Volume 34, Issue 3 (IJIEPR 2023)                   IJIEPR 2023, 34(3): 164-184 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Fadhil Al-Maliki A, Habibnejad Korayem M. Trajectory optimization of Biped Robots with Maximum Load Carrying Capacities: Iterative Linear Programming Approach. IJIEPR 2023; 34 (3) :164-184
URL: http://ijiepr.iust.ac.ir/article-1-1797-en.html
1- Iran university of science and Technology
2- Iran University of science and technology , hkorayem@iust.ac.ir
Abstract:   (938 Views)
A computational approach is presented to obtain the optimal path of the end-effector for the 10 DOF bipedal robot to increase its load carrying capacity for a given task from point to point. The synthesizing optimal trajectories problem of a robot is formulated as a problem of trajectory optimization. An Iterative Linear Programming method (ILP) is developed for finding a numerical solution for this nonlinear trajectory. This method is used for determining the maximum dynamic load carrying capacity of bipedal robot walking subjected to torque actuators, stability and jerk limits constraints. First, the Lagrangian dynamic equation should be written to be suitable for the load dynamics which together with kinematic equations are substantial for determining the optimal trajectory. After that, a representation of the state space of the dynamic equations is introduced also the linearized dynamic equations are needed to obtain the numerical solution of the trajectory optimization followed by formulation for the optimal trajectory problem with a maximum load. Finally, the method of ILP and the computational aspect is applied to solve the problem of trajectory synthesis and determine the dynamic load carrying capacity (DLCC) to the bipedal robot for each of the linear and circular path. By implementing on an experimental biped robot, the simulation results were validated. 
Full-Text [PDF 1407 kb]   (363 Downloads)    
Type of Study: Research | Subject: Optimization Techniques
Received: 2023/05/15 | Accepted: 2023/07/26 | Published: 2023/09/2

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.