Πλοήγηση Articles ανά Θέμα "Minimum coverage paths"
Αποτελέσματα 1-1 από 1
-
DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
(Springer, 2017)This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning ...