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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/64163 |
| _version_ | 1826118296657723392 |
|---|---|
| author | Ho, Don Shusheng |
| author2 | Wang Jianliang |
| author_facet | Wang Jianliang Ho, Don Shusheng |
| author_sort | Ho, Don Shusheng |
| collection | NTU |
| description | 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, a Hexarotor is to fly and navigate autonomously in a selected and controlled environment with obstacles. Consequently, the environment has to be represented in an algorithmic form to be processed. The Hexarotor will fly at a fixed attitude in the x-y plane with respect to the ground while navigating from start to the destination. The path finding algorithm has to consider limitations with regards to changes in velocity and orientation of the Hexarotor and also obstacles in the environment. Hence it is important for the path finding algorithm to be effective in finding the optimal path, shortest path in the fastest time, for Hexarotor to complete the course. |
| first_indexed | 2024-10-01T04:41:05Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/64163 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:41:05Z |
| publishDate | 2015 |
| record_format | dspace |
| spelling | ntu-10356/641632023-07-07T17:24:09Z Hexarotor using A*algorithm pathfinding Ho, Don Shusheng Wang Jianliang School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering 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, a Hexarotor is to fly and navigate autonomously in a selected and controlled environment with obstacles. Consequently, the environment has to be represented in an algorithmic form to be processed. The Hexarotor will fly at a fixed attitude in the x-y plane with respect to the ground while navigating from start to the destination. The path finding algorithm has to consider limitations with regards to changes in velocity and orientation of the Hexarotor and also obstacles in the environment. Hence it is important for the path finding algorithm to be effective in finding the optimal path, shortest path in the fastest time, for Hexarotor to complete the course. Bachelor of Engineering 2015-05-25T03:58:54Z 2015-05-25T03:58:54Z 2015 2015 Final Year Project (FYP) http://hdl.handle.net/10356/64163 en Nanyang Technological University 34 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering Ho, Don Shusheng Hexarotor using A*algorithm pathfinding |
| title | Hexarotor using A*algorithm pathfinding |
| title_full | Hexarotor using A*algorithm pathfinding |
| title_fullStr | Hexarotor using A*algorithm pathfinding |
| title_full_unstemmed | Hexarotor using A*algorithm pathfinding |
| title_short | Hexarotor using A*algorithm pathfinding |
| title_sort | hexarotor using a algorithm pathfinding |
| topic | DRNTU::Engineering::Electrical and electronic engineering |
| url | http://hdl.handle.net/10356/64163 |
| work_keys_str_mv | AT hodonshusheng hexarotorusingaalgorithmpathfinding |