A Comprehensive Survey on Coverage Path Planning for Mobile Robots in Dynamic Environments
Top Cited Papers
Open Access
- 31 March 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 60158-60185
Abstract
Coverage Path Planning (CPP) is a fundamental aspect of mobile robotics, enabling robots to navigate dynamic environments efficiently while ensuring thorough coverage of all areas of interest and avoiding obstacles. CPP is pivotal in diverse applications, from everyday tasks like vacuum cleaning, lawn mowing, and window cleaning to specialized operations such as demining hazardous areas, autonomous underwater imaging, and inspecting complex structures. This survey reviews recent advancements in CPP, focusing on algorithms and methodologies tailored for dynamic environments. It highlights the challenges posed by environmental variability, obstacle dynamics, and real-time computational demands. By synthesizing insights from existing research, this survey aims to guide future developments in CPP, paving the way for smarter and more adaptive robotic systems capable of handling the complexities of real-world scenarios.Keywords
This publication has 208 references indexed in Scilit:
- Path Planning of Mobile Robot Based on an Improved Ant Colony Algorithm2020
- New Advancements in Swarm Algorithms: Operators and Applications2020
- Multi-robot Path Planning for Complete Coverage with Genetic Algorithms2019
- Optimizing a GPU-Parallelized Ant Colony Metaheuristic by Parameter TuningLecture Notes in Computer Science, 2019
- Multi-Robot Coverage: A Bee Pheromone Signalling Approach2015
- Multi-robot Task Allocation: A Review of the State-of-the-Art2015
- Multirobot Coverage Search in Three DimensionsJournal of Field Robotics, 2015
- Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robotsJournal of Field Robotics, 2011
- Robotic Exploration, Brownian Motion and Electrical ResistanceLecture Notes in Computer Science, 1998
- Region filling operations with random obstacle avoidance for mobile robotsJournal of Robotic Systems, 1988