Abstract

Biped robots possess higher capabilities than other mobile robots for moving on uneven environments. However, due to natural postural instability of these robots, their motion planning and control become a more important and challenging task. This article presents a Cartesian approach for gait planning and control of biped robots without the need to use the inverse kinematics and the joint space trajectories, thus the proposed approach could substantially reduce the processing time in both simulation studies and online implementations. It is based on constraining four main points of the robot in Cartesian space. This approach exploits the concept of Transpose Jacobian control as a virtual spring and damper between each of these points and the corresponding desired trajectory, which leads to overcome the redundancy problem. These four points include the tip of right and left foot, the hip joint, and the total center of mass (CM). Furthermore, in controlling biped robots based on desired trajectories in the task space, the system may track the desired trajectory while the knee is broken. This problem is solved here using a PD controller which will be called the Knee Stopper. Similarly, another PD controller is proposed as the Trunk Stopper to limit the trunk motion. Obtained simulation results show that the proposed Cartesian approach can be successfully used in tracking desired trajectories on various surfaces with lower computational effort.

Full Text
Paper version not known

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 call

Disclaimer: 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.