深空探测学报（中英文）2025，Vol.12Issue(3)：305-314,10.DOI:10.3724/j.issn.2096-9287.2025.20240063
基于分层约束图的多节点探测器任务规划方法
Multi-Node Probe Task-Planning Method Based on Hierarchical Constraint Graph
摘要
Abstract
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.关键词
多节点探测器/任务规划/分层约束图/约束可满足问题/启发式规则Key words
multi-node probe/task planning/hierarchical constraint graph/constraint satisfaction problem/heuristic rule分类
信息技术与安全科学引用本文复制引用
付康,赵清杰,杨和星..基于分层约束图的多节点探测器任务规划方法[J].深空探测学报（中英文）,2025,12(3):305-314,10.基金项目
国家重点研发计划资助项目(2019YFA0706500) （2019YFA0706500）
