The paper describes solutions for linear control systems on Lie groups.
problem Linear control systems on Lie groups.
method Solution given by the product of exponentials of invariant systems and drift fields.
result Explicit solutions provided for linear control systems in low dimensions.
New insights into cascade feedback linearization of control systems.
problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.
New method controls linear systems with partial info and disturbances.
problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.
The paper explores when linear system identification is hard or easy, especially for under-actuated systems.
problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.
Study absolute equivalence for Pfaffian systems, applying to control systems.
problem Absolute equivalence of Pfaffian systems with specific independence conditions.
method Structural results for Pfaffian systems of corank 3, applied to control systems.
result Dynamic feedback linearization of control systems with 2 inputs.
Learning to control linear systems is statistically hard, especially for underactuated systems.
problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.
AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.
problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.
New algorithm learns linear dynamical systems from measurements.
problem Learning system dynamics from linear measurements efficiently and accurately.
method Method of moments estimator to directly estimate Markov parameters.
result First polynomial time algorithm for learning linear dynamical systems.
Paper develops PAC-Bayes bounds for unknown linear systems.
problem Learning controllers for unknown stochastic linear discrete-time systems.
method PAC-Bayes framework for data-dependent high probability bounds.
result Proposes efficient learning algorithms with theoretical guarantees.
New method controls linear systems with adversarial disturbances.
problem Controlling linear dynamical systems under adversarial conditions.
method Novel convex relaxation using spectral filters from Hankel matrix eigenvectors.
result Polylogarithmic running time improvement over prior methods.
In this work, we propose a robust approach to design distributed controllers for unknown-but-sparse linear and time-invariant systems. By leveraging modern techniques in distributed controller synthesis and structured linear inverse problems as applied to system identification, we show that near-optimal distributed con…
Paper shows how to linearize flat systems with two inputs.
problem Linearizing flat nonlinear control systems with two inputs.
method Using prolongations of a control, the system can be made static feedback linearizable.
result A tracking control can be designed without requiring measurements of a generalized Brunovsky state.
LqgOpt learns optimal control in unknown LQG systems with minimal regret.
problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) for LQG systems. The study sets limits on how well systems can be controlled adaptively.
problem Learning to control unknown linear Gaussian systems with quadratic costs.
method Combining ideas from experiment design, estimation theory, and perturbation bounds of information matrices.
result Regret lower bounds of the order of T \sqrt{T} T in the time horizon T T T accurately capture control-theoretic parameters. Geometric framework for dynamic feedback linearization of control systems with symmetry.
problem Dynamic feedback linearization of control systems with symmetry.
method Geometric framework based on Lie symmetry, systematic procedure for all smooth, generic system trajectories.
result Sufficient condition for dynamic feedback linearizability obtained.
Efficient algorithm controls unknown systems with adversarial perturbations.
problem Controlling unknown linear systems with adversarial perturbations and convex losses.
method Measures regret against an optimal linear policy, provides efficient algorithm with sublinear regret bound.
result First efficient algorithm with sublinear regret bound of T^{2/3}.
Develops a control framework for systemic risk under uncertainty.
problem Systemic risk under model uncertainty.
method Linear-quadratic mean-field control framework with viscosity solutions and verification theorems.
result Explicit feedback controls derived from a coupled Riccati system, preserving analytical tractability.
Paper tackles online control of linear systems with unbounded noise.
problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) high-probability regret under unbounded noise, and established O ( m p o l y ( log T ) ) O({
m poly} (\log T)) O ( m p o l y ( log T )) regret bound for strongly convex costs and sub-Gaussian noise. result Achieved i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) high-probability regret under unbounded noise, and O ( m p o l y ( log T ) ) O({
m poly} (\log T)) O ( m p o l y ( log T )) regret bound for specific noise and cost conditions. The paper studies symmetry reduction of control systems and its implications for feedback linearization.
problem Understanding symmetry reduction and its effects on feedback linearizability of control systems.
method Generalizing the notion of transversality of Lie group actions, analyzing the geometry of invariant distributions, and extending the S-G-S test.
result Classification of SFL quotients based on geometric properties of the control system and symmetry group.
Develops a new approach to optimal control of stochastic systems.
problem Optimal control of stochastic nonlinear dynamical systems is challenging.
method Formulates optimal control as input estimation, using probabilistic inference and Expectation Maximization.
result Extracts time-varying linear Gaussian feedback controllers from the joint state-action distribution.
Efficient algorithm for unknown linear systems with convex costs.
problem Controlling an unknown linear system with stochastic convex costs.
method Optimism in the Face of Uncertainty paradigm.
result Achieves optimal T \sqrt{T} T regret-rate. Survey on statistical learning theory for control, focusing on linear systems.
problem Applying machine learning techniques to control systems, especially linear ones.
method Adapting tools from modern high-dimensional statistics and learning theory.
result Recent advances in statistical learning theory for control, particularly for linear systems.
Efficiently controls unknown linear systems with black-box interactions.
problem Controlling an unknown linear dynamical system from black-box interactions.
method First efficient algorithm with sublinear regret, using robust system identification.
result Resolves open problem on stochastic LQR and black-box LQR control.
Modern automation systems rely on closed loop control, wherein a controller interacts with a controlled process, based on observations. These systems are increasingly complex, yet most controllers are linear Proportional-Integral-Derivative (PID) controllers. PID controllers perform well on linear and near-linear syste…
New controller reduces regret in non-stochastic control with adversarial perturbations.
problem Non-stochastic control with adversarial perturbations and partially observed states.
method Denoised observations and online gradient descent.
result Sublinear regret bounds, optimal for known and unknown systems.
Optimal control in changing systems without strong convexity assumptions.
problem Adversarial changes in convex costs for unknown linear systems.
method Non-convex lower confidence bounds and computationally-efficient regret minimization.
result Achieves T \smash{\sqrt{T}} T -regret rate, optimal compared to best stabilizing controller. Safe RL in linear systems achieves T \sqrt{T} T -regret.
problem Efficiently learning in safety-constrained online reinforcement learning.
method Study of linear quadratic regulator with safety constraints.
result First safe algorithm with i l d e O T ( T ) ilde{O}_T(\sqrt{T}) i l d e O T ( T ) -regret. This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of systems includes mechanical systems subject to holonomic and nonholonomic const…
Modeling financial systemic risk with optimal control theory for stability.
problem Analyzing and stabilizing systemic risk in interconnected financial entities.
method Developed a theoretical model using optimal control theory, including steps for synthesizing stabilizing controllers.
result The model ensures that the H ∞ H^{\infty} H ∞ norms of the mappings from disturbance to output are less than a predefined constant, stabilizing the system. New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.
problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.
Study optimizes resource allocation in noisy systems for better control.
problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.
Study shows certainty equivalent policy minimizes regret in continuous-time systems.
problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.
In this paper, we put the issue of dynamic equivalence of control systems in the context of pullbacks of coframings on infinite jet bundles over the state manifolds. While much attention has been given to differentially flat systems, i.e. systems dynamically equivalent to linear control systems, the advantage of this a…
New algorithm controls linear systems with bandit feedback, achieving optimal regret.
problem Controlling linear systems with bandit feedback under adversarial costs.
method Developed a new algorithm for linear control with memory optimization technique.
result Achieved optimal regret growth proportional to square root of time horizon.
Test for linearizing 2-input systems with 2D feedback.
problem Linearizability of two-input systems by feedback.
method Algorithmic test for 2D endogenous feedback.
result Systematic derivation of flat outputs.
This work studies the contraction coefficients of Schrödinger bridge problems in linear systems.
problem Optimally controlling the evolution of a system's state density over time.
method Analyzes and improves the convergence rates of dynamic Schrödinger systems via geometric and control-theoretic interpretations.
result New insights into improving computation of worst-case contraction coefficients by preconditioning.
The paper proves that linearization along trajectories preserves flatness in discrete-time systems.
problem The relation between nonlinear and linear time-varying systems.
method Linearization along trajectories of a flat discrete-time system.
result The linearized system is flat, and a flat output can be derived.
The aim of this paper is to prove that a control affine system on a manifold is equivalent by diffeomorphism to a linear system on a Lie group or a homogeneous space if and only the vector fields of the system are complete and generate a finite dimensional Lie algebra. A vector field on a connected Lie group is linear …
Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.
problem Bounding the reachable set of LTI systems controlled by TLL NN controllers.
method Polynomial-time computation of exact one-step reachable set and tight bounding box via two methods.
result Exact reachability computation in polynomial time for TLL NN controllers.
New bounds for adaptive control in high dimensions without fixed state space.
problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.
New framework for online control in evolving populations.
problem Control of evolving populations in real-world conditions.
method Online control framework for linear and non-linear dynamical systems.
result Near-optimal regret bounds for gradient-based controllers.
New algorithm reduces control error in systems with changing dynamics.
problem Online control of systems with time-varying linear dynamics.
method Introduces adaptive regret metric and a novel meta-algorithm.
result First adaptive regret bound for online convex optimization with memory.
Algorithm reduces regret in partially observable systems by learning dynamics and using optimistic control.
problem Minimizing regret in partially observable linear quadratic control systems with unknown dynamics.
method ExpCommit algorithm that learns model parameters and uses optimism in uncertainty.
result End-to-end sublinear regret upper bound of O ~ ( T 2 / 3 ) \tilde{\mathcal{O}}(T^{2/3}) O ~ ( T 2/3 ) for ExpCommit. New method handles robust and adaptive control of linear systems with non-convex costs.
problem Robust and adaptive control of linear systems with unknown parameters.
method Combining non-asymptotic linear regression, interval prediction, and tree-based planning.
result First end-to-end suboptimality analysis for robust and adaptive MPC with non-convex costs.
Paper formulates mutual information optimal control for discrete-time systems.
problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.
Breaks down complex nonlinear dynamics into simpler components.
problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.
Neural ODEs control graph dynamics with low energy feedback.
problem Controlling complex dynamical systems on graphs.
method Neural Ordinary Differential Equation Control (NODEC) framework.
result NODEC learns low-energy control signals for graph dynamical systems.
Algorithm reduces control regret for unknown systems.
problem Minimizing control regret for unknown linear systems.
method Novel geometric exploration strategy and polynomial-time algorithms.
result First polynomial-time algorithms with optimal regret bounds.