- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes CCE-KFF, a method for constructing reusable families of flow fields for agents sharing a destination. It represents destination-reaching fields as rooted spanning trees and generates alternatives through cycle exchanges, with selectors favoring short routes or greater route diversity. Experiments on Moving AI and StarCraft maps evaluate route length, diversity, and shared-destination planning time against source-specific planners and reusable field baselines.
Critical strengths
-
The reusable field representation is well suited to shared-destination planning. The reported speedups over PNC and Plateaus provide evidence of its practical value when serving multiple sources.
-
The analysis establishes that exchanges preserve destination reachability and identifies exactly which routes change. These results support the correctness of the construction and provide a useful basis for evaluating candidate exchanges.
Critical weaknesses
-
The main compiler is not sufficiently specified. Section 4.3 does not explain the field-indexed rule for generating shortest-path skeletons, how candidate exchanges are shortlisted, or how many candidates are considered per skeleton. Algorithm 1 delegates this work to DEPTH_ONE, and Appendix A.6 refers back to Section 4.3 (felt circular writing to me, at least confusing). Since the main experiments use (D=1), this leaves the procedure responsible for the main results difficult to reproduce.
-
The near-shortest results show little benefit from exchanges. In Table 1(a), CCE-Length essentially matches Shortest-Only FF in route count and diversity on both benchmarks, with negligible DAG escape. The improvements over Yen and PNC therefore do not establish the contribution of cycle exchanges. A comparison using the same skeletons before and after exchange, including compilation time, would help separate the benefit of exchanges from that of varying shortest-path ties.
Questions for authors
-
Can the authors provide complete DEPTH_ONE pseudocode?
-
What improvement do exchanges provide over the same shortest-path skeletons, and at what computational cost?