August 7, 2003 Virtual City : A Heterogeneous System Model of an Intelligent Road Navigation System Incorporating Data Mining Concepts Mike Kofi Okyere.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

1.Transform Roadway network into a mathematical model using Petri Net (PN) as illustrated in Figure 1. This work has been partially supported by the U.S.
Distributed Algorithms for Mobile Sensor Networks Chelsea Sanders Ben Tullis.
ADAPTIVE FASTEST PATH COMPUTATION ON A ROAD NETWORK: A TRAFFIC MINING APPROACH Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Network Analyst Lecture 4. What is network? A network is a system of interconnected elements, such as edges (lines) and connecting junctions (points),
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
GEOG 111 & 211A Transportation Planning Traffic Assignment.
HERO UNIT Training Module Work Zone Traffic Control And Incident Management Operations.
Adaptive Fastest Path Computation on a Road Network : A Traffic Mining Approach Hector Gonzalez Jiawei Han Xiaolei Li Margaret Myslinska John Paul Sondag.
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
4-step Model – Trip Assignment 1CVEN672 Lecture 13-1.
by Spurthi Chaganti S Dayakar Reddy
1 A Vehicle Route Management Solution Enabled by Wireless Vehicular Networks Kevin Collins and Gabriel-Miro Muntean IEEE INFOCOM 2008.
Routing - I Important concepts: link state based routing, distance vector based routing.
An Efficient and Scalable Approach to CNN Queries in a Road Network Hyung-Ju Cho and Chin-Wan Chung Dept. of EECS, KAIST VLDB 2005.
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
Chapter 5. Database Aspects of Location-Based Services Lee Myong Soo Mobile Data Engineering Lab. Dept. of.
The Fourth WIM Meeting 1 Active Nearest Neighbor Queries for Moving Objects Jan Kolar, Igor Timko.
ORF 510: Directed Research II “Analyzing travel time distributions using GPS data” Santiago Arroyo Advisor: Prof. Alain L. Kornhauser January 13 th, 2004.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Ant Colony Optimization Optimisation Methods. Overview.
TEMPLATE DESIGN © Issues and Challenges in Route Guidance: Mr. Tremaine Rawls, Mr. Timothy Hulitt, Dr. Fatma Mili Norfolk.
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
TRIP ASSIGNMENT.
ORF 510: Directed Research II “Analyzing travel time distributions using GPS data” Santiago Arroyo Advisor: Prof. Alain L. Kornhauser January 13 th, 2004.
Intelligent Transportation System Using GIS
GPS Navigation and Data Structures By Michael Cabassol and Augie Hill.
Group 6: Paul Antonios, Tamara Dabbas, Justin Fung, Adib Ghawi, Nazli Guran, Donald McKinnon, Alara Tascioglu Quantitative Capacity Building for Emergency.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.
Technology and Society The DynamIT project Dynamic information services and anonymous travel time registration VIKING Workshop København Per J.
Report Samples. 2 Stop Report Shows where, when and for how long a vehicle has stopped.
Mediamatics / Knowledge based systems Dynamic vehicle routing using Ant Based Control Ronald Kroon Leon Rothkrantz Delft University of Technology October.
University of Maryland Department of Civil & Environmental Engineering By G.L. Chang, M.L. Franz, Y. Liu, Y. Lu & R. Tao BACKGROUND SYSTEM DESIGN DATA.
A Military Logistics and Transportation Security Application.
Swarm Intelligence 虞台文.
1 C-TIP Real Time Traffic Monitoring (RTTM) and Dynamic Route Guidance (DRG) Talking Freight Seminar November 17, 2010 Paul Belella In association with:
Shortest Path Navigation Application on GIS Supervisor: Dr. Damitha Karunaratne Thilani Imalka 2007/MCS/023.
Electrical and Computer Engineering Klaus Kristo Clem Leung Adam Frieden Chris Davidson Faculty: Professor Ramgopal Mettu Project: iPlanAhead Preliminary.
Efficient Route Computation on Road Networks Based on Hierarchical Communities Qing Song, Xiaofan Wang Department of Automation, Shanghai Jiao Tong University,
Group 8: Denial Hess, Yun Zhang Project presentation.
ITS and Electric Vehicles What is the nexus How does the topic relate to STWG.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
1 VII CONSORTIUM VIIC Update Walton Fehr Boulder, CO June 21, 2006.
Enlarging the Options in the Strategy-based Transit Assignment TRB Applications Conference Reno 2011 Isabelle Constantin and Michael Florian INRO.
Huiming Yin, P.E., PhD Liang Wang Paul Maurin Heqin Xu, P.E., PhD Dept. of Civil Engineering & Engineering Mechanics Columbia University Jan 16, 2012 Dynamic.
 Introduction  What is Driverless Car ?  History  Component  Action  Technology  Advantages  Disadvantages  Conclusion  Reference.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
Dynamically Computing Fastest Paths for Intelligent Transportation Systems - ADITI BHAUMICK ab3585.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
I have It is difficult to keep track of each vehicle of my business How Do I do it?
Transportation Planning Asian Institute of Technology
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Shortest Path from G to C Using Dijkstra’s Algorithm
Algorithms Detour - Shortest Path
18-WAN Technologies and Dynamic routing
Finding Fastest Paths on A Road Network with Speed Patterns
Networks and Shortest Paths
Problem 5: Network Simulation
Showcasing work by Jing Yuan, Yu Zheng, Xing Xie, Guangzhou Sun
Path Planning using Ant Colony Optimisation
OSPF Protocol.
Presentation transcript:

August 7, 2003 Virtual City : A Heterogeneous System Model of an Intelligent Road Navigation System Incorporating Data Mining Concepts Mike Kofi Okyere Indiana University - Bloomington Mentors: Professor Edward A. Lee Yang Zhao The New Approach The Intelligent Road Navigation System consists of a dynamic data warehouse that contains real-time road information, ranging from road name and length to road inclination and traffic density. The most efficient route is calculated by an extension of the Dijkstra’s Shortest Path Algorithm to obtain driving directions that focus on minimizing either travel time, gasoline usage, driving mileage or a combination of all. The New Approach The Intelligent Road Navigation System consists of a dynamic data warehouse that contains real-time road information, ranging from road name and length to road inclination and traffic density. The most efficient route is calculated by an extension of the Dijkstra’s Shortest Path Algorithm to obtain driving directions that focus on minimizing either travel time, gasoline usage, driving mileage or a combination of all. Static Road Map Dynamic Road Map Advantages of the Intelligent Road Navigation System Calculates routes by taking into account the various road characteristics in addition to the static data: Congestion & Construction Sites Road Inclination & Weather Condition Enables roadways to operate at peak volume levels Establishes a self-balancing Traffic System Advantages of the Intelligent Road Navigation System Calculates routes by taking into account the various road characteristics in addition to the static data: Congestion & Construction Sites Road Inclination & Weather Condition Enables roadways to operate at peak volume levels Establishes a self-balancing Traffic System Disadvantages of Current Route Planners Calculation of shortest and “fastest” route using static data: Road Length Constant Travel Speed No emphasis is placed on traffic behavior or road specifications Disadvantages of Current Route Planners Calculation of shortest and “fastest” route using static data: Road Length Constant Travel Speed No emphasis is placed on traffic behavior or road specifications Overview Generating satisfactory directions for route guidance is a challenging task, because the effectiveness and advantage of particular routes depend on various road specifications and characteristics. Current route planners, such as MapQuest.com, Yahoo.com and Maps.com, present only limited route options to the drivers of personal or commercial vehicles. Such directions are based on static evaluation criteria and do not consider real-time information related to traffic conditions, road construction, road inclination or weather conditions. Overview Generating satisfactory directions for route guidance is a challenging task, because the effectiveness and advantage of particular routes depend on various road specifications and characteristics. Current route planners, such as MapQuest.com, Yahoo.com and Maps.com, present only limited route options to the drivers of personal or commercial vehicles. Such directions are based on static evaluation criteria and do not consider real-time information related to traffic conditions, road construction, road inclination or weather conditions. SELECT START, END, [LENGTH]/([SPEED]*[TrafficFactor]*[ConstructionFactor])*60 AS TrafficTime FROM Construction INNER JOIN (Traffic INNER JOIN RoadRules ON Traffic.TrafficTypeID = RoadRules.TRAFFIC) ON Construcion.ConstructionSiteTypeID = RoadRules.CONSTRUCTION;" IRNS Sample Run User Input : Start Location: [A1] Destination : [P20] The DataReader actor executes the Query [Fig. 4] on the data warehouse and sends result sets to GraphBuilder actor The GraphBuilder actor converts the received result sets into a directed graph (digraph) and sends the created digraph to the ShortestPath actor The ShortestPath actor verifies the validity of the input nodes and graph, in order to then determine the most efficient route by applying an extension of Dijkstra’s Shortest Path Algorithm IRNS Sample Run User Input : Start Location: [A1] Destination : [P20] The DataReader actor executes the Query [Fig. 4] on the data warehouse and sends result sets to GraphBuilder actor The GraphBuilder actor converts the received result sets into a directed graph (digraph) and sends the created digraph to the ShortestPath actor The ShortestPath actor verifies the validity of the input nodes and graph, in order to then determine the most efficient route by applying an extension of Dijkstra’s Shortest Path Algorithm Figure 1 - Showing the “Fastest” Route using a Static Data Figure 2 – Showing the Fastest Route using Dynamic Data Figure 3 – Showing the Ptolemy II model of the Intelligent Route Navigation System Figure 4 – Showing the Query used to find the shortest travel time between road segments Shortest Path from (a) to (d) is calculated as follows: Graph G = (V, E): V = {a, b, c, d}, E = {(a, b, 4), (a, c, 2), (b, c, 3), (b, d, 1),(c, a, 2), (c, b, 1), (c, d, 5)} 1. Init: d(a) = 0, d(b) = INF., d(c) = INF., d(d) = INF [a,b] = 4 < INF. [set distance from (a)  (b) = 4] 0+ [a,c] = 2 < INF. [set distance from (a)  (c) = 2] [Pick [c]] [b,c] = 3 < 4 [set distance from (a)  (b) = 3] 2 + [b,d] = 7 < INF. [set distance from (a)  (d) = 7] [Pick [b]] [b,d] = 4 [set distance from (a)  (d) = 4] The algorithm stops, since the shortest path has been found. Shortest Path: (a)  (c)  (b)  (d) Dijkstra’s Shortest Path Algorithm