.png){kind=icon}
Return
A Formal Framework for Multiagent Task Planning
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2025.3601769.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a solution to the task planning problem for multiagent systems. A formal framework is developed based on the nondeterministic finite automata with $\epsilon$-transitions, where given the capabilities, constraints and failure modes of the agents involved, an initial state of the system, and a task specification, an optimal solution is generated that satisfies the system constraints and the task specification. The resulting solution is guaranteed to be complete and optimal; moreover, a heuristic solution that offers significant reduction of the computational requirements while relaxing the completeness and optimality requirements is proposed. The constructed system model is independent from the initial condition and the task specification, alleviating the need to repeat the costly preprocessing step for solving other scenarios, while allowing the incorporation of failure modes on-the-fly. An analysis of the completeness and optimality properties as well as the class of addressable problems is provided.
Keywords:
Discrete event systems
heterogeneous systems
multiagent systems
task planning
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveMission Accomplished: An Introduction to Formal Methods in Mobile Robot Motion Planning and Control
OAAI
OAAIShareSavePlanning for heterogeneous teams of robots with temporal logic, capability, and resource constraints
PREAI
ShareSaveShareSaveShareSaveShareSave
View more