本文選題：車輛 + 最優(yōu)路線�。� 參考：《浙江工業(yè)大學》2015年碩士論文

【摘要】：隨著越來越多的車輛進入大眾生活中,交通堵塞現(xiàn)象也越來越嚴重。本研究以智能交通網絡為基礎,對車輛行駛的最優(yōu)路徑規(guī)劃方案進行研究。研究內容主要包括：(1)基于交通路徑限制的智能交通路網模型、存儲路網模型的數據結構設計和道路路徑的分層存儲。(2)基于GlS開發(fā)了最優(yōu)智能交通車輛路徑規(guī)劃仿真平臺。基于該仿真平臺,從實際與理論層面對Dijkstra算法、A*算法進行研究。(3)建立了車輛最優(yōu)行駛路徑的靜態(tài)規(guī)劃研究。(4)創(chuàng)建了車輛行駛期間動態(tài)路徑規(guī)劃數學模型,并設計了協(xié)調車輛和自主車輛動態(tài)路徑規(guī)劃的算法,同時對算法進行了實驗。仿真結果表明：在一定范圍內,擁擠道路數與用戶出行代價具有可調節(jié)性,能夠以改變智能交通最優(yōu)與用戶最優(yōu)權重方式,使用戶最優(yōu)動態(tài)路徑規(guī)劃得以滿足。
[Abstract]:With more and more vehicles entering mass life, traffic jam is becoming more and more serious. Based on Intelligent Transportation Network (its), this paper studies the optimal path planning scheme of vehicle. The research contents include: (1) Intelligent Transportation Network Model based on traffic path restriction, data structure design of storage road network model and hierarchical storage of road path. (2) the optimal simulation platform of intelligent transportation vehicle path planning based on GlS is developed. Based on the simulation platform, the static planning of the optimal vehicle path is established from the practical and theoretical aspects of the Dijkstra algorithm. (3) A mathematical model of the dynamic path planning for the vehicle during driving is established. At the same time, the algorithm of coordinating vehicle and autonomous vehicle dynamic path planning is designed, and the algorithm is experimented at the same time. The simulation results show that, in a certain range, the number of congested roads and the travel cost of users are adjustable, and the optimal dynamic path planning of users can be satisfied by changing the optimal weight of intelligent traffic and users.
【學位授予單位】：浙江工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：U495

【相似文獻】

相關期刊論文 前10條

1 王賓 ,溫秉權 ,黃勇;面向21世紀的智能交通系統(tǒng)[J];汽車運用;2000年07期

2 陳小雁;何為智能交通系統(tǒng)[J];交通與運輸;2000年06期

3 朱東輝;智能交通系統(tǒng)發(fā)展展望[J];交通標準化;2001年04期

4 ;智能交通系統(tǒng):解決的不僅僅是交通問題[J];勞動安全與健康;2001年03期

5 鐘鳴;2000年日本智能交通系統(tǒng)新進展[J];全球科技經濟w，

本文編號：1985498