Diagonal A∗ Path Planning with Position Estimation

Shin Nyeong Heo; Shi Guo; Ji Sun Shin; HeeHyol Lee

doi:10.1109/ICT-ROBOT.2018.8549890

Diagonal A∗ Path Planning with Position Estimation

Shin Nyeong Heo, Shi Guo, Ji Sun Shin, HeeHyol Lee

Graduate School of Information, Production and Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	https://doi.org/10.1109/ICT-ROBOT.2018.8549890
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

Heo, S. N., Guo, S., Shin, J. S., & Lee, H. (2018). Diagonal A∗ Path Planning with Position Estimation. In 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 [8549890] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICT-ROBOT.2018.8549890

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

Heo, SN, Guo, S, Shin, JS & Lee, H 2018, Diagonal A∗ Path Planning with Position Estimation. in 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018., 8549890, Institute of Electrical and Electronics Engineers Inc., 2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018, Busan, Korea, Republic of, 18/9/6. https://doi.org/10.1109/ICT-ROBOT.2018.8549890

@inproceedings{07dd5ed4caac45d7ab2947376bb8a094,

title = "Diagonal A∗ Path Planning with Position Estimation",

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.",

keywords = "A∗ algorithm, Diagonal A∗ algorithm, Dijkstra's algorithm, Node based algorithm",

author = "Heo, {Shin Nyeong} and Shi Guo and Shin, {Ji Sun} and HeeHyol Lee",

year = "2018",

month = nov

day = "27",

doi = "10.1109/ICT-ROBOT.2018.8549890",

language = "English",

booktitle = "2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 ; Conference date: 06-09-2018 Through 08-09-2018",

}

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

AN - SCOPUS:85060019495

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 -

Access to Document

10.1109/ICT-ROBOT.2018.8549890