Efficient asymptotically-optimal path planning on manifolds
This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on t...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/22927 |
| Acceso en línea: | https://hdl.handle.net/2117/22927 https://dx.doi.org/10.1016/j.robot.2013.04.012 |
| Access Level: | acceso abierto |
| Palabra clave: | Robots robots paraules autor: asymptotically-optimal path planning kinematic constraints bi-directional search RRT* LPA* higher-dimensional continuation Robòtica Classificació INSPEC::Automation::Robots Àrees temàtiques de la UPC::Informàtica::Robòtica |
| Sumario: | This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as when manipulating an object with two arms or with a multifingered hand. In these cases, the configuration space usually becomes an implicit manifold embedded in a higher-dimensional joint ambient space. Existing sampling-based path planners on manifolds focus on finding a feasible solution, but they do not optimize the quality of the path in any sense and, thus, the returned solution is usually not adequate for direct execution. In this paper, we adapt several techniques to accelerate the convergence of the asymptotically-optimal planners and we use higher-dimensional continuation tools to deal with the case of implicitly-defined configuration spaces. The performance of the proposed approach is evaluated through various experiments. |
|---|