Solving simultaneous target assignment and path planning efficiently with time-independent execution

DOI10.1016/j.artint.2023.103946zbMath1524.68344arXiv2109.04264OpenAlexW4377246895MaRDI QIDQ6108766

Xavier Défago, Keisuke Okumura

Publication date: 26 July 2023

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

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

zbMATH Keywords

multi-robot coordinationonline planningtarget assignmentunlabeled multi-agent pathfinding

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Lexicographic bottleneck problems
• Multi-color pebble motion on graphs
• Priority inheritance with backtracking for iterative multi-agent path finding
• Conflict-based search for optimal multi-agent pathfinding
• A survey of multi-agent formation control
• Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
• Maximal Flow Through a Network
• A survey of heuristics for the weighted matching problem
• Introduction to Distributed Self-Stabilizing Algorithms
• Reconfigurations in Graphs and Grids

This page was built for publication: Solving simultaneous target assignment and path planning efficiently with time-independent execution