Search

Autonomous systems such as space‐ or underwater‐exploration robots or elderly people assistance robots often include an artificial intelligence (AI) planner as a component. Starting from the initial state of a system, an AI planner automatically generates sequential plans to reach final states that satisfy user‐specified goals. Generating plans having a minimum number of intermediate steps or taking the least time to execute is usually strongly desired, as these plans exhibit minimal costs. Unfortunately, testing if an AI planner generates optimal plans is almost impossible because the expected cost of these plans is usually unknown. Based on mutation adequacy test suite selection, this article proposes a novel metamorphic testing framework for detecting the lack of optimality in AI planners. The general idea is to perform a systematic but non‐exhaustive state space exploration from the initial state and to select mutant‐adequate states to instantiate new planning tasks as follow‐up test cases. We then check a metamorphic relation between the automatically generated solutions of the AI planner for these new test cases and the cost of the initial plan. We implemented this metamorphic testing framework in a tool called MorphinPlan. Our experimental evaluation shows that MorphinPlan can detect non‐optimal behaviour in both mutated AI planners and off‐the‐shelf, configurable planners. It also shows that our proposed mutation adequacy test selection strategy outperforms three alternative test generation and selection strategies, including both random state selection and random walks through the state space in terms of mutation scores. [ABSTRACT FROM AUTHOR]

Deep learning methods have recently emerged as a mechanism for generating embeddings of planning states without the need to predefine feature spaces. In this work, we advocate for an automated, cost-effective and interpretable approach to extract representative features of planning states from high-level language. We present a technique that builds up on the objects type and yields a generalization over an entire planning domain, enabling to encode numerical state and goal information of individual planning tasks. The proposed representation is then evaluated in a task for learning heuristic functions for particular domains. A comparative analysis with one of the best current sequential planner and a recent ML-based approach demonstrate the efficacy of our method in improving planner performance. [ABSTRACT FROM AUTHOR]

Copyright of Automatisierungstechnik is the property of De Gruyter and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Cyber security systems generally have the phenomena of passive defense and low-efficiency early warnings. Aiming at the above problems, this study proposes a real-time warning and plans an AI defense strategy for a cyber security system aided by a security ontology. First, we design a security defense ontology that integrates attack graphs, general purpose and domain-specific knowledge bases, and on this basis, we (1) develop an ontology-driven method of early warnings of real-time attacks, which supports non-intrusive scanning attack detection and (2) combine artificial intelligence planning and bounded rationality to recommend and automatically execute defense strategies in conventional defense scenarios. A case study has been performed, and the results indicate that: (1) the proposed method can quickly analyze network traffic data for real-time warnings, (2) the proposed method is highly feasible and has the ability to implement defense strategies autonomously, and (3) the proposed method performs the best, with a 5.4–11.4% increase in defense effectiveness against the state-of-the-art counterparts considering the APT29 attack. Overall, the proposed method holds the potential to increase the defense effectiveness against cyberattacks under high computing resource constraints. [ABSTRACT FROM AUTHOR]

In sustainable agriculture, intercropping systems represent a valuable approach. These systems involve placing mutually beneficial plant types in close proximity to each other, with the goal of exploiting biodiversity to reduce pesticide and water usage, as well as improve soil nutrient utilization. Despite its potential, the optimization of intercropping systems has received limited attention in previous studies. One of the first steps in the design of an intercropping system is the solution of the crop planting layout problem, which involves meeting crop demand while maximizing positive interactions between adjacent plants. We perform a complexity analysis of this problem and solve it through constraint programming, an artificial intelligence technique, which relies on automated reasoning, constraint propagation and search heuristics. To this aim, we present two constraint programming models based on integer variables and interval variables, respectively. Through a computational study on real-life instances, we examine the impact of different modelling approaches on the difficulty of solving the crop planting layout problem with standard constraint programming solvers. This research work has also provided the groundwork for a sowing robotic arm (under development), aiming to automate intercropping systems and assist farm workers. • We study the Crop Planting Layout Problem. • We perform complexity analysis and use an Artificial Intelligence solving method. • We present two constraint programming models with integer and interval variables. • The computational tests show that our models scale up to 8 species and 1080 plants. [ABSTRACT FROM AUTHOR]

The technology which could make our lives prosper within the four walls could also help to create our own corner of nature nourish. In this paper, we propose a smart gardening system that utilizes the concept of the Internet of Things (IoT) [1]. The major goal of this project is to reduce water consumption when gardening and to maintain the garden remotely. Important plant data, like temperature, relative humidity, and soil moisture, are continuously stored in a relational database in this gardening system. Artificial Intelligence (AI) based planning [2] is used for watering the plants at regular intervals and providing appropriate illumination in the garden area for aesthetics and overall plant growth. Our proposed system reduces the effort due to manual intervention by around 59.3%. The real-time sensor status can be monitored which in turn allows the end-users of the garden to control the surrounding conditions optimal for plant growth, using the Telegram application. A plant recognition model has been introduced in this system, where a Convolutional Neural Network (CNN) [3] based deep learning algorithm classifies the plant categories with 95% accuracy. Moreover, an 98% accurate, deep learning-based, plant health identification model integrated with this gardening system also informs the end-user about the health of the plant. [ABSTRACT FROM AUTHOR]

We present the IBM Research Scenario Planning Advisor (SPA), a decision support system that allows users to generate diverse alternate scenarios of the future and enhance their ability to imagine the different possible outcomes, including unlikely but potentially impactful futures. Our system, takes as input the relevant information from news and social media, representing key risk drivers, as well as the domain knowledge and generates scenarios that explain the key risk drivers and describe the alternative futures. To this end, we provide a characterization of the problem, knowledge engineering methodology, and transformation to AI planning. Furthermore, we describe the computation of the scenarios, lessons learned, and the feedback received from the pilot deployment of the SPA system in IBM. [ABSTRACT FROM AUTHOR]

State space search is a basic method for analyzing reachability in discrete transition systems. To tackle large compactly described transition systems – the state space explosion – a wealth of techniques (e.g., partial-order reduction) have been developed that reduce the search space without affecting the existence of (optimal) solution paths. Focusing on classical AI planning, where the compact description is in terms of a vector of state variables, an initial state, a goal condition, and a set of actions, we add another technique, that we baptize star-topology decoupling , into this arsenal. A star topology partitions the state variables into components so that a single center component directly interacts with several leaf components, but the leaves interact only via the center. Many applications explicitly come with such structure; any classical planning task can be viewed in this way by selecting the center as a subset of state variables separating connected leaf components. Our key observation is that, given such a star topology, the leaves are conditionally independent given the center, in the sense that, given a fixed path of transitions by the center, the possible center-compliant paths are independent across the leaves. Our decoupled search hence branches over center transitions only, and maintains the center-compliant paths for each leaf separately. As we show, this method has exponential separations to all previous search reduction techniques, i.e., examples where it results in exponentially less effort. One can, in principle, prune duplicates in a way so that the decoupled state space can never be larger than the original one. Standard search algorithms remain applicable using simple transformations. Our experiments exhibit large improvements on standard AI planning benchmarks with a pronounced star topology. 1 [ABSTRACT FROM AUTHOR]

In the last decade, many approaches to automated service composition have been proposed. However, most of them do not fully exploit the opportunities offered by the Internet of Services (IoS). In this article, we focus on the dynamicity of the execution environment, that is, any change occurring at run-time that might affect the system, such as changes in service availability, service behavior, or characteristics of the execution context. We indicate that any IoS-based application strongly requires a composition framework that supports for the automation of all the phases of the composition life cycle, from requirements derivation, to synthesis, deployment and execution. Our solution to this ambitious problem is an AI planning-based composition framework that features abstract composition requirements and context-awareness. In the proposed approach most human-dependent tasks can be accomplished at design time and the few human intervention required at run time do not affect the system execution. To demonstrate our approach in action and evaluate it, we exploit the ASTRO-CAptEvo framework, simulating the operation of a fully automated IoS-based car logistics scenario in the Bremerhaven harbor. [ABSTRACT FROM AUTHOR]

There is increasing awareness in the planning community that depending on complete models impedes the applicability of planning technology in many real world domains where the burden of specifying complete domain models is too high. In this paper, we consider the problem of generating robust and accurate plans, when the agent only has access to incomplete domain models, supplanted by a set of successful plan cases. We will develop two classes of approaches – one case-based and the other model-based. ML-CBP is a case-based approach that leverages the incomplete model and the plan cases to solve a new problem directly by affecting case-level transfer. RIM is a model-based approach that uses the incomplete model and the plan cases to first learn a more complete model. This model contains both primitive actions as well as macro-operators that are derived from the plan cases. The learned model is then used in conjunction with an off-the-shelf planner to solve new problems. We present a comprehensive evaluation of the two approaches, both to characterize their relative tradeoffs, and to quantify their advances over existing approaches. [ABSTRACT FROM AUTHOR]

Hierarchies are one of the most common structures used to understand and conceptualise the world. Within the field of Artificial Intelligence (AI) planning, which deals with the automation of world-relevant problems, Hierarchical Task Network (HTN) planning is the branch that represents and handles hierarchies. In particular, the requirement for rich domain knowledge to characterise the world enables HTN planning to be very useful, and also to perform well. However, the history of almost 40 years obfuscates the current understanding of HTN planning in terms of accomplishments, planning models, similarities and differences among hierarchical planners, and its current and objective image. On top of these issues, the ability of hierarchical planning to truly cope with the requirements of real-world applications has been often questioned. As a remedy, we propose a framework-based approach where we first provide a basis for defining different formal models of hierarchical planning, and define two models that comprise a large portion of HTN planners. Second, we provide a set of concepts that helps in interpreting HTN planners from the aspect of their search space. Then, we analyse and compare the planners based on a variety of properties organised in five segments, namely domain authoring, expressiveness, competence, computation and applicability. Furthermore, we select Web service composition as a real-world and current application, and classify and compare the approaches that employ HTN planning to solve the problem of service composition. Finally, we conclude with our findings and present directions for future work. In summary, we provide a novel and comprehensive viewpoint on a core AI planning technique. [ABSTRACT FROM AUTHOR]

Testing concurrent programs is a challenging problem due to interleaving explosion: even for a fixed set of inputs, there is a huge number of concurrent runs that need to be tested to account for scheduler behavior. Testing all possible schedules is not practical. Consequently, most effective testing algorithms only test a select subset of runs. For example, limiting testing to runs that contain data races or atomicity violations has been shown to capture a large proportion of concurrency bugs. In this paper we present a general approach to concurrent program testing that is based on techniques from artificial intelligence (AI) automated planning. We propose a framework for predicting concurrent program runs that violate a collection of generic correctness specifications for concurrent programs, namely runs that contain data races, atomicity violations, or null-pointer dereferences. Our prediction is based on observing an arbitrary run of the program, and using information collected from this run to model the behavior of the program, and to predict new runs that contain bugs with one of the above noted violation patterns. We characterize the problem of predicting such new runs as an AI sequential planning problem with the temporally extended goal of achieving a particular violation pattern. In contrast to many state-of-the-art approaches, in our approach feasibility of the predicted runs is guaranteed and, therefore, all generated runs are fully usable for testing. Moreover, our planning-based approach has the merit that it can easily accommodate a variety of violation patterns which serve as the selection criteria for guiding search in the state space of concurrent runs. This is achieved by simply modifying the planning goal. We have implemented our approach using state-of-the-art AI planning techniques and tested it within the Penelope concurrent program testing framework []. Nevertheless, the approach is general and is amenable to a variety of program testing frameworks. Our experiments with a benchmark suite showed that our approach is very fast and highly effective, finding all known bugs. [ABSTRACT FROM AUTHOR]

With the rising popularity of Web services due to their potential to enable interoperability between applications implemented on different platforms, new issues far more complex and crucial than interoperability have appeared, related mainly to Web services composition. Indeed assuming that for each service request there exists a single Web service that perfectly satisfies it on its own is rather unrealistic, in many cases composing functionalities offered by different services may be needed to satisfy a client request. However, current processes of Web services composition tend to be static in the sense that such processes are normally generated off-line and manual as it requires human intervention to be managed. Therefore in order to give value added customized services to users, recognition is growing of the need for automation and dynamicity to be taking in consideration while designing systems supporting Web services integration. Since automated dynamic composition process allows to reduce the time spent in building composition schema, to eliminate human errors and to reduce the overall cost of the process. Thus our research contribution lies in the area of automated dynamic composition of Web services. We propose a conceptual approach to compose Web services by combining the Semantic Web technologies, Artificial Intelligent Planning methods, Multi-Agent architecture and Self-healing propriety of Autonomic Computing paradigm. [ABSTRACT FROM AUTHOR]

Geospatial web services are widely utilised to disseminate spatial data and processing capability over the internet. Combining geospatial web services and generating composite web services out of atomic services can provide users with a higher level of functionality. This paper presents a solution for the automatic composition of geospatial web services. The solution relies on semantic web services technology and Artificial Intelligence (AI) planning techniques to generate composite geospatial web services. Web Service Modelling Ontology (WSMO) is selected as the underlying semantic web service framework. A neoclassical planning algorithm called Graphplan is used as the AI planner. The applicability of the proposed solution for composing web services is illustrated in a case study. The result shows that the proposed approach is well suited for the automatic composition of web services. The future requirements for adaptation of the approach in real world problems are broadly described. [ABSTRACT FROM AUTHOR]

Highlights: [•] An automatic solution to compose OWSs (OGC web services). [•] OWSs are semantically annotation using RDF and SPARQL. [•] Artificial Intelligence planning is used to compose OWSs. [•] The proposed solution is evaluated through a case-study in evacuation sheltering. [ABSTRACT FROM AUTHOR]

Copyright of Lámpsakos is the property of Fundacion Universitaria Luis Amigo, Facultad de Ingenierias and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In a Web service-based distributed environment, individual services must be chained together dynamically to solve a complex real world problem. The Semantic Web Service has shown promise for automatic chaining of Web services. This paper addresses semi-automatic geospatial service chaining through Semantic Web Services-based process planning. Process planning includes three phases: process modeling, process model instantiation and workflow execution. Ontologies and Artificial Intelligence (AI) planning methods are employed in process planning to help a user dynamically create an executable workflow for earth science applications. In particular, the approach was implemented in a common data and service environment enabled by interoperable standards from OGC and W3C. A case study of the chaining process for wildfire prediction illustrates the applicability of this approach. [ABSTRACT FROM AUTHOR]

Workflow management in the grid era faces many challenges both related to workflow modeling and workflow execution. To deal with the challenges, the paper argues that the traditional process-driven workflow management paradigm should be replaced by a goal-driven one and proposes a corresponding implementation approach. The contributions of the paper are as follows: (1) a concept of process pattern is put forward that is an effective means not only for procedural knowledge representation and sharing but also for expertise exchange between domain experts and computer scientists; (2) based on process patterns, a goal-driven workflow framework is designed that incorporates semantic Web technologies and artificial intelligent (AI) planning techniques and that can (semi-)automatically generate a workflow on the fly according to the requirements of users and the running context. [ABSTRACT FROM AUTHOR]

Abstract: We present an any-time concurrent probabilistic temporal planner (CPTP) that includes continuous and discrete uncertainties and metric functions. Rather than relying on dynamic programming our approach builds on methods from stochastic local policy search. That is, we optimise a parameterised policy using gradient ascent. The flexibility of this policy-gradient approach, combined with its low memory use, the use of function approximation methods and factorisation of the policy, allow us to tackle complex domains. This factored policy gradient (FPG) planner can optimise steps to goal, the probability of success, or attempt a combination of both. We compare the FPG planner to other planners on CPTP domains, and on simpler but better studied non-concurrent non-temporal probabilistic planning (PP) domains. We present FPG-ipc, the PP version of the planner which has been successful in the probabilistic track of the fifth international planning competition. [Copyright &y& Elsevier]

Automated composition of Web services or the process of forming new value-added Web services is one of the most promising challenges facing the Semantic Web today. Semantics enables Web service to describe capabilities together with their processes, hence one of the key elements for the automated composition of Web services. In this paper, we focus on the functional level of Web services i.e. services are described according to some input, output parameters semantically enhanced by concepts in a domain ontology. Web service composition is then viewed as a composition of semantic links wherein the latter links refer to semantic matchmaking between Web service parameters (i.e. outputs and inputs) in order to model their connection and interaction. The key idea is that the matchmaking enables, at run time, finding semantic compatibilities among independently defined Web service descriptions. By considering such a level of composition, a formal model to perform the automated composition of Web services i.e. Semantic Link Matrix, is introduced. The latter model is required as a starting point to apply problem-solving techniques such as regression (or progression)-based search for Web service composition. The model supports a semantic context in order to find correct, complete, consistent and robust plans as solutions. In this paper, an innovative and formal model for an AI (Artificial Intelligence) planning-oriented composition is presented. Our system is implemented and interacting with Web services which are dedicated to Telecom scenarios. The preliminary evaluation results showed high efficiency and effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Adaptive automated planning systems that can, over time, improve the quality of plans they produce are a promising prospect. The first part of the article discusses the issues involved in designing quality improving learning for planning systems and reviews recent work on learning to improve plan quality. The second part describes our work on the Performance Improving Planning (PIP) System. The heart of PIP is an analytic technique that compares two planning episodes for solving a planning problem that led to two different quality solutions—a higher-quality solution and a lower quality solution—and identifies the critical differences that were responsible for the resulting differences in the quality of the completed plans. We compare the effectiveness of two different ways of storing and applying the knowledge learned from this analysis—as search-control rules and as rewrite rules. The results show that the search-control rules are more effective in improving plan quality. Further analysis of PIP-search-control—the version of PIP that stores the learned knowledge as search-control rules—shows that it is an effective technique for improving plan quality in a variety of situations. [ABSTRACT FROM AUTHOR]

This paper presents an alternative to the 'speech acts with STRIPS' approach to implementing dialogue: a fully implemented AI planner which generates and analyses the semantics of utterances using a single linguistic act for all contexts. Using this act, the planner can model problematic conversational situations, including felicitous and infelicitous instances of bluffing, lying, sarcasm, and stating the obvious. The act has negligible effects, and its precondition can always be proved. 'Speaker maxims' enable the speaker to plan to deceive, as well as to generate implicatures, while 'hearer maxims' enable the hearer to recognise deceptions, and interpret implicatures. The planner proceeds by achieving parts of the constructive proof of a goal. It incorporates an epistemic theorem prover, which embodies a deduction model of belief, and a constructive logic. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The aim of AI planning is to solve the problems with no exact solution available. These problems usually have a big search space, and planning may not find plans with the least actions and in the shortest time. Recent researches show that using suitable heuristics can help to find desired plans. In planning problems specified formally through graph transformation system (GTS), there are dependencies between applied rules (actions) in the search space. This fact motivates us to solve the planning problem for a small goal (instead of the main goal), extract dependencies from the searched space, and use these dependencies to solve the planning problem for the main goal. In GTS based systems, the nodes of a state (really is a graph) can be grouped due to their type. To create a small (refined) goal, we use a refinement technique to remove the predefined percent of nodes from each group of the main goal. Bayesian Optimization Algorithm (BOA) is then used to solve the planning problem for the refined goal. BOA is an Estimation of Distribution Algorithm (EDA) in which Bayesian networks are used to evolve the solution populations. Actually, a Bayesian network is learned from the current population, and then this network is employed to generate the next population. Since the last Bayesian network learned in BOA has the knowledge about dependencies between applied rules, this network can be used to solve the planning problem for the main goal. Experimental results on four well-known planning domains confirm that the proposed approach finds plans with the least actions and in the lower time compared with the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]