English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75369/75369 (100%)
Visitors : 25536497      Online Users : 342
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/54453

    Title: 一種滿足損傷條件的火力分配模型及算法;Weapon-target assignment model of Artillery satisfying expected damage probabilities and algorithm
    Authors: 趙世俊;CHAO,SHIH-CHUN
    Contributors: 資訊工程學系碩士在職專班
    Keywords: 資源分配問題;矩陣極值篩選法;火力分配;目標武器分配;多目標最佳化;weapon target assignment;Resource Allocation Problem;fire distribution;multi-objective optimization;matrix maximal filter algorithm
    Date: 2012-07-25
    Issue Date: 2012-09-11 18:51:03 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 現代高科技戰爭的條件下存在著大量火力分配問題,而這些問題往往會耗費很多計算資源和時間,在效率上無法滿足需求。為了求得火力分配問題的全域最佳解,所需要的計算時間將隨著問題規模的增加而呈指數倍增,火力分配問題的基本特性說明想在很短時間內解出大量複雜火力分配問題的全域最佳解並不切實際,只能求其滿意解或可行解。本論文主要研究對特定族群在火力分配問題上所量身訂做的一套演算法,在滿足損傷條件下,成功地在短時間內求解大量複雜的火力分配問題,並使用效益評估效能指標輔助決策者選擇較佳火力分配方案。火力分配問題同時也是多目標最佳化問題,其最佳解通常為一組解集合,解集合中的元素就所有目標而言是彼此間不可比較的。然而,最終只需要一個解,為了找出滿足需求的解,研究中發現沒有單一個別的演算法是最佳方法,相反的,在不同的問題模型層次中有不同的解決方法,取決於使用者需求、使用者偏好和實際的應用面。火力分配問題隨著武器數及目標數的增加,其解將呈現組合爆炸性的趨勢,當問題的規模變大時,包含更多的決策變數和限制條件,為了求得全域最佳解往往耗費相當漫長的計算時間。因此,研究火力分配問題,特別是多武器多目標的大量火力分配問題,尋求較佳的武器目標分配的快速解決方案,提高作戰效能,是當前指揮管制問題中的一個重要課題。There are many problems of fire distribution in modern high tech war, which can often be abstracted to multi-objective optim- ization problems. The mathematics properties of fire distribution mean that obtain optimal global solutions usually impossible in limited time , and the near optimal solutions are thought.The matrix maximal filter algorithm is proposed in the paper, which is used to solve the fire distribution problem with high performance . The measure of effectiveness is designed for comparison of course of actions and could be a good conception of selecting better fire plans.It is found that no single approach is superior. Rather, the selection of a specific method depends on the type of information that is provided in the problem,the user’s preferences, the solution requirements, and the availability of application.The fire distribution problem will become more complicated with the increasing of the number of weapons and targets , there are also include more decision parameters and limited conditions .The solution of optimization can not be guaranteed for the evolutionary algorithms,but consuming many resources and waste much time for computing . Therefor, the study of weapon-target assignment with high performance especial for the multi-object optimization is a key part in the process of command decision making.
    Appears in Collections:[資訊工程學系碩士在職專班 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明