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...
| Glavni autor: | |
|---|---|
| Daljnji autori: | |
| Format: | Final Year Project (FYP) |
| Jezik: | English |
| Izdano: |
2015
|
| Teme: | |
| Online pristup: | http://hdl.handle.net/10356/64163 |