INTELLIGENT TRANSPORTATION SYSTEMS - ENABLING TECHNOLOGIES

被引:16
作者
GARCIAORTIZ, A [1 ]
AMIN, SM [1 ]
WOOTTON, JR [1 ]
机构
[1] WASHINGTON UNIV, CTR OPTIMIZAT & SEMANT CONTROL, DEPT SYST SCI & MATH, ST LOUIS, MO 63130 USA
关键词
D O I
10.1016/0895-7177(95)00127-N
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Intelligent transportation programs take many different names throughout the world; in the United States it is ITS, in Europe it is Prometheus, and in Japan it is AMTICS and RAGS. All of them share very similar objectives, i.e., the development of advanced Traffic Management Systems, Traveler Information Systems, Vehicle Control Systems, Commercial Vehicle Operations, Public Transportation Systems, and Rural Transportation Systems. Several key technologies stand to serve the synthesis of each and every one of these objectives. These technologies are: Digital Maps, Computers, Path Planning, Human Factors, Sensors, Communications, Vehicle Control, and Traffic Control. This paper discusses each one of these subjects in enough detail to provide the reader with an introduction to both the technology and its state-of-the-art. In addition, the paper discusses socio-politico-economic issues associated with the implementation of the various programs. We believe that this highly neglected subject will serve to temper the development and deployment of these programs.
引用
收藏
页码:11 / 81
页数:71
相关论文
共 243 条
[21]   SHORTEST-PATH ALGORITHMS - TAXONOMY AND ANNOTATION [J].
DEO, N ;
PANG, CY .
NETWORKS, 1984, 14 (02) :275-323
[22]   COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].
DIAL, R ;
GLOVER, F ;
KARNEY, D ;
KLINGMAN, D .
NETWORKS, 1979, 9 (03) :215-248
[23]   AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].
DREYFUS, SE .
OPERATIONS RESEARCH, 1969, 17 (03) :395-&
[24]   VEHICLE-ROUTING WITH STOCHASTIC DEMANDS - PROPERTIES AND SOLUTION FRAMEWORKS [J].
DROR, M ;
LAPORTE, G ;
TRUDEAU, P .
TRANSPORTATION SCIENCE, 1989, 23 (03) :166-176
[25]  
Filev D., 1994, SIGART B, V6, P22
[26]   A DISTRIBUTED SHORTEST-PATH ALGORITHM FOR A PLANAR NETWORK [J].
FREDERICKSON, GN .
INFORMATION AND COMPUTATION, 1990, 86 (02) :140-159
[27]   DYNAMIC NETWORK TRAFFIC ASSIGNMENT CONSIDERED AS A CONTINUOUS-TIME OPTIMAL-CONTROL PROBLEM [J].
FRIESZ, TL ;
LUQUE, J ;
TOBIN, RL ;
WIE, BW .
OPERATIONS RESEARCH, 1989, 37 (06) :893-901
[28]  
GALLO G, 1986, MATH PROGRAM STUD, V26, P38, DOI 10.1007/BFb0121087
[29]   APPLICATION OF SEMANTIC CONTROL TO A CLASS OF PURSUER-EVADER PROBLEMS [J].
GARCIAORTIZ, A ;
WOOTTON, J ;
RODIN, EY ;
AMIN, SM ;
MEUSEY, M ;
RUAN, C ;
WU, AY ;
DE, P ;
REVETTA, J .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 26 (06) :97-124
[30]   A NEW POLYNOMIALLY BOUNDED SHORTEST-PATH ALGORITHM [J].
GLOVER, F ;
KLINGMAN, D ;
PHILLIPS, N .
OPERATIONS RESEARCH, 1985, 33 (01) :65-73