The International Competition of Distributed and Multiagent Planners (CoDMAP)

AI Magazine ◽  
2016 ◽  
Vol 37 (3) ◽  
pp. 109-115 ◽  
Author(s):  
Antonín Komenda ◽  
Michal Stolba ◽  
Daniel L. Kovacs

This article reports on the first international Competition of Distributed and Multiagent Planners (CoDMAP). The competition focused on cooperative domain-independent planners compatible with a minimal multiagent extension of the classical planning model. The motivations for the competition were manifold: to standardize the problem description language with a common set of benchmarks, to promote development of multiagent planners both inside and outside of the multiagent research community, and to serve as a prototype for future multiagent planning competitions. The article provides an overview of cooperative multiagent planning, describes a novel variant of standardized input language for encoding mutliagent planning problems and summarizes the key points of organization, competing planners and results of the competition.

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.


Author(s):  
Daniel Höller ◽  
Gregor Behnke ◽  
Pascal Bercher ◽  
Susanne Biundo

AbstractDuring the last years, much progress has been made in hierarchical planning towards domain-independent systems that come with sophisticated techniques to solve planning problems instead of relying on advice in the input model. Several of these novel methods have been integrated into the PANDA framework, which is a software system to reason about hierarchical planning tasks. Besides solvers for planning problems based on plan space search, progression search, and translation to propositional logic, it also includes techniques for related problems like plan repair, plan and goal recognition, or plan verification. These various techniques share a common infrastructure, like e.g. a standard input language or components for grounding and reachability analysis. This article gives an overview over the PANDA framework, introduces the basic techniques from a high level perspective, and surveys the literature describing the diverse components in detail.


2018 ◽  
Vol 37 (13-14) ◽  
pp. 1796-1825 ◽  
Author(s):  
Caelan Reed Garrett ◽  
Tomás Lozano-Pérez ◽  
Leslie Pack Kaelbling

This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems. Factoring allows state transitions to be described as the intersection of several constraints each affecting a subset of the state and control variables. Robotic manipulation problems with many movable objects involve constraints that only affect several variables at a time and therefore exhibit large amounts of factoring. We develop a theoretical framework for solving factored transition systems with sampling-based algorithms. The framework characterizes conditions on the submanifold in which solutions lie, leading to a characterization of robust feasibility that incorporates dimensionality-reducing constraints. It then connects those conditions to corresponding conditional samplers that can be composed to produce values on this submanifold. We present two domain-independent, probabilistically complete planning algorithms that take, as input, a set of conditional samplers. We demonstrate the empirical efficiency of these algorithms on a set of challenging task and motion planning problems involving picking, placing, and pushing.


2017 ◽  
Vol 1 (20) ◽  
pp. 1717-1728 ◽  
Author(s):  
Alyssa I. Clay-Gilmour ◽  
Theresa Hahn ◽  
Leah M. Preus ◽  
Kenan Onel ◽  
Andrew Skol ◽  
...  

Key Points IKZF1 associations with high-risk B-ALL may differ by age and sex. A novel variant on chromosome 14, rs189434316, is associated with over a 3.5-fold risk of normal cytogenetic B-ALL.


2020 ◽  
Author(s):  
Eleonora Mäkelä ◽  
Karolina Pavic ◽  
Taru Varila ◽  
Urpu Salmenniemi ◽  
Eliisa Löyttyniemi ◽  
...  

AbstractCancerous inhibitor of PP2A (CIP2A) is a prevalent human oncoprotein that inhibits tumor suppressor PP2A-B56a. However, CIP2A mRNA and protein variants remain uncharacterized. Here, we report discovery of a CIP2A splicing variant NOCIVA (NOvel CIp2a VAriant). NOCIVA contains CIP2A exons 1-13 fused to a continuous stretch of 349 nucleotide from CIP2A intron 13. Intriguingly, the first 39 nucleotides of the NOCIVA specific sequence are in coding frame with exon 13 of CIP2A, and codes for a 13 amino acid peptide tail unhomologous to any known human protein sequence. Therefore, NOCIVA translates to a unique human protein. NOCIVA retains the capacity to bind to B56a, but whereas CIP2A is predominantly a cytoplasmic protein, NOCIVA translocates to nucleus. Indicative of prevalent alternative splicing from CIP2A to NOCIVA in myeloid malignancies, acute myeloid leukemia (AML) and chronic myeloid leukemia (CML) patient samples overexpress NOCIVA, but not CIP2A mRNA. In AML, high NOCIVA mRNA expression is a marker for adverse overall survival. In CML, high NOCIVA expression associates with inferior event free survival among imatinib treated patients, but not among patients treated with dasatinib or nilotinib. Collectively, we describe discovery of a novel variant of oncoprotein CIP2A, and its clinical relevance in myeloid leukemias.Key PointsDiscovery and characterization of a first mRNA variant of one of the most prevalently deregulated human oncoproteins CIP2AUnlike CIP2A, NOCIVA mRNA is overexpressed in AML and CML patient samples and associates with poor clinical response in both myeloid cancers


2015 ◽  
Vol 2 (2) ◽  
pp. 51-56
Author(s):  
Michal Štolba

The notion of planning using multiple agents has been around since the very beginning of planning itself. It has been approached from various viewpoints especially in the multiagent systems community. Recently, domain-independent multiagent planning has gained more attention also in the automated planning community. In this paper, we shortly present the current state of the art, question some aspects of the research field and discuss the rising challenges.


Author(s):  
Nabil A. Kartam ◽  
David E. Wilkins

There exists a large body of Artificial Intelligence (AI) research on generating plans, i.e. linear or non-linear sequences of actions, to transform an initial world state to some desired goal state. However, much of the planning research to date has been complicated, ill-understood, and unclear. Only a few of the developers of these planners have provided a thorough description of their research products, and those descriptions that exist are usually unrealistically favorable since the range of applications for which the systems are tested is limited to those for which they were developed. As a result, it is difficult to evaluate these planners and to choose the best planner for a different domain. To make a planner applicable to different planning problems, it should be domain independent. However, one needs to know the circumstances under which a general planner works so that one can determine its suitability for a specific domain.This paper presents criteria for evaluating AI planners; these criteria fall into three categories: (1) performance issues, (2) representational issues, and (3) communication issues. This paper also assesses four non-linear AI planners (NOAH, NONLIN, SIPE and TWEAK) based on a study of the published literature and on communication (via electronic mail, meetings and correspondence) with their developers.


10.29007/493z ◽  
2018 ◽  
Author(s):  
Arman Masoumi ◽  
Megan Antoniazzi ◽  
Mikhail Soutchanski

Organic Synthesis is a computationally challenging practical problem concerned with constructing a target molecule from a set of initially available molecules via chemical reactions. This paper demonstrates how organic synthesis can be formulated as a planning problem in Artificial Intelligence, and how it can be explored using the state-of-the-art domain independent planners.To this end, we develop a methodology to represent chemical molecules and generic reactions in PDDL 2.2, a version of the standardized Planning Domain Definition Language popular in AI. In our model, derived predicates define common functional groups and chemical classes in chemistry, and actionscorrespond to generic chemical reactions. We develop a set of benchmark problems. Since PDDL is supported as an input language by many modern planners, our benchmark can be subsequently useful forempirical assessment of the performance of various state-of-the-art planners.


2003 ◽  
Vol 17 (4) ◽  
pp. 461-470 ◽  
Author(s):  
Judy L. Van Raalte

Creating and delivering effective sport psychology programs for traveling groups of athletes is a challenging task, particularly when athletes have limited experience with international travel. Using key points from Poczwardowski, Sherman, and Henschen’s (1998) sport psychology service delivery heuristic, this paper provides a personal account of sport psychology services provided at the 16th Maccabiah Games. Guidelines for sport psychology consultants working and traveling with competitive athletes and teams at future international sporting events are provided.


Author(s):  
Daniel Furelos-Blanco ◽  
Anders Jonsson

In this work we present a novel approach to solving concurrent multiagent planning problems in which several agents act in parallel. Our approach relies on a compilation from concurrent multiagent planning to classical planning, allowing us to use an off-the-shelf classical planner to solve the original multiagent problem. The solution can be directly interpreted as a concurrent plan that satisfies a given set of concurrency constraints, while avoiding the exponential blowup associated with concurrent actions. Our planner is the first to handle action effects that are conditional on what other agents are doing. Theoretically, we show that the compilation is sound and complete. Empirically, we show that our compilation can solve challenging multiagent planning problems that require concurrent actions.


Sign in / Sign up

Export Citation Format

Share Document