SearcharxivSearch

arXiv subjects

Alexander Katriniok

Publications and source records attributed to Alexander Katriniok.

16 recordsLinked to original sources

The Separation Principle and the Dual-Certainty Equivalence Gap in Model Predictive Control

Dual control addresses the trade-off between exploitation and exploration, where control inputs both regulate the system and generate informative data for estimation and identification. For certain problem classes, control and estimation can be designed independently without loss of optimality, a property known as the separation principle. However, in stochastic control problems with model uncertainty and constraints, this principle generally breaks down, and introduces the need for dual control. In this paper, we propose an information-weighted dual model predictive control (MPC) formulation and introduce metrics that quantify the dependence of the MPC policy on the uncertainty. We focus on parametric uncertainty in linear systems with Gaussian noise, though the metrics can be applied more broadly. Numerical results show that the dependence of the MPC policy on the posterior covariance is largest under high uncertainty and vanishes as the posterior covariance contracts, providing empirical evidence of the dual effect in closed loop. Moreover, the dual controller improves regulation performance and model accuracy compared to certainty-equivalent MPC.

math.OC

Dual MPC for Active Learning of Nonparametric Uncertainties

This manuscript presents a dual model predictive controller (MPC) that balances the two objectives of dual control, namely, system identification and control. In particular, we propose a Gaussian process (GP)-based MPC that uses the posterior GP covariance for active learning. The dual MPC can steer the system towards states with high covariance, or to the setpoint, thereby balancing system identification and control performance (exploration vs. exploitation). We establish robust constraint satisfaction of the novel dual MPC through a contingency plan. We demonstrate the dual MPC in a numerical study of a nonlinear system with nonparametric uncertainties.

math.OC

Verification and Synthesis of Discrete-Time Control Barrier Functions

Discrete-time Control Barrier Functions (DTCBFs) have recently attracted interest for guaranteeing safety and synthesizing safe controllers for discrete-time dynamical systems. This paper addresses the open challenges of verifying candidate DTCBFs and synthesizing DTCBFs for general nonlinear discrete-time systems with input constraints and arbitrary safe sets. In particular, we propose a branch-and-bound method, inspired by the $α$BB algorithm, for the verification of candidate DTCBFs in both cases, whether a corresponding control policy is known or unknown. We prove that this method, in a finite number of iterations, either verifies a given candidate function as a valid DTCBF or falsifies it by providing a counterexample (within predefined tolerances). As a second main contribution, we propose a novel bilevel optimization approach to synthesize a DTCBF and a corresponding control policy in finite time. This involves determining the unknown coefficients of a parameterized DTCBF and a parameterized control policy. Furthermore, we introduce various strategies to reduce the computational burden of the bilevel approach. We also demonstrate our methods using numerical case studies.

math.OC

Counterexample-Guided Synthesis of Robust Discrete-Time Control Barrier Functions

Learning-based methods have gained popularity for training candidate Control Barrier Functions (CBFs) to satisfy the CBF conditions on a finite set of sampled states. However, since the CBF is unknown a priori, it is unclear which sampled states belong to its zero-superlevel set and must satisfy the CBF conditions, and which ones lie outside it. Existing approaches define a set in which all sampled states are required to satisfy the CBF conditions, thus introducing conservatism. In this paper, we address this issue for robust discrete-time CBFs (R-DTCBFs). Furthermore, we propose a class of R-DTCBFs that can be used in an online optimization problem to synthesize safe controllers for general discrete-time systems with input constraints and bounded disturbances. To train such an R-DTCBF that is valid not only on sampled states but also across the entire region, we employ a verification algorithm iteratively in a counterexample-guided approach. We apply the proposed method to numerical case studies.

math.OC

A Contingency Model Predictive Control Framework for Safe Learning

This research introduces a multi-horizon contingency model predictive control (CMPC) framework in which classes of robust MPC (RMPC) algorithms are combined with classes of learning-based MPC (LB-MPC) algorithms to enable safe learning. We prove that the CMPC framework inherits the robust recursive feasibility properties of the underlying RMPC scheme, thereby ensuring safety of the CMPC in the sense of constraint satisfaction. The CMPC leverages the LB-MPC to safely learn the unmodeled dynamics to reduce conservatism and improve performance compared to standalone RMPC schemes, which are conservative in nature. In addition, we present an implementation of the CMPC framework that combines a particular RMPC and a Gaussian Process MPC scheme. A simulation study on automated lane merging demonstrates the advantages of our general CMPC framework.

math.OC

Synthesis of Discrete-time Control Barrier Functions for Polynomial Systems Based on Sum-of-Squares Programming

Discrete-time Control Barrier Functions (DTCBFs) are commonly utilized in the literature as a powerful tool for synthesizing control policies that guarantee safety of discrete-time dynamical systems. However, the systematic synthesis of DTCBFs in a computationally efficient way is at present an important open problem. This article first proposes a novel alternating-descent approach based on Sum-of-Squares programming to synthesize quadratic DTCBFs and corresponding polynomial control policies for discrete-time control-affine polynomial systems with input constraints and semi-algebraic safe sets. Subsequently, two distinct approaches are introduced to extend the proposed method to the synthesis of higher-degree polynomial DTCBFs. To demonstrate its efficacy, we apply the proposed method to numerical case studies.

math.OC

Optimization-based Verification of Discrete-time Control Barrier Functions: A Branch-and-Bound Approach

Discrete-time Control Barrier Functions (DTCBFs) form a powerful control theoretic tool to guarantee safety and synthesize safe controllers for discrete-time dynamical systems. In this paper, we provide an optimization-based algorithm, inspired by the $α$BB algorithm, for the verification of a candidate DTCBF, i.e., either verifying a given candidate function as a valid DTCBF or falsifying it by providing a counterexample for a general nonlinear discrete-time system with input constraints. This method is applicable whether a corresponding control policy is known or unknown. We apply our method to a numerical case study to illustrate its efficacy.

math.OC

Discrete-time Control Barrier Functions for Guaranteed Recursive Feasibility in Nonlinear MPC: An Application to Lane Merging

In this paper, we present conditions under which the terminal ingredients, defined by discrete-time control barrier function (DTCBF) certificates, guarantee recursive feasibility in nonlinear MPC. Further, we introduce the notion of quasi-DTCBF (qDTCBF) certificates. Compared to DTCBFs, qDTCBF conditions can be satisfied with tighter control input bounds, which is highly advantageous if only limited actuation is possible. Both certificates encourage an earlier reaction of the control system and result in a lower cumulative MPC cost. The methodology is applied to a lane merging problem in automated driving, in which DTCBF and qDTCBF certificates subject to input constraints form the terminal ingredients to guarantee recursive feasibility of the nonlinear MPC scheme. A simulation study demonstrates the efficacy of the concept.

math.OC

Safe, Learning-Based MPC for Highway Driving under Lane-Change Uncertainty: A Distributionally Robust Approach

We present a case study applying learning-based distributionally robust model predictive control to highway motion planning under stochastic uncertainty of the lane change behavior of surrounding road users. The dynamics of road users are modelled using Markov jump systems, in which the switching variable describes the desired lane of the vehicle under consideration and the continuous state describes the pose and velocity of the vehicles. We assume the switching probabilities of the underlying Markov chain to be unknown. As the vehicle is observed and thus, samples from the Markov chain are drawn, the transition probabilities are estimated along with an ambiguity set which accounts for misestimations of these probabilities. Correspondingly, a distributionally robust optimal control problem is formulated over a scenario tree, and solved in receding horizon. As a result, a motion planning procedure is obtained which through observation of the target vehicle gradually becomes less conservative while avoiding overconfidence in estimates obtained from small sample sizes. We present an extensive numerical case study, comparing the effects of several different design aspects on the controller performance and safety.

eess.SY

Control-sharing Control Barrier Functions for Intersection Automation under Input Constraints

This contribution introduces a centralized input constrained optimal control framework based on multiple control barrier functions (CBFs) to coordinate connected and automated agents at intersections. For collision avoidance, we propose a novel CBF which is safe by construction. The given control scheme provides provable guarantees that collision avoidance CBFs and CBFs to constrain the agents' velocity are jointly feasible (referred to as control-sharing property) subject to input constraints. A simulation study finally provides evidence that the proposed control scheme is safe.

math.OC

Fully Distributed Model Predictive Control of Connected Automated Vehicles in Intersections: Theory and Vehicle Experiments

We propose a fully distributed control system architecture, amenable to in-vehicle implementation, that aims to safely coordinate connected and automated vehicles (CAVs) at road intersections. For control purposes, we build upon a fully distributed model predictive control approach, in which the agents solve a nonconvex optimal control problem (OCP) locally and synchronously, and exchange their optimized trajectories via vehicle-to-vehicle (V2V) communication. To accommodate a fast solution of the nonconvex OCPs, we apply the penalty convex-concave procedure which solves a convexified version of the original OCP. For experimental evaluation, we complement the predictive controller with a localization layer, being in charge of self-localization, and an estimator, which determines joint collision points with other agents. Experimental tests reveal the efficacy of the proposed control system architecture.

math.OC

Real-Time Distributed Automation Of Road Intersections

The topic of this paper is the design of a fully distributed and real-time capable control scheme for the automation of road intersections. State of the art Vehicle-to-Vehicle (V2V) communication technology is adopted. Vehicles distributively negotiate crossing priorities by a Consensus-Based Auction Algorithm (CBAA-M). Then, each agent solves a nonlinear Model Predictive Control (MPC) problem that computes the optimal trajectory avoiding collisions with higher priority vehicles and deciding the crossing order. The scheme is shown to be real-time capable and able to respond to sudden priority changes, e.g. if a vehicle gets an emergency call. Simulations reinforce theoretical results.

eess.SY

Nonconvex Consensus ADMM for Cooperative Lane Change Maneuvers of Connected Automated Vehicles

Connected and automated vehicles (CAVs) offer huge potential to improve the performance of automated vehicles (AVs) without communication capabilities, especially in situations when the vehicles (or agents) need to be cooperative to accomplish their maneuver. Lane change maneuvers in dense traffic, e.g., are very challenging for non-connected AVs. To alleviate this problem, we propose a holistic distributed lane change control scheme for CAVs which relies on vehicle-to-vehicle communication. The originally centralized optimal control problem is embedded into a consensus-based Alternating Direction Method of Multipliers framework to solve it in a distributed receding horizon fashion. Although agent dynamics render the underlying optimal control problem nonconvex, we propose a problem reformulation that allows to derive convergence guarantees. In the distributed setting, every agent needs to solve a nonlinear program (NLP) locally. To obtain a real-time solution of the local NLPs, we utilize the optimization engine OpEn which implements the proximal averaged Newton method for optimal control (PANOC). Simulation results prove the efficacy and real-time capability of our approach.

math.OC

Learning-Based Risk-Averse Model Predictive Control for Adaptive Cruise Control with Stochastic Driver Models

We propose a learning-based, distributionally robust model predictive control approach towards the design of adaptive cruise control (ACC) systems. We model the preceding vehicle as an autonomous stochastic system, using a hybrid model with continuous dynamics and discrete, Markovian inputs. We estimate the (unknown) transition probabilities of this model empirically using observed mode transitions and simultaneously determine sets of probability vectors (ambiguity sets) around these estimates, that contain the true transition probabilities with high confidence. We then solve a risk-averse optimal control problem that assumes the worst-case distributions in these sets. We furthermore derive a robust terminal constraint set and use it to establish recursive feasibility of the resulting MPC scheme. We validate the theoretical results and demonstrate desirable properties of the scheme through closed-loop simulations.

eess.SY

A Stochastic Model Predictive Control Approach for Driver-Aided Intersection Crossing With Uncertain Driver Time Delay

We investigate the problem of coordinating human-driven vehicles in road intersections without any traffic lights or signs by issuing speed advices. The vehicles in the intersection are assumed to move along an a priori known path and to be connected via vehicle-to-vehicle communication. The challenge arises with the uncertain driver reaction to a speed advice, especially in terms of the driver reaction time delay, as it might lead to unstable system dynamics. For this control problem, a distributed stochastic model predictive control concept is designed which accounts for driver uncertainties. By optimizing over scenarios, which are sequences of independent and identically distributed samples of the uncertainty over the prediction horizon, we can give probabilistic guarantees on constraint satisfaction. Simulation results demonstrate that the scenario-based approach is able to avoid collisions in spite of uncertainty while the non-stochastic baseline controller is not.

math.OC

Nonlinear Model Predictive Control for Distributed Motion Planning in Road Intersections Using PANOC

The coordination of highly automated vehicles (or agents) in road intersections is an inherently nonconvex and challenging problem. In this paper, we propose a distributed motion planning scheme under reasonable vehicle-to-vehicle communication requirements. Each agent solves a nonlinear model predictive control problem in real time and transmits its planned trajectory to other agents, which may have conflicting objectives. The problem formulation is augmented with conditional constraints that enable the agents to decide whether to wait at a stopping line, if safe crossing is not possible. The involved nonconvex problems are solved very efficiently using the proximal averaged Newton method for optimal control (PANOC). We demonstrate the efficiency of the proposed approach in a realistic intersection crossing scenario.

eess.SY