舰船电子工程
艦船電子工程
함선전자공정
SHIP ELECTRONIC ENGINEERING
2012年
5期
71-73,80
,共4页
航海作业标绘台%路径选择算法%C语言%算法分析设计
航海作業標繪檯%路徑選擇算法%C語言%算法分析設計
항해작업표회태%로경선택산법%C어언%산법분석설계
chart course plotter%route selection algorithm%C programming language%algorithm analysis and design
海图作业标绘台系统是航海作业与作战系统的重要设备,该设备具有战场态势显示,航迹记录等功能。能够记录、标绘自网络接收到的目标点信息,并将该信息交给海图标绘计算机,后者自动完成标绘动作。传统标绘台不会对输入点集合进行处理,标绘目标点的顺序就是传人的目标点的顺序,该顺序往往并不利于标绘操作。不好的顺序往往造成标绘时间长,标绘效率低的缺点。要提高标绘效率就需要对目标点集合进行合理的排序,选择出合理的标绘路径。文章研究参考了现在已有的路径选择算法,分析了它们的应用范围。通过数学分析,文章设计了一种局部最优的路径选择算法,并且给出了这个算法的C语言实现。通过在一些目标点集合上进行验证,该算法是可行的。该算法是局部最优的,而非全局最优的,在这是该算法需要改进的地方。
海圖作業標繪檯繫統是航海作業與作戰繫統的重要設備,該設備具有戰場態勢顯示,航跡記錄等功能。能夠記錄、標繪自網絡接收到的目標點信息,併將該信息交給海圖標繪計算機,後者自動完成標繪動作。傳統標繪檯不會對輸入點集閤進行處理,標繪目標點的順序就是傳人的目標點的順序,該順序往往併不利于標繪操作。不好的順序往往造成標繪時間長,標繪效率低的缺點。要提高標繪效率就需要對目標點集閤進行閤理的排序,選擇齣閤理的標繪路徑。文章研究參攷瞭現在已有的路徑選擇算法,分析瞭它們的應用範圍。通過數學分析,文章設計瞭一種跼部最優的路徑選擇算法,併且給齣瞭這箇算法的C語言實現。通過在一些目標點集閤上進行驗證,該算法是可行的。該算法是跼部最優的,而非全跼最優的,在這是該算法需要改進的地方。
해도작업표회태계통시항해작업여작전계통적중요설비,해설비구유전장태세현시,항적기록등공능。능구기록、표회자망락접수도적목표점신식,병장해신식교급해도표회계산궤,후자자동완성표회동작。전통표회태불회대수입점집합진행처리,표회목표점적순서취시전인적목표점적순서,해순서왕왕병불리우표회조작。불호적순서왕왕조성표회시간장,표회효솔저적결점。요제고표회효솔취수요대목표점집합진행합리적배서,선택출합리적표회로경。문장연구삼고료현재이유적로경선택산법,분석료타문적응용범위。통과수학분석,문장설계료일충국부최우적로경선택산법,병차급출료저개산법적C어언실현。통과재일사목표점집합상진행험증,해산법시가행적。해산법시국부최우적,이비전국최우적,재저시해산법수요개진적지방。
Course chart plotter was an important navigation and marine combat device which could be used to display the circumstances of battlefield and to record the sailing course. Course chart plotter received and recorded target information received from the onboard local area networks, and handed them to the course plotting computer which accomplishes the plotting task. The conventional Course chart plotter did not process the incoming target point data, and the plotting sequential order was the original point sequential order without any modifica tions. Improperly placed points could inflict a longer plotting time and thus lower the plotting efficiency. Therefore it was necessary to per- mute the points into and proper order and give a fair plotting route. This paper analyzed and referred to some modern and effective route algo- rithms which did little help to the present problerrL The paper also designed a local-optimal route algorithm, and presented the brief imple- mentation of this algorithm in the C programming language. After an experiment on a small point set, we are convinced that the algorithm was effective but still it was not universal-optimal. The algorithm suffered many flaw and was open to improvement.