Pith. sign in

REVIEW 1 cited by

Convergent iLQR for Safe Trajectory Planning and Control of Legged Robots

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.00346 v3 pith:ST3SKOJR submitted 2023-04-01 cs.RO

classification cs.RO
keywords trajectoryperturbationshybridsystemcontrolconvergentdisturbancesdomains
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In order to perform highly dynamic and agile maneuvers, legged robots typically spend time in underactuated domains (e.g. with feet off the ground) where the system has limited command of its acceleration and a constrained amount of time before transitioning to a new domain (e.g. foot touchdown). Meanwhile, these transitions can instantaneously change the system's state, possibly causing perturbations to be mapped arbitrarily far away from the target trajectory. These properties make it difficult for local feedback controllers to effectively recover from disturbances as the system evolves through underactuated domains and hybrid impact events. To address this, we utilize the fundamental solution matrix that characterizes the evolution of perturbations through a hybrid trajectory and its 2-norm, which represents the worst-case growth of perturbations. In this paper, the worst-case perturbation analysis is used to explicitly reason about the tracking performance of a hybrid trajectory and is incorporated in an iLQR framework to optimize a trajectory while taking into account the closed-loop convergence of the trajectory under an LQR tracking controller. The generated convergent trajectories recover more effectively from perturbations, are more robust to large disturbances, and use less feedback control effort than trajectories generated with traditional methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Continual Learning and Lifting of Koopman Dynamics for Linear Control of Legged Robots

    cs.RO 2024-11 conditional novelty 6.0 of 10

    An incremental Koopman algorithm that grows both dataset and latent dimension enables linear-MPC walking on five simulated legged robots, but its monotonic convergence theorem assumes the learned embedding is already ...

Pith tools