Hexarotor using A*algorithm pathfinding
For a Hexarotor to complete a course from start to end point, apart from proper calibrations needed for the rotor, it requires an algorithm to plot its waypoints. Therefore a path finding algorithm is needed to compute the shortest path the Hexarotor can complete in the fastest time. In this project...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/64163 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |