Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot

The complete coverage path planning is a process of finding a path which ensures that a mobile robot completely covers the entire environment while following the planned path. In this paper, we propose a complete coverage path planning algorithm that generates smooth complete coverage paths based on...

Descripción completa

Detalles Bibliográficos
Autores principales: Šelek, Ana, Seder, Marija, Brezak, Mišel, Petrović, Ivan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9737636/
https://www.ncbi.nlm.nih.gov/pubmed/36501971
http://dx.doi.org/10.3390/s22239269

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9737636/
https://www.ncbi.nlm.nih.gov/pubmed/36501971
http://dx.doi.org/10.3390/s22239269

Ejemplares similares