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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
