DocumentCode
589352
Title
Upward-Backtracking Mechanism Infused HTN Planning Approach for Space Operation
Author
Jixiang Cui ; Bin Wu ; Xuexiang Huang
Author_Institution
Space Oper. Lab., Beijing Inst. of Tracking & Telecommun. Technol., Beijing, China
Volume
1
fYear
2012
fDate
28-29 Oct. 2012
Firstpage
285
Lastpage
289
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.
Keywords
aerospace computing; cost reduction; planning; autonomous planning system; ground operational cost reduction; hierarchical task network planning approach; prescription database; space operation mission; upward-backtracking mechanism; Antennas; Databases; Maintenance engineering; Planning; Search problems; Space missions; Space vehicles; automatic planning; space operation; upward-backtracking;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Design (ISCID), 2012 Fifth International Symposium on
Conference_Location
Hangzhou
Print_ISBN
978-1-4673-2646-9
Type
conf
DOI
10.1109/ISCID.2012.79
Filename
6406855
Link To Document