Publications

Detailed Information

Development of A* Real-time Path Planning Algorithm of UAV Considering Collision Avoidance : 충돌회피를 고려한 무인항공기

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors

이경현

Advisor
김유단
Major
공과대학 기계항공공학부
Issue Date
2015-02
Publisher
서울대학교 대학원
Keywords
Unmanned Aerial Vehiclecollision avoidanceA* path planningnonlinear guidancereal-time path planning
Description
학위논문 (석사)-- 서울대학교 대학원 : 기계항공공학부, 2015. 2. 김유단.
Abstract
Unmanned aerial vehicle (UAV) has developed to perform military missions including patrol, surveillance, and reconnaissance. Recently, the applications of UAV are expanding to the private markets of UAV agriculture, aerial photography and etc. For these various applications, collision avoidance of UAV is an essential problem, because collision to obstacles may cause not only mission failure but also destruction of UAV and fatal accident including loss of human life.
In this study, modified A* path planning algorithm is proposed for UAV systems. In various robot applications, standard A* algorithm is widely used, which does not apply dynamics of UAV. Therefore, the results from the path planning algorithm should be post-processed to reflect the dynamic constraint of an UAV such as limited turning angle. To deal with this problem, search direction achievable by the UAV is considered in the proposed A* algorithm. The proposed algorithm can be implemented on the on-board system of the UAV in real-time, and does not need post processing to follow the result of path planning. Nonlinear guidance algorithm and PID controller to follow the path are also designed. The performance of the proposed algorithm is demonstrated using numerical simulations. Six degree-of-freedom simulation model was obtained by system identification flight test. Finally, the integrated algorithm is verified by the flight test.
Language
English
URI
https://hdl.handle.net/10371/123831
Files in This Item:
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share