摘要
根据目标区域规划的特点,将目标区域规划形式化为分布式约束满足问题进行求解。建立目标区域规划的分布式约束满足模型,并在分析现有分布式约束满足问题求解算法的基础上,对异步回溯搜索算法进行改进,提出基于分布式约束满足问题的目标区域规划求解框架。仿真结果表明,该方法在求解目标区域规划问题方面有效。
Solution for target area planning （TAP） is formalized as a distributed constraint satisfaction problem （DCSP） based on characters of TAP. First, a DCSP model for TAP is established. Then, based on analysis of the existing algorithms for solving DCSP, the asynchronous backtracking algorithm has been improved, and provides a solving framework of target area planning which based on DCSP. Its solving instance indicates that this approach is available to TAP.
出处
《兵工自动化》
2009年第1期8-11,共4页
Ordnance Industry Automation
基金
航空科学基金(20075185013)
关键词
分布式约束满足问题
目标区域规划
约束分析
异步回溯算法
Distributed constraint satisfaction problem （DCSP）
Target area planning （TAP）
Constraint analysis
Asynchronous backtracking （AB）
