Computational issues in motion planning for autonomous underwater vehicles with manipulators

Motion planning with a high number of degrees of freedom (DOF) is computationally demanding. Coupled AUV-manipulators are an example where there can be as many as 14-DOF in a typical dual-arm configuration attached to an underwater vehicle exhibiting 6-DOF motion. In an underwater environment, autonomous vehicles are required to plan motion online, a non-trivial task for coupled AUV-manipulators. This paper examines the computational requirements of high DOF systems and presents a technique which allows fast execution of motion plans. This technique is implemented using distributed search in a 'local' motion planning context. Distributed search is achieved through the execution of a number of subsearches in parallel, where each subsearch contains a unique subset of the DOFs in the system. It is shown how the use of this technique increases the effectiveness of the local motion planning methodology, allowing fast execution of motion plans for systems with a high number of degrees of freedom.

[1]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[2]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

[3]  Andrew W. Quinn Motion planning for manipulators using distributed search , 1993 .

[4]  B. Faverjon,et al.  A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[5]  Kamal Gupta Fast collision avoidance for manipulator arms: a sequential search strategy , 1990, IEEE Trans. Robotics Autom..

[6]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[7]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[8]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[9]  David M. Lane,et al.  Task and motion planning for subsea manipulators in an unstructured environment , 1993 .

[10]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[11]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[12]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

[13]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

[15]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[16]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[17]  J. Latombe,et al.  Numerical potential field techniques for robot path planning , 1991 .