Search

Switch-based adaptive dynamic programming (ADP) is an optimal control problem in which a cost must be minimized by switching among a family of dynamical modes. When the system dimension increases, the solution to switch-based ADP is made prohibitive by the exponentially increasing structure of the value function approximator and by the exponentially increasing modes. This technical correspondence proposes a distributed computational method for solving switch-based ADP. The method relies on partitioning the system into agents, each one dealing with a lower dimensional state and a few local modes. Each agent aims to minimize a local version of the global cost while avoiding that its local switching strategy has conflicts with the switching strategies of the neighboring agents. A heuristic algorithm based on the consensus dynamics and Nash equilibrium is proposed to avoid such conflicts. The effectiveness of the proposed method is verified via traffic and building test cases. [ABSTRACT FROM AUTHOR]

This work investigates the consensus tracking problem for high-power nonlinear multiagent systems with partially unknown control directions. The main challenge of considering such dynamics lies in the fact that their linearized dynamics contain uncontrollable modes, making the standard backstepping technique fail; also, the presence of mixed unknown control directions (some being known and some being unknown) requires a piecewise Nussbaum function that exploits the a priori knowledge of the known control directions. The piecewise Nussbaum function technique leaves some open problems, such as Can the technique handle multiagent dynamics beyond the standard backstepping procedure? and Can the technique handle more than one control direction for each agent? In this work, we propose a hybrid Nussbaum technique that can handle uncertain agents with high-power dynamics where the backstepping procedure fails, with nonsmooth behaviors (switching and quantization), and with multiple unknown control directions for each agent. [ABSTRACT FROM AUTHOR]

This article addresses and solves the adaptive asymptotic tracking for a class of uncertain switched positive linear dynamics (also known in the literature as compartmental models) subject to dwell-time constraints. Compared to the state-of-the-art, the innovative feature of this method is to attain for the first time asymptotic set-point tracking, while guaranteeing non-negativity of the systems states. To achieve asymptotic tracking, an interpolated Lyapunov function is adopted, which is nonincreasing at the switching instants and decreasing in two consecutive switching instants. Such Lyapunov function results in a novel adaptive law with time-varying adaptive gains, as opposed to state-of-the-art laws with fixed positive adaptive gains. The developed design is applicable to classes of compartmental systems compatible with those proposed in the literature: an example involving the infusion of anesthesia is conducted to show that the proposed method can achieve better performance than existing methods. [ABSTRACT FROM AUTHOR]

By increasingly relying on network-based operation for control, monitoring, and protection functionalities, modern wide-area power systems have also become vulnerable to cyber-attacks aiming to damage system performance and/or stability. Resilience in state-of-the-art methods mostly relies on known characteristics of the attacks and static control loops (i.e., with fixed input/output channels). This work proposes a ‘dynamic loop’ wide-area damping strategy, where input/output channel pairs are changed dynamically. We study ‘reactive’ dynamic switching in case of detectable attack and ‘pro-active’ dynamical switching, in case of undetectable (stealth) attacks. Stability of the dynamic loop is presented via Lyapunov theory, under parametric perturbations, average dwell time switching and external perturbations. Using two- and five-area IEEE benchmarks, it is shown that the proposed strategy provides effective damping and robustness under various detectable (e.g., false data injection, denial-of-service) and stealth (replay, bias injection) attacks. [ABSTRACT FROM AUTHOR]

Multi-area load frequency control (LFC) selects and controls a few generators in each area of the power system in an effort to dampen inter-area frequency oscillations. To effectively dampen such oscillations, it is required to enhance and lower the control activity dynamically during operation, so as to adapt to changing circumstances. Changing circumstances should cover not only parametric uncertainties and unmodelled dynamics (e.g. aggregated area dynamics and bus dynamics), but also the increasing structural flexibility of modern power systems (e.g. protection mechanisms against faults and cyber-attacks, or topology reconfiguration mechanisms for demand response). As formal stability guarantees around such an attractive adaptive multi-area LFC concept are still lacking, this work proposes framework in which adaptation and switching are combined in a provably stable way to handle parametric uncertainty, unmodelled dynamics, and dynamical interconnections of the power system. Stability is studied in the Lyapunov theory sense using the standard structure-preserving modelling approach, and the resulting adaptive multi-area LFC design is validated using an IEEE 39-bus benchmark. [ABSTRACT FROM AUTHOR]

The work presented in this paper concerns a switching-based control formulation for multi-intersection and multiphase traffic light systems. A macroscopic traffic flow modeling approach is first presented, which is instrumental to the development of a model-based and switching-based optimization method for traffic signal operation, in the framework of adaptive dynamic programming (ADP). The main advantage of the switching-based formulation is its capability to determine both “when”’ to switch and “which” mode to switch on without the need to use the cycle-based average flow approximation typical of state-of-the-art formulations. In addition, the framework can handle different cycle times across intersections without the need for synchronization constraints and, moreover, minimum dwell-time constraints can be directly enforced to comply with minimum green/red times in each phase. The simulation experiments on a multi-intersection and multiphase traffic light systems are presented to show the effectiveness of the method. [ABSTRACT FROM AUTHOR]

Underestimation and overestimation problems are commonly observed in conventional adaptive sliding mode control (ASMC). These problems refer to the fact that the adaptive controller gain unnecessarily increases when the states are approaching the sliding surface (overestimation) or improperly decreases when the states are getting far from it (underestimation). In this paper, we propose a novel ASMC strategy that overcomes such issues. In contrast to the state of the art, the proposed strategy is effective even when an a priori constant bound on the uncertainty cannot be imposed. Comparative results using a two-link manipulator demonstrate improved performance as compared to the conventional ASMC. Experimental results on a biped robot confirm the effectiveness and robustness of the proposed method under various practical uncertainties. [ABSTRACT FROM AUTHOR]