- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents a diffusion based approach to generating initial paths in a MAPF problem. The paths are not a correct solution, but large neighbourhood search is used to generate a solution from them. The interesting finding is that the initial paths, even though they have more conflicts than using priorities planning, generate better solutions after repair. But its not clear the method is scalable to problems of interest, and the authors use non-standard benchmarks while there is a wealth of standard benchmarks in this space. There seems little reason to do this, except to make it harder to compare with other existing methods.
Critical strengths
Clearly the diffusion is learning something meaningful, since the repaired plans are better than those created by prioritised planning.
Critical weaknesses
Not applied to large maps. The actual use of MAPF in warehouse logistics is on very large maps with very large numbers of agents. No arguments that this approach scales to this map size.
Not applied to standard maps. There are plenty of small maps and agent start-goal pairs benchmarks available but the authors choose to use their own, for no reason discernible.
Questions for authors
How do you compare with using PIBT/LACAM to generate initial paths and then repairing with LNS. These simple symbolic approaches have very high success rate, leaving LNS2 to mainly reduce the cost of the resulting solution rather than fix conflicts. These are commonly used in modern MAPF solutions e.g. Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI-24).
Sometimes an agent may reach its goal state and have to move off the goal, to let another agent through. Is this something the diffusion patterns can learn. It seems you disallow such paths in the preprocessing step before they are passed to LNS2
How does the method scale with map size. The joint discrete action tensor is going to be very large for 1000 agents on a large map, e.g. requiring over 1000 time steps to complete.
Can you redo the experiments on standard maps, with standard start-goal agent pairs.
Given you are comparing on dense maps with many agents, shouldnt you compare against modern MAPF methods that take into account traffic in their planning, e.g. Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding (AAAI-25) even if they are designed for Lifelong MAPF.
2 comments
We appreciate the reviewer's careful assessment and constructive feedback. We agree that broader evaluation on standard MAPF benchmarks and improved scalability are important for establishing the approach's value across different MAPF settings.
In future work, we will investigate how to improve efficiency and solution quality on larger maps with more agents, and conduct more extensive testing on standard MAPF benchmarks across diverse map types. The reviewer's comments have helped us clarify these priorities for our future research.
After rebuttal
The authors did a good job at answering my questions. Its a pity they did not illustrate the methods on more standard MAPF benchmarks which are widely available. Without this its not clear if this approach actually moves the state-of-the-art for MAPF forward.
The method clearly suffers on large maps, at least how I read the table for Q3 is that on the map of interest (warehouse) LNS2 is faster and has better solutions. The maze and room maps are quite artificial and hard for reasons that dont tend to occur on other map types.
There is some interesting ideas here, but at least for me not quite enough evidence that it really moves the state-of-the-art. I will raise my score to weak acceptance.