Network optimization approach to three-dimensional collision-free robot path planning

P. K. Jain, S. P. Manoochehri

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper presents a network optimization approach to the generation of tool tip paths in three-dimensional space for robot manipulators working in the presence of obstacles. The developed algorithm relies on a graph structure enumeration of possible path segments between discrete points inside the workspace. An intelligent heuristic scheme is used to select a small searchspace over which the search for the optimal path is carried out. Paths which are optimal with respect to predetermined objective functions based on robot kinematic and dynamic solutions are synthesized by applying Dijkstra's minimum cost algorithm. Collision avoidance is checked for the tool tip as well as for the robot body. The methodology is robot independent and can be applied to any robot whose kinematics and dynamics can be solved.

Original languageEnglish
Pages177-182
Number of pages6
StatePublished - 1989
EventAdvances in Design Automation - 1989 - Montreal, Que, Can
Duration: 17 Sep 198921 Sep 1989

Conference

ConferenceAdvances in Design Automation - 1989
CityMontreal, Que, Can
Period17/09/8921/09/89

Fingerprint

Dive into the research topics of 'Network optimization approach to three-dimensional collision-free robot path planning'. Together they form a unique fingerprint.

Cite this