Exploiting subgraph structure in multi-robot path planning

MaRDI QIDQ3624124zbMATH OpenFDO

Authors M. R. K. Ryan

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1111.0053

zbMATH Keywords

prioritised planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• Subdimensional expansion for multirobot path planning
• scientific article; zbMATH DE number 5959974
• Graphbots: mobility in discrete spaces
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
• scientific article; zbMATH DE number 1882044

Cited in

(11)

• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Priority inheritance with backtracking for iterative multi-agent path finding
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
• Subdimensional expansion for multirobot path planning
• Conflict-based search for optimal multi-agent pathfinding
• SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS
• A plan manager for multi-robot systems
• Reducing Multiple Object Motion Planning to Graph Searching
• Density-aware decentralised multi-agent exploration with energy constraint based on optimal transport theory
• The computational complexity of multi-agent pathfinding on directed graphs
• CBS-budget (CBSB): a complete and bounded suboptimal search for multi-agent path finding

This page was built for publication: Exploiting subgraph structure in multi-robot path planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624124)