【摘要】：擁堵已成為城市生活中的突出問題，交通擁堵除了引起空氣污染、噪聲污染、能源浪費(fèi)和交通事故外，還降低了城市生活效率，惡化城市居住環(huán)境，降低了城市吸引力。基于浮動車的交通信息服務(wù)系統(tǒng)是解決擁堵問題的有效途徑，系統(tǒng)通過浮動車提供的位置和時間信息，，估計(jì)當(dāng)前路網(wǎng)中每條道路的交通狀態(tài)，出行者依據(jù)這些信息選擇出行路徑和出行時間，從而在空間和時間上緩解高峰流量，減少不必要的交通延誤和擁堵。 本文旨在解決基于浮動車的交通信息服務(wù)系統(tǒng)的關(guān)鍵技術(shù)問題，具體包含兩方面內(nèi)容：高密度路網(wǎng)和低采樣頻率條件下的在線地圖匹配算法，以及基于路網(wǎng)分層的人性化實(shí)時高效的路徑搜索算法。 主輔路并行是深圳市路網(wǎng)的突出特點(diǎn)，這增加了地圖匹配算法的難度。本文將在線地圖匹配問題轉(zhuǎn)化為局部路網(wǎng)中的最短路徑問題。為了建立一種適合深圳市路網(wǎng)特征的地圖匹配算法，本文提出了道路交叉口的交換點(diǎn)模型和多點(diǎn)匹配模式，前者提高了算法在道路交叉口的匹配精度，后者對主輔路旁邊的定位點(diǎn)有良好的區(qū)分度。為了驗(yàn)證算法的精度和效率，在Visual Studio平臺上實(shí)現(xiàn)了本文算法，在深圳市采集了一組浮動車定位數(shù)據(jù)并進(jìn)行了驗(yàn)證。驗(yàn)證結(jié)果表明，本文算法不僅具有較高的精度和效率，還能夠確定主輔路旁邊的定位點(diǎn)的實(shí)際位置，具有極大的實(shí)際應(yīng)用價值。 實(shí)時性和人性化是路徑誘導(dǎo)算法的鮮明要求。為了使輸出結(jié)果符合人們的選擇偏好以及提高路徑搜索的效率，本文建立了一種分層的路徑搜索模型。模型把起點(diǎn)區(qū)域和終點(diǎn)區(qū)域的道路合并到頂層路網(wǎng)中，然后在新的頂層路網(wǎng)中計(jì)算起點(diǎn)和終點(diǎn)的最短路徑。在針對深圳市具體路網(wǎng)的實(shí)例分析中，以快速路以及主干道為基礎(chǔ)，對深圳市路網(wǎng)進(jìn)行分區(qū)和分層處理，對比了本文分層算法和不分層的一般算法在效率和路徑結(jié)果方面的差異。結(jié)果表明，分層算法效率明顯高于一般算法，分層算法結(jié)果路徑中頂層道路比例高，不同層級道路切換次數(shù)少，更符合人們的路徑選擇偏好。 本文兩類算法針對深圳市路網(wǎng)實(shí)際狀況而提出，并用實(shí)際采集或是隨機(jī)選取的數(shù)據(jù)進(jìn)行了驗(yàn)證，算法有較好的精度和效率，具有很高的使用價值。
[Abstract]:Congestion has become a prominent problem in urban life. Traffic congestion not only causes air pollution, noise pollution, energy waste and traffic accidents, but also reduces the efficiency of urban life, deteriorates the urban living environment and reduces the attraction of the city. The traffic information service system based on the floating vehicle is an effective way to solve the congestion problem. The system estimates the traffic state of every road in the current road network through the location and time information provided by the floating vehicle. Based on these information, travelers choose the travel path and travel time to reduce the peak flow in space and time, and reduce unnecessary traffic delays and congestion. This paper aims to solve the key technical problems of traffic information service system based on floating vehicle, including two aspects: the online map matching algorithm under the condition of high density road network and low sampling frequency. And the real-time and efficient path search algorithm based on road network stratification. The parallelism of main and auxiliary roads is a prominent feature of Shenzhen road network, which increases the difficulty of map matching algorithm. In this paper, the online map matching problem is transformed into the shortest path problem in the local road network. In order to establish a map matching algorithm suitable for the road network characteristics of Shenzhen City, this paper proposes a switching point model and a multi-point matching model for road intersections. The former improves the matching accuracy of the algorithm at road intersections. The latter has a good degree of differentiation for the positioning points next to the main and auxiliary roads. In order to verify the accuracy and efficiency of the algorithm, the algorithm is implemented on Visual Studio platform, and a set of floating vehicle positioning data are collected and verified in Shenzhen. The results show that the proposed algorithm not only has high accuracy and efficiency, but also can determine the actual position of the location point next to the main and auxiliary road, which is of great practical value. Real-time and humanization are the distinct requirements of path guidance algorithm. In order to make the output result accord with people's choice preference and improve the efficiency of path search, a hierarchical path search model is established in this paper. The model combines the starting and end roads into the top road network, and then calculates the shortest path of the starting and ending points in the new top road network. In the analysis of the concrete road network in Shenzhen, based on the expressway and the main road, the road network in Shenzhen is divided and stratified. The differences in efficiency and path results between the hierarchical algorithm and the non-delamination algorithm are compared. The results show that the efficiency of the hierarchical algorithm is obviously higher than that of the general algorithm. The result of the hierarchical algorithm results in a high proportion of the top-level roads and less road switching at different levels, which is more in line with people's preference for path selection. In this paper, two kinds of algorithms are proposed according to the actual situation of Shenzhen road network, and verified by the actual data collected or randomly selected. The algorithm has good accuracy and efficiency, and has a high use value.
【學(xué)位授予單位】：清華大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：U495

【參考文獻(xiàn)】

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

1 曹敏暉;;城市交通存在的問題及對策分析[J];重慶交通大學(xué)學(xué)報(bào)(社會科學(xué)版);2009年01期

2 劉宇環(huán);姚恩建;李欣;李建軍;錢越;;浮動車系統(tǒng)地圖的匹配精度[J];公路交通科技;2011年S1期

3 余志文,鄔永宏;淺談智能交通中的電子地圖[J];海南師范學(xué)院學(xué)報(bào)(自然科學(xué)版);2002年02期

4 廖孝勇;孫棣華;周舒杰;田川;古曦;;混合浮動車交通狀態(tài)估計(jì)的樣本數(shù)量研究[J];計(jì)算機(jī)工程與應(yīng)用;2011年24期

5 付夢印,李杰,鄧志紅;基于分層道路網(wǎng)絡(luò)的新型路徑規(guī)劃算法[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2005年04期

6 楊殿閣;羅禹貢;丁捷;李克強(qiáng);連小珉;;基于單線模型的交通車載電子地圖[J];清華大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年05期

7 王曉華,郭敏;GPS衛(wèi)星定位誤差分析[J];全球定位系統(tǒng);2005年01期

8 鐘慧玲;鄺朝劍;黃曉宇;蔡文學(xué);;基于歷史頻繁模式的交通流預(yù)測算法[J];計(jì)算機(jī)工程與設(shè)計(jì);2012年04期

9 劉春,姚連璧;車載導(dǎo)航電子地圖中道路數(shù)據(jù)的空間邏輯描述[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2002年03期

10 李慧兵;楊曉光;;面向行程時間預(yù)測準(zhǔn)確度評價的數(shù)據(jù)融合方法[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年01期

本文編號：2341714