Pages that link to "Item:Q2147092"
From MaRDI portal
The following pages link to Branch-and-cut-and-price for multi-agent path finding (Q2147092):
Displaying 10 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← links)
- The multiple shortest path problem with path deconfliction (Q2030451) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- Priority inheritance with backtracking for iterative multi-agent path finding (Q2163887) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- Push and rotate: a complete multi-agent pathfinding algorithm (Q2929587) (← links)
- Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (Q5076310) (← links)
- Shadoks Approach to Low-Makespan Coordinated Motion Planning (Q6163580) (← links)
- Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective (Q6488132) (← links)