多机器人追逃中用因子图提升追踪精度和鲁棒性
FG-PE: Factor-graph Approach for Multi-robot Pursuit-Evasion
- 基于因子图建模,协同优化多机追踪与规划
- 追捕时间与移动距离均显著优于传统方法
- 支持通信丢失下稳定运行,适合真实场景
随着机器人在日常生活中的广泛应用,亟需高效可靠的协作协议以应对复杂动态任务。本文提出一种基于因子图的新型多机器人追逃方法,实现多个追捕者对单一逃避者精准的状态估计、路径规划与持续追踪。该方法在保证高追踪精度的同时,显著缩短追捕所需时间和追捕者总移动距离。此外,即使在通信丢包情况下,系统仍能有效降低状态不确定性,保持鲁棒性。通过大量仿真与真实硬件实验验证,该算法在追捕时长、平均移动距离等关键指标上持续优于传统方法,展现出良好的实际应用潜力。
原文摘要 · Abstract (English)
With the increasing use of robots in daily life, there is a growing need to provide robust collaboration protocols for robots to tackle more complicated and dynamic problems effectively. This paper presents a novel, factor graph-based approach to address the pursuit-evasion problem, enabling accurate estimation, planning, and tracking of an evader by multiple pursuers working together. It is assumed that there are multiple pursuers and only one evader in this scenario. The proposed method significantly improves the accuracy of evader estimation and tracking, allowing pursuers to capture the evader in the shortest possible time and distance compared to existing techniques. In addition to these primary objectives, the proposed approach effectively minimizes uncertainty while remaining robust, even when communication issues lead to some messages being dropped or lost. Through a series of comprehensive experiments, this paper demonstrates that the proposed algorithm consistently outperforms traditional pursuit-evasion methods across several key performance metrics, such as the time required to capture the evader and the average distance traveled by the pursuers. Additionally, the proposed method is tested in real-world hardware experiments, further validating its effectiveness and applicability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。