运动目标快速搜索辨识的路径规划  

A Model for Quick Searching and Recognizing Path of a Moving Target

作　　者：袁俊华[1] 年福耿 刘李楠[1] 

机构地区：[1]海军蚌埠士官学校基础部

出　　处：《科学技术与工程》2013年第24期7093-7097,共5页Science Technology and Engineering

摘　　要：运动目标快速搜索辨识问题属于路径规划,与背包问题以及推销员最佳路线问题相似,但又存在明显区别:前者问题目标是运动的,后者是静止的;当运动目标是待辨识可疑船只时,还要考虑多种因素和资源。基于此,提出"动静结合",在利用Hamilton回路算法和Kruskal避圈法的基础上,设计截相遇迭代算法,并根据目标的威胁等级以及聚集程度建立最优搜索策略。The problem to search and identify the path of a moving is a path planning problem. It is similar to knappack problem and best saleman route, but with significant differences： problem targets at moving objects, while other problems deal with static situation. Especially when the target is a suspicious ship, the safety of convoy should be also considered. Based on this, a model combining target movement and static condition are proposd. Model use the Hamilton loop optimal algorithm and Kruskal~ algorithm to establish a optimal search strategy, with a cut-off encounter algorithm to solving the problem.

关 键 词：最小生成树 HAMILTON回路 威胁等级 截相遇 搜索策略 最短路径 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]