Obstacle Avoidance for Kinematically Redundant Manipulators Using the Deterministic Annealing Neural Network
With the wide deployment of redundant manipulators in complex working environments, obstacle avoidance emerges as an important issue to be addressed in robot motion planning. In this paper, a new obstacle avoidance scheme is presented for redundant manipulators. In this scheme, obstacle avoidance is mathematically formulated as a time-varying linearly constrained quadratic programming problem. To solve this problem effectively in real time, the deterministic annealing neural network is adopted, which has the property of low structural complexity. The effectiveness of this scheme and the real time solution capability of the deterministic neural network is demonstrated by using a simulation example based on the Mitsubishi PA10-7C manipulator.
KeywordsObstacle Avoidance Redundant Manipulator Inverse Kinematic Problem Robot Motion Planning Obstacle Point
Unable to display preview. Download preview PDF.
- 8.Wang, J.: A Deterministic Annealing Neural Network for Convex Programming. Neural Networks 5, 962–971 (1994)Google Scholar