Fast Matching of Planning Schemes Based on DTW
ZHANG Zheng
ZHANG Deping
Abstract：The current level of intelligent technology cannot achieve credible combat program fully autonomous generation to cope with a variety of unexpected situations in the operational program of impromptu adjustment,the use of the usual accumulation of operational planning data for rapid matching and recommendation of operational programs is an effective way to achieve rapid and efficient mission planning for operational dynamic targets.In this paper,an automatic matching and dynamic recommendation meth-od for combat scenarios is proposed based on dynamic time regularization(DTW)algorithm,which realizes the use of DTW algo-rithm to calculate the similarity between scenarios and quickly match available scenarios with combat resources based on combat in-tent and real-time situational time series data,and the method can better consider the"human in the loop"in combat scenarios commander's business preferences on the impact of changes in the combat situation,and can be based on the consideration of the commander's decision intent to give the recommended ranking,the introduction of the lower boundary value distance search strategy to achieve rapid decision program retrieval,accurate recommendation of the appropriate combat plan,to assist the commander to ad-just the combat program on the fly,effectively improve combat effectiveness.
Keywords：solution quick matchdynamic time warpingsimilarity
Publication Date：2024-09-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 26-30 )