Online motion planning for robotic arms: new approach based on the reduction of the search space

This paper presents a new method for online path planning for robotic arms in dynamic environments. Most online path planning methods are based on local algorithms that end up being inefficient due to their lack of global information (local minima problems). The method presented in this paper avoids local minima by using a two stage framework. The robots react to dynamic environments using a local and reactive planning method restricted to a subset of its configuration space. Since the subset has few degrees of freedom the computational cost of the online stage is very low. An off-line stage chooses the subset of the configuration space that minimizes the probability of blockades and inefficient motions.

[1]  Max Q.-H. Meng,et al.  A Neural Network Approach to Real-Time Trajectory Generation * , 1998 .

[2]  José R. Perán,et al.  Optimization of collision free trajectories in multi-robot systems , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

[4]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[5]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[6]  Angel P. del Pobil,et al.  Practical Motion Planning in Robotics: Current Approaches and Future Directions , 1998 .

[7]  Stanley Lemeshow,et al.  Adequacy of Sample Size in Health Studies , 1990 .