Subdimensional expansion for multirobot path planning

DOI10.1016/j.artint.2014.11.001zbMath1328.68236OpenAlexW2123030512MaRDI QIDQ2343828

Glenn Wagner, Howie Choset

Publication date: 6 May 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2014.11.001

zbMATH Keywords

multiagent systemmotion and path planning

Mathematics Subject Classification ID

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

Related Items (13)

Multi-agent pathfinding with continuous time ⋮ Scalable distributed algorithms for multi-robot near-optimal motion planning ⋮ Priority inheritance with backtracking for iterative multi-agent path finding ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Conflict-tolerant and conflict-free multi-agent meeting ⋮ An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Efficient generation of performance bounds for a class of traffic scheduling problems ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Synchronized Multi-arm Rearrangement Guided by Mode Graphs with Capacity Constraints ⋮ Visualizing Local Minima in Multi-robot Motion Planning Using Multilevel Morse Theory ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ Safe Multi-Agent Pathfinding with Time Uncertainty

Uses Software

• Walksat

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-space best-first search
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Depth-first iterative-deepening: An optimal admissible tree search
• On multiple moving objects
• Graph puzzles, homotopy, and the alternating group
• SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS
• Enhanced Partial Expansion A*
• Planning as heuristic search

This page was built for publication: Subdimensional expansion for multirobot path planning