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.