Time Complexity of Decentralized Fixed-Mode Verification

Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM). It is shown that checking the decentralized fixedness of any distinct mode is tantamount to testing the strong connectivity of a digraph formed based on the system. It is subsequently proved that the time complexity of this decision problem using the proposed approach is the same as the complexity of matrix multiplication. This work concludes that the identification of distinct DFMs (by means of a deterministic algorithm, rather than a randomized one) is computationally very easy, although the existing algorithms for solving this problem would wrongly imply that it is cumbersome. This note provides not only a complexity analysis, but also an efficient algorithm for tackling the underlying problem

Plug-and-Play Fault Detection and control-reconfiguration for a class of nonlinear large-scale constrained systems

This paper deals with a novel Plug-and-Play (PnP) architecture for the control and monitoring of Large-Scale Systems (LSSs). The proposed approach integrates a distributed Model Predictive Control (MPC) strategy with a distributed Fault Detection (FD) architecture and methodology in a PnP framework. The basic concept is to use the FD scheme as an autonomous decision support system: once a fault is detected, the faulty subsystem can be unplugged to avoid the propagation of the fault in the interconnected LSS. Analogously, once the issue has been solved, the disconnected subsystem can be re-plugged-in. PnP design of local controllers and detectors allow these operations to be performed safely, i.e. without spoiling stability and constraint satisfaction for the whole LSS. The PnP distributed MPC is derived for a class of nonlinear LSSs and an integrated PnP distributed FD architecture is proposed. Simulation results in two paradigmatic examples show the effectiveness and the potential of the general methodology

Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Plug-and-Play Decentralized Model Predictive Control

In this paper we consider a linear system structured into physically coupled subsystems and propose a decentralized control scheme capable to guarantee asymptotic stability and satisfaction of constraints on system inputs and states. The design procedure is totally decentralized, since the synthesis of a local controller uses only information on a subsystem and its neighbors, i.e. subsystems coupled to it. We first derive tests for checking if a subsystem can be plugged into (or unplugged from) an existing plant without spoiling overall stability and constraint satisfaction. When this is possible, we show how to automatize the design of local controllers so that it can be carried out in parallel by smart actuators equipped with computational resources and capable to exchange information with neighboring subsystems. In particular, local controllers exploit tube-based Model Predictive Control (MPC) in order to guarantee robustness with respect to physical coupling among subsystems. Finally, an application of the proposed control design procedure to frequency control in power networks is presented.Comment: arXiv admin note: text overlap with arXiv:1210.692

A design procedure for overlapped guaranteed cost controllers

© 2008 the authors. This work has been accepted to IFAC for publication under a Creative Commons Licence CC-BY-NC-NDIn this paper a quadratic guaranteed cost control problem for a class of linear continuous-time state-delay systems with norm-bounded uncertainties is considered. We will suppose that the systems are composed by two overlapped subsystems but the results can be easily extended to any number of subsystems. The main objective is to design overlapping guaranteed cost controllers with tridiagonal gain matrices for these kind of systems by using a linear matrix inequality (LMI) approach. With this idea in mind, we present a design strategy to reduce the computational burden and to increase the feasibility in the LMI problem. In this context, the use of so-called complementary matrices play an important role. A simple example to illustrate the advantages achieved by using the proposed method is supplied.Peer ReviewedPostprint (published version

Decentralized Control Performances of an Experimental Web Handling System

Robust and good tracking control of the speed and the tension in web handling systems in spite of changes of set point is surely one of the important challenges in the web transport systems future development. In this paper, the authors experimentally demonstrate the real applicability of a decentralized robust control to a multi-span web transport system, which is composed of twelve guide rollers, four main sections mutually interconnected with each other. The overlapping methodology has been applied for the system decomposition. The experimental results carried out using the robust decentralized control show an excellent velocity and tension tracking in each controlled section of the system