PPCPP: A Predator-Prey-Based Approach to Adaptive Coverage Path Planning
- Publication Type:
- Journal Article
- IEEE Transactions on Robotics, 2020, 36 (1), pp. 284 - 301
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
The embargo period expires on 27 Nov 2021
© 2004-2012 IEEE. Most of the existing coverage path planning (CPP) algorithms do not have the capability of enabling a robot to handle unexpected changes in the coverage area of interest. Examples of unexpected changes include the sudden introduction of stationary or dynamic obstacles in the environment and change in the reachable area for coverage (e.g., due to imperfect base localization by an industrial robot). Thus, a novel adaptive CPP approach is developed that is efficient to respond to changes in real-time while aiming to achieve complete coverage with minimal cost. As part of the approach, a total reward function that incorporates three rewards is designed where the first reward is inspired by the predator-prey relation, the second reward is related to continuing motion in a straight direction, and the third reward is related to covering the boundary. The total reward function acts as a heuristic to guide the robot at each step. For a given map of an environment, model parameters are first tuned offline to minimize the path length while assuming no obstacles. It is shown that applying these learned parameters during real-time adaptive planning in the presence of obstacles will still result in a coverage path with a length close to the optimized path length. Many case studies with various scenarios are presented to validate the approach and to perform numerous comparisons.
Please use this identifier to cite or link to this item: