Fast and Adaptive Multi-agent Planning under Collaborative Temporal Logic Tasks via Poset Products

TL;DR

This paper introduces an adaptive, on-the-fly planning algorithm for large multi-agent systems with complex temporal tasks, significantly improving scalability and efficiency over traditional formal methods.

Contribution

It proposes a novel planning paradigm that avoids automaton translation and synchronized product bottlenecks, enabling scalable multi-agent planning with long, online task formulas.

Findings

Handles task formulas with over 400 length

Supports fleets of more than 400 agents

Achieves polynomial time complexity in planning

Abstract

Efficient coordination and planning is essential for large-scale multi-agent systems that collaborate in a shared dynamic environment. Heuristic search methods or learning-based approaches often lack the guarantee on correctness and performance. Moreover, when the collaborative tasks contain both spatial and temporal requirements, e.g., as Linear Temporal Logic (LTL) formulas, formal methods provide a verifiable framework for task planning. However, since the planning complexity grows exponentially with the number of agents and the length of the task formula, existing studies are mostly limited to small artificial cases. To address this issue, a new planning paradigm is proposed in this work for system-wide temporal task formulas that are released online and continually. It avoids two common bottlenecks in the traditional methods, i.e., (i) the direct translation of the complete task formula to the associated B\"uchi automaton; and (ii) the synchronized product between the B\"uchi automaton and the transition models of all agents. Instead, an adaptive planning algorithm is proposed that computes the product of relaxed partially-ordered sets (R-posets) on-the-fly, and assigns these subtasks to the agents subject to the ordering constraints. It is shown that the first valid plan can be derived with a polynomial time and memory complexity w.r.t. the system size and the formula length. Our method can take into account task formulas with a length of more than 400 and a fleet with more than $400$ agents, while most existing methods fail at the formula length of 25 within a reasonable duration. The proposed method is validated on large fleets of service robots in both simulation and hardware experiments.