TRAFFIC CONTROL USING GRAPH-THEORY

被引：10

作者：

RIEDEL, T ^{[1
]}

BRUNNER, U ^{[1
]}

机构：

[1] SWISS FED INST TECHNOL,AUTOMAT CONTROL LAB,CH-8092 ZURICH,SWITZERLAND

来源：

CONTROL ENGINEERING PRACTICE | 1994年 / 2卷 / 03期

关键词：

DISCRETE EVENT SYSTEMS; TRAFFIC CONTROL; GRAPH THEORY; DYNAMIC PROGRAMMING;

D O I：

10.1016/0967-0661(94)90776-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper the design of a controller for a traffic crossing is presented by means of an example. The controller to be developed has to minimise the waiting time of the public transportation while maintaining the individual traffic flowing as well as possible. First, the model of the chosen traffic crossing is derived. Then, using a combination of 'Dynamic Programming' and 'Branch and Bound' the control algorithm is presented. A visualisation of the algorithm is given by means of graphs, complexity issues are investigated, and computational refinements proposed. Simulation results are shown at the end. The actual implementation of the control algorithm for the example shown is under way and carried out in co-operation with the Transportation Authority of the city of Zurich. The work presented here is part of a bigger project. The overall goal is to provide the traffic engineer with a tool for designing 'intelligent' controllers for traffic lights.

引用

页码：397 / 404

页数：8