Related papers: Piecewise semi-ellipsoidal control invariant sets
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
Despite rapid evolution, embedded computing systems increasingly feature resource constraints and workload uncertainties. To achieve much better system performance in unpredictable environments than traditional design approaches, a novel…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions $\sin$ and $\cos$. Apparently, this method may be very useful for explicit description of solutions of optimal…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
This paper delves into the problem of computing robust controlled invariants for monotone continuous-time systems, with a specific focus on lower-closed specifications. We consider the classes of state monotone (SM) and control-state…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
In this paper we explicitly calculate the control sets associated with a linear control system on the two dimensional solvable Lie group. We show that a linear control system of such kind admits exactly one control set or infinite control…
We propose an extension of the theory of control sets to the case of inputs satisfying a dwell-time constraint. Although the class of such inputs is not closed under concatenation, we propose a suitably modified definition of control sets…
Polyhedral estimate is a generic efficiently computable nonlinear in observations routine for recovering unknown signal belonging to a given convex compact set from noisy observation of signal's linear image. Risk analysis and optimal…
Reliable controllers with high flexibility and performance are necessary for the control of intricate, advanced, and expensive systems such as aircraft, marine vessels, automotive vehicles, and satellites. Meanwhile, control allocation has…
Nonlinear control allocation is an important part of modern nonlinear dynamic inversion based flight control systems which require highly accurate model of aircraft aerodynamics. Generally, an accurately implemented onboard model determines…
The aim of this paper is to present the application of an approach to study contraction theory recently developed for piecewise smooth and switched systems. The approach that can be used to analyze incremental stability properties of…
A convex penalty for promoting switching controls for partial differential equations is introduced; such controls consist of an arbitrary number of components of which at most one should be simultaneously active. Using a Moreau-Yosida…
Input-affine dynamical systems often arise in control and modeling scenarios, such as the data-driven case when state-derivative observations are recorded under bounded noise. Common tasks in system analysis and control include optimal…
In this paper we present a direct adaptive control method for a class of uncertain nonlinear systems with a time-varying structure. We view the nonlinear systems as composed of a finite number of ``pieces,'' which are interpolated by…
Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multiple outputs, there is an opportunity to reuse partial…
We describe a convex programming approach to the calculation of lower bounds on the minimum cost of constrained decentralized control problems with nonclassical information structures. The class of problems we consider entail the…
We study the problem of computing robust controllable sets for discrete-time linear systems with additive uncertainty. We propose a tractable and scalable approach to inner- and outer-approximate robust controllable sets using constrained…