Research on Model and Algorithm of Missile Operational Mission Planning under Complex Constraints
GU Li-lin · Command Control & Simulation · 2009
Missile operational mission planning is a complex problem relate to time, resource, quality and other constraints. Basic constraint satisfaction model is extended through defining constraint satisfaction utility at first. A constraint satisfaction optimize model about missile operational mission planning is made. On the basis, algorithms of time promulgate and utility promulgate are studied. A optimize resolving frame is presented based on integration utility. The model and algorithm frame not only are easy to solve complex problems that have manifold constraints, but also have preferable general performance. Through defining soft and hard constraints, mission planning in practice will have further flexible.