Download pdf
Coverage Path Planning with Dynamic Target Selection for Search and Rescue
- 1 Department of Computer Science, Sichuan University, Chengdu, Sichuan, China
* Author to whom correspondence should be addressed.
Abstract
This paper proposes a novel coverage path planning algorithm for autonomous robots in grid-based environments, focusing on search and rescue missions. Efficient exploration and mapping of disaster areas are crucial for locating survivors and guiding rescue operations. The algorithm addresses complex, dynamic environments by dynamically selecting target points using a weighted scoring function that balances exploration and exploitation, minimizing travel distance and energy consumption. It incorporates visibility constraints to simulate real-world sensor limitations, ensuring accurate coverage updates and thorough exploration. The integration of the A* algorithm enables optimal navigation around obstacles, enhancing efficiency in cluttered spaces. This approach is vital for mission success and survival rates in time-sensitive rescue scenarios.
Keywords
Coverage Path Planning, Autonomous Robots, Dynamic Target Selection, A* Algorithm, Visibility Constraints
[1]. Murphy, R., Tadokoro, S., Nardi, D., Jacoff, A., Fiorini, P., Choset, H., & Erkmen, A. (2008). Search and rescue robotics. In B. Siciliano & O. Khatib (Eds.), Springer handbook of robotics(pp. 1151-1173). Springer. https://doi.org/10.1007/978-3-540-30301-5_51
[2]. Overmars, M. H., & van der Stappen, A. F. (1997). Motion planning in the plane. In M. de Berg, M. van Kreveld, M. Overmars, & O. Schwarzkopf (Eds.), Computational geometry: Algorithms and applications(2nd ed., pp. 225-253). Springer-Verlag.
[3]. Choset, H. (2001). Coverage for robotics—A survey of recent results. Annals of Mathematics and Artificial Intelligence, 31(1-4), 113–126. https://doi.org/10.1023/A:1016639210959
[4]. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. https://doi.org/10.1109/TSSC.1968.300136
[5]. Bresenham, J. E. (1965). Algorithm for computer control of a digital plotter. IBM Systems Journal, 4(1), 25–30. https://doi.org/10.1147/sj.41.0025
[6]. Deza, E., & Deza, M. M. (2009). Encyclopedia of Distances. Springer. Minkowski, H. (1910). Geometrie der Zahlen. Teubner.
[7]. Koenig, S., & Likhachev, M. (2002). D* Lite. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 476–483). AAAI Press.
Cite this article
Ding,Z. (2025). Coverage Path Planning with Dynamic Target Selection for Search and Rescue. Applied and Computational Engineering,145,7-13.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 3rd International Conference on Software Engineering and Machine Learning
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).