首页 | 本学科首页   官方微博 | 高级检索  
     检索      

深空探测器动态约束规划中的外延约束过滤方法研究
作者姓名:姜啸  徐瑞  陈俐均
作者单位:北京航天控制仪器研究所, 北京 100854,北京理工大学 深空探测技术研究所, 北京 100081;深空自主导航与控制工业和信息化部重点实验室, 北京 100081,北京航天控制仪器研究所, 北京 100854
基金项目:国家自然科学基金资助项目(617773061)
摘    要:随着深空探测任务的增加以及星上科学任务的日益复杂,深空探测器自主任务规划与调度技术成为研究的热点。在深空探测器任务特点与系统约束分析的基础上,将智能规划理论与约束可满足技术相结合,研究多层约束规划模型中约束的动态特征,设计了基于动态约束表的外延约束快速过滤算法,根据领域信息中活动间的冲突性特征来对新加入的活动进行分类和一致性检查。仿真结果表明:提出的算法能够有效地降低约束处理中无效的约束检查次数,降低问题处理过程中的算法回溯,提高规划效率和成功率。

关 键 词:规划  约束可满足  过滤算法  外延约束  动态约束集
收稿时间:2018/5/2 0:00:00
修稿时间:2018/6/29 0:00:00

Research on Extensional Constraint Filtering Method Based on Dynamic Constraint Sets
Authors:JIANG Xiao  XU Rui and CHEN Lijun
Institution:Beijing Institute of Space Control Instruments, Beijing 100854, China,Institute of Deep Space Exploration, Beijing Institute of Technology, Beijing 100081, China;Key Laboratory of Autonomous Navigation and Control for Deep Space Exploration, Ministry of Industry and Information Technology, Beijing 100081, China and Beijing Institute of Space Control Instruments, Beijing 100854, China
Abstract:With the development of deep space missions and the complexity of scientific tasks, the autonomous mission planning and scheduling of deep space explorers has become a research hotspot. On the basis of the task characteristics and the analysis of the system constraints of deep space probes,combined the intelligent planning theory with the constraint satisfaction technology,the dynamic characteristics of the constraints in the multi-layer constraint programming model is studied,and the fast extensional constraint filtering algorithm is designed based on the dynamic constraint sets. In this method, the newly added activities are classified according to the conflict between activities in the domain information,and the consistency of variables in the constraint table are checked. The results show that the proposed algorithm can effectively reduce the number of invalid constraints in the constraint processing,reduce the algorithm backtracking in the process of problem processing,and improve the efficiency and success rate of the planning.
Keywords:planning  constraint satisfaction  filtering algorithm  extensional constraint  dynamic constraint set
本文献已被 CNKI 等数据库收录!
点击此处可从《》浏览原始摘要信息
点击此处可从《》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号