Non-crossing anonymous MAPF for tethered robots

DOI10.1613/JAIR.1.14351MaRDI QIDQ6535407

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

planningroboticsautonomous agentsmultiagent systemscconstraint programming

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Cites Work

• Title not available (Why is that?)
• Conflict-based search for optimal multi-agent pathfinding
• A bottleneck matching problem with edge-crossing constraints
• Maximal Flow Through a Network

Recommendations

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

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)