Model-based design of experiments for parameter precision: State of the art

Recent analysis of empirical data from cities showed that a macroscopic fundamental diagram (MFD) of urban traffic provides for homogenous network regions a unimodal low-scatter relationship between network vehicle density and network space-mean flow. In this paper, the optimal perimeter control for two-region urban cities is formulated with the use of MFDs. The controllers operate on the border between the two regions and manipulate the percentages of flows that transfer between the two regions such that the number of trips that reach their destinations is maximized. The optimal perimeter control problem is solved by model predictive control, where the prediction model and the plant (reality) are formulated by MFDs. Examples are presented for different levels of congestion in the regions of the city and the robustness of the controller is tested for different sizes of error in the MFDs and different levels of noise in the traffic demand. Moreover, two methods for smoothing the control sequences are presented. Comparison results show that the performances of the model predictive control are significantly better than a “greedy” feedback control. The results in this paper can be extended to develop efficient hierarchical control strategies for heterogeneously congested cities.

/pdf/optimal-perimeter-control-for-two-urban-regions-with-3p6ra0tp53.pdf

Optimal Perimeter Control for Two Urban Regions With Macroscopic Fundamental Diagrams: A Model Predictive Approach

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.

A Gauss pseudospectral transcription for optimal control

We consider the problem of determining an optimal driving strategy in a train control problem with a generalised equation of motion. We assume that the journey must be completed within a given time and seek a strategy that minimises fuel consumption. On the one hand we consider the case where continuous control can be used and on the other hand we consider the case where only discrete control is available. We pay particular attention to a unified development of the two cases. For the continuous control problem we use the Pontryagin principle to find necessary conditions on an optimal strategy and show that these conditions yield key equations that determine the optimal switching points. In the discrete control problem, which is the typical situation with diesel-electric locomotives, we show that for each fixed control sequence the cost of fuel can be minimised by finding the optimal switching times. The corresponding strategies are called strategies of optimal type and in this case we use the Kuhn–Tucker equations to find key equations that determine the optimal switching times. We note that the strategies of optimal type can be used to approximate as closely as we please the optimal strategy obtained using continuous control and we present two new derivations of the key equations. We illustrate our general remarks by reference to a typical train control problem.

K. Wong

Papers

A unified computational approach to optimal control problems