Output feedback robust distributed model predictive control for parallel systems in process networks with competitive characteristics

The parallel structure is one of the basic system architectures found in process networks. This paper formulates control strategies for such parallel systems when the states are unmeasured. The competitive coupling and competitive constraints are addressed in the control design. A distributed buffer and pre-estimator are proposed to solve problems relating to coupling and timely communication whilst a distributed moving horizon estimator is employed to further improve the estimation accuracy in the presence of the constraints. An output feedback robust distributed model predictive control algorithm is then developed for such parallel systems. The Lyapunov method is used for the theoretical analysis which produces tractable linear matrix inequalities (LMI). Simulations and experimental results are provided to validate the effectiveness of the proposed approach

A Real-time Nonlinear Model Predictive Controller for Yaw Motion Optimization of Distributed Drive Electric Vehicles

This paper proposes a real-time nonlinear model predictive control (NMPC) strategy for direct yaw moment control (DYC) of distributed drive electric vehicles (DDEVs). The NMPC strategy is based on a control-oriented model built by integrating a single track vehicle model with the Magic Formula (MF) tire model. To mitigate the NMPC computational cost, the continuation/generalized minimal residual (C/GMRES) algorithm is employed and modified for real-time optimization. Since the traditional C/GMRES algorithm cannot directly solve the inequality constraint problem, the external penalty method is introduced to transform inequality constraints into an equivalently unconstrained optimization problem. Based on the Pontryagin’s minimum principle (PMP), the existence and uniqueness for solution of the proposed C/GMRES algorithm are proven. Additionally, to achieve fast initialization in C/GMRES algorithm, the varying predictive duration is adopted so that the analytic expressions of optimally initial solutions in C/GMRES algorithm can be derived and gained. A Karush-Kuhn-Tucker (KKT) condition based control allocation method distributes the desired traction and yaw moment among four independent motors. Numerical simulations are carried out by combining CarSim and Matlab/Simulink to evaluate the effectiveness of the proposed strategy. Results demonstrate that the real-time NMPC strategy can achieve superior vehicle stability performance, guarantee the given safety constraints, and significantly reduce the computational efforts

Networked control system – an overview

Networked Control System (NCS) is fetching researchers’ interest from many decades. It’s been used in industry which range from manufacturing, automobile, aviation, aerospace to military. This paper gives the general architecture of NCS and its fundamental routes. It also touches to its advantages and disadvantages and some of the popular controller which include PID (Proportional-Integral-Derivative) and MPC (Model Predictive Control)

Feedback and time are essential for the optimal control of computing systems

The performance, reliability, cost, size and energy usage of computing systems can be improved by one or more orders of magnitude by the systematic use of modern control and optimization methods. Computing systems rely on the use of feedback algorithms to schedule tasks, data and resources, but the models that are used to design these algorithms are validated using open-loop metrics. By using closed-loop metrics instead, such as the gap metric developed in the control community, it should be possible to develop improved scheduling algorithms and computing systems that have not been over-engineered. Furthermore, scheduling problems are most naturally formulated as constraint satisfaction or mathematical optimization problems, but these are seldom implemented using state of the art numerical methods, nor do they explicitly take into account the fact that the scheduling problem itself takes time to solve. This paper makes the case that recent results in real-time model predictive control, where optimization problems are solved in order to control a process that evolves in time, are likely to form the basis of scheduling algorithms of the future. We therefore outline some of the research problems and opportunities that could arise by explicitly considering feedback and time when designing optimal scheduling algorithms for computing systems

Implementation of Model Based Networked Predictive Control System

Networked control systems are made up of several computer nodes communicating over a communication channel, cooperating to control a plant. The stability of the plant depends on the end to end delay from sensor to the actuator. Although computational delays within the computer nodes can be made bounded, delays through the communication network are generally unpredictable. A method which aims to protect the stability of the plant under communication delays and data loss, Model Based Predictive Networked Control System (MBPNCS), has previously been proposed by the authors. This paper aims to demonstrate the implementation of this type of networked control system on a non-real-time communication network; Ethernet. In this paper, we first briefly describe the MBPNCS method, then discuss the implementation, detailing the properties of the operating system, communications and hardware, and later give the results on the performance of the Model Based Predictive Networked Control System implementation controlling a DC motor. This work was supported in part by the Scientific and Technological Re search Council of Turkey, project code 106E155

dARTMAP: A Neural Network for Fast Distributed Supervised Learning

Distributed coding at the hidden layer of a multi-layer perceptron (MLP) endows the network with memory compression and noise tolerance capabilities. However, an MLP typically requires slow off-line learning to avoid catastrophic forgetting in an open input environment. An adaptive resonance theory (ART) model is designed to guarantee stable memories even with fast on-line learning. However, ART stability typically requires winner-take-all coding, which may cause category proliferation in a noisy input environment. Distributed ARTMAP (dARTMAP) seeks to combine the computational advantages of MLP and ART systems in a real-time neural network for supervised learning, An implementation algorithm here describes one class of dARTMAP networks. This system incorporates elements of the unsupervised dART model as well as new features, including a content-addressable memory (CAM) rule for improved contrast control at the coding field. A dARTMAP system reduces to fuzzy ARTMAP when coding is winner-take-all. Simulations show that dARTMAP retains fuzzy ARTMAP accuracy while significantly improving memory compression.National Science Foundation (IRI-94-01659); Office of Naval Research (N00014-95-1-0409, N00014-95-0657

A Very Brief Introduction to Machine Learning With Applications to Communication Systems

Given the unprecedented availability of data and computing resources, there is widespread renewed interest in applying data-driven machine learning methods to problems for which the development of conventional engineering solutions is challenged by modelling or algorithmic deficiencies. This tutorial-style paper starts by addressing the questions of why and when such techniques can be useful. It then provides a high-level introduction to the basics of supervised and unsupervised learning. For both supervised and unsupervised learning, exemplifying applications to communication networks are discussed by distinguishing tasks carried out at the edge and at the cloud segments of the network at different layers of the protocol stack