Optimal dynamic path planning for robot manipulators

S. Muthuswamy, S. Manoochehri

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

The study deals with a computer-based methodology for the synthesis of an optimal tool tip path for robot manipulators in the presence of obstacles and singularities of the workspace. The methodology plans an optimal path to achieve the best robot kinematic and dynamic performances. An interactive computer program is developed to implement the methodology. To execute the program, robot design parameters, the size and the location of the obstacles, and the initial and the goal states should be specified. Thus there is no need for the specification of the intermediate points or the form of the trajectory. The optimal path is synthesized using Dijkstra's minimum cost path algorithm as a sequence of intermediate points connecting the initial and the goal states. Contrary to most existing methodologies, the computational complexity of this algorithm decreases with an increase in the number and/or size of the obstacles in the workspace. The procedure is general and can be applied to any type of robot. The algorithm has been applied to some industrial SCARA robots and the results are presented.

Original languageEnglish
Pages517-524
Number of pages8
StatePublished - 1988
EventTrends and Developments in Mechanisms, Machines, and Robotics - 1988 - Kissimmee, FL, USA
Duration: 25 Sep 198828 Sep 1988

Conference

ConferenceTrends and Developments in Mechanisms, Machines, and Robotics - 1988
CityKissimmee, FL, USA
Period25/09/8828/09/88

Fingerprint

Dive into the research topics of 'Optimal dynamic path planning for robot manipulators'. Together they form a unique fingerprint.

Cite this