Electrical Engineering And Systems Science

In unmanned aerial vehicle (UAV)-assisted data collection system, UAVs can be deployed to charge ground terminals (GTs) via wireless power transfer (WPT) and collect data from them via wireless information transmission (WIT). In this paper, we aim to minimize the time required by a UAV via jointly optimizing the trajectory of the UAV and the transmission scheduling for all the GTs. This problem is formulated as a mixed integer nonlinear programming (MINLP) which are difficult to address in general. To this end, we develop an iterative algorithm based on binary search and successive convex optimization (SCO) to solve it. The simulation shows that our proposed solution outperforms the benchmark algorithms.

For critical infrastructure restoration planning, the real-time scheduling and coordination of system restoration efforts, the key in decision-making is to prioritize those critical components that are out of service during the restoration. For this purpose, there is a need for component importance analysis. While it has been investigated extensively for individual systems, component importance considering interdependence among transmission, distribution and communication (T&D&C) systems has not been systematically analyzed and widely adopted. In this study, we propose a component importance assessment method in the context of interdependence between T&D&C networks. Analytic methods for multilayer networks and a set of metrics have been applied for assessing the component importance and interdependence between T&D&C networks based on their physical characteristics. The proposed methodology is further validated with integrated synthetic Illinois regional transmission, distribution, and communication (T&D&C) systems, the results reveal the unique characteristics of component/node importance, which may be strongly affected by the network topology and cross-domain node mapping.

In this paper, we develop a compositional scheme for the construction of continuous approximations for interconnections of infinitely many discrete-time switched systems. An approximation (also known as abstraction) is itself a continuous-space system, which can be used as a replacement of the original (also known as concrete) system in a controller design process. Having designed a controller for the abstract system, it is refined to a more detailed one for the concrete system. We use the notion of so-called simulation functions to quantify the mismatch between the original system and its approximation. In particular, each subsystem in the concrete network and its corresponding one in the abstract network are related through a notion of local simulation functions. We show that if the local simulation functions satisfy certain small-gain type conditions developed for a network containing infinitely many subsystems, then the aggregation of the individual simulation functions provides an overall simulation function quantifying the error between the overall abstraction network and the concrete one. In addition, we show that our methodology results in a scale-free compositional approach for any finite-but-arbitrarily large networks obtained from truncation of an infinite network. We provide a systematic approach to construct local abstractions and simulation functions for networks of linear switched systems. The required conditions are expressed in terms of linear matrix inequalities that can be efficiently computed. We illustrate the effectiveness of our approach through an application to AC islanded microgirds.

Assuring the correct behavior of cyber-physical systems requires significant modeling effort, particularly during early stages of the engineering and design process when a system is not yet available for testing or verification of proper behavior. A primary motivation for `getting things right' in these early design stages is that altering the design is significantly less costly and more effective than when hardware and software have already been developed. Engineering cyber-physical systems requires the construction of several different types of models, each representing a different view, which include stakeholder requirements, system behavior, and the system architecture. Furthermore, each of these models can be represented at different levels of abstraction. Formal reasoning has improved the precision and expanded the available types of analysis in assuring correctness of requirements, behaviors, and architectures. However, each is usually modeled in distinct formalisms and corresponding tools. Currently, this disparity means that a system designer must manually check that the different models are in agreement. Manually editing and checking models is error prone, time consuming, and sensitive to any changes in the design of the models themselves. Wiring diagrams and related theory provide a means for formally organizing these different but related modeling views, resulting in a compositional modeling language for cyber-physical systems. Such a categorical language can make concrete the relationship between different model views, thereby managing complexity, allowing hierarchical decomposition of system models, and formally proving consistency between models.

In this paper, we discuss the methodology of generalizing the optimal control law from learned component tasks to unlearned composite tasks on Multi-Agent Systems (MASs), by using the linearity composition principle of linearly solvable optimal control (LSOC) problems. The proposed approach achieves both the compositionality and optimality of control actions simultaneously within the cooperative MAS framework in both discrete- and continuous-time in a sample-efficient manner, which reduces the burden of re-computation of the optimal control solutions for the new task on the MASs. We investigate the application of the proposed approach on the MAS with coordination between agents. The experiments show feasible results in investigated scenarios, including both discrete and continuous dynamical systems for task generalization without resampling.

This paper presents an iterative algorithm to compute a Robust Control Invariant (RCI) set, along with an invariance-inducing control law, for Linear Parameter-Varying (LPV) systems. As the real-time measurements of the scheduling parameters are typically available, in the presented formulation, we allow the RCI set description along with the invariance-inducing controller to be scheduling parameter dependent. The considered formulation thus leads to parameter-dependent conditions for the set invariance, which are replaced by sufficient Linear Matrix Inequality (LMI) conditions via Polya's relaxation. These LMI conditions are then combined with a novel volume maximization approach in a Semidefinite Programming (SDP) problem, which aims at computing the desirably large RCI set. In addition to ensuring invariance, it is also possible to guarantee performance within the RCI set by imposing a chosen quadratic performance level as an additional constraint in the SDP problem. The reported numerical example shows that the presented iterative algorithm can generate invariant sets which are larger than the maximal RCI sets computed without exploiting scheduling parameter information.

This paper develops and implements an algorithm to compute sequences of polytopic Robust Forward Invariant Sets (RFIS) that can parametrically vary in size between the maximal and minimal RFIS of a nonlinear dynamical system. This is done through a novel computational approach that geometrically deforms a polytope into an invariant set using a sequence of homeomorphishms, based on an invariance condition that only needs to be satisfied at a finite set of test points. For achieving this, a fast computational test is developed to establish if a given polytopic set is an RFIS. The geometric nature of the proposed approach makes it applicable for arbitrary Lipschitz continuous nonlinear systems in the presence of bounded additive disturbances. The versatility of the proposed approach is presented through simulation results on a variety of nonlinear dynamical systems in two and three dimensions, for which, sequences of invariant sets are computed.

This paper deals with the computation of the largest robust control invariant sets (RCISs) of constrained nonlinear systems. The proposed approach is based on casting the search for the invariant set as a graph theoretical problem. Specifically, a general class of discrete-time time-invariant nonlinear systems is considered. First, the dynamics of a nonlinear system is approximated with a directed graph. Subsequently, the condition for robust control invariance is derived and an algorithm for computing the robust control invariant set is presented. The algorithm combines the iterative subdivision technique with the robust control invariance condition to produce outer approximations of the largest robust control invariant set at each iteration. Following this, we prove convergence of the algorithm to the largest RCIS as the iterations proceed to infinity. Based on the developed algorithms, an algorithm to compute inner approximations of the RCIS is also presented. A special case of input affine and disturbance affine systems is also considered. Finally, two numerical examples are presented to demonstrate the efficacy of the proposed method.

This paper develops a conservation-based approach to model traffic dynamics and alleviate traffic congestion in a network of interconnected roads (NOIR). We generate a NOIR by using the Simulation of Urban Mobility (SUMO) software based on the real street map of Philadelphia Center City. The NOIR is then represented by a directed graph with nodes identifying distinct streets in the Center City area. By classifying the streets as inlets, outlets, and interior nodes, the model predictive control (MPC) method is applied to alleviate the network traffic congestion by optimizing the traffic inflow and outflow across the boundary of the NOIR with consideration of the inner traffic dynamics as a stochastic process. The proposed boundary control problem is defined as a quadratic programming problem with constraints imposing the feasibility of traffic coordination, and a cost function defined based on the traffic density across the NOIR.

We present Contingency Model Predictive Control (CMPC), a motion planning and control framework that optimizes performance objectives while simultaneously maintaining a contingency plan -- an alternate trajectory that avoids a potential hazard. By preserving the existence of a feasible avoidance trajectory, CMPC anticipates emergency and keeps the controlled system in a safe state that is selectively robust to the identified hazard. We accomplish this by adding an additional prediction horizon in parallel to the typical Model Predictive Control (MPC) horizon. This extra horizon is constrained to guarantee safety from the contingent threat and is coupled to the nominal horizon at its first command. Thus, the two horizons negotiate to compute commands that are both optimized for performance and robust to the contingent event. This article presents a linear formulation for CMPC, illustrates its key features on a toy problem, and then demonstrates its efficacy experimentally on a full-size automated road vehicle that encounters a realistic pop-out obstacle. Contingency MPC approaches potential emergencies with safe, intuitive, and interpretable behavior that balances conservatism with incentive for high performance operation.