【摘要】：伴隨人們的生活節(jié)奏加快,汽車的數(shù)量陡增,由此引發(fā)的交通擁擠問(wèn)題也日益明顯。為此,世界各國(guó)都開始投入人力物力對(duì)交通系統(tǒng)進(jìn)行研究。面對(duì)擁堵的交通,一款智能的交通導(dǎo)航系統(tǒng)能在指導(dǎo)人們出行的同時(shí),在一定程度上也能緩解當(dāng)前擁擠的交通現(xiàn)狀。近幾年來(lái)時(shí)空數(shù)據(jù)庫(kù)的研究日益廣泛和深入,但是在交通導(dǎo)航系統(tǒng)中的應(yīng)用尚未完善。為了提高現(xiàn)有導(dǎo)航的準(zhǔn)確性與時(shí)效性,本論文主要通過(guò)對(duì)基于時(shí)間依賴的最短路徑查詢技術(shù)的研究,設(shè)計(jì)與實(shí)現(xiàn)基于交通路況的高效的導(dǎo)航系統(tǒng),為人們出行提供重要指導(dǎo)。首先,針對(duì)目前國(guó)內(nèi)外導(dǎo)航系統(tǒng)的現(xiàn)狀,結(jié)合當(dāng)前形勢(shì)考慮交通路況,對(duì)基于交通路況的導(dǎo)航系統(tǒng)進(jìn)行需求分析。導(dǎo)航系統(tǒng)的核心為最短路徑問(wèn)題,本論文對(duì)最短路徑求解過(guò)程中存在的問(wèn)題進(jìn)行分析,并對(duì)已有的最短路徑的相關(guān)算法進(jìn)行分析與總結(jié)。其次,研究最短路徑查詢算法Dijkstra與基于時(shí)間依賴的最短路徑查詢算法Dijkstra以及TDSP,根據(jù)算法的工作機(jī)制,設(shè)計(jì)優(yōu)先隊(duì)列堆結(jié)構(gòu)及圖的鄰接表結(jié)構(gòu)。給出導(dǎo)航系統(tǒng)的數(shù)據(jù)集存儲(chǔ)方式,存儲(chǔ)起始點(diǎn)、終止點(diǎn)及表示道路擁護(hù)程度的權(quán)值等信息。然后,結(jié)合交通路況的實(shí)際情況,給出基于交通路況的導(dǎo)航系統(tǒng)的設(shè)計(jì)方案,規(guī)劃系統(tǒng)功能,包括路況導(dǎo)入模塊、路徑選擇模塊以及導(dǎo)航結(jié)果顯示模塊。按照最短路徑查詢算法的實(shí)際需要,給出基于交通路況的導(dǎo)航系統(tǒng)的詳細(xì)設(shè)計(jì)方案。最后,基于MFC框架,開發(fā)基于交通路況的導(dǎo)航系統(tǒng),實(shí)現(xiàn)交通路況的導(dǎo)入功能、最短路徑的選擇功能及導(dǎo)航結(jié)果的顯示功能。進(jìn)行系統(tǒng)測(cè)試,驗(yàn)證導(dǎo)航系統(tǒng)的穩(wěn)定性與準(zhǔn)確性。
[Abstract]:With the rapid pace of people's life, the number of cars has increased sharply, and the traffic congestion problem has become increasingly obvious. For this reason, countries all over the world begin to invest manpower and material resources to carry on the research to the transportation system. In the face of traffic congestion, an intelligent traffic navigation system can guide people to travel, but also alleviate the current traffic congestion to a certain extent. In recent years, the research of spatiotemporal database is more and more extensive, but its application in traffic navigation system is not perfect. In order to improve the accuracy and timeliness of the existing navigation, this paper mainly through the research of the shortest path query technology based on time dependence, designs and implements an efficient navigation system based on traffic conditions, which provides important guidance for people to travel. Firstly, according to the present situation of navigation system at home and abroad, considering the traffic condition, the requirement of navigation system based on traffic condition is analyzed. The core of the navigation system is the shortest path problem. This paper analyzes the problems existing in the process of solving the shortest path, and analyzes and summarizes the existing algorithms of the shortest path. Secondly, the shortest path query algorithm (Dijkstra) and the shortest path query algorithm (Dijkstra) based on time dependence are studied. According to the working mechanism of the algorithm, the structure of priority queue heap and the adjacent table structure of graph are designed by TDSP,. The data set storage method, the starting point, the termination point and the weight value of the road support degree of the navigation system are given. Then, according to the actual situation of the traffic conditions, the design scheme of the navigation system based on the traffic conditions and the function of the planning system are given, including the road condition guide module, the path selection module and the navigation result display module. According to the practical need of shortest path query algorithm, the detailed design scheme of navigation system based on traffic condition is given. Finally, based on the MFC framework, a navigation system based on traffic conditions is developed to realize the function of traffic condition introduction, the selection of shortest path and the display of navigation results. System test to verify the stability and accuracy of the navigation system.
【學(xué)位授予單位】：燕山大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U495;TP301.6

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 ;Research on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra[J];Journal of Measurement Science and Instrumentation;2010年S1期

2 高松;陸鋒;;基于弧段標(biāo)記的交通網(wǎng)絡(luò)時(shí)間最短路徑算法[J];地球信息科學(xué);2008年05期

3 劉志遠(yuǎn);徐擁軍;聶新艷;廖國(guó)衡;賀帥;;基于GIS的耗時(shí)最少路徑誘導(dǎo)系統(tǒng)開發(fā)[J];中國(guó)水運(yùn)(下半月);2009年03期

，

本文編號(hào)：2256235