Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments

This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution...

Descripción completa

Detalles Bibliográficos
Autores principales: Samaniego, Ricardo, Lopez, Joaquin, Vazquez, Fernando
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5579725/
https://www.ncbi.nlm.nih.gov/pubmed/28809785
http://dx.doi.org/10.3390/s17081876

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5579725/
https://www.ncbi.nlm.nih.gov/pubmed/28809785
http://dx.doi.org/10.3390/s17081876

Ejemplares similares