Exploring Instance Generation for Automated Planning

• URL: http://arxiv.org/abs/2009.10156v1
• Date: Mon, 21 Sep 2020 19:58:33 GMT
• Title: Exploring Instance Generation for Automated Planning
• Authors: \"Ozg\"ur Akg\"un, Nguyen Dang, Joan Espasa, Ian Miguel, Andr\'as Z. Salamon, Christopher Stone
• Abstract summary: Constraint programming and automated planning are examples of these areas. The efficiency of each solving method varies not only between problems, but also between instances of the same problem. We propose a new approach where the whole planning problem description is modelled using Essence.
• Score: 1.6735240552964108
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many of the core disciplines of artificial intelligence have sets of standard benchmark problems well known and widely used by the community when developing new algorithms. Constraint programming and automated planning are examples of these areas, where the behaviour of a new algorithm is measured by how it performs on these instances. Typically the efficiency of each solving method varies not only between problems, but also between instances of the same problem. Therefore, having a diverse set of instances is crucial to be able to effectively evaluate a new solving method. Current methods for automatic generation of instances for Constraint Programming problems start with a declarative model and search for instances with some desired attributes, such as hardness or size. We first explore the difficulties of adapting this approach to generate instances starting from problem specifications written in PDDL, the de-facto standard language of the automated planning community. We then propose a new approach where the whole planning problem description is modelled using Essence, an abstract modelling language that allows expressing high-level structures without committing to a particular low level representation in PDDL.

Related papers

• Multi-agent Planning using Visual Language Models [2.2369578015657954]
  Large Language Models (LLMs) and Visual Language Models (VLMs) are attracting increasing interest due to their improving performance and applications across various domains and tasks. LLMs andVLMs can produce erroneous results, especially when a deep understanding of the problem domain is required. We propose a multi-agent architecture for embodied task planning that operates without the need for specific data structures as input.
  arXiv  Detail & Related papers  (2024-08-10T08:10:17Z)
• A General Framework for Learning from Weak Supervision [93.89870459388185]
  This paper introduces a general framework for learning from weak supervision (GLWS) with a novel algorithm. Central to GLWS is an Expectation-Maximization (EM) formulation, adeptly accommodating various weak supervision sources. We also present an advanced algorithm that significantly simplifies the EM computational demands.
  arXiv  Detail & Related papers  (2024-02-02T21:48:50Z)
• PPM: Automated Generation of Diverse Programming Problems for Benchmarking Code Generation Models [10.491051578439722]
  We propose the idea of programming problem merging (PPM) and provide two implementation of this idea, we utilize our tool on two widely-used datasets. The results demonstrate the effectiveness of our tool in generating more challenging, diverse, and natural programming problems.
  arXiv  Detail & Related papers  (2024-01-28T02:27:38Z)
• Automated Process Planning Based on a Semantic Capability Model and SMT [50.76251195257306]
  In research of manufacturing systems and autonomous robots, the term capability is used for a machine-interpretable specification of a system function. We present an approach that combines these two topics: starting from a semantic capability model, an AI planning problem is automatically generated.
  arXiv  Detail & Related papers  (2023-12-14T10:37:34Z)
• Large Language Models as Analogical Reasoners [155.9617224350088]
  Chain-of-thought (CoT) prompting for language models demonstrates impressive performance across reasoning tasks. We introduce a new prompting approach, analogical prompting, designed to automatically guide the reasoning process of large language models.
  arXiv  Detail & Related papers  (2023-10-03T00:57:26Z)
• Numerical Methods for Convex Multistage Stochastic Optimization [86.45244607927732]
  We focus on optimisation programming (SP), Optimal Control (SOC) and Decision Processes (MDP) Recent progress in solving convex multistage Markov problems is based on cutting planes approximations of the cost-to-go functions of dynamic programming equations. Cutting plane type methods can handle multistage problems with a large number of stages, but a relatively smaller number of state (decision) variables.
  arXiv  Detail & Related papers  (2023-03-28T01:30:40Z)
• Generalization Properties of Retrieval-based Models [50.35325326050263]
  Retrieval-based machine learning methods have enjoyed success on a wide range of problems. Despite growing literature showcasing the promise of these models, the theoretical underpinning for such models remains underexplored. We present a formal treatment of retrieval-based models to characterize their generalization ability.
  arXiv  Detail & Related papers  (2022-10-06T00:33:01Z)
• Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
  We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm. We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
  arXiv  Detail & Related papers  (2022-09-15T07:22:58Z)
• A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming [0.0]
  We introduce a new model-oriented Answer Set Programming that lifts the SBCs of small problem instances into a set of interpretable first-order constraints. After targeting simple problems, we aim to extend our method to be applied also for advanced decision problems.
  arXiv  Detail & Related papers  (2022-08-05T10:50:03Z)
• A Framework for Generating Informative Benchmark Instances [3.8848561367220276]
  Benchmarking is an important tool for assessing the relative performance of alternative solving approaches. Modern constraint programming languages allow the specification of a class-level model that is parameterised over instance data. We introduce a framework that combines these two properties to generate a large number of benchmark instances.
  arXiv  Detail & Related papers  (2022-05-29T19:56:08Z)
• Efficient lifting of symmetry breaking constraints for complex combinatorial problems [9.156939957189502]
  This work extends the learning framework and implementation of a model-based approach for Answer Set Programming. In particular, we incorporate a new conflict analysis algorithm in the Inductive Logic Programming system ILASP.
  arXiv  Detail & Related papers  (2022-05-14T20:42:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.