Iniciar sesión
Información - Multi-agent path finding
Directly Planning a Temporal Planning Graph by Redefining Conflict-Based Search
The authors propose a novel algorithm, Space-Order CBS, that can directly plan a Temporal Planning Graph (TPG) by reinterpreting a TPG as a set of space-visitation order paths. This allows them to explicitly minimize coordination between agents during the planning process.
Efficient Algorithm Selection for Suboptimal Multi-Agent Path Finding
Developing an efficient algorithm selection framework that considers both runtime and solution quality for suboptimal multi-agent path finding solvers.
Improving Scalability and Success Rates of Learnt Local Multi-Agent Path Finding Policies using Heuristic Search
Learnt local MAPF policies can be significantly improved in terms of success rate and scalability by using them in conjunction with heuristic search techniques like PIBT and LaCAM.
Acerca de
Productos | Recursos
© 2024 by Linnk AI