The Indirect Method for Generating Libraries of Optimal Periodic Trajectories and Its Application to Economical Bipedal Walking
Maximilian Raff, Kathrin Fla{\ss}kamp, C. David Remy

TL;DR
This paper advances trajectory optimization in legged robotics by formalizing an indirect method that improves accuracy and systematically generates gait libraries, demonstrated on complex robots like RABBIT.
Contribution
It introduces a formalized indirect trajectory optimization approach with numerical continuation, enhancing accuracy and efficiency in gait library development for legged robots.
Findings
Indirect method yields more accurate optimal gaits than direct method.
Numerical continuation effectively addresses convergence issues in indirect shooting.
Method successfully applied to complex robots like RABBIT with multiple states and inputs.
Abstract
Trajectory optimization is an essential tool for generating efficient, dynamically consistent gaits in legged locomotion. This paper explores the indirect method of trajectory optimization, emphasizing its application in creating optimal periodic gaits for legged systems and contrasting it with the more common direct method. While the direct method provides flexibility in implementation, it is limited by its need for an input space parameterization. In contrast, the indirect method improves accuracy by computing the control input from states and costates obtained along the optimal trajectory. In this work, we tackle the convergence challenges associated with indirect shooting methods by utilizing numerical continuation methods. This is particularly useful for the systematic development of gait libraries. Our contributions include: (1) the formalization of a general periodic trajectory…
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.
