1
|
Salzman O, Solovey K, Halperin D. Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling. IEEE Robot Autom Lett 2016. [DOI: 10.1109/lra.2016.2524066] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|
2
|
Abstract
SUMMARYThe Tangent Bundle Rapidly Exploring Random Tree (TB-RRT) is an algorithm for planning robot motions on curved configuration space manifolds, in which the key idea is to construct random trees not on the manifold itself, but on tangent bundle approximations to the manifold. Curvature-based methods are developed for constructing tangent bundle approximations, and procedures for random node generation and bidirectional tree extension are developed that significantly reduce the number of projections to the manifold. Extensive numerical experiments for a wide range of planning problems demonstrate the computational advantages of the TB-RRT algorithm over existing constrained path planning algorithms.
Collapse
|
3
|
Porta JM, Jaillet L, Bohigas O. Randomized path planning on manifolds based on higher-dimensional continuation. Int J Rob Res 2011. [DOI: 10.1177/0278364911432324] [Citation(s) in RCA: 25] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Despite the significant advances in path planning methods, highly constrained problems are still challenging. In some situations, the presence of constraints defines a configuration space that is a non-parametrizable manifold embedded in a high-dimensional ambient space. In these cases, the use of sampling-based path planners is cumbersome since samples in the ambient space have low probability to lay on the configuration space manifold. In this paper, we present a new path planning algorithm specially tailored for highly constrained systems. The proposed planner builds on recently developed tools for higher-dimensional continuation, which provide numerical procedures to describe an implicitly defined manifold using a set of local charts. We propose to extend these methods focusing the generation of charts on the path between the two configurations to connect and randomizing the process to find alternative paths in the presence of obstacles. The advantage of this planner comes from the fact that it directly operates into the configuration space and not into the higher-dimensional ambient space, as most of the existing methods do.
Collapse
Affiliation(s)
- Josep M Porta
- Institut de Robòtica i Informàtica Industrial, CSIC-UPC, Barcelona, Spain
| | - Léonard Jaillet
- Institut de Robòtica i Informàtica Industrial, CSIC-UPC, Barcelona, Spain
| | - Oriol Bohigas
- Institut de Robòtica i Informàtica Industrial, CSIC-UPC, Barcelona, Spain
| |
Collapse
|
4
|
Xinyu Tang, Thomas S, Coleman P, Amato NM. Reachable Distance Space: Efficient Sampling-Based Planning for Spatially Constrained Systems. Int J Rob Res 2010. [DOI: 10.1177/0278364909357643] [Citation(s) in RCA: 21] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
Motion planning for spatially constrained robots is difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end-effector placement for articulated linkages. It is usually computationally too expensive to apply sampling-based planners to these problems since it is difficult to generate valid configurations. We overcome this challenge by redefining the robot’s degrees of freedom and constraints into a new set of parameters, called reachable distance space (RD-space), in which all configurations lie in the set of constraint-satisfying subspaces. This enables us to directly sample the constrained subspaces with complexity linear in the number of the robot’s degrees of freedom. In addition to supporting efficient sampling of configurations, we show that the RD-space formulation naturally supports planning and, in particular, we design a local planner suitable for use by sampling-based planners. We demonstrate the effectiveness and efficiency of our approach for several systems including closed chain planning with multiple loops, restricted end-effector sampling, and on-line planning for drawing/sculpting. We can sample single-loop closed chain systems with 1,000 links in time comparable to open chain sampling, and we can generate samples for 1,000-link multi-loop systems of varying topologies in less than a second.
Collapse
Affiliation(s)
- Xinyu Tang
- Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA,
| | - Shawna Thomas
- Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843, USA,
| | - Phillip Coleman
- Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843, USA,
| | - Nancy M. Amato
- Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843, USA,
| |
Collapse
|
5
|
|