Filters








151,788 Hits in 5.3 sec

Automatic Instance Generation for Classical Planning

Álvaro Torralba, Jendrik Seipp, Silvan Sievers
2021
Due to the steady progress of planning research some of the instances that were generated for past IPCs are inadequate for evaluating current planners.  ...  To alleviate this problem, we introduce Autoscale, an automatic tool that selects instances for a given domain.  ...  Thus, given an instance generator for a planning domain and a set of baseline and state-of-the-art planners, Autoscale automatically generates an instance set that has the desired properties.  ... 
doi:10.5451/unibas-ep84291 fatcat:v7b6wzwo25em7e5xdkhob5h62i

Inference and Learning in Planning (Extended Abstract) [chapter]

Hector Geffner
2009 Lecture Notes in Computer Science  
In this invited talk, I'll review the inference techniques used for solving individual planning instances from scratch, and discuss the use of learning methods and transformations for obtaining more general  ...  Planning is concerned with the development of solvers for a wide range of models where actions must be selected for achieving goals.  ...  I thank Joao Gamma and the organizers of DS-09 for the invitation. The author is partially supported by grant TIN2006-15387-C03-03 from MEC, Spain.  ... 
doi:10.1007/978-3-642-04747-3_1 fatcat:p22arigjj5gmdmtgrnfrjxopr4

Inference and Learning in Planning [chapter]

Hector Geffner
2012 Lecture Notes in Computer Science  
In this invited talk, I'll review the inference techniques used for solving individual planning instances from scratch, and discuss the use of learning methods and transformations for obtaining more general  ...  Planning is concerned with the development of solvers for a wide range of models where actions must be selected for achieving goals.  ...  I thank Joao Gamma and the organizers of DS-09 for the invitation. The author is partially supported by grant TIN2006-15387-C03-03 from MEC, Spain.  ... 
doi:10.1007/978-3-642-31951-8_1 fatcat:3rjnwv6monf2bdhi2w6qefvtmi

Computing Plans with Control Flow and Procedures Using a Classical Planner

Sergio Jiménez Celorrio, Anders Jonsson
2015 Symposium on Combinatorial Search  
Control flow instructions and procedures allow us to generate compact and general solutions able to solve planning tasks for which multiple unit tests are defined.  ...  The paper analyzes the relation between classical planning and structured programming with unit tests and shows how to exploit this relation in a classical planning compilation.  ...  The generation of the FSMs is also different since it starts from a partially observable planning model and uses a conformant into classical planning compilation (Palacios and Geffner 2009) . • Automatic  ... 
dblp:conf/socs/CelorrioJ15 fatcat:ljy473e6lfenxksppx5dnt7yam

Foundations and applications of generalized planning

Siddharth Srivastava
2011 AI Communications  
While the generalized planning problem is incomputable in general, this thesis presents a new formalization of the problem, a study of the limits of computability of generalized plans and algorithms for  ...  solving a broad class of generalized planning problems.  ...  In this algorithm, a classical planner is used to create a concrete plan for an unsolved problem instance. At the beginning, this instance can be any member of the class of initial states.  ... 
doi:10.3233/aic-2011-0508 fatcat:6747dn7atbfadchyj2vaulvj4u

A functional layer for description logics

Ralf Möller
1996 SIGPLAN notices  
It presents a unification approach of Description Logics and object-oriented programming that allows both views to be conveniently used for different subproblems in a modern software-engineering environment  ...  For instance, for planning purposes, additional ships might be created by the Seasoft logistics module which consists of a set of ship classes.  ...  With the extended dispatch mechanism for CLASSIC instances, a large system for generating interfaces has been implemented [20] , [21] . ( define-generic-function <function-name> (<dispatched-argument-description  ... 
doi:10.1145/236338.236357 fatcat:mryihuosrze4xf7tb7ofkm4moy

A functional layer for description logics

Ralf Möller
1996 Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '96  
It presents a unification approach of Description Logics and object-oriented programming that allows both views to be conveniently used for different subproblems in a modern software-engineering environment  ...  For instance, for planning purposes, additional ships might be created by the Seasoft logistics module which consists of a set of ship classes.  ...  With the extended dispatch mechanism for CLASSIC instances, a large system for generating interfaces has been implemented [20] , [21] . ( define-generic-function <function-name> (<dispatched-argument-description  ... 
doi:10.1145/236337.236357 dblp:conf/oopsla/Moller96 fatcat:esghrji23nh6hkdi4saphnnriy

Forthcoming papers

1996 Artificial Intelligence  
Abstractions am generated automatically, using an intensional representation of the planning problem (probabilistic STRIPS rules) to determine the most relevant problem features and optimally solving a  ...  Automatically selecting and using primary effects in planning: theory and experiments The use of primary effects of operators is an effective approach to improving the efficiency of planning.  ...  Abstractions am generated automatically, using an intensional representation of the planning problem (probabilistic STRIPS rules) to determine the most relevant problem features and optimally solving a  ... 
doi:10.1016/s0004-3702(96)90016-8 fatcat:heev5wzgnbenfpinwk52u2dfzi

What Automated Planning can do for Business Process Management [article]

Andrea Marrella
2017 arXiv   pre-print
In this paper, we discuss how automated planning techniques can be leveraged to enable new levels of automation and support for business processing, and we show some concrete examples of their successful  ...  nowadays many domains of interest to the BPM community are characterized by ever-changing requirements, unpredictable environments and increasing amounts of data that influence the execution of process instances  ...  A classical planner fed with such inputs searches for a plan that may turn the physical reality into the expected reality by adapting the faulty process instance.  ... 
arXiv:1709.10482v2 fatcat:pwf64qsvtfdmvhc5ybdcjzvtji

Generalized Planning With Procedural Domain Control Knowledge [article]

Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
2019 arXiv   pre-print
Generalized planning is the task of generating a single solution that is valid for a set of planning problems.  ...  generalized planning problem.  ...  In these domains procedural DCK was automatically generated as generalized plans for subtasks and then inserted as procedures in the overall generalized planning problem.  ... 
arXiv:1910.04999v1 fatcat:rcct2w3435gr3g6uoovczwdx2u

Generalized Potential Heuristics for Classical Planning

Guillem Francès, Augusto B. Corrêa, Cedric Geissmann, Florian Pommerening
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
Generalized planning aims at computing solutions that work for all instances of the same domain.  ...  In this paper, we show that several interesting planning domains possess compact generalized heuristics that can guide a greedy search in guaranteed polynomial time to the goal, and which work for any  ...  Acknowledgments This work was supported by the Swiss National Science Foundation (SNSF) as part of the project "Certified Correctness and Guaranteed Performance for Domain-Independent Planning" (CCGP-Plan  ... 
doi:10.24963/ijcai.2019/771 dblp:conf/ijcai/FrancesCGP19 fatcat:4jj2h5fehbdk7jeemqzxu3djdm

Classical Planning in Deep Latent Space: From Unlabeled Images to PDDL (and back)

Masataro Asai, Alex Fukunaga
2017 International Workshop on Neural-Symbolic Learning and Reasoning  
Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck.  ...  We evaluate LatPlan using image-based versions of 3 planning domains: 8-puzzle, LightsOut, and Towers of Hanoi.  ...  Discussion and Conclusion We proposed LatPlan, an integrated architecture for planning which, given only a set of unlabeled images and no prior knowledge, generates a classical planning problem model,  ... 
dblp:conf/nesy/AsaiF17 fatcat:zsgbzjkomva5xlt3eejw3yv434

iThink: A Library for Classical Planning in Video-Games [chapter]

Vassileios-Marios Anastassiou, Panagiotis Diamantopoulos, Stavros Vassos, Manolis Koubarakis
2012 Lecture Notes in Computer Science  
Except for being a useful tool for game developers, we believe that iThink can be used in education, providing a modern and fun environment for learning and experimenting with classical planning.  ...  In particular, classical planning methods for specifying a goal-oriented behavior have proven to be useful to game developers in an increasingly number of cases.  ...  On the other hand, existing academic frameworks for classical planning that aim for generality, such as planners that conform to the Planning Domain Definition Language (PDDL) [5] , cannot be directly  ... 
doi:10.1007/978-3-642-30448-4_14 fatcat:ubeutflk7rayfayfmg55g2vf2a

Representation and Synthesis of C++ Programs for Generalized Planning [article]

Javier Segovia-Aguas, Yolanda E-Martín, Sergio Jiménez
2022 arXiv   pre-print
Last but not least, the execution of a C++ program on a classical planning instance is a deterministic grounding-free and search-free process, so our C++ representation allows us to automatically validate  ...  The paper introduces a novel representation for Generalized Planning (GP) problems, and their solutions, as C++ programs.  ...  the information of the classical planning instance.  ... 
arXiv:2206.14480v1 fatcat:4wemsdjidbaazjxpn3z6w5nhoa

Automatic SAT-Compilation of Planning Problems

Michael D. Ernst, Todd D. Millstein, Daniel S. Weld
1997 International Joint Conference on Artificial Intelligence  
We describe an automatic compiler that generates all of these encodings.  ...  Recent work by Kautz et al. provides tantalizing evidence that large, classical planning problems may be efficiently solved by translating them into propositional satisfiability problems, using stochastic  ...  compiler that takes classical STRIPS planning problems and generates SAT problems using all of the above encodings.  ... 
dblp:conf/ijcai/ErnstMW97 fatcat:45pwplwkfnanzigqr3guqy7pma
« Previous Showing results 1 — 15 out of 151,788 results