SearcharxivSearch

arXiv subjects

Christian Hespe

Publications and source records attributed to Christian Hespe.

7 recordsLinked to original sources

Towards Safe Multi-Task Bayesian Optimization

Bayesian optimization has emerged as a highly effective tool for the safe online optimization of systems, due to its high sample efficiency and noise robustness. To further enhance its efficiency, reduced physical models of the system can be incorporated into the optimization process, accelerating it. These models are able to offer an approximation of the actual system, and evaluating them is significantly cheaper. The similarity between the model and reality is represented by additional hyperparameters, which are learned within the optimization process. Safety is a crucial criterion for online optimization methods such as Bayesian optimization, which has been addressed by recent works that provide safety guarantees under the assumption of known hyperparameters. In practice, however, this does not apply. Therefore, we extend the robust Gaussian process uniform error bounds to meet the multi-task setting, which involves the calculation of a confidence region from the hyperparameter posterior distribution utilizing Markov chain Monte Carlo methods. Subsequently, the robust safety bounds are employed to facilitate the safe optimization of the system, while incorporating measurements of the models. Simulation results indicate that the optimization can be significantly accelerated for expensive to evaluate functions in comparison to other state-of-the-art safe Bayesian optimization methods, contingent on the fidelity of the models.

cs.LG

Robust Stability for Multiagent Systems with Spatio-Temporally Correlated Packet Loss

A problem with considering correlations in the analysis of multiagent system with stochastic packet loss is that they induce dependencies between agents that are otherwise decoupled, preventing the application of decomposition methods required for efficient evaluation. To circumvent that issue, this paper is proposing an approach based on analysing sets of networks with independent communication links, only considering the correlations in an implicit fashion. Combining ideas from the robust stabilization of Markov jump linear systems with recently proposed techniques for analysing packet loss in multiagent systems, we obtain a linear matrix inequality based stability condition which is independent of the number of agents. The main result is that the set of stabilized probability distributions has non-empty interior such that small correlations cannot lead to instability, even though only distributions of independent links were analysed. Moreover, two examples are provided to demonstrate the applicability of the results to practically relevant scenarios.

math.OC

Convergence Properties of Fast quasi-LPV Model Predictive Control

In this paper, we study the convergence properties of an iterative algorithm for fast nonlinear model predictive control of quasi-linear parameter-varying systems without inequality constraints. Compared to previous works considering this algorithm, we contribute conditions under which the iterations are guaranteed to converge. Furthermore, we show that the algorithm converges to suboptimal solutions and propose an optimality-preserving variant with moderately increased computational complexity. Finally, we compare both variants in terms of quality of solution and computational performance with a state-of-the-art solver for nonlinear model predictive control in two simulation benchmarks.

math.OC

A Scalable Approach for Analysing Multi-Agent Systems with Heterogeneous Stochastic Packet Loss

An important aspect in jointly analysing networked control systems and their communication is to model the networking in a sufficiently rich but at the same time mathematically tractable way. As such, this paper improves on a recently proposed scalable approach for analysing multi-agent systems with stochastic packet loss by allowing for heterogeneous transmission probabilities and temporal correlation in the communication model. The key idea is to consider the transmission probabilities as uncertain, which facilitates the use of tools from robust control. Due to being formulated in terms of linear matrix inequalities that grow linearly with the number of agents, the result is applicable to very large multi-agent systems, which is demonstrated by numerical simulations with up to 10000 agents.

eess.SY

Robust Performance Analysis of Cooperative Control Dynamics via Integral Quadratic Constraints

We study cooperative control dynamics with gradient based forcing terms. As a specific example, we focus on source-seeking dynamics with vehicles embedded in an unknown scalar field with a subset of agents having gradient information. As interaction mechanisms, formation control dynamics and flocking dynamics are considered. We leverage the framework of $α$-integral quadratic constraints to obtain convergence rate estimates whenever exponential stability can be achieved. The communication graph and the interaction potential are assumed to be time-invariant and uncertain. Sufficient conditions take the form of linear matrix inequalities independent of the size of network. A derivation (purely in time-domain) of the so-called \textit{hard} Zames-Falb $α$-IQCs involving general non-causal higher order multipliers is given along with a suitably adapted parameterization of the multipliers to the $α$-IQC setting. The time-domain arguments facilitate a straightforward extension to linear parameter varying systems. Numerical examples illustrate the application of the theoretical results.

math.OC

A Decomposition Approach to Multi-Agent Systems with Bernoulli Packet Loss

In this paper, we extend the decomposable systems framework to multi-agent systems with Bernoulli distributed packet loss with uniform probability. The proposed sufficient analysis conditions for mean-square stability and $H_2$-performance -- which are expressed in the form of linear matrix inequalities -- scale linearly with increased network size and thus allow to analyse even very large-scale multi-agent systems. A numerical example demonstrates the potential of the approach by application to a first-order consensus problem.

math.OC

Robust Performance Analysis for Time-Varying Multi-Agent Systems with Stochastic Packet Loss

Recently, a scalable approach to system analysis and controller synthesis for homogeneous multi-agent systems with Bernoulli distributed packet loss has been proposed. As a key result of that line of work, it was shown how to obtain upper bounds on the $H_2$-norm that are robust with respect to uncertain interconnection topologies. The main contribution of the current paper is to show that the same upper bounds hold not only for uncertain but also time-varying topologies that are superimposed with the stochastic packet loss. Because the results are formulated in terms of linear matrix inequalities that are independent of the number of agents, multi-agent systems of any size can be analysed efficiently. The applicability of the approach is demonstrated on a numerical first-order consensus example, on which the obtained upper bounds are compared to estimates from Monte-Carlo simulations.

eess.SY