An enhanced real-time path finding methodology

Pao Yue-kong Library Electronic Theses Database

An enhanced real-time path finding methodology

 

Author: Cheung, Man-kit Calvin
Title: An enhanced real-time path finding methodology
Degree: M.Sc.
Year: 2013
Subject: Global Positioning System
Route choice -- Mathematical models.
Hong Kong Polytechnic University -- Dissertations
Department: Dept. of Land Surveying and Geo-Informatics
Pages: viii, 96 p. : ill. (some col.) ; 30 cm.
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b2598734
URI: http://theses.lib.polyu.edu.hk/handle/200/6938
Abstract: Vehicle Navigation System (VNS) device is popular nowadays. Many vehicles are equipped with them for location identification or route searching purpose. As such vehicle navigation device is a standalone system and mainly adopts the pre-installed road network data, it generally cannot make use of the current traffic information for road network analysis. Therefore, it is limited to providing the shortest distance path result for the driver. When the traffic congestion occurs, such system is impossible to provide alternative solution for the user. Even though there are some countries use the Intelligent Traffic System (ITS) for gathering and disseminating the real-time traffic information to drivers, it must rely on many expensive road sensors and electronic display boards installed on roads. Due to its limitations, it cannot be applied everywhere. In this paper, a new system design is proposed to accommodate this situation. The proposed system can be more simply and conveniently capture the current traffic flow information through the VNS with wireless transmission support. It will automatically determine the occurrence of traffic congestion based on the captured real-time traffic information and provide the updated fastest path result to drivers. In order to perform the efficient fastest path analysis when congestion is occurred, a new recalculation method is proposed that can make use of the previous fastest path calculation results to efficiently reduce the number of vertices examined in A* algorithm. Two constraints of A* algorithm applied in real road network are also discussed in this paper.

Files in this item

Files Size Format
b25987343.pdf 2.835Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information