本文選題：星地數(shù)傳 + 動態(tài)規(guī)劃�。� 參考：《哈爾濱工業(yè)大學(xué)》2015年碩士論文

【摘要】：星地數(shù)傳任務(wù)規(guī)劃問題具有多時間窗口、多約束條件和多求解目標(biāo),其NP-Hard性質(zhì)是衛(wèi)星任務(wù)規(guī)劃優(yōu)化問題的難點之一。尤其是中繼星的使用為數(shù)據(jù)全天候?qū)崟r傳輸提供可能,如何分配有限的地面資源及其可見時間窗口成為亟待解決的問題,為此,本文做了如下三方面工作:第一,設(shè)計Multi-Agent系統(tǒng),建立任務(wù)規(guī)劃模型。本文將Agent系統(tǒng)引入衛(wèi)星數(shù)傳任務(wù)中,設(shè)計聯(lián)邦式和分布式混合結(jié)構(gòu)以實現(xiàn)多部門任務(wù)協(xié)調(diào)。并在此基礎(chǔ)上,構(gòu)建了基于Multi-Agent的星地數(shù)傳任務(wù)分配模型及動態(tài)任務(wù)重調(diào)度模型,進行了基本假設(shè)、符號描述、約束條件滿足,考慮了任務(wù)執(zhí)行收益、資源優(yōu)化的條件,以實現(xiàn)多類型地面站和中繼星的協(xié)同規(guī)劃。第二,設(shè)計動態(tài)規(guī)劃原則,建立誠信可解約招投標(biāo)機制。對于實際情況中出現(xiàn)的動態(tài)規(guī)劃問題,本文設(shè)計了三種調(diào)度原則,并在此基礎(chǔ)上,將動態(tài)性引入誠信合同網(wǎng)協(xié)議中,改進了傳統(tǒng)的合同網(wǎng)機制,提出了可解約的誠信合同網(wǎng)協(xié)議。并進一步設(shè)計了招標(biāo)、投標(biāo)、評標(biāo)策略和分配算法ASD。第三,提出改進的Agent算法,進行仿真實驗。本文提出了改進Agent算法,同時更深層次的挖掘任務(wù)到達(dá)順序與規(guī)劃性能的關(guān)系,緩存數(shù)量與嵌套次數(shù)的相互博弈關(guān)系。在預(yù)設(shè)了仿真環(huán)境的基礎(chǔ)上,將星地數(shù)傳動態(tài)規(guī)劃調(diào)度問題進行多算法的對比分析。
[Abstract]:There are many time windows, multiple constraints and multiple targets in the space-ground data transmission mission planning problem. Its NP-Hard property is one of the most difficult problems in the satellite mission planning optimization problem. In particular, the use of relay satellites provides the possibility for real-time transmission of data around the clock. How to allocate limited ground resources and their visible time windows becomes an urgent problem to be solved. For this reason, the following three aspects of work have been done in this paper: first, the design of Multi-Agent system, The task planning model is established. In this paper, the Agent system is introduced into the satellite data transmission task, and a federated and distributed hybrid structure is designed to achieve multi-department task coordination. On the basis of this, this paper constructs a space-ground data transfer task assignment model and a dynamic task rescheduling model based on Multi-Agent. The basic assumptions, symbolic description, constraint conditions are satisfied, and the conditions of task execution income and resource optimization are considered. In order to achieve multi-type earth station and relay satellite cooperative planning. Second, design the principle of dynamic planning and establish the mechanism of bidding and bidding. In this paper, three scheduling principles are designed for the dynamic programming problems in the actual situation. On this basis, the dynamic characteristics are introduced into the good faith contract net protocol, and the traditional contract network mechanism is improved. In this paper, a retractable protocol of good faith contract net is put forward. Furthermore, the bidding, bid evaluation strategy and allocation algorithm ASD are designed. Thirdly, an improved Agent algorithm is proposed and simulated. In this paper, an improved Agent algorithm is proposed, and the relationship between the order of arrival of mining tasks and the planning performance, the number of caches and the number of nesting is also discussed. On the basis of presupposing the simulation environment, the scheduling problem of space-ground data transmission dynamic programming is compared and analyzed.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：V556

【參考文獻(xiàn)】

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

1 鄭晉軍,張乃通,張麗艷;合理利用測控資源的動態(tài)調(diào)度模型[J];高技術(shù)通訊;2002年07期

2 郝會成;姜維;李一軍;袁子清;;基于Multi-Agent敏捷衛(wèi)星動態(tài)任務(wù)規(guī)劃問題[J];國防科技大學(xué)學(xué)報;2013年01期

3 龐秀麗;于渤;姜維;;成像衛(wèi)星任務(wù)周規(guī)劃模型與算法[J];國防科技大學(xué)學(xué)報;2013年05期

4 李園強;李傳榮;胡堅;李子揚;唐伶俐;;基于貪婪算法的多星多站數(shù)據(jù)接收規(guī)劃[J];科學(xué)技術(shù)與工程;2012年22期

5 孫兵;陳祥國;;混合蟻群優(yōu)化算法求解衛(wèi)星數(shù)傳調(diào)度問題[J];計算機應(yīng)用研究;2012年11期

6 龍運軍;陳宇寧;陳英武;邢立寧;;基于Petri網(wǎng)和混合蟻群算法的多星成像調(diào)度[J];計算機工程;2013年01期

7 宋海偉;肖洋;梁廣;龔文斌;余金培;;基于LVDS的高速數(shù)傳方法研究[J];信息技術(shù);2015年02期

8 ;Task scheduling for multi-electro-magnetic detection satellite with a combined algorithm[J];Journal of Systems Engineering and Electronics;2012年01期

9 ;Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks[J];Journal of Systems Engineering and Electronics;2012年05期

10 李菊芳;賀仁杰;姚鋒;譚躍進;;成像衛(wèi)星集成調(diào)度的變鄰域禁忌搜索算法[J];系統(tǒng)工程理論與實踐;2013年12期

，

本文編號：1940787