Safe multi-agent pathfinding with time uncertainty
From MaRDI portal
(Redirected from Publication:5856485)
Recommendations
- Robust multi-agent path finding and executing
- Conflict-based search for optimal multi-agent pathfinding
- scientific article; zbMATH DE number 5959974
- Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
Cites work
- Conflict-based search for optimal multi-agent pathfinding
- Enhanced partial expansion A^*
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Improved bounds on the sample complexity of learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Robust multi-agent path finding and executing
- Strong temporal planning with uncontrollable durations
- Subdimensional expansion for multirobot path planning
- Temporal constraint networks
- The Complexity of Decentralized Control of Markov Decision Processes
- The increasing cost tree search for optimal multi-agent pathfinding
- The optimal sample complexity of PAC learning
- Weak, strong, and strong cyclic planning via symbolic model checking
Cited in
(4)- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
- Robust multi-agent path finding and executing
- Solving simultaneous target assignment and path planning efficiently with time-independent execution
- Robust and effective multi-agent path execution with timing uncertainty
This page was built for publication: Safe multi-agent pathfinding with time uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856485)
