Coordinated Path Planning through Local Search and Simulated Annealing
From MaRDI portal
(Redirected from Publication:6163582)
Recommendations
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Coordinated Motion Planning Through Randomized k -Opt
- Coordination in navigation of multiple mobile robots
- Coordinated motion planning: the video (multimedia exposition)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
Cites work
Cited in
(7)- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Shadoks Approach to Low-Makespan Coordinated Motion Planning
- Coordinated Motion Planning Through Randomized k -Opt
- Coordinated motion planning: multi-agent path finding in a densely packed, bounded domain
- Dynamic robot path planning using an enhanced simulated annealing approach
This page was built for publication: Coordinated Path Planning through Local Search and Simulated Annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163582)