Search arXivSearch

arXiv · 2004.01761

Multi-Rate Control Design Leveraging Control Barrier Functions and Model Predictive Control Policies

Abstract

In this paper we present a multi-rate control architecture for safety critical systems. We consider a high level planner and a low level controller which operate at different frequencies. This multi-rate behavior is described by a piecewise nonlinear model which evolves on a continuous and a discrete level. First, we present sufficient conditions which guarantee recursive constraint satisfaction for the closed-loop system. Afterwards, we propose a control design methodology which leverages Control Barrier Functions (CBFs) for low level control and Model Predictive Control (MPC) policies for high level planning. The control barrier function is designed using the full nonlinear dynamical model and the MPC is based on a simplified planning model. When the nonlinear system is control affine and the high level planning model is linear, the control actions are computed by solving convex optimization problems at each level of the hierarchy. Finally, we show the effectiveness of the proposed strategy on a simulation example, where the low level control action is updated at a higher frequency than the high level command.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ugo Rosolia, Aaron D. Ames. 2020-07-06. Multi-Rate Control Design Leveraging Control Barrier Functions and Model Predictive Control Policies. https://arxiv.org/abs/2004.01761

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Efficient RF Chain Selection for MIMO Integrated Sensing and Communications: A Greedy Approach

In multiple-input multiple-output integrated sensing and communication (MIMO ISAC) systems, radio frequency chain (i.e., RF chain) selection plays a vital role in reducing hardware cost, power consumption, and computational complexity. However, designing an effective RF chain selection strategy is challenging due to the disparity in performance metrics between communication and sensing: mutual information (MI) versus beam-pattern mean-squared error (MSE) or the Cramér-Rao lower bound (CRLB). To overcome this, we propose a low-complexity greedy RF chain selection framework maximizing a unified MI-based performance metric applicable to both functions. By decomposing the total MI into individual contributions of each RF chain, we introduce two approaches: greedy eigen-based selection (GES) and greedy cofactor-based selection (GCS), which iteratively identify and remove the RF chains with the lowest contribution. We further extend our framework to beam selection for beamspace MIMO ISAC systems, introducing diagonal beam selection (DBS) as a simplified solution. Simulation results show that our proposed methods achieve near-optimal performance with significantly lower complexity than exhaustive search, demonstrating their practical effectiveness for MIMO ISAC systems.

eess.SY

An adaptive extension to robust data-driven predictive control under parametric uncertainty

Robust data-driven controllers typically rely on datasets from previous experiments, which embed information on the variability of the system parameters across past operational conditions. Complementarily, data collected online can contribute to improving the feedback performance relative to the current system's conditions, but are unable to account for the overall -- possibly time-varying -- system operation. With this in mind, we consider the problem of stabilizing a time-varying linear system, whose parameters are only known to lie within a bounded polytopic set. Taking a robust data-driven approach, we synthesize the control law by simultaneously leveraging two sets of historical state and input measures: an offline dataset -- which covers the extreme variations of the system parameters -- and an online dataset consisting of a rolling window of the latest state and input samples. Our approach relies on the data informativity framework, allowing a direct data-to-feedback design based on standard Lyapunov arguments. The procedure is implemented via semi-definite optimization: this also yields an upper bound on the cost-to-go for the class of systems that are consistent with the online data, while guaranteeing a decreasing cost for all systems compatible with the offline data. Numerical experiments are presented to illustrate the effectiveness of the proposed controller.

eess.SY

Grounded Laplacians of Directed Signed Matrix-Weighted Networks: Spectral Properties and Applications to Non-Trivial Consensus

Grounded Laplacians provide the spectral link between external information and network convergence. This paper establishes positive-stability results for grounded Laplacians in directed signed matrix-weighted networks, where directionality, antagonism, and singular edge weight matrices coexist. First, under in-degree dominance and positive-negative reachability, we derive explicit local thresholds for the grounding gains. Second, a scaled, kernel-based certificate replaces the unscaled degree condition with a signed matrix-weighted Dirichlet decomposition and a joint-kernel test for the scaled symmetric part. The computable margin $γ_p$ lower-bounds the minimum real part of the spectrum and certifies exponential contraction in the $P$-norm. Under absolute generalized balance, the kernel-intersection test is given; the balanced and definite-edge unbalanced undirected cases follow. As an application, non-trivial consensus (NTC) on signed matrix-weighted networks is studied. Informed agents, external signals and coupling terms are designed to steer all agents to any prescribed nonzero state without requiring structural balance. Switching topology case retains non-trivial consensus result under certain conditions. Realizing NTC on signed matrix-weighted networks demonstrates that groups with both cooperative and antagonistic multi-dimensional interactions can achieve consensus, which was previously deemed exclusive to fully cooperative groups.

eess.SY