PC-SHOP: A Probabilistic-Conditional Hierarchical Task Planner
نویسندگان
چکیده
SOMMARIO/ABSTRACT In this paper we report on the extension of the classical HTN planner SHOP to plan in partially observable domains with uncertainty. Our algorithm PC-SHOP uses belief states to handle situations involving incomplete and uncertain information about the state of the world. Sensing and acting are integrated in the primitive actions through the use of a stochastic model. PC-SHOP is showed to scale up well compared to some of the state-of-the-art planners. We outline the main characteristics of the algorithm, and present performance results on some problems found in the literature .
منابع مشابه
SHOP: Simple Hierarchical Ordered Planner
SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planni...
متن کاملHierarchical Task Planning under Uncertainty
In this paper we present an algorithm for planning in nondeterministic domains. Our algorithm C-SHOP extends the successful classical HTN planner SHOP, by introducing new mechanisms to handle situations where there is incomplete and uncertain information about the state of the environment. Being an HTN planner, C-SHOP supports coding domain-dependent knowledge in a powerful way that describes h...
متن کاملHOTRiDE: Hierarchical Ordered Task Replanning in Dynamic Environments
One of the assumptions in classical planning is that the environment is static: i.e., the planner is the only entity that can induce changes in the environment. A more realistic assumption is that the environment is dynamic; that is, there are other entities in the world and the actions generated by the planner may fail due to the operations of these entitites. In this paper, we describe a plan...
متن کاملAdaptation of Hierarchical Task Network Plans
This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair. RepairSHOP is built on top of the HTN planner SHOP. RepairSHOP has three properties. The first property is its design modularity, which makes it is straightforward to apply the same process discussed in this paper to build plan adaptation capabilities in other HTN planners. Second, RepairSHOP can perf...
متن کاملAnytime Planning For Agent Behaviour
For an agent to act successfully in a complex and dynamic environment (such as a computer game) it must have a method of generating future behaviour that meets the demands of its environment. One such method is anytime planning. This paper discusses the problems and benefits associated with making a planning system work under the anytime paradigm, and introduces AnytimeUMCP (A-UMCP), an anytime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Intelligenza Artificiale
دوره 2 شماره
صفحات -
تاریخ انتشار 2005