Exploiting macro-actions and predicting plan length in planning as satisfiability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Macro-actions and Predicting Plan Length in Planning as Satisfiability

The use of automatically learned knowledge for a planning domain can significantly improve the performance of a generic planner when solving a problem in this domain. In this work, we focus on the well-known SAT-based approach to planning and investigate two types of learned knowledge that have not been studied in this planning framework before: macro-actions and planning horizon. Macro-actions...

متن کامل

Planning as satisfiability: parallel plans and algorithms for plan search

We address two aspects of constructing plans efficiently by means of satisfiability testing: efficient encoding of the problem of existence of plans of a given number t of time points in the propositional logic and strategies for finding plans, given these formulae for different values of t. For the first problem we consider three semantics for plans with parallel operator application in order ...

متن کامل

Planning with Tests, Branches, and Non-Deterministic Actions as Satisfiability

We present an effective SAT encoding of planning with partial knowledge, tests, branches, and non-deterministic actions. As in recent work on compiling conformant and contingent planning into STRIPS, our encoding is based on representing knowledge states. Unlike previous approaches, however, fluents are conditioned on threads of execution, rather than on alternative choices of the initial state...

متن کامل

Evolving Macro-Actions for Planning

Domain re-engineering through macro-actions (i.e. macros) provides one potential avenue for research into learning for planning. However, most existing work learns macros that are reusable plan fragments and so observable from planner behaviours online or plan characteristics offline. Also, there are learning methods that learn macros from domain analysis. Nevertheless, most of these methods ex...

متن کامل

Plan Merging & Plan Reuse as Satisfiability

Planning as satissability has hitherto focused only on purely generative planning. There is an evidence in traditional reenement planning that planning incrementally by reusing or merging plans can be more eecient than planning from scratch (sometimes reuse is not eecient, but becomes necessary if the cost of abandoning the reusable plan is too high, when users are charged for the planning solu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AI Communications

سال: 2015

ISSN: 0921-7126

DOI: 10.3233/aic-140641