Optimized Frontier-Based Path Planning Using the TAD Algorithm for Efficient Autonomous Exploration

A novel path-planning method utilizing the trapezoid, adjacent, and distance, (TAD) characteristics of frontiers is presented in this work. The method uses the mobile robot’s sensor range to detect frontiers throughout each exploration cycle, modifying them at regular intervals to produce their parameters. This well-thought-out approach makes it possible to choose objective points carefully, guaranteeing seamless navigation. The effectiveness and applicability of the suggested approach with respect to exploration time and distance are demonstrated by empirical validation. Results from experiments show notable gains over earlier algorithms: time consumption decreases by 10% to 89% and overall path distance for full investigation decreases by 12% to 74%. These remarkable results demonstrate the efficacy of the suggested approach and represent a paradigm change in improving mobile robot exploration in uncharted territory. This research introduces a refined algorithm and paves the way for greater efficiency in autonomous robotic exploration. This study opens the door for more effective autonomous robotic exploration by introducing an improved algorithm.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2024-12-27
DOI
https://doi.org/10.3390/electronics14010074
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimized Frontier-Based Path Planning Using the TAD Algorithm for Efficient Autonomous Exploration

Andrew Jaeyong Choi, Heung Seok Jeon, Abror Shavkatovich Buriboev
3 citations
Electronics
Robotic Path Planning Algorithms
0.75
article

Optimized Frontier-Based Path Planning Using the TAD Algorithm for Efficient Autonomous Exploration

Andrew Jaeyong Choi, Heung Seok Jeon, Abror Shavkatovich Buriboev
article en
3 citations

Abstract

A novel path-planning method utilizing the trapezoid, adjacent, and distance, (TAD) characteristics of frontiers is presented in this work. The method uses the mobile robot’s sensor range to detect frontiers throughout each exploration cycle, modifying them at regular intervals to produce their parameters. This well-thought-out approach makes it possible to choose objective points carefully, guaranteeing seamless navigation. The effectiveness and applicability of the suggested approach with respect to exploration time and distance are demonstrated by empirical validation. Results from experiments show notable gains over earlier algorithms: time consumption decreases by 10% to 89% and overall path distance for full investigation decreases by 12% to 74%. These remarkable results demonstrate the efficacy of the suggested approach and represent a paradigm change in improving mobile robot exploration in uncharted territory. This research introduces a refined algorithm and paves the way for greater efficiency in autonomous robotic exploration. This study opens the door for more effective autonomous robotic exploration by introducing an improved algorithm.

ElectronicsVol. 14(1)
Gachon University (KR), Konkuk University (KR)
National Research Foundation, National Research Foundation of Korea, Ministry of Science and ICT, South Korea
Openalex Percentile: Top 26%
Robotic Path Planning Algorithms
0.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.