Robust Temporal Logic Task Planning for Multirobot Systems Under Permanent Robot Failures

We investigate the multirobot task planning problem for intricate tasks specified by linear temporal logic (LTL) formulae. While most studies on this topic assume flawless robot performance, it is crucial to recognize that failures can always occur in the real world due to errors or disturbances. Th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control systems technology Ročník 33; číslo 2; s. 526 - 538
Hlavní autoři: Cui, Bohan, Huang, Feifei, Li, Shaoyuan, Yin, Xiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Combinatorial analysis
Costs
Failure
Failure-awareness
Integer programming
Linear programming
linear temporal logic (LTL)
Logic
Logic programming
Mixed integer
Mixed integer linear programming
Multi-robot systems
Multiple robots
multirobot systems (MRSs)
Path planning
Planning
Robot kinematics
Robots
Robustness
task planning
Task planning (robotics)
Temporal logic
ISSN:1063-6536, 1558-0865
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate the multirobot task planning problem for intricate tasks specified by linear temporal logic (LTL) formulae. While most studies on this topic assume flawless robot performance, it is crucial to recognize that failures can always occur in the real world due to errors or disturbances. Therefore, to enhance the robustness of task planning for multirobot systems (MRSs), one must take the unexpected robot failures into account. In this article, we formulate and solve a new type of failure-aware multirobot task planning problem. Specifically, we aim to find a failure-robust plan that ensures the LTL task can always be accomplished, even if a maximum number of robots fail at any instant during the execution, where a failed robot can no longer contribute to the satisfaction of the LTL task. To achieve this, we extend the mixed-integer linear programming (MILP) approach to the failure-robust setting. To overcome the computational complexity, we identify a fragment of LTL formulae called the free-union-closed LTL, which allows for more scalable synthesis without considering the global combinatorial issue. We provide a systematic method to check this property, as well as several commonly used patterns as instances. We demonstrate the effectiveness of our approach through simulation and real-world experiments, showcasing our failure-robust plans and the efficiency of our simplified algorithm. Our approach offers an optimal and efficient way to achieve robustness in multirobot path planning under unforeseen failure events.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6536
1558-0865
DOI:10.1109/TCST.2024.3494392