Axioms in Model-based Planners
نویسندگان
چکیده
Axioms can be used to model derived predicates in domainindependent planning models. Formulating models which use axioms can sometimes result in problems with much smaller search spaces and shorter plans than the original model. Previous work on axiom-aware planners focused solely on statespace search planners. We propose axiom-aware planners based on answer set programming and integer proramming. We evaluate them on PDDL domains with axioms and show that they can exploit additional expressivity of axioms.
منابع مشابه
Optimal Planning with Axioms
The use of expressive logical axioms to specify derived predicates often allows planning domains to be formulated more compactly and naturally. We consider axioms in the form of a logic program with recursively defined predicates and negationas-failure, as in PDDL 2.2. We show that problem formulations with axioms are not only more elegant, but can also be easier to solve, because specifying in...
متن کاملBASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...
متن کاملSituation Calculus with Aspect
In this paper, we describe situation calculus with aspect, which is an extension of the classical situation calculus. The new approach allows eecient representation of the frame axioms and partially ordered plans. In S.C. with aspect, uents and actions are associated with aspects. The frame axioms are replaced by axioms that describe the interference relation between aspects. A plan is represen...
متن کاملIn Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the lack of precise semantics for such axioms, while others have argued that it might be best to compile them away. We propose an adequate semantics for PDDL axioms and show that they are an essential feat...
متن کاملConformant Planning for Domains with Constraints-A New Approach
The paper presents a pair of new conformant planners, CPA and CPA, based on recent developments in theory of action and change. As an input the planners take a domain description D in action language AL which allows state constraints (non-stratified axioms), together with a set of CNF formulae describing the initial state, and a set of literals representing the goal. We propose two approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.03916 شماره
صفحات -
تاریخ انتشار 2017