基于向上回溯机制的HTN空间运行规划方法

Jixiang Cui, Bin Wu, Xuexiang Huang
{"title":"基于向上回溯机制的HTN空间运行规划方法","authors":"Jixiang Cui, Bin Wu, Xuexiang Huang","doi":"10.1109/ISCID.2012.79","DOIUrl":null,"url":null,"abstract":"To reduce ground operational costs and increase overall capability, space powers are competing to develop autonomous planning system of space operation missions. Hierarchical task network (HTN) is the most widely used method to construct automatic planners. for typical HTN algorithm, if the current state does not support any decomposition prescription, the HTN planner will not try to change the state, but just return failure. This characteristic requires personnel to compile a large prescription database, which is time consuming. to overcome this shortcoming, the paper infuses upward-backtracking mechanism to improve HTN algorithm. When the problem above occurs, the improved planner will search higher level tasks and its subtasks to change the system state to support the decomposition of the mission. the promotion could extend the searching range of planner and reduce the compiling of prescription database largely. a typical space operation task is taken as an example to demonstrate the algorithm's property.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Upward-Backtracking Mechanism Infused HTN Planning Approach for Space Operation\",\"authors\":\"Jixiang Cui, Bin Wu, Xuexiang Huang\",\"doi\":\"10.1109/ISCID.2012.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To reduce ground operational costs and increase overall capability, space powers are competing to develop autonomous planning system of space operation missions. Hierarchical task network (HTN) is the most widely used method to construct automatic planners. for typical HTN algorithm, if the current state does not support any decomposition prescription, the HTN planner will not try to change the state, but just return failure. This characteristic requires personnel to compile a large prescription database, which is time consuming. to overcome this shortcoming, the paper infuses upward-backtracking mechanism to improve HTN algorithm. When the problem above occurs, the improved planner will search higher level tasks and its subtasks to change the system state to support the decomposition of the mission. the promotion could extend the searching range of planner and reduce the compiling of prescription database largely. a typical space operation task is taken as an example to demonstrate the algorithm's property.\",\"PeriodicalId\":246432,\"journal\":{\"name\":\"2012 Fifth International Symposium on Computational Intelligence and Design\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2012.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2012.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了降低地面作战成本,提高整体能力,空间大国竞相发展空间作战任务自主规划系统。分层任务网络(HTN)是目前应用最广泛的自动规划方法。对于典型的HTN算法,如果当前状态不支持任何分解处方,HTN规划器将不会尝试改变状态,而只返回失败。这一特点需要人员编制庞大的处方数据库,耗时较长。为了克服这一缺点,本文引入了向上回溯机制来改进HTN算法。当出现上述问题时,改进的规划器将搜索更高级别的任务及其子任务,改变系统状态,以支持任务分解。这一改进大大扩大了计划者的搜索范围,减少了处方数据库的编制。以一个典型的空间操作任务为例,验证了该算法的特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Upward-Backtracking Mechanism Infused HTN Planning Approach for Space Operation
To reduce ground operational costs and increase overall capability, space powers are competing to develop autonomous planning system of space operation missions. Hierarchical task network (HTN) is the most widely used method to construct automatic planners. for typical HTN algorithm, if the current state does not support any decomposition prescription, the HTN planner will not try to change the state, but just return failure. This characteristic requires personnel to compile a large prescription database, which is time consuming. to overcome this shortcoming, the paper infuses upward-backtracking mechanism to improve HTN algorithm. When the problem above occurs, the improved planner will search higher level tasks and its subtasks to change the system state to support the decomposition of the mission. the promotion could extend the searching range of planner and reduce the compiling of prescription database largely. a typical space operation task is taken as an example to demonstrate the algorithm's property.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信