Non-crossing anonymous MAPF for tethered robots
From MaRDI portal
Publication:6535407
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
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)