Pith. sign in

REVIEW 1 cited by

Joint Stabilization and Regret Minimization through Switching in Over-Actuated Systems (extended version)

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 2105.14709 v2 pith:VRM24WPZ submitted 2021-05-31 eess.SY cs.SY

Joint Stabilization and Regret Minimization through Switching in Over-Actuated Systems (extended version)

classification eess.SY cs.SY
keywords regretsystemsalgorithmcontrollingdynamicalminimizationover-actuatedstabilization
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Adaptively controlling and minimizing regret in unknown dynamical systems while controlling the growth of the system state is crucial in real-world applications. In this work, we study the problem of stabilization and regret minimization of linear over-actuated dynamical systems. We propose an optimism-based algorithm that leverages possibility of switching between actuating modes in order to alleviate state explosion during initial time steps. We theoretically study the rate at which our algorithm learns a stabilizing controller and prove that it achieves a regret upper bound of $\mathcal{O}(\sqrt{T})$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Regret-Guaranteed Safe Switching: LQR Setting with Unknown Dynamics

    eess.SY 2026-06 unverdicted novelty 6.0

    Proposes a regret-minimizing algorithm for safe mode switching in unknown-dynamics LQR that achieves expected regret O(|M|^{1/4} n_s^{3/4} + n_m) under infinite mode visits.