Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTight Remainder-Form Decomposition Functions with Applications to Constrained Reachability and Interval Observer Design
193
0
0.0
(
0
)
Added by
Mohammad Khajenejad
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This paper proposes a tractable family of remainder-form mixed-monotone decomposition functions that are useful for over-approximating the image set of nonlinear mappings in reachability and estimation problems. In particular, our approach applies to a new class of nonsmooth nonlinear systems that we call either-sided locally Lipschitz (ELLC) systems, which we show to be a superset of locally Lipschitz continuous systems, thus expanding the set of systems that are formally known to be mixed-monotone. In addition, we derive lower and upper bounds for the over-approximation error and show that the lower bound is achievable with our proposed approach. Moreover, we develop a set inversion algorithm that along with the proposed decomposition functions, can be used for constrained reachability analysis and interval observer design for continuous and discrete-time systems with bounded noise.
rate research
Read More
In this paper we revisit the problem of computing robust controlled invariant sets for discrete-time linear systems. The key idea is that by considering controllers that exhibit eventually periodic behavior, we obtain a closed-form expression for an implicit representation of a robust controlled invariant set in the space of states and finite input sequences. Due to the derived closed-form expression, our method is suitable for high dimensional systems. Optionally, one obtains an explicit robust controlled invariant set by projecting the implicit representation to the original state space. The proposed method is complete in the absence of disturbances, with a weak completeness result established when disturbances are present. Moreover, we show that a specific controller choice yields a hierarchy of robust controlled invariant sets. To validate the proposed method, we present thorough case studies illustrating that in safety-critical scenarios the implicit representation suffices in place of the explicit invariant set.
We propose a framework to use Nesterovs accelerated method for constrained convex optimization problems. Our approach consists of first reformulating the original problem as an unconstrained optimization problem using a continuously differentiable exact penalty function. This reformulation is based on replacing the Lagrange multipliers in the augmented Lagrangian of the original problem by Lagrange multiplier functions. The expressions of these Lagrange multiplier functions, which depend upon the gradients of the objective function and the constraints, can make the unconstrained penalty function non-convex in general even if the original problem is convex. We establish sufficient conditions on the objective function and the constraints of the original problem under which the unconstrained penalty function is convex. This enables us to use Nesterovs accelerated gradient method for unconstrained convex optimization and achieve a guaranteed rate of convergence which is better than the state-of-the-art first-order algorithms for constrained convex optimization. Simulations illustrate our results.
This paper treats an optimal scheduling problem of control nodes in networked systems. We newly introduce both the L0 and l0 constraints on control inputs to extract a time-varying small number of effective control nodes. As the cost function, we adopt the trace of the controllability Gramian to reduce the required control energy. Since the formulated optimization problem is combinatorial, we introduce a convex relaxation problem for its computational tractability. After a reformulation of the problem into an optimal control problem to which Pontryagins maximum principle is applicable, we give a sufficient condition under which the relaxed problem gives a solution of the main problem. Finally, the proposed method is applied to a rebalancing problem of a mobility network.
This paper proposes a novel framework for resource-aware control design termed performance-barrier-based triggering. Given a feedback policy, along with a Lyapunov function certificate that guarantees its correctness, we examine the problem of designing its digital implementation through event-triggered control while ensuring a prescribed performance is met and triggers occur as sparingly as possible. Our methodology takes into account the performance residual, i.e., how well the system is doing in regards to the prescribed performance. Inspired by the notion of control barrier function, the trigger design allows the certificate to deviate from monotonically decreasing, with leeway specified as an increasing function of the performance residual, resulting in greater flexibility in prescribing update times. We study different types of performance specifications, with particular attention to quantifying the benefits of the proposed approach in the exponential case. We build on this to design intrinsically Zeno-free distributed triggers for network systems. A comparison of event-triggered approaches in a vehicle platooning problem shows how the proposed design meets the prescribed performance with a significantly lower number of controller updates.
Transmission line failures in power systems propagate and cascade non-locally. This well-known yet counter-intuitive feature makes it even more challenging to optimally and reliably operate these complex networks. In this work we present a comprehensive framework based on spectral graph theory that fully and rigorously captures how multiple simultaneous line failures propagate, distinguishing between non-cut and cut set outages. Using this spectral representation of power systems, we identify the crucial graph sub-structure that ensures line failure localization -- the network bridge-block decomposition. Leveraging this theory, we propose an adaptive network topology reconfiguration paradigm that uses a two-stage algorithm where the first stage aims to identify optimal clusters using the notion of network modularity and the second stage refines the clusters by means of optimal line switching actions. Our proposed methodology is illustrated using extensive numerical examples on standard IEEE networks and we discussed several extensions and variants of the proposed algorithm.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
