Planning with recursive subgoals

    Authors

    H. Yu; D. C. Marinescu; A. S. Wu;H. J. Siegel

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Keywords

    SEARCH; Computer Science, Artificial Intelligence; Computer Science, Information; Systems

    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.

    Journal Title

    Knowledge-Based Intelligent Information and Engineering Systems, Pt 2, Proceedings

    Volume

    3214

    Publication Date

    1-1-2004

    Document Type

    Article

    Language

    English

    First Page

    17

    Last Page

    27

    WOS Identifier

    WOS:000224585400003

    ISSN

    0302-9743; 3-540-23206-0

    Share

    COinS