Persistent LLM Orchestration of Heterogeneous Robot Teams via Partial Delegation to Multi-Agent Protocols
Authors: Maria G. Mendoza, Victoria M. Tuck, Zachary Ravichandran, Shankar Sastry, George J. Pappas
Organizations: Department of Mechanical Engineering (M.G.M.) and Department of Electrical Engineering and Computer Sciences (S.S.), University of California, Berkeley, CA, USA. · Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA.
Natural language specifications let non-expert users task robot teams, and large language models (LLMs) have recently proven effective at grounding such semantic specifications into plans for heterogeneous teams. Existing approaches assume missions that terminate and environments that, while unknown, do not change, but both assumptions fail in many emerging applications. For example, a disaster-response mission does not terminate, and its environment changes continuously as hazards spread and evacuees move. We identify three ways an LLM orchestrator breaks in this setting: its prompt grows without bound, its reasoning degrades as agents and targets accumulate, and it stops actively monitoring after covering the search space once. We build on the successful framework of grounded generative intelligence, and address each issue with a classical idea. A Markovian state summary, rebuilt from the semantic map at every invocation, replaces the growing interaction history. Partial delegation lets the orchestrator assign a subset of robots to an autonomous multi-agent protocol and reserve its reasoning for generating subtasks that require detailed parameters and careful ordering. Lastly, observation staleness, surfaced explicitly in the prompt, together with task-and event-triggered re-prompting, keeps the team vigilant. In a simulated urban search-and-rescue mission with spreading fire and moving evacuees, our framework rescues 98% of civilians versus 89% for the strongest baseline while using six times fewer tokens. Additional ablations isolate the contribution of each mechanism.
Figures & tables
Fig. 1: System architecture. The mission statement, team specification, including task primitives and multi-agent protocols, and a partial semantic map are provided as inputs. The LLM is prompted with these inputs and the prompt information of Sec. IV-D to delegate a subset of the robots to the multi-agent protocols and generate subtasks for the rest according to the system needs. This plan is validated, and the LLM is provided feedback if there are issues. The actual task assignment is done symbolically with a linear program (LP) assignment. Multi-agent Protocols (green) are shown to be continuously operating with the self-loop or similar to tasks in that they have an endpoint. Asymmetric observations from all operations are constantly fused into the map. The feedback mechanism is triggered on task completion (solid lines) or on relevant map update events (dashed lines). Feedback on the map and observation age (orange) is compiled with a state summary of the history (blue) and provided in the new prompt to the LLM.
Failure mode
Mechanism
Time-varying environment Exogenous, endogenous, and epistemic changes
Invocation triggered by changes to objects of interest (Sec. IV-F )
Memory Accumulated history grows and describes outdated states, distracting the orchestrator
Markovian input, rebuilt from the current map at every invocation (Sec. IV-D )
Dynamic objects Asymmetric observation aliases distinct objects, making data association ambiguous
Pending tasks and failures trigger mechanism (Sec. IV-F )
Scale Planning degrades as team, targets, and map size grow
Delegation to a multi-robot protocol (Sec. IV-C ); assignment by linear program (Sec. IV-E )
Mission persistence The mission has no completion signal, and the orchestrator has no reason to revisit regions
Observation age summarized in the state: mean age and the regions observed least recently (Sec. IV-G )
TABLE I: Failure modes and the proposed mechanisms
Fig. 4: A 10×10 urban environment for disaster response, shown at selected steps. Dark regions are city blocks, which ground robots cannot enter; the remaining regions form the street network. Fire ignites at two regions (red blocks with stars) and spreads to neighbors over the course of the mission. Groups of people appear at street regions, vary in density, and move between steps; they must be escorted to the safe zone in the upper left (green). Robots are omitted for clarity.
Vehicle type
Movement
Speed (m/s)
Sensor Range (m)
Aerial (UAV)
survey
4.2
150
go_to, local_search
2.9
50
escort
1.4
50
Ground (UGV)
go_to, local_search
2.9
50
escort
1.4
50
TABLE II: Robot properties.
Configuration
Results
Name
History Repr.
Multi-Agent Protocols
Re-prompt Trigger
Time to rescue (k) ↓
Rescues (%) ↑
# Orchestrator calls ↓
Total tokens ( ×106)↓
Comparisons
SPINE-HT [ 3 ]
Full
No
Task
106.9±23.8
89.4±12.8
33.6±12.5
2.40±1.25
CoMuRoS [ 21 ]
Full
No
Event
90.1±35.8
32.5±19.0
14.2±6.1
0.45±0.35
Ours
Summ.
Yes
All
102.3±7.7
98.1±2.8
32.4±6.1
0.41±0.07
Ablations
History
Full
Yes
All
105.2±15.0
83.1±16.3
25.8±3.6
1.16±0.27
Re-Prompt
Summ.
Yes
Cadence
137.3±17.4
95.6±4.7
10.0±0.0
0.14±0.01
TABLE III: Experimental results across configurations. Values are mean ± std.
Fig. 5: The orchestrator reasoning about moving humans under partial information. Left: at k=34 people are reported in r6_c0 and r7_c0 , with an escort under way to r7_c0 . Right: by k=41 both regions have been re-observed clear and two civilians are reported in r6_c1 . The orchestrator treats the re-observation as evidence the pickups are stale, cancels the escort, issues a local_search around each vacated region to recover the missing group, and escorts the live report at r6_c1 .
Fig. 6: Total tokens used across ablations. We show that for the same triggering mechanism, the stateless prompt (which does not re-send the prompt history) uses fewer overall tokens though more output tokens. These output tokens come from additional ”thinking” tokens the LLM needs.
Fig. 7: Effect of exposing observation staleness to the orchestrator. With staleness in the prompt (green), the orchestrator sees maxage=202 and a median of 83, assigns all three aerial robots on coverage, and re-observes the region later in the run, recovering the last group of humans. Without it (blue), coverage looks complete ( unobserved=0 ), the mandatory-H constraint is dropped, aerial robots are released to other work, and the group is never found and the map is only covered once.
Multi-robot task planning requires decomposing natural-language instructions into executable actions for heterogeneous robot teams. Conventional Planning Domain Definition Language (PDDL) planners provide rigorous guarantees but struggle to handle ambiguous or long-horizon missions, while large language models (LLMs) can interpret instructions and propose plans but may hallucinate or produce infeasible actions. We present a hierarchical multi-agent LLM-based planner with prompt optimization: an upper layer decomposes tasks and assigns them to lower-layer agents, which generate PDDL problems solved by a classical planner. When plans fail, the system applies TextGrad-inspired textual-gradient updates to optimize each agent's prompt and thereby improve planning accuracy. In addition, meta-prompts are learned and shared across agents within the same layer, enabling efficient prompt optimization in multi-agent settings. On the MAT-THOR benchmark, our planner achieves success rates of 0.95 on compound tasks, 0.84 on complex tasks, and 0.60 on vague tasks, improving over the previous state-of-the-art LaMMA-P by 2, 7, and 15 percentage points respectively. An ablation study shows that the hierarchical structure, prompt optimization, and meta-prompt sharing contribute roughly +59, +37, and +4 percentage points to the overall success rate.
Tomoya Kawabe, Rin Takano
Data Science Laboratories, NEC Corporation, 1753, Shimonumabe, Nakahara-ku, Kawasaki, Kanagawa, 211-8666, Japan.
This paper presents a framework to prompt multi-robot teams with high-level tasks using natural language expressions. Our objective is to use the reasoning capabilities of language models in understanding and decomposing multi-robot collaboration and decision-making tasks, but in settings where such models cannot be called at deployment time. However, it is hard to specify the behavior of an individual robot from a team instruction, and have it continuously adapt to actions from other robots. This necessitates a framework with the representational capacity required by the logic and semantics of a task, and yet supports decentralized, real-time operation. We solve this dilemma by recognizing that a task can be represented as a deterministic finite automaton, and that recurrent neural networks (RNNs) can encode numerous automata. This allows us to distill the logic and sequential decompositions of sub-tasks obtained from a language model into an RNN, and align its internal states with the semantics of a given task. This leads to a tiny model that encapsulates the reasoning of the language model and can be implemented onboard. To interpret the internal state of the RNN for a decentralized execution, we train a graph neural network control policy conditioned on the hidden states of the RNN and the language embeddings. We present evaluations on simulated and real-world multi-robot tasks that require sequential and collaborative behavior by the team, demonstrating scalable, robust, real-time performance -- sites.google.com/view/prompting-teams.
Eduardo Sebastián, Nicolas Pfitzer, Ajay Shankar +1
Department of Computer Science and Technology, University of Cambridge, UK · Department of Mechanical and Process Engineering, ETH Zurich, Switzerland
Large language models (LLMs) provide robots with richer task understanding and adaptability, making them promising for coordinating heterogeneous multi-robot systems in long-horizon tasks. Despite this potential, several challenges remain underexplored: (1) Centralized LLM schedulers scale poorly as team size and environmental complexity increase. A single model must process excessive contextual information, and long-context approximation may degrade reasoning quality; (2) Existing task formulations insufficiently consider dynamic settings, while robust adaptation to evolving task conditions is essential for real-world deployment; (3) Domain-specific data scarcity limits specialized robotic reasoning, making proprietary general-purpose models inefficient for expert tasks. To address these limitations, we propose DynaHMRC, a decentralized framework in which each robot acts as a role-aware LLM agent. This design mitigates the single-model context bottleneck and supports flexible collaboration across heterogeneous team configurations. DynaHMRC organizes collaboration as a four-stage closed-loop process: self-description, task allocation with leadership bidding, leader election, and reflective execution, supported by executable robot interfaces. We further develop a benchmark covering three task families, four dynamic variations, and six team configurations to systematically study dynamic task modeling. In addition, we conduct an empirical analysis to guide the construction of domain-specific expert datasets and fine-tune pretrained LLMs to improve specialized competence. Experiments show that DynaHMRC achieves higher success rates than strong baselines with fewer action and communication steps, while demonstrating promising scalability trends as team size grows within the evaluated settings.
Wenhao Yu, Yu'ang Xie, Yifan Duan +5
University of Science and Technology of China (USTC) · University of Macau (UM)