Refining Abstraction Heuristics during Real-Time Planning
نویسندگان
چکیده
منابع مشابه
Refining abstraction heuristics with mutexes
Planning as heuristic search is a powerful approach to solve domain-independent planning problems. An important class of heuristics is based on abstractions of the original planning task. However it comes with loss in precision. The contribution of this thesis is the concept of constrained abstraction heuristics in general, and the application of this concept to pattern database and merge and s...
متن کاملAbstraction Planning in Real Time
ION PLANNING IN REAL TIME a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy By Richard Washington March 1994 c Copyright 1994 by Richard Washington All Rights Reserved
متن کاملEeects of Abstraction on Real-time Planning
Artiicial intelligence systems for complex, time-limited domains must construct and execute plans within varying deadlines. One of the approaches to synthesizing plans within limited deadlines is to build a plan incrementally from the current situation, maintaining a plan preex that can be used when it is necessary to execute an action. The drawback of this approach is the size of the search sp...
متن کاملFlexible Abstraction Heuristics for Optimal Sequential Planning
We describe an approach to deriving consistent heuristics for automated planning, based on explicit search in abstract state spaces. The key to managing complexity is interleaving composition of abstractions over different sets of state variables with abstraction of the partial composites. The approach is very general and can be instantiated in many different ways by following different abstrac...
متن کاملImplicit abstraction heuristics for cost-optimal planning
State-space search with explicit abstraction heuristics is at the state of the art of cost-optimal planning. These heuristics are inherently limited nonetheless, because the size of the abstract space must be bounded by some, even if very large, constant. Targeting this shortcoming, we introduce the notion of (additive) implicit abstractions, in which the planning task is abstracted by instance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33017578