ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Quadrotor Path Planning using A* Search Algorithm and Minimum Snap Trajectory Generation
Cited 8 time in scopus Download 260 time Share share facebook twitter linkedin kakaostory
저자
홍유경, 김수성, 김유경, 차지훈
발행일
202112
출처
ETRI Journal, v.43 no.6, pp.1013-1023
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.2020-0085
협약과제
20HS2200, 안전한 무인이동체를 위한 ICT 기반기술 개발, 안재영
초록
In this study, we propose a practical path planning method that combines the A* search algorithm and minimum snap trajectory generation. The A* search algorithm determines a set of waypoints to avoid collisions with surrounding obstacles from a starting to a destination point. Only essential waypoints (waypoints necessary to generate smooth trajectories) are extracted from the waypoints determined by the A* search algorithm, and an appropriate time between two adjacent waypoints is allocated. The waypoints so determined are connected by a smooth minimum snap trajectory, a dynamically executable trajectory for the quadrotor. If the generated trajectory is invalid, we methodically determine when intermediate waypoints are needed and how to insert the points to modify the trajectory. We verified the performance of the proposed method by various simulation experiments and a real-world experiment in a forested outdoor environment.
KSP 제안 키워드
Outdoor environments, Planning method, Real-world experiment, Search Algorithm(GSA), Simulation and experiment, path planning, trajectory generation
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
제4유형