Non-crossing anonymous MAPF for tethered robots

DOI10.1613/JAIR.1.14351MaRDI QIDQ6535407zbMATH OpenFDO

Authors Xiao Peng, Olivier Simonin, Christine Solnon

Publication date 20 December 2023

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

zbMATH Keywords

planningautonomous agentsmultiagent systemsroboticscconstraint programming

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Recommendations

• Anonymous graph exploration without collision by mobile robots
• Shortest path planning for a tethered robot
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Distributed robust MPC for nonholonomic robots with obstacle and collision avoidance
• Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles

Cites work

• A bottleneck matching problem with edge-crossing constraints
• Conflict-based search for optimal multi-agent pathfinding
• Introduction to algorithms.
• Maximal Flow Through a Network

This page was built for publication: Non-crossing anonymous MAPF for tethered robots

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