【摘要】：車(chē)輛導(dǎo)航軟件是目前車(chē)輛出行必備的工具。目前市場(chǎng)上的導(dǎo)航軟件滿(mǎn)足了普通用戶(hù)日常出行的需要。由于車(chē)體超重、超高、超寬、超長(zhǎng)的特種車(chē)輛對(duì)道路通行能力有特殊要求,市場(chǎng)的導(dǎo)航軟件則沒(méi)有根據(jù)特種車(chē)輛需求條件進(jìn)行定制的功能。特種車(chē)輛出行過(guò)程中經(jīng)常要進(jìn)行較長(zhǎng)路程的行車(chē),因此需要一種面向大數(shù)據(jù)量的路網(wǎng)中快速完成搜路的算法。為了響應(yīng)國(guó)家提倡國(guó)產(chǎn)化的號(hào)召,具有跨平臺(tái)能力的軟件具有很好的發(fā)展前景。本文首先根據(jù)客戶(hù)的需求和國(guó)家政策引出了課題的背景和研究意義,通過(guò)查閱相關(guān)文獻(xiàn)總結(jié)了國(guó)內(nèi)外的Dijkstra算法的優(yōu)化研究的進(jìn)展和車(chē)輛導(dǎo)航軟件在國(guó)內(nèi)外的研究進(jìn)展,總結(jié)了目前市場(chǎng)上的導(dǎo)航軟件不能滿(mǎn)足特種車(chē)輛特殊的需求的問(wèn)題。論文其次介紹了車(chē)輛搜路分析過(guò)程中所需基礎(chǔ)數(shù)據(jù)的結(jié)構(gòu)、存儲(chǔ)方式、為了提升搜路效率對(duì)數(shù)據(jù)的加載所用的數(shù)據(jù)組織方式和結(jié)合特種車(chē)輛自身對(duì)道路需求對(duì)路網(wǎng)數(shù)據(jù)中的“關(guān)鍵點(diǎn)”數(shù)據(jù)做的預(yù)處理。論文接著闡述了車(chē)輛搜路過(guò)程所需要的常規(guī)算法-Dijkstra算法,并在大數(shù)據(jù)路網(wǎng)環(huán)境下的Dijkstra算法的效率做了優(yōu)化和提升。在Dijkstra算法的基礎(chǔ)上結(jié)合特種車(chē)輛對(duì)道路的特殊需求設(shè)計(jì)了根據(jù)特種車(chē)輛用戶(hù)對(duì)道路選擇的條件實(shí)現(xiàn)搜路分析的算法,并進(jìn)行了實(shí)現(xiàn)。論文通過(guò)對(duì)跨平臺(tái)仿組件框架的研究以及對(duì)Qt內(nèi)部圖形框架的學(xué)習(xí)與研究,確定了特種車(chē)輛導(dǎo)航組件的設(shè)計(jì)思路,采用面向?qū)ο蟮姆椒?對(duì)大數(shù)據(jù)量的路網(wǎng)數(shù)據(jù)預(yù)處理,入庫(kù)以及道路“關(guān)鍵點(diǎn)”數(shù)據(jù)的提取和管理,常規(guī)搜路算法以及特種車(chē)輛搜路算法進(jìn)行了詳細(xì)的設(shè)計(jì)與實(shí)現(xiàn)。最后論文通過(guò)具體的實(shí)例,成功地驗(yàn)證了特種車(chē)輛組件各個(gè)功能,實(shí)現(xiàn)了特種車(chē)輛組件能在大數(shù)據(jù)量的路網(wǎng)條件較短時(shí)間內(nèi)完成搜路分析的特性。
[Abstract]:Vehicle navigation software is a necessary tool for vehicle travel. At present, the navigation software in the market meets the daily travel needs of ordinary users. Because the special vehicles with overweight, super-high, ultra-wide and super-long have special requirements for road capacity, the navigation software of the market does not have the function of customizing according to the requirements of special vehicles. Special vehicles often travel a long distance, so we need a fast search algorithm for large amount of data in the road network. In order to respond to the call of nationalization, cross-platform software has a good prospect. Firstly, according to the customer's demand and the national policy, this paper leads to the background and significance of the research, and summarizes the research progress of the Dijkstra algorithm optimization and the vehicle navigation software at home and abroad by consulting the relevant literature. The problems that the navigation software in the market can not meet the special needs of special vehicles are summarized. Secondly, the paper introduces the structure and storage mode of the basic data needed in the process of vehicle search analysis. In order to improve the efficiency of road search, the data organization mode used to load the data and the preprocessing of the "key point" data in the road network data based on the special vehicle itself are proposed. Then, the paper describes the conventional algorithm-Dijkstra algorithm, which is needed in the process of vehicle search, and optimizes and improves the efficiency of the Dijkstra algorithm in the big data network environment. Based on the Dijkstra algorithm and the special demand of the special vehicle to the road, the algorithm of road search analysis is designed according to the condition of the special vehicle user's choice of the road, and the algorithm is implemented. Through the research of cross-platform simulation component framework and the study and research of QT internal graphics framework, this paper determines the design idea of special vehicle navigation component, and uses the object-oriented method to preprocess the road network data of large amount of data. The data extraction and management of the "key points" in the database, the conventional search algorithm and the special vehicle search algorithm are designed and implemented in detail. Finally, through concrete examples, the paper successfully verifies each function of the special vehicle component, and realizes the characteristic that the special vehicle component can complete the road search analysis in the short time of the road network condition of large amount of data.
【學(xué)位授予單位】：鄭州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：U495

【參考文獻(xiàn)】

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

1 李擎,宋頂立,張雙江,李哲,劉建光,王志良;兩種改進(jìn)的最優(yōu)路徑規(guī)劃算法[J];北京科技大學(xué)學(xué)報(bào);2005年03期

2 王杰臣,毛海城,楊得志;圖的節(jié)點(diǎn)-弧段聯(lián)合結(jié)構(gòu)表示法及其在GIS最優(yōu)路徑選取中的應(yīng)用[J];測(cè)繪學(xué)報(bào);2000年01期

3 劉玉海,肖江陽(yáng),張錫恩;一種新型最短路徑搜索算法的研究[J];計(jì)算機(jī)工程與應(yīng)用;2001年17期

4 姚亞鋒;方賢進(jìn);陳代梅;;Dijkstra算法的一種高效率實(shí)現(xiàn)[J];計(jì)算機(jī)與數(shù)字工程;2007年07期

5 胡金星;劉允才;;面向動(dòng)態(tài)導(dǎo)航的城市路網(wǎng)實(shí)時(shí)交通信息服務(wù)系統(tǒng)研究[J];交通與計(jì)算機(jī);2005年06期

6 張國(guó)強(qiáng),晏克非;城市道路網(wǎng)絡(luò)交通特性仿真模型及最短路徑算法[J];交通運(yùn)輸工程學(xué)報(bào);2002年03期

7 朱靜;Dijkstra算法在GIS中的優(yōu)化實(shí)現(xiàn)[J];計(jì)算機(jī)與現(xiàn)代化;2005年09期

8 俞奕;;GIS中最短路徑問(wèn)題的應(yīng)用研究[J];軟件導(dǎo)刊;2007年13期

9 樂(lè)陽(yáng),龔健雅;Dijkstra最短路徑算法的一種高效率實(shí)現(xiàn)[J];武漢測(cè)繪科技大學(xué)學(xué)報(bào);1999年03期

10 衛(wèi)小偉;;城市智能交通控制系統(tǒng)研究與設(shè)計(jì)[J];現(xiàn)代電子技術(shù);2010年17期

相關(guān)碩士學(xué)位論文 前1條

1 蔚潔;車(chē)輛監(jiān)控導(dǎo)航系統(tǒng)中最短路徑的實(shí)時(shí)性研究[D];河北師范大學(xué);2007年

，

本文編號(hào)：2195663