首页 | 官方网站   微博 | 高级检索  
     

基于马尔可夫过程的水下运动目标启发式搜索
引用本文:吴芳,杨日杰,高青伟.基于马尔可夫过程的水下运动目标启发式搜索[J].电子与信息学报,2010,32(5):1088-1093.
作者姓名:吴芳  杨日杰  高青伟
作者单位:海军航空工程学院电子信息工程系,烟台,264001
基金项目:国家自然科学基金(60572161);;航空基金(20055184005);;“泰山学者”建设工程专项经费资助课题
摘    要:在搜索海域存在障碍的情况下,该文将启发式搜索算法应用于对水下运动目标的搜索,研究了基于马尔可夫过程的运动目标启发式搜索算法。建立了马尔可夫水下运动目标规避模型、搜索器启发式搜索过程模型和马尔可夫水下运动目标的搜索概率模型。该算法由已知的目标先验位置分布信息不断地对目标的运动位置进行估计、更新,以获得精确的目标后验分布,再利用启发函数得到下一步的最佳搜索节点。仿真分析表明:在对水下运动目标搜索时,搜索器能有效地规避障碍,提高搜索效率,有助于研究水下目标的优化搜索。

关 键 词:人工智能  水下运动目标  马尔可夫过程  启发式搜索算法  搜索效率
收稿时间:2009-3-19
修稿时间:2009-12-18

Heuristic Search for Moving Underwater Targets Based on Markov Process
Wu Fang,Yang Ri-jie,Gao Qing-wei.Heuristic Search for Moving Underwater Targets Based on Markov Process[J].Journal of Electronics & Information Technology,2010,32(5):1088-1093.
Authors:Wu Fang  Yang Ri-jie  Gao Qing-wei
Affiliation:Department of Electronic and Information Engineering, Naval Aeronautical and Astronautical University, Yantai 264001, China
Abstract:If there are obstacles in the search sea area, the heuristic search algorithm can be applied into the search process of moving underwater targets, to study the heuristic search for moving underwater targets based on Markov process in this paper. The Markov process motion model of underwater targets, the heuristic search model and search probability model of searcher are built. This algorithm continually estimates and updates the moving underwater targets location based on the target’s prior location distributed information, to gain accurate targets posterior location distribution information, by using the heuristic function to get the next best search node. The simulation shows that the heuristic search can avoid obstacles effectively, when searching the moving underwater targets. Moreover, it can improve search efficiency. It is useful to study on optimization search for moving underwater targets.
Keywords:Artificial intelligence  Moving underwater targets  Markov process  Heuristic search algorithm  Search efficiency
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号