Steady-state and N-stages control for isolated controlled intersections

Authors:
Jack Haddad;Bart De Schutter;David Mahalel;Per-Olof Gutman
Affiliations:
Transportation Research Institute, Technion-Israel Institute of Technology, Haifa, Israel;Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands;Transportation Research Institute, Technion-Israel Institute of Technology, Haifa, Israel;Transportation Research Institute, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 5
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Optimal Control of a Class of Linear Hybrid Systems with Saturation

SIAM Journal on Control and Optimization
Numerical Experience with Lower Bounds for MIQP Branch-And-Bound

SIAM Journal on Optimization
Urban traffic control structure based on hybrid Petri nets

IEEE Transactions on Intelligent Transportation Systems
Control of systems integrating logic, dynamics, and constraints

Automatica (Journal of IFAC)

Design of optimal traffic flow control at intersection with regard for queue length constraints

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a simplified isolated controlled intersection is introduced. Discrete-event piecewise affine (PWA) and discrete-event max-plus models are proposed to formulate the optimization problem for the switching sequences. Two control problems are considered: steady-state control and N-stages control. The formulated discrete-event PWA and max-plus problems are converted to be solved by linear programming (LP), mixed-integer programming (MIP), and mixed-integer linear programming (MILP). In the special case when the criterion is a strictly monotonous and linear function of the queue lengths, the steady-state control problem is solved analytically.