多机器人动态路径规划，能自适应不同区域的作业速度差异。
MDCPP: Multi-Robot Dynamic Coverage Path Planning for Workload Adaptation
- 基于部分观测学习负载分布，预测每块区域的服务时间
- 通过分布式分配实现任务重分，使总完成时间减少60%以上
- 适合复杂地形中需动态调整速度的多机协同任务
多机器人覆盖路径规划通常在恒定速度假设下平衡几何面积或路径长度。当感知或交互任务导致空间速度差异时，该假设失效，相同面积可能带来显著不同的完成时间。本文提出多机器人动态覆盖路径规划（MDCPP），从部分观测中学习高斯混合负载场，预测单元格级服务时间，并通过分布式容量约束分配反复重新划分未覆盖区域。我们证明了每次同步分配轮次的有限终止性和局部最优性，界定了估计误差导致的服务时间完工时间退化，给出了完整覆盖的充分条件。在600次基准测试中，与扫掠、LS-MCPP、反应式重分配及理想情况对比，预测在强异质性下最有效，相比非预测方法平均成对完工时间降低超60%。三台无人车实验验证了路径执行及在定位、驱动和无线控制影响下的空间速度自适应能力。
原文摘要 · Abstract (English)
Multi-robot coverage path planning commonly balances geometric area or path length under a constantspeed assumption. This assumption is inadequate when sensing or interaction tasks cause spatially varying traversal speeds, because equal areas can induce markedly different completion times. We propose Multi-Robot Dynamic Coverage Path Planning (MDCPP), which learns a Gaussian-mixture workload field from partial observations, predicts cell-wise service times, and repeatedly repartitions the uncovered cells through a distributed capacity-constrained assignment. We establish finite termination and pairwise local optimality of each synchronized assignment round, bound the service-time makespan degradation due to estimation error, and state sufficient conditions for complete coverage. A 600-run benchmark against sweeping, LS-MCPP, reactive reassignment, and an oracle shows that prediction is most valuable under strong heterogeneity and improves aggregate paired makespan over the nonpredictive alternatives. A three-UGV experiment further validates route execution and spatial speed adaptation under localization, drivetrain, and wireless-control effects.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。