Diagonal A∗ Path Planning with Position Estimation

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

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 languageEnglish
Title of host publication2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728119960
DOIs
Publication statusPublished - 2018 Nov 27
Event2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018 - Busan, Korea, Republic of
Duration: 2018 Sep 6 → 2018 Sep 8

Other

Other2018 International Conference on Information and Communication Technology Robotics, ICT-ROBOT 2018
CountryKorea, Republic of
CityBusan
Period18/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

Access to Document

Fingerprint Dive into the research topics of 'Diagonal A∗ Path Planning with Position Estimation'. Together they form a unique fingerprint.

    • 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