Abstract
This paper proposes a diagonal A∗ path planning for reducing a calculation time better than an A∗ algorithm and an adapt smoothing algorithm for solving the diagonal A∗ path planning problems. Position estimation methods are recommended for realizing diagonal A∗ algorithm in real situations.
Original language | English |
---|---|
Title of host publication | 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781728119960 |
DOIs | |
Publication status | Published - 2018 Nov 27 |
Event | 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 - Busan, Korea, Republic of Duration: 2018 Sep 6 → 2018 Sep 8 |
Other
Other | 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 |
---|---|
Country | Korea, Republic of |
City | Busan |
Period | 18/9/6 → 18/9/8 |
Keywords
- A∗ algorithm
- Diagonal A∗ algorithm
- Dijkstra's algorithm
- Node based algorithm
ASJC Scopus subject areas
- Artificial Intelligence
- Human-Computer Interaction
- Electrical and Electronic Engineering
- Control and Optimization
- Communication