摘要
针对多节点探测器的附着任务规划问题,提出了一种基于分层约束图的约束可满足任务规划方法。介绍了时间资源约束的表示方式、任务时间网络和分层约束图模型,并将该问题转化为约束可满足问题。该方法通过任务时间网络推理变量的值域信息,并采用基于约束双向支持的弧相容算法进行约束传播。设计了结合层级约束信息的变量启发式规则以及优先满足资源约束的值启发式规则。实验结果验证了所提出方法的有效性。
In this paper,a constraint satisfaction-based task planning method based on the hierarchical constraint graph was proposed for the attachment task planning of a multi-node probe.First,the representation of time-resource constraints,task-time networks,and hierarchical constraint graph models were introduced,and the planning problem was transformed into a constraint satisfaction problem.The method inferred the value range information of variables through the task-time network and employed an arc consistency algorithm with bidirectional constraint support for constraint propagation.In addition,the variable heuristic rules guided by constraint hierarchy information and value heuristic rules that prioritize resource satisfaction were designed.Experimental results demonstrate the effectiveness of the proposed method.
作者
付康
赵清杰
杨和星
FU Kang;ZHAO Qingjie;YANG Hexing(School of Computer Science and Technology,Beijing Institute of Technology,Beijing 100081,China)
出处
《深空探测学报(中英文)》
北大核心
2025年第3期305-314,共10页
Journal Of Deep Space Exploration
基金
国家重点研发计划资助项目(2019YFA0706500)。
关键词
多节点探测器
任务规划
分层约束图
约束可满足问题
启发式规则
multi-node probe
task planning
hierarchical constraint graph
constraint satisfaction problem
heuristic rule
