检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李晨光 许卫东 李良涛 刘朝畅 LI Chenguang;XU Weidong;LI Liangtao;LIU Chaochang(Field Engineering College,Army Engineering University of the People’s Liberation Army,Nanjing 210007,China)
出 处:《兵器装备工程学报》2022年第S02期333-336,共4页Journal of Ordnance Equipment Engineering
摘 要:伪装作业的耗时直接关系到阵地整体作战准备周期。以最小化伪装作业时间成本实现伪装需求为目标,基于动态规划算法提出了阵地工程伪装作业时效关系模型,结合算例验证了模型的有效性,解决了伪装作业耗时与伪装效果间的矛盾,可供指挥员和参谋人员快速便捷的优化确定阵地伪装方案借鉴使用。Camouflage is one of the most important measures to guarantee the safety and stability of position engineering.The time-consuming of camouflage operation is directly related to the overall combat preparation cycle of position engineering.Aiming at minimizing the camouflage time cost while satisfying the camouflage requirements,this paper proposes a time-effectiveness relationship model of camouflage operation in position engineering based on dynamic programming algorithm,whose effectiveness is verified as well.The contradiction between camouflage time-consuming and camouflage effect requirements in position engineering is alleviated,which can be used as a reference for commanders and staff to quickly and conveniently optimize and determine the position camouflage scheme.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33