Auto-splitting D* lite path planning for large disaster area
Open Access
- 16 March 2022
- journal article
- research article
- Published by Springer Nature in Intelligent Service Robotics
- Vol. 15 (3) , 289-306
Abstract
This research introduces a new path planning method for rescue robots in a dynamic and partially known area when the robots are performing tasks in a large area. The path planning of the rescue robots that move in the dynamic area is introduced to solve the issue of unnecessary areas, which are the disadvantages of the existing D*-based algorithms. This paper proposes a method to eliminate unnecessary expanded nodes of the dynamic and partially known environment by segmenting a map with an auto-clustering algorithm, which is able to achieve a faster execution time than conventional algorithms. Furthermore, to show the effectiveness of the proposed algorithms, an expected value of re-planned nodes in the dynamic and partially known area is introduced using a probability-based approach.Keywords
This publication has 36 references indexed in Scilit:
- Initialization for K-means Clustering using Voronoi DiagramProcedia Technology, 2012
- Navigation of mobile robot by using D++ algorithmIntelligent Service Robotics, 2012
- Weightedsearch – unifying view and applicationArtificial Intelligence, 2009
- A FAST k-MEANS IMPLEMENTATION USING CORESETSInternational Journal of Computational Geometry & Applications, 2008
- Improving hierarchical cluster analysis: A new method with outlier detection and automatic clusteringChemometrics and Intelligent Laboratory Systems, 2007
- Using interpolation to improve path planning: The Field D* algorithmJournal of Field Robotics, 2006
- Estimating the Number of Clusters in a Data Set Via the Gap StatisticJournal of the Royal Statistical Society Series B: Statistical Methodology, 2001
- A potential field approach to path planningIEEE Transactions on Robotics and Automation, 1992
- Numerical potential field techniques for robot path planningIEEE Transactions on Systems, Man, and Cybernetics, 1992
- A note on two problems in connexion with graphsNumerische Mathematik, 1959