面向目标区域规划的分布式约束满足求解方法  

Solution of Distributed Constraint Satisfaction for Target Area Planning

作　　者：谷学强[1] 陈璟[1] 王克波[1] 

机构地区：[1]国防科学技术大学机电工程与自动化学院,湖南长沙410073

出　　处：《兵工自动化》2009年第1期8-11,共4页Ordnance Industry Automation

基　　金：航空科学基金(20075185013)

摘　　要：根据目标区域规划的特点,将目标区域规划形式化为分布式约束满足问题进行求解。建立目标区域规划的分布式约束满足模型,并在分析现有分布式约束满足问题求解算法的基础上,对异步回溯搜索算法进行改进,提出基于分布式约束满足问题的目标区域规划求解框架。仿真结果表明,该方法在求解目标区域规划问题方面有效。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.

关 键 词：分布式约束满足问题 目标区域规划 约束分析 异步回溯算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP391[自动化与计算机技术—计算机科学与技术]