Push and Rotate: a Complete Multi-agent Pathfinding Algorithm

DOI10.1613/jair.4447zbMath1367.68319OpenAlexW2167979940MaRDI QIDQ2929587

Boris de Wilde, Adriaan W. Ter Mors, Cees Witteveen

Publication date: 13 November 2014

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

Full work available at URL: https://doi.org/10.1613/jair.4447

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 (3)

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Solving simultaneous target assignment and path planning efficiently with time-independent execution ⋮ Shadoks Approach to Low-Makespan Coordinated Motion Planning

Uses Software

• Algorithm 447

This page was built for publication: Push and Rotate: a Complete Multi-agent Pathfinding Algorithm