LLM-Grounded Dynamic Task Planning with Hierarchical Temporal Logic for Human-Aware Multi-Robot Collaboration
Shuyuan Hu, Tao Lin, Kai Ye, Yang Yang, Tianwei Zhang
TL;DR
This work tackles long-horizon, human-aware multi-robot planning by grounding LLM-generated reasoning inside a hierarchical LTL framework (H-LTL_f) and executing it via a receding horizon loop. The approach combines open-vocabulary perception, hierarchical formal specifications, and dynamic task allocation to produce correct-by-construction plans in dynamic environments, with real-time replanning and safety checks. Key contributions include the hierarchical LTL formulation, product team models with explicit intra- and inter-task switches, and a receding horizon execution pipeline that handles stochastic durations and human motion. The results show improved success rates, reduced planning latency, and robust collaboration across both simulated and real-world human-robot interactions, indicating practical impact for scalable human-aware robotics.
Abstract
While Large Language Models (LLM) enable non-experts to specify open-world multi-robot tasks, the generated plans often lack kinematic feasibility and are not efficient, especially in long-horizon scenarios. Formal methods like Linear Temporal Logic (LTL) offer correctness and optimal guarantees, but are typically confined to static, offline settings and struggle with computational scalability. To bridge this gap, we propose a neuro-symbolic framework that grounds LLM reasoning into hierarchical LTL specifications and solves the corresponding Simultaneous Task Allocation and Planning (STAP) problem. Unlike static approaches, our system resolves stochastic environmental changes, such as moving users or updated instructions via a receding horizon planning (RHP) loop with real-time perception, which dynamically refines plans through a hierarchical state space. Extensive real-world experiments demonstrate that our approach significantly outperforms baseline methods in success rate and interaction fluency while minimizing planning latency.
