本文關(guān)鍵詞： 城市交通 分布式 多智能體 人工代謝算法 Dijkstra VISSIM　出處：《西華大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著城市化建設(shè)的日益發(fā)展，越來(lái)越多的車輛加入到城市交通中，城市交通也因此變得越來(lái)越復(fù)雜。尤其是大城市，公民的出行已經(jīng)成為一個(gè)很棘手的問(wèn)題。目前，關(guān)于城市智能交通的研究有很多，主要的算法有遺傳算法、神經(jīng)網(wǎng)絡(luò)和蟻群算法等。但是這些算法所消耗的時(shí)間成本和空間成本過(guò)大，對(duì)于實(shí)時(shí)性要求高的城市交通來(lái)說(shuō)，這不是最佳選擇。 本文采用分布式和多智能體的設(shè)計(jì)方法來(lái)設(shè)計(jì)交通模型，模型中包含五種不同類型的智能體，通過(guò)這些不同類型的智能體來(lái)描述交通場(chǎng)景中的實(shí)體。每個(gè)智能體通過(guò)與相鄰的智能體進(jìn)行通信，獲取自身所需要的交通數(shù)據(jù)。對(duì)于一個(gè)包含多個(gè)路口的交通區(qū)域，，本文采用兩種不同的算法進(jìn)行單路口控制和全局控制。首先對(duì)傳統(tǒng)的人工代謝算法進(jìn)行改進(jìn)并以此計(jì)算單個(gè)路口的信號(hào)方案，然后采用Dijkstra算法對(duì)交通區(qū)域進(jìn)行區(qū)域協(xié)調(diào)控制；傳統(tǒng)的Dijkstra算法主要用于計(jì)算帶權(quán)圖中一個(gè)頂點(diǎn)到其他頂點(diǎn)的最短路徑，這里對(duì)Dijkstra算法進(jìn)行一定的改進(jìn)。 本文采用交通仿真工具VISSIM和Visual Basic對(duì)一個(gè)包含九個(gè)雙向四車道的十字路口的交通區(qū)域進(jìn)行仿真。VISSIM可以模擬真實(shí)交通場(chǎng)景并在仿真后獲取相關(guān)的交通參數(shù)：車輛延時(shí)、等待時(shí)間和車輛速度等，通過(guò)分析這些交通參數(shù)來(lái)對(duì)本文提出的控制方法進(jìn)行評(píng)價(jià)。仿真結(jié)果表明，對(duì)于不同的交通流量，本文提出的交通控制方法在解決區(qū)域交通的擁堵問(wèn)題比定時(shí)控制顯得更為高效。
[Abstract]:With the development of urbanization, more and more vehicles are added to the urban traffic, and the urban transportation becomes more and more complicated. Especially in the big cities, the travel of citizens has become a very difficult problem. There are many researches on urban intelligent transportation, such as genetic algorithm, neural network and ant colony algorithm. This is not the best option. In this paper, a distributed and multi-agent design method is used to design the traffic model, which includes five different types of agents. Entities in traffic scenarios are described by these different types of agents. Each agent communicates with an adjacent agent to obtain the traffic data it needs. For a traffic area with multiple intersections, In this paper, two different algorithms are used for single intersection control and global control. Firstly, the traditional artificial metabolism algorithm is improved to calculate the signal scheme of a single intersection, and then the Dijkstra algorithm is used to control the traffic area. The traditional Dijkstra algorithm is mainly used to calculate the shortest path from one vertex to other vertices in weighted graph. The Dijkstra algorithm is improved in this paper. In this paper, the traffic simulation tools VISSIM and Visual Basic are used to simulate a traffic area with nine two-way four-lane intersections. VisSIM can simulate the real traffic scene and obtain the relevant traffic parameters: vehicle delay. The waiting time and vehicle speed are analyzed to evaluate the control methods proposed in this paper. The simulation results show that, for different traffic flow, The traffic control method proposed in this paper is more efficient than timing control in solving regional traffic congestion.
【學(xué)位授予單位】：西華大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U491.54

【相似文獻(xiàn)】

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

1 張蕾,曹其新,李杰,張春余,張靜永;面向智能維護(hù)的嵌入式無(wú)線預(yù)診斷智能體技術(shù)[J];機(jī)械設(shè)計(jì)與研究;2004年02期

2 潘志庚;楊宏偉;劉箴;;虛擬智能體情感研究綜述[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);2007年12期

3 伍文平;魏明;王東;王剛;;基于可信買方智能體輔助選擇高質(zhì)量賣方模型研究[J];科學(xué)技術(shù)與工程;2008年17期

4 李宏光;宿

本文編號(hào)：1503619