NASA Technical Reports Server (NTRS) 20120001628: Near real-time traffic routing

3.1 MB·English

by  NASA Technical Reports Server (NTRS)

mu uuuu ui iiui imi uui uiu imi uui mii uui iuui uu uii mi
(12) United States Patent (1o) Patent No.: US 8,103,435 B2
Yang et al. (45) Date of Patent: Jan. 24, 2012
(54) NEAR REAL-TIME TRAFFIC ROUTING (56) References Cited
(75) Inventors: Chaowei Yang, Gaithersburg, MD (US); U.S. PATENT DOCUMENTS
Ying Cao, Fairfax, VA (US); Jibo Xie,
2004/0236498 Al* 11/2004 Le et al . ........................ 701/200
Fairfax, VA (US); Bin Zhou, Fairfax, VA
2006/0178807 Al * 8/2006 Kato et al . .................... 701/117
(US) 2011/0007629 Al * 1/2011 Atlas et al ..................... 370/225
* cited by examiner
(73) Assignee: George Mason Intellectual Properties,
Inc., Fairfax, VA (US)
Primary Examiner Mark Beauchaine
(*) Notice: Subject to any disclaimer, the term of this (74) Attorney, Agent, or Firm David Grossman
patent is extended or adjusted under 35
U.S.C. 154(b) by 649 days.
(57) ABSTRACT
(21) Appl. No.: 12/181,249 A near real-time physical transportation network routing sys-
tem comprising: a traffic simulation computing grid and a
(22) Filed: Jul. 28, 2008
dynamic traffic routing service computing grid. The traffic
simulator produces traffic network travel time predictions for
(65) Prior Publication Data
a physical transportation network using a traffic simulation
US 2009/0043486 Al Feb. 12, 2009 model and common input data. The physical transportation
network is divided into a multiple sections. Each section has
Related U.S. Application Data a primary zone and a buffer zone. The traffic simulation
(60) Provisional application No. 60/952,373, filed on Jul. computing grid includes multiple of traffic simulation com-
27, 2007. puting nodes. The common input data includes static network
characteristics, an origin-destination data table, dynamic traf-
(51) Int. Cl. fic information data and historical traffic data. The dynamic
G06G 7176 (2006.01) traffic routing service computing grid includes multiple
(52) U.S. Cl . ....................................................... 701/117 dynamic traffic routing computing nodes and generates traffic
route(s) using the traffic network travel time predictions.
(58) Field of Classification Search .................. 701/117,
701/119, 210, 204; 340/7.48; 434/305
See application file for complete search history. 22 Claims, 41 Drawing Sheets
4530
Traffic Simulation
Computing Grid
----------------------------------------------;
4737
Traffic Simulation Computing Node
Coordination Module
r' r ^' r +' r
4731 4732 4735
Traffic Traffic Traffic
Simulation Simulation Simulation
Computing Computing 900 Computing
Node Node Node
1 2 n
r r r
----_.c ............... t ------------------ -•----
4738
Traffic Simulation Computing Node
. Combination Module
= ---------------------------------------------
4739
Traffic Simulation Model
U.S. Patent Jan. 24, 2012 Sheet 1 of 41 US 8,103,435 B2
^ n ^ n n
M M N N N
M M N N N
NN
M M N N N
., ., ., .,
M M N N N
dN
M M N N N
.. ., ..
M M N N N m
C
M M r--i M r--+
CN CN
d
M M r--a M r--a
ON ., LL
u u —j u
Q
d
LL
U.S. Patent US 8,103,435 B2
Jan. 24, 2012 Sheet 2 of 41
m
N
d
LL
Q
N
LL
U.S. Patent Jan. 24, 2012 Sheet 3 of 41 US 8,103,435 B2
rcn
c o o a a c
o
Y
C4 NI C i NI V NI
M Q •E M d M Q 'a M
N d ^ a)
zQ) w =°C7 zma
O
U
M
N N
O> ON O LL
O
t4 ^ M cc M
L OL
a N
i 0
N —
Np N
o OI cn O O d
c r)
~ M p^ ^MI ^V p ^= M^I ^^ •N^ M
^ W
U
N
U.S. Patent Jan. 24, 2012 Sheet 4 of 41 US 8,103,435 B2
LL
r
C
Om
.I.,
L
U.S. Patent Jan. 24, 2012 Sheet 5 of 41 US 8,103,435 B2
Pseudo code of the Extended Dijkstra's algorithm
1 determinedVertecesSet.clearo;
2 rem ainingVerticesQueue.clearo;
3 // add source V with distance 0
4 rem aingVerticesQueue.insert(sourceVertex, 0):
5 get start TimeIndex;
6 While( !remainingVerticesQueue.isEmptyo)(
7 //select closet one
8 closet = rem ainingVerticesQueue.dequeueOneE]emento;
9 determined Vertices Set. add (closet);
10 //update timelndex
11 timelndex +=graph. getEdgeWeight(source, timelndex, closest)/timestep;
12 //relax
13 While (adjacentVertices.hasNexto){
14 adjV = adjacentVertices.nexto;
15 /only update V that is not determined
16 f(determ inedVertices Set. con ta ins(adj V) 1
17 totalTime = path From Source(closest)
+ getEdgeWeight(closest, timelndex,adjV);
18 if(getShortestPathFromSource(adjV) > totalTime)(
19 //update shortest path result map
20 setShortestPathFromStart(adjV, totalTime);
21 //update predecessor map result
22 thepredecessorMap.put(adjV, closest);
23 remain ingVerticesQueue.insert(adjV, totalTime);
24 }
25 }
26 } //end while for relaxation
27 }
FIG. 5
U.S. Patent Jan. 24, 2012 Sheet 6 of 41 US 8,103,435 B2
O
V
R
as
CL
N
N
co
i
d
Q
Q
O
iv
C
O
CO
c^
Z
LL
0
d
L
O
Y
N
e^

Q
P&
^3
2
U.S. Patent Jan. 24, 2012 Sheet 7 of 41 US 8,103,435 B2
r N N
W^I co001
U I I V I I U
co
ti
L
d
LO
^I
O
r^
V
L
r^
V
LL
co
co QtiI
0
0
L
NQ
IX.L
0 O
M
Z
W mI
w
E
0 ice+
dL
L^ L
G L
Z
C^
V
U.S. Patent Jan. 24, 2012 Sheet 8 of 41 US 8,103,435 B2
•
•
•
•
•
•
•
•
•
a^
U
N
N
t ^ (D
I
N
ff00
O mC NU VLL
O
ZcU (C
•
•
•
•
0
00
U.S. Patent Jan. 24, 2012 Sheet 9 of 41 US 8,103,435 B2
cu
ca
_0 N0
L
N
CNU N
E
!nQ,7
00 O 0
0 :O w
CL
-0
00 O
cu
LL
.L
eo
r_
0
U E
N
>
cu
m LZ
F-- (0
0