Pages that link to "Item:Q5283371"
From MaRDI portal
The following pages link to Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds (Q5283371):
Displaying 6 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← links)
- (Q3093656) (← links)
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Q3120432) (← links)
- k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems (Q3449531) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)