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 |
Fingerprint
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
Cite this
Diagonal A∗ Path Planning with Position Estimation. / Heo, Shin Nyeong; Guo, Shi; Shin, Ji Sun; Lee, HeeHyol.
2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. 8549890.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Diagonal A∗ Path Planning with Position Estimation
AU - Heo, Shin Nyeong
AU - Guo, Shi
AU - Shin, Ji Sun
AU - Lee, HeeHyol
PY - 2018/11/27
Y1 - 2018/11/27
N2 - 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.
AB - 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.
KW - A∗ algorithm
KW - Diagonal A∗ algorithm
KW - Dijkstra's algorithm
KW - Node based algorithm
UR - http://www.scopus.com/inward/record.url?scp=85060019495&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060019495&partnerID=8YFLogxK
U2 - 10.1109/ICT-ROBOT.2018.8549890
DO - 10.1109/ICT-ROBOT.2018.8549890
M3 - Conference contribution
BT - 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
ER -