- Load the 2.5D map in the colliders.csv file describing the environment.
- Discretize the environment into a grid or graph representation.
- Define the start and goal locations.
- Perform a search using A* or other search algorithm.
- Use a collinearity test or ray tracing method (like Bresenham) to remove unnecessary waypoints.
- Return waypoints in local ECEF coordinates (format for
self.all_waypoints
is [N, E, altitude, heading], where the drone’s start location corresponds to [0, 0, 0, 0]. - Write it up.
- Congratulations! Your Done!
Rubric Points
Here I will consider the rubric points individually and describe how I addressed each point in my implementation.
1. Provide a Writeup / README that includes all the rubric points and how you addressed each one. You can submit your writeup as markdown or pdf.
You're reading it! Below I describe how I addressed each rubric point and where in my code each point is handled.
These scripts contain a basic planning implementation that includes...
And here's a lovely image of my results (ok this image has nothing to do with it, but it's a nice example of how to include images in your writeup!)
Here's | A | Snappy | Table |
---|---|---|---|
1 | highlight |
bold | 7.41 |
2 | a | b | c |
3 | italic | text | 403 |
4 | 2 | 3 | abcd |
This is accomplished by reading the colliders.csv by using the csv python package and extracting the first line into lattitude and longitude variables.
And here is a lovely picture of our downtown San Francisco environment from above!
Drone local location is determined by making a translation from current global to local location using the global_to_local() function.
Meanwhile, here's a picture of me flying through the trees!
Grid start position is set by offsetting the current position with the start position rather than the map center at line 153.
This step is to handle random grid goal locations. This is achieved by continually setting the grid goal in an iterative loop until the drone reaches the desired goal location.
The diagonal motion is achieved by setting diagonal directions(NORTH_WEST,NORTH_EAST,SOUTH_WEST,SOUTH_EAST) by offsetting the cost of action in the tuple using numpy sqrt function in the Action class.
For this I used the ray tracing method with Bresenham algorithm. The idea is simply to prune the paths of unnecessary waypoints through free space.
It works great!