Por favor, use este identificador para citar o enlazar este ítem:
http://cimat.repositorioinstitucional.mx/jspui/handle/1008/609| Shortest Paths for Differential Drive Robots Under Visibility and Sensor Constraints | |
| JEAN BERNARD HAYET | |
| Acceso Abierto | |
| Atribución-NoComercial | |
| Robótica | |
| Abstract — This article revisits the problem of planning short- est paths in terms of distance in the plane (i.e., not in time) for the differential drive robot (DDR) in the absence of obstacles. We complete the existing works by explaining and deepening the remarks made recently in the literature [10] that exhibited more cases that what was thought until then. Motivated by that work, we show that there cannot have more than 4-word trajectories and finally exhibit a complete partition of the plane in terms of the nature of the shortes path. | |
| Centro de Investigación en Matemáticas AC | |
| 24-02-2009 | |
| Reporte | |
| Inglés | |
| Investigadores | |
| ARQUITECTURA DE ORDENADORES | |
| Versión publicada | |
| publishedVersion - Versión publicada | |
| Aparece en las colecciones: | Reportes Técnicos - Ciencias de la Computación |
Cargar archivos:
| Fichero | Tamaño | Formato | |
|---|---|---|---|
| I-09-02.pdf | 561.79 kB | Adobe PDF | Visualizar/Abrir |