arXiv:2410.17188cs.RO2024-10被引 3

面对机器人技能故障,该算法能动态重分配任务,最小化任务违规。

Minimum-Violation Temporal Logic Planning for Heterogeneous Robots under Robot Skill Failures

  • 根据可用技能重新分配子任务,局部调整团队计划以适应故障。
  • 在任务无法完全完成时,优先执行关键子任务,最小化违规程度。
  • 适用于多类型机器人协作的高可靠性任务规划场景。

本文研究具有异构技能(如感知与操作)的机器人团队,执行由线性时序逻辑(LTL)公式描述的协同任务。这些任务要求机器人按时间与逻辑顺序在特定区域和物体上应用其技能。现有时序逻辑规划算法虽可生成正确构造的计划,但通常缺乏对机器人技能意外故障的反应能力,可能影响任务性能。本文提出一种反应式LTL规划算法,可在部署过程中动态应对意外故障。具体而言,该算法根据可用技能重新分配子任务,并局部修正团队计划以适应新分配,确保任务完成。其主要创新在于处理因可用机器人有限导致任务无法完成的情况:不直接报告失败,而是根据用户指定的优先级,战略性地优先执行最关键子任务,局部重构团队计划以最小化任务违规。本文给出了该框架计算最小违规任务重分配与团队计划的理论条件,并通过数值模拟与硬件实验验证了方法的有效性。

原文摘要 · Abstract (English)

In this paper, we consider teams of robots with heterogeneous skills (e.g., sensing and manipulation) tasked with collaborative missions described by Linear Temporal Logic (LTL) formulas. These LTL-encoded tasks require robots to apply their skills to specific regions and objects in a temporal and logical order. While existing temporal logic planning algorithms can synthesize correct-by-construction plans, they typically lack reactivity to unexpected failures of robot skills, which can compromise mission performance. This paper addresses this challenge by proposing a reactive LTL planning algorithm that adapts to unexpected failures during deployment. Specifically, the proposed algorithm reassigns sub-tasks to robots based on their functioning skills and locally revises team plans to accommodate these new assignments and ensure mission completion. The main novelty of the proposed algorithm is its ability to handle cases where mission completion becomes impossible due to limited functioning robots. Instead of reporting mission failure, the algorithm strategically prioritizes the most crucial sub-tasks and locally revises the team's plans, as per user-specified priorities, to minimize mission violations. We provide theoretical conditions under which the proposed framework computes the minimum-violation task reassignments and team plans. We provide numerical and hardware experiments to demonstrate the efficiency of the proposed method.

任务规划机器人协同时序逻辑故障应对

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。