检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李琦 韦道知 李俊伟 LI Qi;WEI Daozhi;LI Junwei(Air Force Engineering University,Xi’an 710043,China;Unit 93605 of PLA,Beijing 102100,China)
机构地区:[1]空军工程大学,西安710043 [2]解放军93605部队,北京102100
出 处:《火力与指挥控制》2024年第7期50-57,共8页Fire Control & Command Control
基 金:国家自然科学基金资助项目(62173339)。
摘 要:为进一步发挥多传感器综合效能和提高资源利用率,最大程度满足对多目标的探测跟踪需求。针对传统多传感器探测网络调度方法存在忽略环境动态变化、考虑任务单一、算法性能偏弱等问题,提出了一种多传感器自适应调度方法,该方法对多传感器调度模型进行分析设计,联合任务优先级、目标威胁度和探测跟踪收益3个指标建立传感器效能函数,以此作为自适应目标函数;通过引入新的局部授粉算子、修改全局授粉过程及设计动态切换概率,来对花朵授粉算法进行改进,并应用到寻优求解过程中;通过仿真实验表明,该方法能够随环境的变化和任务需求自适应对多传感器进行调度,显著提高了多传感器的资源利用率。In order to further bring the comprehensive effect of multiple sensors into play,and to enhance the utilization rate of resources,and to maximize the demand for detection and tracking of multiple targets,a multi-sensor adaptive scheduling method is proposed to address the such issues of traditional multi-sensor scheduling methods as ignoring dynamic environmental changes,considering only a single task,and weak algorithm performance,etc.This method analyzes and designs the multi-sensor scheduling model,establishes a sensor efficiency function by combining three indicators:task priority,target threat degree,and detection and tracking benefits,and uses this as an adaptive objective function.The flower pollination(FP)algorithm is improved by introducing a new local pollination operator,modifying the global pollination process,and designing a dynamic switching probability,and is applied to the optimization solution process.Finally,the simulation experiments show that this method can adaptively schedule multiple sensors according to environmental changes and task requirements and can significantly improve the resource utilization rate of multiple sensors.
关 键 词:目标探测 传感器调度 效能函数 自适应 改进花朵授粉算法
分 类 号:V248.1[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.140.250.157