Mapping Planning Actions and Partially-Ordered Plans into Execution Knowledge
نویسندگان
چکیده
In essence, the underlying ultimate purpose of classical deliberative planning systems is to model some world task and generate plans that can then be executed. Execution systems rely on the assumption that there is a built-in library of a variety of plans and primitive actions for performing tasks. Although hard and time consuming, such libraries of execution plans and actions are usually handcoded. Faced with two different systems, a planner and an executor, we analyze in this work the representational map between planning actions and partially-ordered plans and the execution knowledge. We developed algorithms to automatically translate classical planning operators to execution primitive actions, and partially-ordered plans into executable tasks with partially ordered subtasks. We implemented our work using the PRODIGY planner and the RAP execution system. We provide illustrative examples of how partially-ordered plans produced by PRODIGY are translated to Reactive Action Packages suitable for execution by the RAP system.
منابع مشابه
Planning Partially for Situated Agents
In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partial plans. Total plans can be seen as (partially ordered) sets of actions which, if executed successfully, would lead to the achievement of the goals. Partial plans, instead, can be seen as (partially ordered) sets of actions whi...
متن کاملMultiagent Planning with Partially Ordered Temporal Plans
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL allows to describe both qualitative and quantitative temporal relations among events, thus subsuming the temporal models of both PDDL 2.1 and POP. Other features are different levels of control over actions, modeling of agent...
متن کاملControl Strategies in Planning
Over the years increasing sophisticated planning algorithms have been developed. These have made for more efficient planners. However, current state of the art planners still suffer from severe complexity problems, problems that can surface even in domains in which good plans are easy to generate, like the blocks world. Planners generally employ search to find plans, and planning research has i...
متن کاملFinding User-friendly Linearizations of Partially Ordered Plans
Planning models usually do not discriminate between different possible execution orders of the actions within a plan, as long as the sequence remains executable. As the formal planning problem is an abstraction of the real world, it can very well occur that one linearization is more favorable than the other for reasons not captured by the planning model — in particular if actions are performed ...
متن کاملA. Brogi Et Al. / the Logic of Totally and Partially Ordered Plans 34 7 { Conclusions
In this paper, we have shown that complex planning problems and non-monotonic strategies nd natural logic-based formulations in the framework of deductive database languages. In particular, we have shown how totally and partially ordered plans can both be modeled using XY-stratiied Datalog 1S programs. The framework proposed is exible, amenable to eecient implementation, and supportive of varia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003