인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2021.10
- 수록면
- 754 - 761 (8page)
- DOI
- 10.5302/J.ICROS.2021.21.0022
이용수
초록· 키워드
Graph search-based path planning algorithms have been widely applied for path planning in autonomous robot systems. Among these algorithms, the jump point search (JPS) method, adopted in this study, is a variant of the well-known algorithm A* and utilizes a unique node search strategy called “jump.” The jump makes the JPS method one of the fastest graph search-based path planning algorithms. However, while the A* algorithm can be easily modified for identifying uneven environmental conditions (e.g., danger zones), danger zones cannot be handled in the JPS algorithm because the jump strategy removes plenty of nodes, including the essential ones for avoiding danger zones. To obtain a reasonable path in uneven environments, this study proposes a modified version of the JPS algorithm called the modified jump search method (MJPS). The MJPS method enables danger zones to be recognized and thus avoided during path generation by introducing bordering and additional nodes. To validate the proposed method, numerical simulations will be performed, and the results will be analyzed by comparing it with the A*-based path planning results.
상세정보 수정요청해당 페이지 내 제목·저자·목차·페이지정보가 잘못된 경우 알려주세요!
목차
- Abstract
- Ⅰ. 서론
- Ⅱ. Modified JPS (MJPS) 알고리즘
- Ⅲ. 시뮬레이션
- Ⅳ. 결론
- REFERENCES