返回
PPCPP: A Predator-Prey-Based Approach to Adaptive Coverage Path Planning
DOI:10.1109/TRO.2019.2946891.png)
摘要
En 中文
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.
Keyword:
Service robots
Task analysis
Planning
Surface cleaning
Biological neural networks
Path planning
Adaptive coverage path planning (CPP)
complete coverage
dynamic obstacles
three-dimensional (3-D) coverage of complex surfaces
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
引用论文
Online Coverage of Planar Environments by a Battery Powered Autonomous Mobile Robot电池供电的自主移动机器人对平面环境的在线覆盖
BA*: an online complete coverage algorithm for cleaning robotsBA *: 一种清洁机器人的在线完全覆盖算法
APPLIED INTELLIGENCE
IF3.5

