Coordinated Path Planning through Local Search and Simulated Annealing

DOI10.1145/3531224MaRDI QIDQ6163582zbMATH OpenOpenAlexFDO

Authors Hyeyun Yang, Antoine Vigneron

Publication date 26 June 2023

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3531224

zbMATH Keywords

computational geometrygeometric optimizationpath planningalgorithm engineering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

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

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch

Cited in

(6)

• Dynamic robot path planning using an enhanced simulated annealing approach
• SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS
• Shadoks Approach to Low-Makespan Coordinated Motion Planning
• Coordinated Motion Planning Through Randomized k -Opt
• Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem

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)