Planning Graph Heuristics for Belief Space Search
نویسندگان
چکیده
منابع مشابه
Planning Graph Heuristics for Belief Space Search
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To place previous work in context and extend work on heuristics for conditional planning, we provide a formal basis for distance estimates between belief states. We give a definition for the distance bet...
متن کاملImproving Heuristics for Planning as Search in Belief Space
Search in the space of beliefs has been proposed as a convenient framework for tackling planning under uncertainty. Significant improvements have been recently achieved, especially thanks to the use of symbolic model checking techniques such as Binary Decision Diagrams. However, the problem is extremely complex, and the heuristics available so far are unable to provide enough guidance for an in...
متن کاملImproving Heuristics for Planning and Search in Belief Space
This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer communications and specificc requests. Afte...
متن کاملBelief Space Reachability Heuristics for Conformant and Contingent Planning
Although reachability heuristics have been shown to be useful in conformant an contingent planning, the cost of heuristic computation is still an issue. We present several improvements of our previous work on planning graph heuristics for planning in belief space. One, we generalize our approach, based on using multiple planning graphs, to symbolically represent many planning graphs in a struct...
متن کاملA search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, we introduce the following clustering hypothesis: the high quality solutions are not randomly scattered in the search space, but rather grouped in clusters within spheres of specific diameter. We first provide intuitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2006
ISSN: 1076-9757
DOI: 10.1613/jair.1869