Polynomial trajectory algorithm for a biped robot
Erik Cuevas, Daniel Zaldivar, Marco Perez, Marte Ramirez

TL;DR
This paper introduces a polynomial trajectory algorithm for biped robots that enables smooth walking phase transitions, reducing falls and improving real-time trajectory generation across varied terrains.
Contribution
The paper presents a novel cubic Hermitian polynomial interpolation method for biped robot walking that enhances stability and real-time performance compared to existing approaches.
Findings
Successfully tested on a 10 DOF biped robot
Outperforms state-of-the-art methods in diverse terrains
Enables real-time trajectory generation with limited computing resources
Abstract
Building trajectories for biped robot walking is a complex task considering all degrees of freedom (DOFs) commonly bound within the mechanical structure. A typical problem for such robots is the instability produced by violent transitions between walking phases in particular when a swinging leg impacts the surface. Although extensive research on novel efficient walking algorithms has been conducted, falls commonly appear as the walking speed increases or as the terrain condition changes. This paper presents a polynomial trajectory generation algorithm (PTA) to implement the walking on biped robots following the cubic Hermitian polynomial interpolation between initial and final conditions. The proposed algorithm allows smooth transitions between walking phases, significantly reducing the possibility of falling. The algorithm has been successfully tested by generating walking trajectories…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
