Pages that link to "Item:Q6488132"
From MaRDI portal
The following pages link to Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective (Q6488132):
Displaying 6 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
- Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (Q5076310) (← links)
- Safe Multi-Agent Pathfinding with Time Uncertainty (Q5856485) (← links)