基于约束可满足的深空探测任务规划方法研究

姓名
邮箱
手机号码
标题
留言内容
验证码

doi:10.15982/j.issn.2095-7777.2018.6.008

bob手机在线登陆深空探测技术研究所, 北京 100081;深空自主导航与控制工业和信息化部重点实验室, 北京 100081

基金项目:基础科研计划资助项目（JCKY2016602C018）

Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

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

摘要:基于传统的CSP算法不能充分体现规划过程的特点，讨论了如何将规划中的动作关系映射到CSP结构中，并据此提出了一种以动作为中心的启发式变量选择策略；分析验证了该方法能够显著降低传统CSP变量搜索策略的时间复杂度，同时对于约束编码的规划问题具有一般适用性。仿真实验表明，本文提出的方法减少了约束处理中的冗余操作，有效提高了问题的求解效率，为工程应用奠定了基础。
- 规划/
- 约束可满足/
- 变量选取/
- 动作指向
Abstract:The ordinary CSP algorithms cannot reflect the characteristics of the task planning progress. How the action rules in task planning for deep space exploration can be mapped into the constraint satisfaction problems is discussed. Based on the conclusion,an action directed constraint is proposed to guide the variable selection procedure in constraint satisfaction problems. Through theoretical analysis,the proposed technology can be used in constraint-programmed planning problem. The simulation experiments show that the algorithm with action guided constraint can effectively reduce the number of constraint checks during the planning procedure and has a better performance on total running time over the standard version. It lays the foundation for the application of the project.
- planning/
- constraint satisfaction/
- variable selection/
- action-oriented

[1]	VERFAILLIE G,PRALET C. A timeline,event,and constraint-based modeling framework for planning and scheduling problems[J]. Knowledge Engineering for Planning and Scheduling,2013:61-68.
[2]	ACHLIOPTAS D,HASSANI S H,MACRIS N,et al. New bounds for random constraint satisfaction problems via spatial coupling[C]//Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. USA:Association for Computing Machine,2013.
[3]	BODIRSKY M. Complexity classification in infinite-domain constraint satisfaction[J]. Eprint Arxiv,2012.
[4]	MUSCETTOLA N,PANDURANG N P,PELL B,et al. Remote agent:to boldly go where no AI system has gone before[M]. USA:NASA Ames Research Center,1998.
[5]	PELL B,BERNARD D,CHIEN S,et al. A remote agent prototype for spacecraft autonomy[J]. Proceedings of SPIE-The International Society for Optical Engineering 2810,1996,28(10):74-90.
[6]	CICHY B,CHIEN S,SCHAFFER S. Validating the EO-1 autonomous science agent[C]//International Workshop on Planning and Scheduling for Space. Darmstadt,Germany:[s.n],2004.
[7]	SHERWOOD R,GOVINDJEE A,YAN D,et al. Using ASPEN to automate EO-1 activity planning[C]//Proceedings of the 1998 IEEE Aerospace Conference. Colorado:IEEE,1998.
[8]	PHILIPPE L. Algorithms for propagating resource constraints in AI planning and scheduling. Existing approaches and new results[J]. Artificial Intelligence,2003,143(2):151-188.
[9]	FRANK J,JONSSON A,MORRIS R,et al. planning and scheduling for fleets of earth observing satellites[C]//Proceeding of the 6th International Symposium on Artificial Intelligence Robotics,Automation and Space. Montreal:[s.n],2001.
[10]	DUNGAN J,FRANK J,JONSSON A,et al. Advances in planning and scheduling of remote sensing instruments for fleets of earth orbiting satellites[C]//Proceeding of the 2nd Earth Science Technology Conference. Pasadena,CA,USA:Research Institute for Advanced Computer Science (RIACS),2002.
[11]	仲维国,崔平远,崔祜涛. 航天器复杂约束姿态机动的自主规划[J]. 航空学报,2007,28(5):1091-1097. ZHONG W G,CUI P Y,CUI H T. Autonomous attitude maneuver planning for spacecraft under complex constraints[J]. Acta Aeronautica ET Astronautica Sinica,2007,28(5):1091-1097.
[12]	程小军,崔祜涛,徐瑞. 几何约束下的航天器姿态机动控制[J]. 控制与决策,2012,27(5):724-730. CHENG X J,CUI H T,XU R. Attitude maneuver control of spacecraft under geometric constraints[J]. Control and Decision,2012,27(5):724-730.
[13]	陈德相,徐瑞,崔平远. 航天器资源约束的时间拓扑排序处理方法[J]. 宇航学报,2014,6(6):669-676. CHEN D X,XU R,CUI P Y. A temporal topological sort processing method for spacecraft resources constraints[J]. Journal of Astronautics,2014,6(6):669-676.
[14]	伍丽华,陈蔼祥,姜云飞,等. 时态规划中基于CSP技术的时态约束方法[J]. 计算机学报,2012,35(8):1759-1766. WU L H,CHEN A X,JIANG Y F. A CSP-based approach for temporal constraints in temporal planning[J]. Chinese Journal of Computers,2012,35(8):1759-1766.
[15]	陈德相,徐文明,杜智远. 航天器任务规划中资源约束的可分配处理方法[J]. 深空探测学报,2015,2(2):180-185. CHEN D X,XU W M,DU Z Y. Dispatchable processing method of resource constraint in spacecraft mission planning[J]. Journal of Deep Space Exploration,2015,2(2):180-185.
[16]	赵凡宇,徐瑞. 启发式深空探测器任务规划方法[J]. 宇航学报,2015,36(5):496-503. ZHAN F Y,XU R. Heuristic mission planning approach for deep space explorer[J]. Journal of Astronautics,2015,36(5):496-503.
[17]	JUDGE M,LONG D. A CSP heuristic for AI planning[C]//Proceedings of 20th Automated Reasoning Workshop. UK:School of Computing,University of Dundee,2013.
[18]	PETIT T,BELDICEANU N,LORCA X. A generalized arc-consistency algorithm for a class of counting constraints[J]. IEEE Photonics Technology Letters,2011,24(11):942-944.
[19]	FRATINI S,POLICELLA N. ICKEPS 2012 challenge domain:planning operations on the Mars express mission[J]. International Competition on Knowledge Engineering for Planning and Scheduling,2012,18(18):195-196.

[1]	张顺波, 任红宇, 靳春帅, 刘伟栋, 李春晖, 李勇.火星环绕器高增益天线在轨热设计及波束指向影响分析. 深空探测学报(中英文）, 2023, 10(1): 44-51.doi:10.15982/j.issn.2096-9287.2023.20210089
[2]	柳景兴, 王彬, 毛维杨, 熊新.深空探测器任务规划认知图谱及多属性约束冲突检测. 深空探测学报(中英文）, 2023, 10(1): 88-96.doi:10.15982/j.issn.2096-9287.2023.20220064
[3]	卢皓, 张辉, 张朕, 于天一, 崔晓峰, 胡晓东, 费立刚.火星车多光谱相机桅杆精确指向控制方法. 深空探测学报(中英文）, 2022, 9(5): 1-6.doi:10.15982/j.issn.2096-9287.2022.20220007
[4]	王安然, 王立, 张成渝, 田启航, 华宝成, 李涛, 刘姝含, 李林.小天体SPC特征导航过程中特征选取原则研究. 深空探测学报(中英文）, 2022, 9(4): 1-9.doi:10.15982/j.issn.2096-9287.2022.20220043
[5]	赵宇庭, 徐瑞, 李朝玉, 朱圣英.基于动态智能体交互图的深空探测器任务规划方法. 深空探测学报(中英文）, 2021, 8(5): 519-527.doi:10.15982/j.issn.2096-9287.2021.20210020
[6]	陈超, 徐瑞, 李朝玉.基于状态差异的火星巡视器快速任务规划修复方法. 深空探测学报(中英文）, 2021, 8(2): 124-131.doi:10.15982/j.issn.2096-9287.2021.20200075
[7]	陈上上, 关轶峰, 于萍, 李骥, 张晓文.基于粒子群优化的月球陨石坑探测轨迹规划. 深空探测学报(中英文）, 2020, 7(3): 271-277.doi:10.15982/j.issn.2095-7777.2020.20191031007
[8]	金颢, 徐瑞, 崔平远, 朱圣英.基于状态转移图的启发式深空探测器任务规划方法. 深空探测学报(中英文）, 2019, 6(4): 364-368.doi:10.15982/j.issn.2095-7777.2019.04.008
[9]	朱立颖, 叶志玲, 李玉庆, 付中梁, 徐勇.小天体探测自主绕飞智能规划建模. 深空探测学报(中英文）, 2019, 6(5): 463-469.doi:10.15982/j.issn.2095-7777.2019.05.007
[10]	于天一, 费江涛, 李立春, 程肖.月面巡视器路径规划方法研究. 深空探测学报(中英文）, 2019, 6(4): 384-390.doi:10.15982/j.issn.2095-7777.2019.04.011
[11]	姜啸, 徐瑞, 陈俐均.深空探测器动态约束规划中的外延约束过滤方法研究. 深空探测学报(中英文）, 2019, 6(6): 586-594.doi:10.15982/j.issn.2095-7777.2019.06.010
[12]	熊亮, 王锦清, 孙骥, 关轶峰, 陆波.深空探测器大口径天线指向在轨标定方案. 深空探测学报(中英文）, 2018, 5(6): 554-560.doi:10.15982/j.issn.2095-7777.2018.06.008
[13]	贺波勇, 曹鹏飞, 罗亚中, 李海阳.环月轨道交会的载人登月任务轨道与窗口规划. 深空探测学报(中英文）, 2017, 4(5): 471-476.doi:10.15982/j.issn.2095-7777.2017.05.008
[14]	卜彦龙, 张强, 王航, 梁立波, 邱如金.基于地月合影图像的“嫦娥5T”指向校正算法. 深空探测学报(中英文）, 2017, 4(1): 66-71.doi:10.15982/j.issn.2095-7777.2017.01.010
[15]	魏祥泉, 黄建明, 顾冬晴, 陈凤.火星车自主导航与路径规划技术研究. 深空探测学报(中英文）, 2016, 3(3): 275-281.doi:10.15982/j.issn.2095-7777.2016.03.012
[16]	武长青, 徐瑞, 朱圣英.基于对数势函数的深空探测器姿态规划与控制方法. 深空探测学报(中英文）, 2015, 2(4): 365-370.doi:10.15982/j.issn.2095-7777.2015.04.011
[17]	梁常春, 孙鹏飞, 王耀兵, 危清清, 姜水清.行星采样柔性机械臂运动规划研究. 深空探测学报(中英文）, 2015, 2(1): 27-33.doi:10.15982/j.issn.2095-7777.2015.01.004
[18]	陈德相, 徐文明, 杜智远, 徐瑞.航天器任务规划中资源约束的可分配处理方法. 深空探测学报(中英文）, 2015, 2(2): 180-185.doi:10.15982/j.issn.2095-7777.2015.02.013
[19]	王琼, 于登云, 贾阳.Risk Theta*:一种基于地形危险度的任意航向路径规划算法. 深空探测学报(中英文）, 2014, 1(4): 269-274.doi:10.15982/j.issn.2095-7777.2014.04.004
[20]	董元元, 崔祜涛, 田阳.基于栅格地图的火星车路径规划方法. 深空探测学报(中英文）, 2014, 1(4): 289-293.doi:10.15982/j.issn.2095-7777.2014.04.007

点击查看大图

计量

文章访问数:1694
HTML全文浏览量:110
PDF下载量:696
被引次数:0

留言板

基于约束可满足的深空探测任务规划方法研究

doi:10.15982/j.issn.2095-7777.2018.6.008

Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

计量

基于约束可满足的深空探测任务规划方法研究

doi:10.15982/j.issn.2095-7777.2018.6.008

bob手机在线登陆深空探测技术研究所, 北京 100081;深空自主导航与控制工业和信息化部重点实验室, 北京 100081

English Abstract

Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

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

全文HTML

目录

留言板

基于约束可满足的深空探测任务规划方法研究

doi:10.15982/j.issn.2095-7777.2018.6.008

Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

计量

出版历程

基于约束可满足的深空探测任务规划方法研究

doi:10.15982/j.issn.2095-7777.2018.6.008

bob手机在线登陆 深空探测技术研究所, 北京 100081;深空自主导航与控制工业和信息化部重点实验室, 北京 100081

English Abstract

Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

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

全文HTML

目录

bob手机在线登陆深空探测技术研究所, 北京 100081;深空自主导航与控制工业和信息化部重点实验室, 北京 100081