Skip to main content

A formulation for path planning of manipulators in complex environments by using adjacent configurations

Buy Article:

$55.00 plus tax (Refund Policy)

The problem of robot path planning among obstacles has been approached by formulating robot configurations by means of a suitable fully Cartesian coordinate description. Thus, an analytical expression has been found for adjacent configurations, which is useful in deducing an optimization formulation for the collision-free path problem. An algorithm is proposed to solve the problem of finding a feasible path to be followed to an end point by a robot between given start and end points in space. In the procedure a map of feasible robot configurations is obtained by using a suitable nonlinear programming technique; then a weighted graph is associated to the map and finally a search algorithm is used to obtain a sequence of free-of-collision robot configurations between two previously selected points. The algorithm has been successfully applied to redundant planar robotic manipulators with rotational and prismatic joints, and three-dimensional robotic manipulators. Some numerical examples are reported in the paper.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Data/Media
No Metrics

Document Type: Research Article

Affiliations: 1: Department of Mechanical Engineering, Polytechnic University of Valencia, 46022 Valencia, Spain 2: Department of Industrial Engineering, University of Cassino, 03043 Cassino (Fr), Italy

Publication date: 1996-01-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more