Shadoks Approach to Low-Makespan Coordinated Motion Planning

DOI10.1145/3524133zbMath1521.68224arXiv2103.13956OpenAlexW4220830180MaRDI QIDQ6163580

Yan Gerard, Luc Libralesso, Guilherme Dias da Fonseca, Pascal Lafourcade, Aldo Gonzalez-Lorenzo, Loïc Crombez

Publication date: 26 June 2023

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

heuristicsshortest pathmotion planningmulti-agent path finding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• Parts-to-picker based order processing in a rack-moving mobile robots environment
• Branch-and-cut-and-price for multi-agent path finding
• Conflict-based search for optimal multi-agent pathfinding
• Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
• Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
• Two-point L1 shortest path queries in the plane
• Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach
• Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
• Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
• Enhanced Partial Expansion A*