Filters








464 Hits in 6.0 sec

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

J. Hoffmann, S. Edelkamp, S. Thiebaux, R. Englert, F. Liporace, S. Trueg
2006 The Journal of Artificial Intelligence Research  
In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks.  ...  Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain  ...  In the development of the benchmark domains and instances for IPC-4, the authors have invested significant effort into creating such a set of useful benchmarks for AI planning.  ... 
doi:10.1613/jair.1982 fatcat:hmne5ycxj5gjtn5d2u5hz73dqu

A Survey of the Seventh International Planning Competition

Amanda Coles, Andrew Coles, Angel García Olaya, Sergio Jiménez, Carlos Linares López, Scott Sanner, Sungwook Yoon
2012 The AI Magazine  
In this article we review the 2011 International Planning Competition. We give an overview of the history of the competition, discussing how it has developed since its first edition in 1998.  ...  The 2011 competition was run in three main separate tracks: the deterministic (classical) track; the learning track; and the uncertainty track.  ...  The impact of the IPC on the planning and scheduling community is broader than just determining a winner: benchmarking test sets are used for evaluating new ideas, and the defined state-of-the-art, the  ... 
doi:10.1609/aimag.v33i1.2392 fatcat:jstmrnertfeotj5a7gf3ld5r34

What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask)

Mauro Vallati, Lukáš Chrpa, Thomas L. Mccluskey
2018 Knowledge engineering review (Print)  
on the deterministic part of IPC 2014, and describes format, participants, benchmarks as well as a thorough analysis of the results.  ...  IPC has a strong impact also outside the planning community, by providing a large number of ready-to-use planning engines and testing pioneering applications of planning techniques.This paper focusses  ...  We want to thank all the people that submitted a planner to the deterministic part of the IPC 2014.  ... 
doi:10.1017/s0269888918000012 fatcat:lu3v5j6q5ngxvfppeeof5xaw54

The 2014 International Planning Competition: Progress and Trends

Mauro Vallati, Lukas Chrpa, Marek Grześ, Thomas Leo McCluskey, Mark Roberts, Scott Sanner, Managing Editor
2015 The AI Magazine  
IPC-2014 was held in three separate parts to assess state-of-the-art in three prominent areas of planning research: the deterministic (classical) part (IPCD), the learning part (IPCL), and the probabilistic  ...  We review the 2014 International Planning Competition (IPC-2014), the eighth in a series of competitions starting in 1998.  ...  Acknowledgements The organizers of IPCD-2014 would like to acknowledge the use of the University of Huddersfield Queensgate Grid in carrying out this work as well as Ibad Kureshi and John Brennan for their  ... 
doi:10.1609/aimag.v36i3.2571 fatcat:blon2cpw3net5fyex5qnp3p7wm

Planning with Critical Section Macros: Theory and Practice

Lukas Chrpa, Mauro Vallati
2022 The Journal of Artificial Intelligence Research  
Usefulness of macros is evaluated using a range of state-of-the-art planners, and a large number of benchmarks from the deterministic and learning tracks of recent editions of the International Planning  ...  Macro-operators (macros) are a well-known technique for enhancing performance of planning engines by providing "short-cuts" in the state space.  ...  Acknowledgements We would like to thank the anonymous reviewers for their constructive feedback that helped to considerably improve the paper.  ... 
doi:10.1613/jair.1.13269 fatcat:tlaibx52vvh3nl6pdcd5r7ucle

On the Importance of Domain Model Configuration for Automated Planning Engines [article]

Mauro Vallati and Lukas Chrpa and Thomas L. McCluskey and Frank Hutter
2020 arXiv   pre-print
The development of domain-independent planners within the AI Planning community is leading to "off-the-shelf" technology that can be used in a wide range of applications.  ...  This approach also supports the use of reformulation and configuration techniques, which transform how a model is represented in order to improve the efficiency of plan generation.  ...  engineering for planning, and provide useful information to help engineer more efficient planning domain models.  ... 
arXiv:2010.07710v1 fatcat:rdiztqrbtzeztcntdo2uw6b5fi

On the Configuration of Robust Static Parallel Portfolios for Efficient Plan Generation [chapter]

Mauro Vallati, Lukáš Chrpa, Diane Kitchin
2018 Lecture Notes in Computer Science  
In this work, we introduce three techniques for an automatic configuration of static parallel portfolios of planning engines.  ...  Automated Planning has achieved a significant step forward in the last decade, and many advanced planning engines have been introduced.  ...  IBaCoP took part in IPC 2014, and has been used also to configure parallel portfolios -it was the runner-up of the multicore trackoptimising the quality of plans.  ... 
doi:10.1007/978-3-319-93698-7_2 fatcat:ssutypmgxnf45nxiox6pvgk46e

Agent planning programs

Giuseppe De Giacomo, Alfonso Emilio Gerevini, Fabio Patrizi, Alessandro Saetti, Sebastian Sardina
2016 Artificial Intelligence  
Finally, we study the effectiveness of this approach for deterministic domains through an experimental analysis on well-known planning domains.  ...  , and use it to characterize the worst-case computational complexity of the problem as EXPTIMEcomplete.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their suggestions and comments that helped improve the paper in significant ways.  ... 
doi:10.1016/j.artint.2015.10.001 fatcat:x3rczbkh4jajhfau5pqhbojyte

ASAP: An Automatic Algorithm Selection Approach for Planning

Mauro Vallati, Lukáš Chrpa, Diane Kitchin
2014 International journal on artificial intelligence tools  
Despite the advances made in the last decade in automated planning, no planner outperforms all the others in every known benchmark domain.  ...  , which is used for creating different encodings of the given planning domain and problems, and (ii) explores the 2 dimensional space of available algorithms, defined as encodings-planners couples, and  ...  Acknowledgments The authors would like to acknowledge the use of the University of Huddersfield Queensgate Grid in carrying out this work.  ... 
doi:10.1142/s021821301460032x fatcat:quv4ih5yhzdbhdpnznuyuhu3ha

Introducing Preferences in Planning as Satisfiability

E. Giunchiglia, M. Maratea
2010 Journal of Logic and Computation  
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: SATPLAN has been the winning system in the deterministic track for optimal planners in the 4th  ...  first 5 IPCs, and some domains from the "SimplePreferences" category of the IPC-5. ⋆ This paper extends previous work presented in [31, 32] .  ...  The problem of finding an optimal plan for Π n wrt P, c can be solved again using OPT-DLL in Figure 1 as core engine.  ... 
doi:10.1093/logcom/exq023 fatcat:fgojeq2rvbg3ve34jppgah72mi

Portfolio-based planning: State of the art, common practice and open challenges

Mauro Vallati, Lukáš Chrpa, Diane Kitchin
2015 AI Communications  
However, none of these systems clearly outperforms all the others in every known benchmark domain.  ...  Such results let us suppose that future challenges of the Automated Planning community will converge on designing different approaches for combining existing planning algorithms.  ...  that took part in some editions of the IPC.  ... 
doi:10.3233/aic-150671 fatcat:ztahfeemqze3hlhyvywkqkgig4

Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches [chapter]

Mostepha R. Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 Lecture Notes in Computer Science  
The comparative experiments on a recently proposed benchmark set that are reported here demonstrate the usefulness of going Pareto-based in AI Planning.  ...  Most real-world Planning problems are multi-objective, trying to minimize both the makespan of the solution plan, and some cost of the actions involved in the plan.  ...  in all planning domains [15] , winning the temporal deterministic satisficing track at the last IPC in 2011 5 .  ... 
doi:10.1007/978-3-642-37198-1_18 fatcat:acwww3mggnhhhj6suijhld23wy

Planning from video game descriptions [article]

Ignacio Vellido, Carlos Núñez-Molina, Vladislav Nikolov, Juan Fdez-Olivares
2021 arXiv   pre-print
Furthermore, benchmarks of the domains has been produced that can be of interest to the international planning community to evaluate planners in international planning competitions.  ...  Experimental results validate the methodology and prove that the effort put by a knowledge engineer can be greatly reduced in the definition of such complex domains.  ...  It is necessary to analyse the game and comprehend it. At present we are addressing the automated discovery of game strategies with the proposed architecture in (Núñez-Molina et al. 2020) .  ... 
arXiv:2109.00449v2 fatcat:mdqdsngdhjhbbjmtbojlc4japi

Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition [chapter]

Jacques Bibai, Marc Schoenauer, Pierre Savéant
2009 Lecture Notes in Computer Science  
Divide-and-Evolve (DAE) is the first evolutionary planner that has entered the biennial International Planning Competition (IPC).  ...  in a number of instances.  ...  The description of a planning problem splits in two separate parts: the generic domain theory on one hand and a specific instance scenario on the other hand.  ... 
doi:10.1007/978-3-642-01009-5_12 fatcat:hg6ojtkl5bgpffoy2gws2qac6y

Temporal Planning with Extended Timed Automata

Christine Largouet, Omar Krichen, Yulong Zhao
2016 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)  
We propose to reformulate the planning problem in terms of model-checking and controller synthesis on interacting agents such that the state to reach is expressed using temporal logic.  ...  In this kind of system, the planning task consists in selecting and organizing actions in order to reach a goal state in a limited time and in an optimal manner, assuming actions have a cost.  ...  Domain Description The logistics domain has been a classical planning benchmark for several years at the IPC (International Planning Competition).  ... 
doi:10.1109/ictai.2016.0086 dblp:conf/ictai/LargouetKZ16 fatcat:ebdkumgeeva3hlez5nf7izvhie
« Previous Showing results 1 — 15 out of 464 results