Amol Mali and Subbarao Kambhampati, Encoding HTN planning in propositional logic, Proceedings of international conference on Arti cial Intelligence Planning Systems (AIPS), 1998, pp. 190-198.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....1991 ] has the downward solution property. So, using this system, CPlan could fully commit to partial plans at each abstraction level. However, in order to achieve the downward solution property, Tenenberg s system accepts severe restrictions which limit the type of abstractions it can perform. Mali and Kambhampati, 1998 ] formulates HTN planning as constraint satisfaction. Work in case based planning also suggests novel compilation methods for planning as constraint satisfaction systems [ Hanks and Weld, 1995 ] 5 Symmetry breaking Predicates Crawford et al. s symmetry breaking predicates system [ Crawford et ....

A. D. Mali and S. Kambhampati. Encoding HTN planning in propositional logic. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, pages 190--198. Menlo Park, Calif.: AAAI Press, June 1998.

....done in the original work on the SATPLAN system (Kautz Selman 1992) instead of starting with a STRIPS formulation. One advantage of the direct approach is that it makes it easy to express complex intermediate goals and domain specific control knowledge in axiomatic form (Kautz Selman 1998; Mali Kambhampati 1998). Another advantage is in experimenting with different encoding schemata, including action based encodings (similar to the STRIPS conventions treated above) causal encodings (Kautz, McAllester, Selman 1996) and in particular, state based encodings (Kautz Selman 1996) We call an encoding ....

Mali, A., and Kambhampati, S. 1998. Encoding htn planning in propositional logic. In Proceedings Fourth International Conference on AI Planning Systems (AIPS-98). Pittsburgh, PA.

....HTN approaches mentioned in the next section. It is encouraging that this is already starting to occur. For example, there is initial work on adding knowledge about temporal extent of actions to SATPLAN encodings (Smith Weld 1999) and on encoding HTN method knowledge for satisfiability solvers (Mali Kambhampati 1998). Kautz and Selman (1998) identify three kinds of planning knowledge: knowledge about the domain, knowledge about good plans, and explicit search control knowledge. In addition, HTN planners are also concerned with other types of knowledge, such as knowledge about interacting with the user, ....

....for the expense of modeling a new domain. However, we conjecture that building computationally efficient encodings for DPs of complex planning domains is no easier than building HTN models. Many encoding issues are still under study, even for toy domains (Kautz Selman 1999; Brafman 1999; Mali Kambhampati 1998). DPs often start with STRIPSbased encodings, further restricting the types of actions that can be encoded, and causing a possible exponential explosion in the number of operators when context dependent effects are not permitted. Lessons from Machine Learning In every research community, there ....

Mali, A. D., and Kambhampati, S. 1998. Encoding htn planning in propositional logic. In Proc. of the 1998 International Conference on AI Planning Systems, 190--198.

.... both action centered and fluentcentered representations of change, conditional and maintenance goals, causal planning (Kautz, McAllester, Selman 1996) automatic generation of axioms from STRIPS operators (Ernst, Millstein, Weld 1997; Kautz Selman 1999) hierarchical task networks (Mali Kambhampati 1998), and domain specific knowledge (Kautz Selman 1998b) Despite this generality, certain limitations in the framework still prevent it from being used for many practical, real world domains. One problem is the difficulty in dealing with resources and the associated numeric constraints. For ....

Mali., A., and Kambhampati, S. 1998. Encoding htn planning in propositional logic. In Proc. AIPS-98. Pittsburgh, PA.

....the smallest encoding when measured asymptotically, the constant factors are large, and despite several efforts no one has succeeded in building a practical compiler based on the idea. Work has also been done exploring ways of encoding hierarchical task network (HTN) planning [23] as a SAT problem [75]. 3.1.4 Comparison with Graphplan Note the strong similarities between Graphplan derivative and SAT based planning systems. ffl Both approaches convert parameterized action schemata into a finite propositional structure (e.g. the planning graph and a CNF formula) representing the space of ....

A. D. Mali and S. Kambhampati. Encoding HTN planning in propositional logic. In Proc. 4th Intl. Conf. AI Planning Systems, June 1998.

No context found.

Amol Mali and Subbarao Kambhampati, Encoding HTN planning in propositional logic, Proceedings of international conference on Arti cial Intelligence Planning Systems (AIPS), 1998, pp. 190-198.

No context found.

Amol D. Mali and Subbarao Kambhampati, Encoding HTN planning in propositional logic, Proceedings of AIPS-98.

No context found.

A. Mali and S. Kambhampati. Encoding HTN planning in propositional logic. Proc. 4th AI Planning Systems Conf., 1998.

.... Second and perhaps more important, our work also helps us exploit recent progress on action based planners, including SATPLAN [15] and Graphplan [3] in the context of HTN planners [14] Indeed, some of our ongoing work involves adapting the planning as satisfiability approach to HTN planning [17] . As in this paper, our HTN encodings are obtained by generalizing the encodings for action based planning. In theory, it is also possible to represent partially hierarchical domains in existing HTN planners such as SIPE [22] and O Plan [7] as well as in the existing HTN formalizations [8; 2] ....

....planning allows us to put into perspective the many surface differences between HTN and action based planners, and could help in transferring progress between HTN and action based planning approaches. As an example of the latter, we recently extended the SATPLAN [15] approach to HTN planning [17] . ....

A. Mali and S. Kambhampati. Encoding HTN planning in propositional logic. Proc. 4th AI Planning Systems Conf., 1998.

No context found.

Amol D. Mali and Subbarao Kambhampati, Encoding HTN planning in propositional logic, Proceedings of AIPS-98.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC