A Critical Look at the Abstraction Based on Macro-Operators

Abstraction can be an effective technique for dealing with the complexity of planning tasks. This paper is aimed at assessing and identifying in which cases abstraction can actually speed-up the overall search. In fact, it is well known that the impact of abstraction on the time spent to search for a solution of a planning problem can be positive or negative, depending on several factors -including the number of objects defined in the domain, the branching factor, and the plan length. Experimental results highlight the role of such aspects on the overall performance of an algorithm that performs the search at the ground-level only, and compares them with the ones obtained by enforcing abstraction

A Parametric Hierarchical Planner for Experimenting Abstraction Techniques

This paper presents a parametric system, devised and implemented to perform hierarchical planning by delegating the actual search to an external planner (the "parameter") at any level of abstraction, including the ground one. Aimed at giving a better insight of whether or not the exploitation of abstract spaces can be used for solving complex planning problems, comparisons have been made between instances of the hierarchical planner and their non hierarchical counterparts. To improve the significance of the results, three different planners have been selected and used while performing experiments. To facilitate the setting of experimental environments, a novel semi-automatic technique, used to generate abstraction hierarchies starting from ground-level domain descriptions, is also described

PACMAS: A Personalized, Adaptive, and Cooperative MultiAgent System Architecture

In this paper, a generic architecture, designed to support the implementation of applications aimed at managing information among different and heterogeneous sources, is presented. Information is filtered and organized according to personal interests explicitly stated by the user. User pro- files are improved and refined throughout time by suitable adaptation techniques. The overall architecture has been called PACMAS, being a support for implementing Personalized, Adaptive, and Cooperative MultiAgent Systems. PACMAS agents are autonomous and flexible, and can be made personal, adaptive and cooperative, depending on the given application. The peculiarities of the architecture are highlighted by illustrating three relevant case studies focused on giving a support to undergraduate and graduate students, on predicting protein secondary structure, and on classifying newspaper articles, respectively

A two-tiered 2D visual tool for assessing classifier performance

In this article, a new kind of 2D tool is proposed, namely ⟨φ δ⟩ diagrams, able to highlight most of the information deemed relevant for classifier building and assessment. In particular, accuracy, bias and break-even points are immediately evident therein. These diagrams come in two different forms: the first is aimed at representing the phenomenon under investigation in a space where the imbalance between negative and positive samples is not taken into account, the second (which is a generalization of the first) is able to visualize relevant information in a space that accounts also for the imbalance. According to a specific design choice, all properties found in the first space hold also in the second. The combined use of φ and δ can give important information to researchers involved in the activity of building intelligent systems, in particular for classifier performance assessment and feature ranking/selection

An Adaptive Approach for Planning in Dynamic Environments

Planning in a dynamic environment is a complex task that requires several issues to be investigated in order to manage the associated search complexity. In this paper, an adaptive behavior that integrates planning with learning is presented. The former is performed adopting a hierarchical approach, interleaved with execution. The latter, devised to identify new abstract operators, adopts a chunking technique on successful plans. Integration between planning and learning is also promoted by an agent architecture explicitly designed for supporting abstraction

The Beneficial Role of Mobility for the Emergence of Innovation

Innovation is a key ingredient for the evolution of several systems, including social and biological ones. Focused investigations and lateral thinking may lead to innovation, as well as serendipity and other random discovery processes. Some individuals are talented at proposing innovation (say innovators), while others at deeply exploring proposed novelties, at getting further insights on a theory, or at developing products, services, and so on (say developers). This separation in terms of innovators and developers raises an issue of paramount importance: under which conditions a system is able to maintain innovators? According to a simple model, this work investigates the evolutionary dynamics that characterize the emergence of innovation. In particular, we consider a population of innovators and developers, in which agents form small groups whose composition is crucial for their payoff. The latter depends on the heterogeneity of the formed groups, on the amount of innovators they include, and on an award-factor that represents the policy of the system for promoting innovation. Under the hypothesis that a "mobility" effect may support the emergence of innovation, we compare the equilibria reached by our population in different cases. Results confirm the beneficial role of "mobility", and the emergence of further interesting phenomena

Experimenting Abstraction Mechanisms Through an Agent-Based Hierarchical Planner

In this paper, an agent-based architecture devised to perform experiments on hierarchical planning is described. The planning activity results from the interaction of a community of agents, some of them being explicitly devoted to embed one or more existing planners. The proposed architecture allows to exploit the characteristics of any external planner, under the hypothesis that a suitable wrapper –in form of planning agent– is provided. An implementation of the architecture, able to embed one planner of the graphplan family, has been used to directly assess whether or not abstraction mechanisms can help to reduce the time complexity of the search on specific domains. Some preliminary experiments are reported, focusing on problems taken from the AIPS 2002, 2000 and 1998 planning competitions. Comparative results, obtained by assessing the performances of the selected planner (used first in a stand-alone configuration and then embedded into the proposed multi-agent architecture), put into evidence that abstraction may significantly speed up the search

Generating Abstractions from Static Domain Analysis

This paper addresses the problem of how to implement a proactive behavior according to a two-tiered (i.e., both theoretical and pragmatic) perspective. Theoretically, we claim that abstraction must be used to render agents able to solve complex problems. Pragmatically, we illustrate a technique devised to generate abstract spaces starting from a “ground” description of the domain being modeled