- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies the message routing problem in embodied multi-agent systems and proposes CREAC, a training-free dynamic communication routing method. Experiments on two embodied collaboration benchmarks, C-WAH and CREW-Wildfire, demonstrate that CREAC can reduce task execution costs and outperform various communication strategies and routing baselines.
Critical strengths
- The paper proposes a simple and clear message allocation strategy to address the problem of excessive irrelevant information in multi-agent communication.
- The experimental design is relatively comprehensive and effectively demonstrates that the performance improvements come from message selection.
- The method provides good interpretability, as each message selection decision is associated with an explicit rationale.
Critical weaknesses
- For some tasks, knowing which agent possesses certain information may not be sufficient to determine who should receive a message. This issue affects the core claim of the paper, namely that effective routing can be achieved by identifying which agents know what information. In large-scale tasks involving agents with different roles and capabilities, this assumption may be insufficient. Although the authors acknowledge in the appendix that action requests should theoretically consider whether an agent has the capability to complete the task, the actual implementation still relies on the simple information representation.
- CREAC only maintains a simple binary marker for each agent–entity pair, which may be too coarse to represent the complex knowledge states required in challenging tasks.
Questions for authors
The paper would benefit from a clearer overview figure illustrating the overall workflow of CREAC.
2 comments
Response to Reviewer Mo9E (2/2)
W2. Is a binary marker for each agent–entity pair too coarse?
The meta-belief is not binary. Each entry is , the product of an evidence indicator and a confidence, and it takes continuous values between 0 and 1 (Section 4.3). The evidence indicator is 1 when the messages so far indicate that agent knows entity , and 0 otherwise. The confidence decreases continuously with the number of steps since the entry was last updated. Routing compares with , and the router sends an active query when the largest entry for an entity falls below , so both decisions use the continuous value.
A meta-belief whose entries are binary corresponds to our ablation without decay (), in which every entry stays at 0 or 1 (Section 6.5). On six-agent C-WAH, this ablation takes 51.85 steps, and CREAC takes 43.28 steps. The target precision of this ablation is 9.5 points lower than that of CREAC (Table 7).
In challenging tasks, the continuous meta-belief is sufficient for CREAC to outperform the other communication policies. On CREW-Wildfire, with fifteen agents of four types, CREAC gives the lowest damage of all communication policies under both planners (Table 27, and Table R1 in Part 1). On TDW-MAT, whose episodes last up to 3,000 steps, CREAC has the highest average transport rate under each of the four planners (Table R2 in Part 1).
We have revised Section 7 and Appendix A.22 of the revised PDF so that they describe each entry of the meta-belief as this continuous value.
Q. Overview figure
We agree, and the revised PDF adds an overview figure at the start of Section 4 (Figure 1).
We hope that these clarifications address the reviewer's concerns, and we would be glad to answer further questions. If they do, we would appreciate it if the reviewer would consider updating the assessment.
Response to Reviewer Mo9E (1/2)
We thank the reviewer for the assessment of the method's clarity, interpretability and experimental design, and for the close reading of Appendix A.4. We have uploaded a revised PDF. Section, table and figure numbers below refer to the revised PDF. It adds an overview figure (Figure 1) and a TDW-MAT table (Table 3), so most later table and figure numbers are one higher than in the submitted version. Tables R1 and R2 are new results and keep their numbers from the responses to the other reviewers.
W1. Is knowing which agent holds which information sufficient when agents differ in roles and capabilities?
The paper evaluates CREAC in this setting on CREW-Wildfire, a large-scale task whose fifteen agents are of four types with different capabilities (Table 12). Drones can only scout. Helicopters carry firefighters and drop water. The bulldozer clears firebreaks. Firefighters suppress fire and rescue civilians. In this setting, CREAC gives the lowest damage of all communication policies in Table 27, under both planners. We also ran two graph-based routers, AgentPrune and GDesigner, and CREAC gives lower damage than both (Table R1).
Table R1 (Tables 2 and 30). CREW-Wildfire with fifteen agents of four types. Damage (lower is better) and tokens per episode, with the standard error over five seeds after ±.
We also added a third benchmark, ThreeDWorld Multi-Agent Transport (TDW-MAT; Zhang et al., 2023), in which a team transports target objects to a goal location in multi-room 3D houses, with episodes of up to 3,000 steps. An agent carries at most two objects at a time, or more if it holds a container, so whether an agent can take on a transport depends on what it already carries. We ran its 24 official test episodes with teams of three to six agents and four planners, CoELA, ReAct, PCE (Seo et al., 2026) and Mind-Map Agent (Jeon et al., 2025). Overall, CREAC has the highest average transport rate under each of the four planners (Table R2).
Table R2 (Table 3). TDW-MAT. An episode lasts up to 3,000 steps, twelve times the horizon of C-WAH (250 steps) and fifteen times that of CREW-Wildfire (200 steps). An agent carries at most two objects at a time, or more with a container. Each cell gives the transport rate, the percentage of target objects transported (higher is better), averaged over teams of three to six agents, and in parentheses the mean tokens per episode, in millions and including the router. Each team size has one run of each of the 24 official test episodes. Bold marks the highest transport rate for each planner. Original is the communication that comes with PCE and Mind-Map Agent; like Broadcast, it sends every message to every teammate. The results for each team size, with standard errors, are in Table 28 (Appendix A.17).
In all of these results, CREAC routes requests for actions with the same meta-belief as requests for information, without a model of each agent's capabilities (Appendix A.4, Remark 1). In these teams of agents with different roles and capabilities, knowing which agent holds which information was therefore enough for CREAC to perform best among the compared methods.