Hostname: page-component-848d4c4894-8kt4b Total loading time: 0 Render date: 2024-06-30T13:25:09.665Z Has data issue: false hasContentIssue false

Optimal path planning of manipulatory systems subjected tonon-autonomous motion laws

Published online by Cambridge University Press:  01 May 1997

A. D. Jutard-Malinge
Affiliation:
Université de Poitiers, Laboratoire de Mécanique des Solides (URA-CNRS 861), S.P.2M.I, Bd. 3, Téléport 2, BP 179, 86960 Futuroscope Cedex, France
G. Bessonnet
Affiliation:
Université de Poitiers, Laboratoire de Mécanique des Solides (URA-CNRS 861), S.P.2M.I, Bd. 3, Téléport 2, BP 179, 86960 Futuroscope Cedex, France

Abstract

A path planning method is presented based on non-autonomous dynamic modeling of open-loops in articulated systems. It is assumed that one part of the mechanical system is submitted to specified motions laws, while movements of the complementary part are free. Thus, motion optimization is related to free joint movements but it is achieved on the basis of the dynamic model of the whole mechanical system. This approach introduces a non-autonomous state equation of a special type in the sense that it can not only depend on the running time but also on the unknown travelling time. The cost function to be minimized involves the travelling time and the actuating inputs. Optimization is achieved by applying the Pontryagin Maximum Principle which yields a new optimality condition concerning the travelling time dependency of the stated problem. Two simulation examples are presented. The first one shows how the developed technique makes possible both the reducing and mastering the dynamic complexity of a four degrees of freedom-vertical manipulator. Set at four degrees of freedom, the second one deals with a redundant planar manipulator characterized by a mobile base that is submitted to a specified driving motion.

Type
Research Article
Copyright
© 1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)