LAV Path Planning by Enhanced Fireworks Algorithm on Prior Knowledge

Author:

Bing Li1,Ning You1,YeHong Du2

Affiliation:

1. Science and Technology on Complex Land Systems Simulation laboratory, Beijing Institute of Special Electromechanical Technology , Beijing 100012 , China

2. Ordnance Test Center , Baicheng 137001 , China

Abstract

Abstract Path planning plays an extremely important role in the design of LAVs (Loitering Air Vehicles) to accomplish the air combat task fleetly and reliably. The planned path should ensure that LAVs reach the destination along the optimal path with minimum probability of being found and minimal consumed fuel. Traditional methods tend to find local best solutions due to the large search space. So it takes a lot of time and consumes a lot of computing resources. In this paper, a new young intelligent algorithm-fireworks algorithm is introduced, and EFWA (enhanced fireworks algorithm)-its enhanced version is used to find the optimal solution. At the same time, the battlefield prior knowledge is fully utilized to predict the existence space of the potential optimal trajectory. Greatly the search space reduced, plan planning efficiency is significantly improved. Path planning method effectiveness in this paper has further been improved compared with FACPSO. Moreover, the EFWA on prior knowledge performs well on the application of dynamic path planning when the threats cruise randomly than FAC-PSO.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3