path for a robot from a given starting point to a destination using the A-* planning algorithm in ROS

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

The objective of this assignment is to plan a path for a robot from a given starting point to a destination using the A-* planning algorithm in ROS. The attached .pdf provides instructions on the specific requirements/parameters as well as additional files to help facilitate the programming. I will also attach a screenshot of what exactly the A-* planning algorithm is.

 

CSE 468/568: Robotics Algorithms 1

CSE 468/568 Lab 4: A* Planning

The objective of this assignment is to plan a path for a robot from a given starting

point to a destination. Create a new package called lab4, and place the world files

(playground.pgm and playground.world) in the appropriate sub-folder.

The objective of the assignment is simple. Use A-* planning algorithm to find a route

from a default start point (-8.0, -2.0) to a default goal (4.5, 9.0). Please go through the

tutorial on ROS Parameters. The goal should be defined as two parameters goalx and

goaly both of which should be doubles. This allows us to set a new goal parameter, and

the robot should plan a path to the new goal.

There are a couple of challenges in implementing A-* planning as discussed in class.

The first challenge is to derive a graph representation of the workspace. This depends

on the map representation that the estimation block provides us. Typical examples of

such representations are occupancy grids - a grid representation with 1s and 0s with 1

indicating an obstacle in that cell and 0 representing an empty cell. For this assignment,

we have provided you such an occupancy grid. It is the file map.txt. It grids the world

as 1X1 cells. You should import this into your program as the map.

The second challenge is the heuristic for the estimated cost between the current node

and the goal. Given you know the current location and the goal, you can use Euclidean

distance between the current location and the goal as the heuristic cost.

Once planned, you should command your robot to execute the plan to go from start to

goal.

Submission Instructions

As always, please submit via Autograder.

The assignment is due Sunday, Dec 12 just before midnight

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of