Multiple-robot motion planning = parallel processing + geometry
From MaRDI portal
Recommendations
- Motion planning for multiple robots
- scientific article; zbMATH DE number 4108220
- Pareto Optimal Multirobot Motion Planning
- Geometric backtracking for combined task and motion planning in robotic systems
- Parallel collision detection between moving robots for practical motion planning
- Scalable distributed algorithms for multi-robot near-optimal motion planning
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Configuration spaces and robot motion planning algorithms
Cited in
(11)- Motion planning for multiple robots
- Subdimensional expansion for multirobot path planning
- Multiple object semilinear motion planning
- Parallel collision detection between moving robots for practical motion planning
- Nonpositive Curvature and Pareto Optimal Coordination of Robots
- Translation STRIPS planning in multi-robot environment to linear programming
- scientific article; zbMATH DE number 935096 (Why is no real title available?)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated motion planning: the video (multimedia exposition)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Unlabeled multi-robot motion planning with tighter separation bounds
This page was built for publication: Multiple-robot motion planning = parallel processing + geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736548)