Dynamic modelling and optimal time‐energy off‐line programming of mobile robots: A cybernetic problem

Abstract

In this paper the problem of the dynamic optimal time‐energy Off‐Line programming of an autonomous mobile robot in a crowded environment is considered. First, kinematic model and planning are presented. Then a dynamic model based on Euler‐Lagrange formalism is developed and a mobility estimation function of the robot is considered. This dynamic estimation of the robot mobility takes into account of the velocity and the orientation of the robot. Then the scene structuration and a path finder algorithm are developed. After, the optimal dynamic off‐line programming is formulated as a nonlinear programming problem under nonlinear equality and inequality constraints. The Discrete Augmented Lagrangian (DAL) is used to obtain the optimal trajectograhy. We develop an extended DAL to DALAP, DALAdaptive Penalty. RoboSim 1.0 simulator is developed to perform kinematic and DALAP based algorithms on a large class of mobile robots optimal time‐energy off‐line programming. A comparative study with kinematic planning is considered. It is shown that the performance of the dynamic optimal time‐energy control and off‐line programming is much better than kinematic and heuristic based schemes. This strategy of trajectory planning was implemented on the case study of the SARA mobile robot model.

Citation

Khoukhi, A. (2002), "Dynamic modelling and optimal time‐energy off‐line programming of mobile robots: A cybernetic problem", Kybernetes, Vol. 31 No. 5, pp. 731-765. https://doi.org/10.1108/03684920210428254