复杂约束下的导弹作战任务规划模型和算法研究

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题。首先通过定义约束满足效用对基本约束满足模型进行了扩展，建立了导弹任务规划的约束满足优化模型。在此基础上，研究了任务规划模型求解的时间和效用传播算法，提出了基于综合效用的优化求解框架。该模型和求解框架易于解决具有多种约束因素的复杂问题，具有较好的通用性。通过定义软、硬约束效用，使得实际任务规划问题求解具有更好的灵活性。

Research on Model and Algorithm of Missile Operational Mission Planning under Complex Constraints

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.