篇名 | 動態任務計畫導向之合作架構 |
---|---|
卷期 | 12:2 |
並列篇名 | A COOPERATION FRAMEWORK BASED ON DYNAMIC MISSION PLANNING ORIENTED |
作者 | 蔡榮隆 、 朱慧德 |
頁次 | 025-033 |
關鍵字 | 戰場管理 、 廣播通訊合作架構 、 錐形一合併策略 、 動態計畫典範 、 Battle management 、 Broadcast communication framework for cooperation 、 Heap-merge strategy 、 Dynamic-planning paradigm |
出刊日期 | 199107 |
本文提出一個問題解的架構一廣播通訊合作架構,即利用廣播通訊方法使分散式的多元處 理系統中的每個處理節點能相互協調,分工合作,共同推理出最滿足的問題解。廣播通訊 合作架構具有合作性、協調性、漸增性、交換性、並行性和多元性之特性。廣播通訊合作架構由兩層的控制系統所組成:區域控制及介控制。區域計畫執行區域控制 ,利用目標及條件的衝突推理法則求得區域性最佳計畫。爲了增加平行及平分負荷,採用 錐形_合併策略,選出最適合的處理節點執行介計畫,匯整區域計畫,依最少確認的方法 ,指派最適合的資源給最需求的任務。這兩層控制交替的相互作用,以求得最佳的問題解。爲證明其可行性,本文將廣播通訊合作架構應用到空軍戰術戰機的攻擊任務計畫,並利用 人工智慧的邏輯語言程式PROLOG硏製了此攻擊任務計畫實例。
This paper presents a problem-solving BCFC framework in which each processing element of multiprocessing system can share, cooperate, and coordinate the assigned subtask to reason a satisfactory merge strategy; 4. Dynamic-planning paradigm. problem since it owns the properties, such as cooperation, coordination, increment, commutativity, parallelism, and pluralism. The BCFC framework consists of two-level control mechanism: meta-control and local control. The local planner executes local optimal solutions by conflict resolution based on the ultimate goal and constraints. The meta-planner is executed by an available processing element which is selected by the heap-mergy strategy, on the least-commitment approach, the resource based the most critical condition. This two level control mechanisms are itinerantly and interchangeably executed to reach a sub-optimal solution. To show the feasibility, the BCFC framework is applied to a dynamic mission plain which is an air-attack mission in battlefield. This application is implemented by Turbo Prolog in IBM-PC compatible computer.