Pages that link to "Item:Q2124435"
From MaRDI portal
The following pages link to Multi-agent pathfinding with continuous time (Q2124435):
Displaying 6 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← links)
- Priority inheritance with backtracking for iterative multi-agent path finding (Q2163887) (← links)
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Q3120432) (← links)
- Continuous optimisation problem and game theory for multi-agent pathfinding (Q6146784) (← links)
- Railway scheduling using Boolean satisfiability modulo simulations (Q6174526) (← links)
- Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective (Q6488132) (← links)