TY - GEN
T1 - Diagonal A∗ Path Planning with Position Estimation
AU - Heo, Shin Nyeong
AU - Guo, Shi
AU - Shin, Ji Sun
AU - Lee, Hee Hyol
N1 - Publisher Copyright:
© 2018 IEEE.
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
AN - SCOPUS:85060019495
T3 - 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
BT - 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
Y2 - 6 September 2018 through 8 September 2018
ER -