Papers for

robotics control teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Linear covariance control improves risk-sensitive system steering

Linear Exponential Quadratic Gaussian Covariance Steering

Abstract: We formulate and analyze the linear exponential quadratic Gaussian (LEQG) covariance steering problem in continuous time over a given deadline (finite time horizon). The solution for this problem can be seen as a risk-sensitive Schrödinger bridge between Gaussian endpoints in the linear quadratic setting. Unlike the risk-neutral case, the LEQG covariance steering controller--still a linear state feedback--can no longer be written in closed form. We show that the optimal controller is parameterized by a symmetric matrix solving an algebraic equation that encodes the implicit dependence on the risk-sensitivity parameter. We explain how the structure of this optimal controller significantly generalizes the existing results for the risk-neutral case. Building on these results, for the matched noise and input channel case, we prove the existence-uniqueness of solution for the LEQG covariance steering problem in the neighborhood of the known risk-neutral optimal solution. We give an illustrative numerical example.

Fri 11 SeptArtificial IntelligenceMachine Learning
The gist
Controlling a system's uncertain behavior over time is important in many applications. This paper looks at steering the system so that its randomness matches desired end conditions while accounting for risk sensitivity, meaning the controller is cautious about uncertainties. The authors provide a new mathematical way to find the best controller that adapts to risk concerns, extending previous simpler cases that ignored risk. They prove the solution exists near known risk-neutral solutions and show an example of how it works.
Open 2609.12463v1

Learning speeds up distributed control for vehicle path tracking

A Data-Driven Distributed Control Scheme: Learning Multi-Objective Agent-Based MPC for Path-Tracking

Abstract: Agent-based model predictive control (AMPC) has recently been proposed for vehicle systems with various controllers, such as differential braking and torque vectoring, where controllers are regarded as distributed agents contributing to the same objective. However, this scheme is challenging in handling multiple conflicting objectives with coupled agents. A common approach for such tasks is the integrated MPC, where all objectives and agents are stacked together in one optimization. Nevertheless, as more agents and objectives are involved, the integrated MPC will face challenges like computational burdens and maintenance difficulties in practice. To this end, this paper proposes a learning multi-objective AMPC that can improve design flexibility and computing efficiency. First, under the assumption of information exchange, a multi-objective AMPC tailored from the alternating direction method of multipliers (ADMM) is proposed to decouple the system and achieve the same performance as the integrated scheme iteratively. Second, a learning-based method for initializing iterations is proposed to accelerate convergence. In addition, a data management method is proposed for real-time efficiency, and an authentication module is designed for learning reliability. We compare the proposed scheme against the integrated scheme via a combined path-tracking simulation for autonomous vehicles with various controllers. The proposed scheme achieves the same control performance as the integrated one while reducing the computational time by 43.5%. Furthermore, the learning-based method saves 88.6% more computational time than without learning, making it suitable for real-time implementation.

Thu 10 SeptRobotics
The gist
Controlling a vehicle with many cooperating parts that have different goals is hard because it takes a lot of computing power. The authors developed a method that breaks the problem into smaller pieces solved by different agents, which work together by exchanging information. They used learning to help the system start with a good guess, making it faster to find the best control actions. Their approach performs just as well as the traditional method but uses much less computation, making it more practical for real-time use.
Open 2609.12142v1

Small-step belief updates optimize distribution changes on probability simplex

Physics of Information Geometry - Part II: Small-Step Active Inference on the Probability Simplex

Abstract: This paper is the second in a two-part investigation of the physics of information geometry. While Part I develops a physical foundation for distributional motion on the probability simplex, the present paper studies how that framework manifests in active inference. The treatment is fully self-contained and does not require familiarity with Part I. We focus in particular on active inference through small distributional steps and the geometric structure induced by such local motion. Starting from an initial distribution, an agent evolves its belief state toward a final target distribution through a sequence of constrained updates. We define a relative free energy functional with respect to the preferred distribution and extend it to a relative potential energy analogous to the Helmholtz/Gibbs free-energy decomposition. The evolution is subject to a per-step kinetic constraint expressed through the Kullback-Leibler (KL) divergence between consecutive distributions, which serves as a discrete kinetic energy on the probability simplex. Using the information-geometric Pythagorean theorem on KL balls, we show that sufficiently small local moves dominate large direct jumps, and that greedy maximization of free-energy reduction is globally optimal under the kinetic constraint. This leads to a sequential variational principle in which the optimal trajectory minimizes the associated Lagrangian of the optimization problem. Similar to classical mechanics, the Lagrangian takes on the form as the difference between the kinetic and potential terms, establishing a least-action principle for distributional motion on the simplex. The resulting optimal update admits a closed form as an exponentially tilted version of the current distribution toward the preferred distribution, parametrized by an inverse-temperature-like multiplier. We further extend the framework to incorporate state-dependent geodesic...

Thu 10 SeptInformation Theory
The gist
This paper studies how an agent can update its beliefs step-by-step when changing from one probability distribution to another. The authors treat these updates like movements on a geometric surface shaped by probabilities. They show that making many small, careful updates is better than jumping directly to the target belief. The work uses ideas similar to physics, like energies and paths of least resistance, to describe these belief changes. This method results in a clear formula for making the best small update toward a goal belief.
Open 2609.11187v1

Autonomous driving improves safety and efficiency at busy intersections

A Risk-Sensitive and Uncertainty-Aware Decision-Making and Control Framework for Safe and Robust Autonomous Driving

Abstract: Reinforcement learning (RL) has demonstrated considerable potential for autonomous driving decision-making. However, its deployment in urban autonomous driving, particularly at highly interactive unsignalized intersections, remains challenging, as learned policies may struggle to maintain both safety and robust decision-making in complex traffic situations. Conventional safety-filtering approaches typically employ fixed conservative constraints, which may improve safety at the cost of excessive intervention and degraded traffic efficiency. To address these limitations, we propose a Risk-sensitive and Uncertainty-aware Decision-making and Control (RUDC) framework for safe and robust autonomous driving. RUDC couples risk-sensitive distributional RL with ensemble-based policy uncertainty quantification, jointly accounting for tail risks in return distributions and uncertainty in learned policies. An uncertainty-aware high-order control barrier function (HOCBF)-based safety correction mechanism adaptively adjusts constraint strictness according to policy uncertainty, while a learnable residual predictor compensates for CBF model mismatches and discretization errors. Extensive simulations at unsignalized intersections demonstrate that RUDC achieves a favorable balance among safety, efficiency, and robustness, outperforming representative safe RL baselines under both nominal and challenging OOD and long-tail scenarios while satisfying real-time requirements.

Wed 9 SeptRobotics
The gist
Autonomous cars need to make safe decisions even in tricky traffic spots like busy intersections without traffic lights. The authors created a system that helps self-driving cars better understand risks and how sure they are about decisions. This system adjusts safety rules depending on uncertainty and fixes model errors to keep driving smooth and safe. Tests in simulated intersections showed the system keeps cars safer and more efficient than some earlier methods.
Open 2609.09650v1

Humanoid robot maintains stable walking despite missing sensor data

RoboDreamer: Anticipatory Humanoid Locomotion with Predictive State-Space Models

Abstract: Humanoid locomotion requires control policies that remain stable under imperfect sensing while exploiting temporal context for consistent motion. We present RoboDreamer, a two-stage teacher--student framework that combines next-observation consistency with randomized continuous temporal masking. A teacher is first trained on clean observations, and a student is then distilled under masked recent observations, encouraging the policy to infer missing current information from history. At inference, the same masking interface is reused for implicit closed-loop action refinement and optional multi-step action chunking. Mamba is used as the temporal backbone, while matched ablations show that masking/distillation provides a substantial part of the gain and Mamba contributes additional tracking improvements with real-time latency. Experiments in IsaacLab, MuJoCo, and on a Unitree G1 demonstrate robust motion tracking under observation masking and successful real-world deployment.

Mon 7 SeptRobotics
The gist
Robotic walking is tricky because sensors can sometimes miss important details, making the robot stumble. The authors developed RoboDreamer, a two-step training method where a 'teacher' robot learns from perfect data and a 'student' robot learns to fill in gaps using past information. This helps the robot keep walking smoothly even when its current sensor data is incomplete or noisy. The method was tested both in computer simulations and on a real robot, showing it works well in practice.
Open 2609.07096v1