A MOTIVATION-BASED PLANNING AND EXECUTION FRAMEWORK

2004 ◽  
Vol 13 (01) ◽  
pp. 5-25 ◽  
Author(s):  
ALEXANDRA M. CODDINGTON ◽  
MICHAEL LUCK

AI planning systems tend to be disembodied and are not situated within the environment for which plans are generated, thus losing information concerning the interaction between the system and its environment. This paper argues that such information may potentially be valuable in constraining plan formulation, and presents both an agent- and domain-independent architecture that extends the classical AI planning framework to take into account context, or the interaction between an autonomous situated planning agent and its environment. The paper describes how context constrains the goals an agent might generate, enables those goals to be prioritised, and constrains plan selection.

2020 ◽  
Vol 34 (06) ◽  
pp. 9883-9891 ◽  
Author(s):  
Daniel Höller ◽  
Gregor Behnke ◽  
Pascal Bercher ◽  
Susanne Biundo ◽  
Humbert Fiorino ◽  
...  

The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and – much more important – also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems.


1992 ◽  
Vol 01 (03n04) ◽  
pp. 411-449 ◽  
Author(s):  
LEE SPECTOR ◽  
JAMES HENDLER

For intelligent systems to interact with external agents and changing domains, they must be able to perceive and to affect their environments while computing long term projection (planning) of future states. This paper describes and demonstrates the supervenience architecture, a multilevel architecture for integrating planning and reacting in complex, dynamic environments. We briefly review the underlying concept of supervenience, a form of abstraction with affinities both to abstraction in AI planning systems, and to knowledge-partitioning schemes in hierarchical control systems. We show how this concept can be distilled into a strong constraint on the design of dynamic-world planning systems. We then describe the supervenience architecture and an implementation of the architecture called APE (for Abstraction-Partitioned Evaluator). The application of APE to the HomeBot domain is used to demonstrate the capabilities of the architecture.


2003 ◽  
Vol 19 ◽  
pp. 279-314 ◽  
Author(s):  
F. Lin

We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify the effects of actions using domain rules, which are state constraints that can entail new action effects from old ones. Declaratively, an action domain in our language corresponds to a nonmonotonic causal theory in the situation calculus. Procedurally, such an action domain is compiled into a set of logical theories, one for each action in the domain, from which fully instantiated successor state-like axioms and STRIPS-like systems are then generated. We expect the system to be a useful tool for knowledge engineers writing action specifications for classical AI planning systems, GOLOG systems, and other systems where formal specifications of actions are needed.


AI Magazine ◽  
2016 ◽  
Vol 37 (3) ◽  
pp. 116-117 ◽  
Author(s):  
Christian Fritz

This article describes our application of AI planning to the problem of automated process planning for machining parts, given raw stock and a CAD file describing the desired part geometry. We have found that existing planners from the AI community were falling short on several requirements, most importantly regarding the expressivity of state and action representations, and the ability to exploit domain-specific knowledge to prune the search space. In this article we describe the requirements we had in this application and what kind of results from the planning community helped us most. Overall, in this project as well as others, we found that even significant results from domain-independent planning may not be relevant in practice.


2011 ◽  
Vol 40 ◽  
pp. 415-468 ◽  
Author(s):  
W. Ruml ◽  
M. B. Do ◽  
R. Zhou ◽  
M. P.J. Fromherz

We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain requires high-speed autonomous decision-making and robust continual operation. To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning. Our system handles execution failures and multi-objective preferences. At its heart is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling. We suggest that this general architecture may prove useful in other applications as more intelligent systems operate in continual, on-line settings. Our system has been used to drive several commercial prototypes and has enabled a new product architecture for our industrial partner. When compared with state-of-the-art off-line planners, our system is hundreds of times faster and often finds better plans. Our experience demonstrates that domain-independent AI planning based on heuristic search can flexibly handle time, resources, replanning, and multiple objectives in a high-speed practical application without requiring hand-coded control knowledge.


Author(s):  
Dieqiao Feng ◽  
Carla Gomes ◽  
Bart Selman

Despite significant progress in general AI planning, certain domains remain out of reach of current AI planning systems. Sokoban is a PSPACE-complete planning task and represents one of the hardest domains for current AI planners. Even domain-specific specialized search methods fail quickly due to the exponential search complexity on hard instances. Our approach based on deep reinforcement learning augmented with a curriculum-driven method is the first one to solve hard instances within one day of training while other modern solvers cannot solve these instances within any reasonable time limit. In contrast to prior efforts, which use carefully handcrafted pruning techniques, our approach automatically uncovers domain structure. Our results reveal that deep RL provides a promising framework for solving previously unsolved AI planning problems, provided a proper training curriculum can be devised.


2007 ◽  
Vol 22 (2) ◽  
pp. 153-184 ◽  
Author(s):  
Susana Fernández ◽  
Daniel Borrajo ◽  
Raquel Fuentetaja ◽  
Juan D. Arias ◽  
Manuela Veloso

AbsractArtificial intelligence (AI) planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will transform some initial state into some desirable end-state. There is a long tradition of work in AI for developing planners that make use of heuristics that are shown to improve their performance in many real world and artificial domains. The developers of planners have chosen between two extremes when defining those heuristics. The domain-independent planners use domain-independent heuristics, which exploit information only from the ‘syntactic’ structure of the problem space and of the search tree. Therefore, they do not need any ‘semantic’ information from a given domain in order to guide the search. From a knowledge engineering (KE) perspective, the planners that use this type of heuristics have the advantage that the users of this technology need only focus on defining the domain theory and not on defining how to make the planner efficient (how to obtain ‘good’ solutions with the minimal computational resources). However, the domain-dependent planners require users to manually represent knowledge not only about the domain theory, but also about how to make the planner efficient. This approach has the advantage of using either better domain-theory formulations or using domain knowledge for defining the heuristics, thus potentially making them more efficient. However, the efficiency of these domain-dependent planners strongly relies on the KE and planning expertise of the user. When the user is an expert on these two types of knowledge, domain-dependent planners clearly outperform domain-independent planners in terms of number of solved problems and quality of solutions. Machine-learning (ML) techniques applied to solve the planning problems have focused on providing middle-ground solutions as compared to the aforementioned two extremes. Here, the user first defines a domain theory, and then executes the ML techniques that automatically modify or generate new knowledge with respect to both the domain theory and the heuristics. In this paper, we present our work on building a tool, PLTOOL (planning and learning tool), to help users interact with a set of ML techniques and planners. The goal is to provide a KE framework for mixed-initiative generation of efficient and good planning knowledge.


2011 ◽  
Vol 474-476 ◽  
pp. 1830-1835
Author(s):  
Hong Qian ◽  
Ming Xiang Sui ◽  
Yun Fei Jiang ◽  
Dong Hui Zhang ◽  
Heng Guo

There are much research into Artificial Intelligence (AI) and Semantic Web over the past few years and intelligent behaviour such as learning, analysing, problem solving, planning and abstracting is displayed by modern computer systems. Automatically acquiring domain-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training material. In planning, there is a novel ways to search knowledge when solving problems. This Paper presents a new heuristic for carrying out searches of training material, where metadata and the knowledge build into them are captured and fully scalable. These insfrastructure use AI Planning and Ontology technologies, allowing to construct learning rules dynamically based on the general Domain independent Planner even from disjoint learning objects, and meeting the learner’s profile, preferences needs and abilitity. We provide an efficient topology construction and maintenance algorithm, and show how our scheme can be made even more efficient by using a globally known ontology to determine the organization of nodes in the graph topology, allowing for efficient concept-based search.


Sign in / Sign up

Export Citation Format

Share Document