Cargando…
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...
Autores principales: | Samaniego, Ricardo, Lopez, Joaquin, Vazquez, Fernando |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2017
|
Materias: | |
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 |
Ejemplares similares
-
Efficient Path Planing for Articulated Vehicles in Cluttered Environments
por: Samaniego, Ricardo, et al.
Publicado: (2020) -
Non-holonomic quantum devices
por: Gershkovich, V, et al.
Publicado: (2000) -
Dynamic Output Feedback and Neural Network Control of a Non-Holonomic Mobile Robot
por: Cardona, Manuel, et al.
Publicado: (2023) -
Path following control of planar snake robots using virtual holonomic constraints: theory and experiments
por: Rezapour, Ehsan, et al.
Publicado: (2014) -
Observer-Based Time-Variant Spacing Policy for a Platoon of Non-Holonomic Mobile Robots
por: Velasco-Villa, Martín, et al.
Publicado: (2021)