Title
Planning With Recursive Subgoals
Abstract
In this paper, we introduce an effective strategy for subgoal division and ordering based upon recursive subgoals and combine this strategy with a genetic-based planning approach. This strategy can be applied to domains with conjunctive goals. The main idea is to recursively decompose a goal into a set of serializable subgoals and to specify a strict ordering among the subgoals. Empirical results show that the recursive subgoal strategy reduces the size of the search space and improves the quality of solutions to planning problems. © Springer-Verlag 2004.
Publication Date
1-1-2004
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
3214
Number of Pages
17-27
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/978-3-540-30133-2_3
Copyright Status
Unknown
Socpus ID
35048884577 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/35048884577
STARS Citation
Yu, Han; Marinescu, Dan C.; Wu, Annie S.; and Siegel, Howard Jay, "Planning With Recursive Subgoals" (2004). Scopus Export 2000s. 5382.
https://stars.library.ucf.edu/scopus2000/5382