- Weak-to-none technical novelty. Every mechanism is adapted from prior work the paper itself cites including agent modeling, priority determination, and guidance graphs for lifelong MAPF. The one genuinely new mechanism is the keyed sampling scheme that aligns an observer’s random draw with the target’s. The paper’s own ablation shows it has no measurable effect: separating the draws, or making them observer-specific, performs the same or marginally better.
Meanwhile the ablation ordering is awkward for the paper’s framing. Coordination tokens alone provide little benefit. Traffic Guidance alone provides a large jump. So the component contributing most is the one closest to existing work, and the component the title focuses on the most contributes least on its own.
Related: selective recovery, offered as a lighter substitute for runtime shielding, is shown to be worse than the thing it replaces. The shielded variant achieves higher relative throughput and lower waiting. The justification would be computational, but recovery occupies a fraction of a percent of per-step runtime, so almost nothing is saved.
- The predictor is weakest precisely where it is needed. Top-1 agreement with the true policy is high across all neighbor pairs but falls sharply on contended pairs, meaning the cases where two agents’ intended actions actually conflict. Those are the only cases where prediction changes anything. After confidence gating, a substantial fraction of retained hypotheses are false positives and a substantial fraction of real conflicts are missed. Gating trades recall for precision rather than improving either much.
So the central mechanism degrades on the interaction-critical subset and contributes least in the ablation. Taken together, these suggest the method may be working mainly through congestion-aware routing and policy adaptation, with prediction playing a supporting role.
-
The runtime argument has some discrepancies. The runtime comparison in fig. 8 is on a single standard-scale map, where PACT reaches high throughput at tens of milliseconds per step against several hundred for the centralized reference. The large-scale breakdown, in the appendix in fig. 10, reports per-step times approaching and exceeding one second at the largest agent count, with the congestion field accounting for the majority. At that large scale, it is not clear how well it performs comapred with the centralied planner but even taken on its, own, >1s is a weak result for a distributed method.
-
The decentralized comparison is absent, and the obvious runtime-oriented baselines are missing. Of the evaluated methods, four are the same backbone with different wrappers, one of which is the paper’s own adaptation teacher. Only two are independent decentralized baselines, and one of those runs in a different environment version, which the paper notes without addressing.
More importantly, the canonical methods that trade optimality for runtime, priority-inheritance planning and its search-based successors, do not appear as standalone baselines. The shield appears only as a wrapper on the backbone, which is not the same experiment. The paper’s entire positioning is quality at lower cost, and the established methods making that trade are absent.
-
The paper is positioned narrowly within learned MAPF and does not engage the broader motion-planning literature. The related work covers learned MAPF, runtime shielding, and congestion-aware lifelong planning, and covers them accurately. But spatially constrained multi-agent motion planning is a much larger field, and two neighboring bodies of work are relevant and absent including reactive and optimization-based methods (ORCA, multi-agent MPC etc.), reinforcement learning approaches, etc. Finally, the congestion mechanism is a decentralized form of congestion pricing on a graph, a long-standing idea in network flow and traffic assignment, and the connection is missing.
-
Smaller points. The main improvement of 13X is a macro-average of per-map ratios at the density where the backbone collapses, so it describes the baseline’s failure mode more than the method’s capability. The relative throughput against the centralized reference is the informative number and should be reported as such.
The framing emphasizes the absence of peer-to-peer communication, but the congestion mechanism requires a global broadcast of per-sector counts. The abstract should be upfront about this. The paper also notes it never measured the cost of collecting, distributing, or refreshing that information.
Section, figure, and numbered-table references follow the revised manuscript. Lettered tables and bibliography numbers belong to this response.
We thank the reviewer for the positive assessment of the paper’s clarity, baselines, ablations, and appendix.
Correction. The >13× ratio cited in the summary incorrectly described a Warehouse-specific gain as a five-map macro-average; the corrected values are 14.36× on Warehouse and 5.80× across maps. The revision now reports 90.5% of centralized RHCR-PBS throughput as the headline result (Table 5) and clarifies that Traffic Guidance uses a shared sector-occupancy service.
Main revisions. Following other reviewers, we strengthened the evidence for the main claims: