Path Planning through Tight Spaces for Payload Transportation using Multiple Mobile Manipulators
Rahul Tallamraju, Venkatesh Sripada, Suril V. Shah
- Year
- 2019
- Citations
- 2
Abstract
In this paper, the problem of path planning through tight spaces, for the task of spatial payload transportation, using a formation of mobile manipulators is addressed. Due to the high dimensional configuration space of the system, efficient and geometrically stable path planning through tight spaces is challenging. We resolve this by planning the path for the system in two phases. First, an obstacle-free trajectory in R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> for the payload being transported is determined using RRT. Next, near-energy optimal and quasi-statically stable paths are planned for the formation of robots along this trajectory using non-linear multi-objective optimization. We validate the proposed approach in simulation experiments and compare different multi-objective optimization algorithms to find energy optimal and geometrically stable robot path plans.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002