多靜態(tài)節(jié)點(diǎn)DTN中移動(dòng)Agent路徑規(guī)劃研究
[Abstract]:Delay tolerance network (DTN) is a self-organized network which has emerged in recent years. The network is different from the traditional network, such as the network connection is easy to break, the delay is large, and so on. However, because of its practicability, it has aroused many scholars' research. There is a special form of network in DTN, called multi-static node DTN, which has the general characteristics of traditional DTN and some unique features, for example, most of the nodes in the network are in "static" state. There are a few mobile nodes that serve the entire network, such as information collection, data distribution, energy supply, and so on. These nodes are called mobile Agent. The path planning problem of mobile Agent is mainly to find a path scheduling method for mobile nodes in the network. It includes the classical traveling salesman problem, which is used in many network applications. The path planning problem of mobile nodes is a NP combinatorial optimization problem. In this paper, the path planning problem of mobile Agent in multi-static node DTN is studied, and the algorithms of information collection and data distribution are studied respectively. The main contents of this paper are as follows: (1) the information of marine submersible cycle is collected. A heuristic two-hop greedy algorithm is proposed for ship routing planning to collect as much information as possible and quickly. (2) aiming at patients with different severity of illness, a heuristic two-hop greedy algorithm is proposed. In the case of sending an ambulance to transport it to different levels of hospital, a novel algorithm, HAEP., using the improved Hungarian algorithm and taking into account the actual case of emergency patient transportation, is described. The algorithm can efficiently transport all kinds of patients in big cities to hospitals of different levels, reduce the time of ambulance delivery, and strive for the treatment time of emergency patients.
【學(xué)位授予單位】:杭州電子科技大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2016
【分類號(hào)】:TN929.5
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 楊正磊;宋建社;吳永定;郭軍;;多約束條件下戰(zhàn)場(chǎng)導(dǎo)航路徑規(guī)劃問題研究[J];系統(tǒng)仿真學(xué)報(bào);2011年06期
2 艾海舟,張鈸;基于拓?fù)涞穆窂揭?guī)劃問題的圖形解法[J];機(jī)器人;1990年05期
3 鄧文;李實(shí);鄭攀;;基于蟻群算法的路徑規(guī)劃問題研究[J];物流技術(shù);2008年10期
4 胡薈;蔡秀珊;;機(jī)器人三維路徑規(guī)劃問題的一種改進(jìn)蟻群算法[J];計(jì)算機(jī)工程與科學(xué);2012年11期
5 陳剛,沈林成;復(fù)雜環(huán)境下路徑規(guī)劃問題的遺傳路徑規(guī)劃方法[J];機(jī)器人;2001年01期
6 普措才仁;;一種新的編碼方法解決路徑規(guī)劃問題[J];工業(yè)儀表與自動(dòng)化裝置;2011年01期
7 魯子卉;;基于Memetic算法的電子AGV路徑規(guī)劃[J];四川兵工學(xué)報(bào);2013年02期
8 于銳;曹介南;朱培棟;;車輛運(yùn)輸路徑規(guī)劃問題研究[J];計(jì)算機(jī)技術(shù)與發(fā)展;2011年01期
9 馬保離,宗光華,霍偉;非完整鏈?zhǔn)较到y(tǒng)的路徑規(guī)劃——多項(xiàng)式擬合法[J];自動(dòng)化學(xué)報(bào);1999年05期
10 劉全;禹華鋼;劉冰;;基于幾何分析的機(jī)械臂運(yùn)動(dòng)路徑規(guī)劃問題研究[J];數(shù)學(xué)的實(shí)踐與認(rèn)識(shí);2008年14期
相關(guān)會(huì)議論文 前1條
1 王旭;張江;崔平遠(yuǎn);;一種基于蟻群算法求解路徑規(guī)劃問題的新方法[A];2003年中國(guó)智能自動(dòng)化會(huì)議論文集(下冊(cè))[C];2003年
相關(guān)博士學(xué)位論文 前2條
1 張興;信使機(jī)制UAV/UGV多點(diǎn)動(dòng)態(tài)集結(jié)的協(xié)同規(guī)劃方法研究[D];北京理工大學(xué);2015年
2 王沛棟;改進(jìn)蟻群算法及在路徑規(guī)劃問題的應(yīng)用研究[D];中國(guó)海洋大學(xué);2012年
相關(guān)碩士學(xué)位論文 前10條
1 王晨;基于社區(qū)發(fā)現(xiàn)的動(dòng)態(tài)路徑規(guī)劃問題研究[D];哈爾濱工業(yè)大學(xué);2016年
2 林麗琳;供應(yīng)鏈中的車輛路徑規(guī)劃問題研究[D];華僑大學(xué);2015年
3 張麗娜;電動(dòng)汽車路徑規(guī)劃問題研究[D];東華大學(xué);2016年
4 徐彪;多靜態(tài)節(jié)點(diǎn)DTN中移動(dòng)Agent路徑規(guī)劃研究[D];杭州電子科技大學(xué);2016年
5 袁斌;帶訪問限制的需求時(shí)變的移動(dòng)設(shè)施路徑規(guī)劃問題研究[D];清華大學(xué);2014年
6 趙再興;基于改進(jìn)和聲搜索算法的車輛路徑規(guī)劃問題[D];沈陽大學(xué);2011年
7 王星;基于蟻群算法的圖書物流車輛路徑規(guī)劃問題研究[D];武漢理工大學(xué);2011年
8 吳穎;雙層車庫車輛調(diào)度輔助決策支持系統(tǒng)[D];華中科技大學(xué);2011年
9 玉坤;蟻群算法在路徑規(guī)劃問題中的應(yīng)用研究[D];北京工業(yè)大學(xué);2012年
10 弓晨;三維曲面上路徑規(guī)劃問題的研究[D];中國(guó)地質(zhì)大學(xué);2006年
,本文編號(hào):2317530
本文鏈接:http://www.lk138.cn/kejilunwen/xinxigongchenglunwen/2317530.html