检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙文[1] 王刚[1] 王晶晶[1] 付强[1] SUN Wen;WANG Gang;WANG Jingjing;FU Qiang(Air and Missile Defense College, Air Force Engineering University, Xi'an 710051, China)
机构地区:[1]空军工程大学防空反导学院,陕西西安710051
出 处:《探测与控制学报》2021年第1期68-72,共5页Journal of Detection & Control
基 金:国家自然科学基金项目资助(61272011);国家自然科学青年基金项目资助(61102109)。
摘 要:针对传统分解策略对高速隐身目标多传感器探测跟踪任务分解存在分解时间长、自适应性低、完备性差等问题,提出了柔性时间任务树分解策略。首先,基于对高速隐身目标多传感器探测跟踪任务分解特点的分析,确立了任务分解的基本准则;然后,以传感器与高速隐身目标的可视化关系为前提和基础,融合“起止时间”、“最长观测时间”、“均匀分割时间”分解法和任务树层次化分解的思想,提出了柔性时间任务树分解策略,该策略能够灵活自适应地调整,对任务进行高效合理地分解;最后,通过案例分析,验证了柔性时间任务树分解策略的合理性和有效性,为未来高速隐身目标探测跟踪任务分配提供了保障。Aiming at the problem of traditional decomposition strategy for the high-speed stealth target(multi-sensors)detection and tracking mission,such as taking much time,low adaptability and poor completeness,the flexible time-mission tree decomposition was proposed.Firstly,based on the analysis of mission decomposition characteristics,the fundamental rule was established.Then,the visual relationship between sensors and HSST was the premise and foundation,combing the decompositions of“the start-end time”,“the longest detecting time”“the average division time”and the hierarchy of mission tree,the flexible time-mission tree decomposition was put forward.The decomposition was adaptive and flexible,which could decompose tasks efficiently and rationally.At last,the reasonability and effectiveness of the proposed decomposition were proved through case analysis.
关 键 词:高速隐身目标 探测跟踪 任务分解 可视化 柔性时间任务树
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.135.25