{"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}
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.