Random Neural Networks and Optimisation

In this thesis we introduce new models and learning algorithms for the Random Neural Network (RNN), and we develop RNN-based and other approaches for the solution of emergency management optimisation problems. With respect to RNN developments, two novel supervised learning algorithms are proposed. The first, is a gradient descent algorithm for an RNN extension model that we have introduced, the RNN with synchronised interactions (RNNSI), which was inspired from the synchronised firing activity observed in brain neural circuits. The second algorithm is based on modelling the signal-flow equations in RNN as a nonnegative least squares (NNLS) problem. NNLS is solved using a limited-memory quasi-Newton algorithm specifically designed for the RNN case. Regarding the investigation of emergency management optimisation problems, we examine combinatorial assignment problems that require fast, distributed and close to optimal solution, under information uncertainty. We consider three different problems with the above characteristics associated with the assignment of emergency units to incidents with injured civilians (AEUI), the assignment of assets to tasks under execution uncertainty (ATAU), and the deployment of a robotic network to establish communication with trapped civilians (DRNCTC). AEUI is solved by training an RNN tool with instances of the optimisation problem and then using the trained RNN for decision making; training is achieved using the developed learning algorithms. For the solution of ATAU problem, we introduce two different approaches. The first is based on mapping parameters of the optimisation problem to RNN parameters, and the second on solving a sequence of minimum cost flow problems on appropriately constructed networks with estimated arc costs. For the exact solution of DRNCTC problem, we develop a mixed-integer linear programming formulation, which is based on network flows. Finally, we design and implement distributed heuristic algorithms for the deployment of robots when the civilian locations are known or uncertain

Estimation and control of non-linear and hybrid systems with applications to air-to-air guidance

Issued as Progress report, and Final report, Project no. E-21-67

On the continuum approximation of the on-and-off signal control on dynamic traffic networks

In the modeling of traffic networks, a signalized junction is typically treated using a binary variable to model the on-and-off nature of signal operation. While accurate, the use of binary variables can cause problems when studying large networks with many intersections. Instead, the signal control can be approximated through a continuum approach where the on-and-off control variable is replaced by a continuous priority parameter. Advantages of such approximation include elimination of the need for binary variables, lower time resolution requirements, and more flexibility and robustness in a decision environment. It also resolves the issue of discontinuous travel time functions arising from the context of dynamic traffic assignment. Despite these advantages in application, it is not clear from a theoretical point of view how accurate is such continuum approach; i.e., to what extent is this a valid approximation for the on-and-off case. The goal of this paper is to answer these basic research questions and provide further guidance for the application of such continuum signal model. In particular, by employing the Lighthill-Whitham-Richards model (Lighthill and Whitham, 1955; Richards, 1956) on a traffic network, we investigate the convergence of the on-and-off signal model to the continuum model in regimes of diminishing signal cycles. We also provide numerical analyses on the continuum approximation error when the signal cycles are not infinitesimal. As we explain, such convergence results and error estimates depend on the type of fundamental diagram assumed and whether or not vehicle spillback occurs to the signalized intersection in question. Finally, a traffic signal optimization problem is presented and solved which illustrates the unique advantages of applying the continuum signal model instead of the on-and-off model

Nondeterministic hybrid dynamical systems

This thesis is concerned with the analysis, control and identification of hybrid dynamical systems. The main focus is on a particular class of hybrid systems consisting of linear subsystems. The discrete dynamic, i.e., the change between subsystems, is unknown or nondeterministic and cannot be influenced, i.e. controlled, directly. However changes in the discrete dynamic can be detected immediately, such that the current dynamic (subsystem) is known. In order to motivate the study of hybrid systems and show the merits of hybrid control theory, an example is given. It is shown that real world systems like Anti Locking Brakes (ABS) are naturally modelled by such a class of linear hybrids systems. It is shown that purely continuous feedback is not suitable since it cannot achieve maximum braking performance. A hybrid control strategy, which overcomes this problem, is presented. For this class of linear hybrid system with unknown discrete dynamic, a framework for robust control is established. The analysis methodology developed gives a robustness radius such that the stability under parameter variations can be analysed. The controller synthesis procedure is illustrated in a practical example where the control for an active suspension of a car is designed. Optimal control for this class of hybrid system is introduced. It is shows how a control law is obtained which minimises a quadratic performance index. The synthesis procedure is stated in terms of a convex optimisation problem using linear matrix inequalities (LMI). The solution of the LMI not only returns the controller but also the performance bound. Since the proposed controller structures require knowledge of the continuous state, an observer design is proposed. It is shown that the estimation error converges quadratically while minimising the covariance of the estimation error. This is similar to the Kalman filter for discrete or continuous time systems. Further, we show that the synthesis of the observer can be cast into an LMI, which conveniently solves the synthesis problem