Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMultiple sparsity constrained control node scheduling with application to rebalancing of mobility networks
74
0
0.0
(
0
)
Added by
Kenji Kashima
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
In Part I of this paper we have introduced the closed-form conditions for guaranteeing regional frequency stability in a power system. Here we propose a methodology to represent these conditions in the form of linear constraints and demonstrate their applicability by implementing them in a generation-scheduling model. This model simultaneously optimises energy production and ancillary services for maintaining frequency stability in the event of a generation outage, by solving a frequency-secured Stochastic Unit Commitment (SUC). We consider the Great Britain system, characterised by two regions that create a non-uniform distribution of inertia: England in the South, where most of the load is located, and Scotland in the North, containing significant wind resources. Through several case studies, it is shown that inertia and frequency response cannot be considered as system-wide magnitudes in power systems that exhibit inter-area oscillations in frequency, as their location in a particular region is key to guarantee stability. In addition, securing against a medium-sized loss in the low-inertia region proves to cause significant wind curtailment, which could be alleviated through reinforced transmission corridors. In this context, the proposed constraints allow to find the optimal volume of ancillary services to be procured in each region.
This paper studies the extremum seeking control (ESC) problem for a class of constrained nonlinear systems. Specifically, we focus on a family of constraints allowing to reformulate the original nonlinear system in the so-called input-output normal form. To steer the system to optimize a performance function without knowing its explicit form, we propose a novel numerical optimization-based extremum seeking control (NOESC) design consisting of a constrained numerical optimization method and an inversion based feedforward controller. In particular, a projected gradient descent algorithm is exploited to produce the state sequence to optimize the performance function, whereas a suitable boundary value problem accommodates the finite-time state transition between each two consecutive points of the state sequence. Compared to available NOESC methods, the proposed approach i) can explicitly deal with output constraints; ii) the performance function can consider a direct dependence on the states of the internal dynamics; iii) the internal dynamics do not have to be necessarily stable. The effectiveness of the proposed ESC scheme is shown through extensive numerical simulations.
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.
In decentralized optimization, multiple nodes in a network collaborate to minimize the sum of their local loss functions. The information exchange between nodes required for this task, is often limited by network connectivity. We consider a setting in which communication between nodes is hindered by both (i) a finite rate-constraint on the signal transmitted by any node, and (ii) additive noise corrupting the signal received by any node. We propose a novel algorithm for this scenario: Decentralized Lazy Mirror Descent with Differential Exchanges (DLMD-DiffEx), which guarantees convergence of the local estimates to the optimal solution under the given communication constraints. A salient feature of DLMD-DiffEx is the introduction of additional proxy variables that are maintained by the nodes to account for the disagreement in their estimates due to channel noise and rate-constraints. Convergence to the optimal solution is attained by having nodes iteratively exchange these disagreement terms until consensus is achieved. In order to prevent noise accumulation during this exchange, DLMD-DiffEx relies on two sequences; one controlling the power of the transmitted signal, and the other determining the consensus rate. We provide clear insights on the design of these two sequences which highlights the interplay between consensus rate and noise amplification. We investigate the performance of DLMD-DiffEx both from a theoretical perspective as well as through numerical evaluations.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
