- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes region-addressed attention messages to reduce redundant VLM computation in multi-robot embodied planning. Each region is independently encoded by a designated robot, and its KV cache is associated with a region identity, version, and owner. Other robots can reuse valid cached states through their frozen planners without re-encoding the same regions. Experiments on HM3D, MP3D, and physical robots demonstrate navigation feasibility and a 45% reduction in planner GPU time compared with cached re-perception.
Critical strengths
-
Well-motivated problem. The paper addresses redundant planner computation in multi-robot navigation, extending beyond conventional map-level information sharing.
-
Computational efficiency gains. The proposed approach reduces execution latency and GPU processing time compared with cached re-perception, while maintaining comparable navigation performance.
Critical weaknesses
-
Limited methodological novelty. Independent context construction, positional adaptation, and KV-cache transfer have been explored previously. The paper could better distinguish its technical contributions from existing cache-reuse methods.
-
Figure clarity. Figure 1 could be improved in terms of visual appeal and readability. The excessive text and mathematical expressions make it appear cluttered.
Questions for authors
Q1. Novelty. Could the authors clarify the main technical differences between the proposed framework and existing KV-cache reuse methods? Which components constitute the primary methodological contributions?
Q2. Limited comparison with existing KV-cache reuse methods. Although the paper evaluates several communication and caching baselines, it lacks direct comparisons with existing KV-cache reuse techniques. Such comparisons would help clarify the proposed method's advantages.
Q3. Insufficient evaluation of independent regional encoding. Independent encoding removes cross-region attention and leads to noticeable disagreement with joint encoding. Could the authors include joint encoding results in Table 1 and further analyze the trade-off between navigation performance degradation and computational efficiency gains introduced by independent encoding?
Q4. Source of navigation performance gains. The proposed method sacrifices cross-region interactions to improve computational efficiency, yet achieves the best navigation performance in Table 1. Could these performance gains be attributed to differences in the planners used? The authors are encouraged to further analyze the sources of the observed performance improvements.
3 comments
Thank you for the clarification, which addressed my concern. I will raise my score.
Response to Reviewer ujW6
Thank you very much for taking the time to read our response and for your kind reconsideration. We sincerely appreciate your thoughtful review and your support of our work.
Response to Reviewer ujW6
Thank you for the review. Shared points are in the general response (G1–G4). Where a question repeats a weakness, we answer once and refer back.
W1: Methodological novelty. We inherit several components: encoding each room independently from a shared prefix, storing pre-RoPE keys, rephasing at read time, and KV transport (Prompt Cache, Block-Attention, APE, EPIC, KVCOMM). The revised Sec. 1 states what we add. (1) A query-independent, world-keyed construction that an owner commits before any reader or query exists, and that frozen planners on other robots read natively. (2) A complete-key admission rule (region, version including the selected patches, single owner) that decides when shared state is current. (3) A measured account of the one approximation, independent construction (please see Q3). Table 4(b) shows that (2) is more than a detail: dropping any key field either admits stale state (99.4% of post-change decisions without the version) or makes records differ across robots, while the full key admits none. EfficientNav, now cited, is a goal-conditioned map cache for a single robot; its per-robot analogue is our cached re-perception baseline (App. E.1, Table 9).
W2: Figure 1. We redrew Figure 1 on a real HM3D map, in four labelled panels with short labels and no equations. Panel (a) shows the shared map with rooms tinted by owner. Panel (b) shows the owner running the frozen planner on the shared prefix and one room, with no goal, and tagging that room's keys and values with room, version and owner. Panel (c) shows the receiver admitting only records whose tag matches its map, encoding a changed room locally, and computing only its task tokens over all rooms. Panel (d) shows where the saving comes from: cached re-perception encodes every changed room on every robot, while attention messages encode it once. The version with full notation is Fig. 7 in the appendix.
Q1. Please see W1.
Q2: Comparison with KV-cache reuse techniques. We added CacheBlend-style recomputation and a KVCOMM-style anchor correction on the same admission layer (G2; App. E.7, Table 15). Recomputation raises agreement with joint encoding from 0.761 to 0.812 but costs 2.11 GPU-s per step against our 1.68; the anchor correction does not raise agreement. SR stays within noise for both (0.722 with recomputation against 0.708 without), so our default reaches the same navigation quality at lower cost, and recomputation can be enabled when higher agreement matters. We thank the reviewer for suggesting this comparison: it shows that correction methods complement the admission layer rather than replace it. Per-robot and centralized region caches are already in the paper as cached re-perception (3.07 GPU-s, Table 2) and a centralized cache (1.64 GPU-s, Table 3). Latent sharing matches the centralized cost while planning stays onboard: under a 20% link outage, a centralized team times out on 19.6% of decisions, while latent sharing keeps deciding (App. E.11).
Q3: Joint encoding in Table 1, and the trade-off. We agree this comparison belongs in the main table, and Table 1 now has a joint-encoding row: 0.810 SR on HM3D and 0.625 on MP3D, against 0.818 and 0.621 for latent sharing, and the paired intervals include zero on both splits (App. E.9, Table 16). Joint encoding costs 3.66 GPU-s per step against 1.68, because nothing can be reused across decisions or robots. Independent construction keeps 79–81% of joint encoding's own run-to-run agreement, and the gap concentrates in multi-room, near-tie decisions (App. E.6, Table 14). The trade-off is therefore no measurable loss in success rate for roughly half the planner GPU time.
Q4: Source of the navigation gains. This is a fair concern, and Table 1 lets us check it directly. The gains do not come from a stronger planner; ours is the smaller one. MCoCoNav runs GLM-4V 9B, while each of our robots runs GLM-Edge-V-5B. With the full map and no sharing, our planner records 0.722 SR on HM3D and 0.552 on MP3D, against 0.716 and 0.568 for MCoCoNav rerun under our protocol (Table 1). The margin comes from pruning the front end (0.752 without sharing) and from communicating teammate rooms, which adds 0.066 SR on HM3D and 0.058 on MP3D, both significant (App. E.9). The last four rows of Table 1 share this planner and front end and differ only in how teammate rooms are delivered; the caption now says so. Dropping cross-region interaction costs no measurable SR (please see Q3). Re-perception obtains the same rooms by re-encoding them on every robot and reaches a similar SR, while attention messages need 45% less planner GPU time.