Filters








4,943 Hits in 4.2 sec

Diverse and additive Cartesian abstraction heuristics

Jendrik Seipp, Malte Helmert
2014
We have recently shown how counterexample-guided abstraction refinement can be used to derive informative Cartesian abstraction heuristics for optimal classical planning.  ...  In this work we introduce two methods for producing diverse sets of heuristics within this framework, one based on goal facts, the other based on landmarks.  ...  Acknowledgments The Swiss National Science Foundation (SNSF) supported this work as part of the project "Abstraction Heuristics for Planning and Combinatorial Search" (AHPACS).  ... 
doi:10.5451/unibas-ep37157 fatcat:eqyczbm425cljkpfhixl4xhrdq

Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning

Jendrik Seipp, Malte Helmert
2018 The Journal of Artificial Intelligence Research  
Since a single abstraction usually cannot capture enough details of the planning task, we also introduce two methods for producing diverse sets of heuristics within this framework, one based on goal atoms  ...  Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete planning task and refine the abstraction so that  ...  Acknowledgments This work was supported by the European Research Council as part of the project "State Space Exploration: Principles, Algorithms and Applications".  ... 
doi:10.1613/jair.1.11217 fatcat:gjrouhtxxzewnd2f6tfor2bmri

System identification of fuzzy cartesian granule feature models using genetic programming [chapter]

James F. Baldwin, Trevor P. Martin, James G. Shanahan
1999 Lecture Notes in Computer Science  
G_DACG has been applied in the system identification of additive Cartesian granule feature models on a variety of artificial and real world problems.  ...  G_DACG helps avoid many of the problems of traditional approaches to system identification that arise from feature selection and feature abstraction such as local minima.  ...  These type of systems are not considered here however, [41] gives details and examples of a heuristic approach to output granularity identification in the case of additive Cartesian granule feature modelling  ... 
doi:10.1007/bfb0095073 fatcat:gj6om6bbgzdtzgkduulzvfhrwy

Saturated Cost Partitioning for Optimal Classical Planning

Jendrik Seipp, Thomas Keller, Malte Helmert
2020 The Journal of Artificial Intelligence Research  
heuristic, especially when we actively search for a set of diverse orders.  ...  Saturated cost partitioning is an alternative that is much faster to compute and has been shown to yield high-quality heuristics.  ...  Acknowledgments We have received funding for this work from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement no. 817639).  ... 
doi:10.1613/jair.1.11673 fatcat:gtwrdxh7mvhhnoj6fqjscq2s64

Controlling with words using automatically identified fuzzy Cartesian granule feature models

James F. Baldwin, Trevor P. Martin, James G. Shanahan
1999 International Journal of Approximate Reasoning  
The system identi®cation of good, parsimonious additive Cartesian granule feature models is an exponential search problem.  ...  We present a new approach to representing and acquiring controllers based upon Cartesian granule features ± multidimensional features formed over the cross product of words drawn from the linguistic partitions  ...  These type of systems are not considered here however, [43] gives details and examples of a heuristic approach to output granularity identi®cation in the case of additive Cartesian granule feature modelling  ... 
doi:10.1016/s0888-613x(99)00016-x fatcat:tveckl2rg5eornoswz5jr6euty

Haiku - a Scala Combinator Toolkit for Semi-automated Composition of Metaheuristics [chapter]

Zoltan A. Kocsis, Alexander E. I. Brownlee, Jerry Swan, Richard Senington
2015 Lecture Notes in Computer Science  
We provide examples of use and give a case study in which a programatically-generated heuristic is applied to the Travelling Salesman Problem within an Evolutionary Strategies framework.  ...  In principle, metaheuristics have a relatively clean decomposition, where well-known frameworks such as ILS and EA are parameterised by variant components for acceptance, perturbation etc.  ...  This does not seem intended to support additional combinators, and specifically targets depth-first search.  ... 
doi:10.1007/978-3-319-22183-0_9 fatcat:t7ol3woov5ezhfxr67hj7dmf3q

Searching the Hyper-heuristic Design Space

Jerry Swan, John Woodward, Ender Özcan, Graham Kendall, Edmund Burke
2013 Cognitive Computation  
2014) Searching the hyper-heuristic design space. Cognitive Computation, 6 (1). pp. 66-73. Abstract.  ...  We show that this leads naturally to a recursive definition of hyper-heuristic and to a division of responsibility that is suggestive of a blackboard architecture, in which individual heuristics annotate  ...  [3] classified diverse approaches under the more general concept of 'heuristics for searching the space of heuristics'.  ... 
doi:10.1007/s12559-013-9201-8 fatcat:elaghw2unnaa5mq6jtbo5yjc7u

PackageBuilder

Matteo Brucato, Rahul Ramakrishna, Azza Abouzied, Alexandra Meliou
2014 Proceedings of the VLDB Endowment  
To efficiently evaluate queries, the system employs pruning and heuristics, as well as state-of-the-art constraint optimization solvers.  ...  We introduce PaQL, a declarative SQL-based package query language, and the interface abstractions which allow users to interactively specify package queries and easily navigate through their results.  ...  . • PACKAGEBUILDER employs additional heuristic and pruning techniques to increase the efficiency of package queries.  ... 
doi:10.14778/2733004.2733038 fatcat:dszl5bukanaklbybch2xwreixa

PackageBuilder: From Tuples to Packages [article]

Matteo Brucato, Rahul Ramakrishna, Azza Abouzied, Alexandra Meliou
2015 arXiv   pre-print
To efficiently evaluate queries, the system employs pruning and heuristics, as well as state-of-the-art constraint optimization solvers.  ...  We introduce PaQL, a declarative SQL-based package query language, and the interface abstractions which allow users to interactively specify package queries and easily navigate through their results.  ...  This work was partially supported by the National Science Foundation under grants IIS-1421322 and IIS-1420941. REFERENCES  ... 
arXiv:1507.00942v1 fatcat:dtue3wyhxvcudeodkc2yfpuecm

Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning

Maximilian Fickert, Jörg Hoffmann
2022 The Journal of Artificial Intelligence Research  
We evaluate our algorithms with the partial delete relaxation heuristic hCFF, which can be refined by treating additional conjunctions of facts as atomic, and whose refinement operation satisfies the convergence  ...  Such relaxations can be more or less precise, and many heuristic functions have a refinement procedure that can be iteratively applied until the desired degree of precision is reached.  ...  This paper adds several extensions, including a novel online-refinement hill-climbing algorithm leveraging subgoal counting in its local lookahead search, and analyzes the algorithms and results in much  ... 
doi:10.1613/jair.1.13153 fatcat:x7evijmkk5fy5npgpchz5lel7a

Counterexample-guided focus

Andreas Podelski, Thomas Wies
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
The question of the right precision-efficiency tradeoff for the corresponding program analyses here boils down to the question of the right treatment of disjunction below and above the universal quantifier  ...  In the closely related setting of shape analysis one uses the focus operator in order to adapt the treatment of disjunction (and thus the efficiency-precision tradeoff) to the individual program statement  ...  Our tool uses a few simple heuristics to guess an initial set of predicates from the input program and its specification.  ... 
doi:10.1145/1706299.1706330 dblp:conf/popl/PodelskiW10 fatcat:h2s3vpjnenf3rdrmzq3cfos4vq

Counterexample-guided focus

Andreas Podelski, Thomas Wies
2010 SIGPLAN notices  
The question of the right precision-efficiency tradeoff for the corresponding program analyses here boils down to the question of the right treatment of disjunction below and above the universal quantifier  ...  In the closely related setting of shape analysis one uses the focus operator in order to adapt the treatment of disjunction (and thus the efficiency-precision tradeoff) to the individual program statement  ...  Our tool uses a few simple heuristics to guess an initial set of predicates from the input program and its specification.  ... 
doi:10.1145/1707801.1706330 fatcat:lmff57fldra47cshszf35zlqrq

Scalable Resilient Overlay Networks Using Destination-Guided Detouring

S. Qazi, T. Moors
2007 2007 IEEE International Conference on Communications  
INPUT: Network Coordinates for destination D and detour set T =T 1, T 2 ...T n .  ...  We propose Destination-Guided Detouring via Resilient Overlay Network (DG-RON); a distributed coordinate based overlay architecture, which uses landmark based heuristics for scalable end-to-end path discovery  ...  In addition our work presents a platform for harnessing the findings of previous literature [4, 14] .  ... 
doi:10.1109/icc.2007.77 dblp:conf/icc/QaziM07 fatcat:spxb523sujgjndujbyplp75k4e

Plasticity of intermediate mechanics students' coordinate system choice

Eleanor C. Sayre, Michael C. Wittmann
2008 Physical Review Special Topics. Physics Education Research  
In the mechanics course, the selection and application of coordinate systems is a consistent thread. Students start the course with a strong preference to use Cartesian coordinates. In small group  ...  We investigate the interplay between mathematics and physics resources in intermediate mechanics students.  ...  The process of abstracting and consolidating resources can be of long duration. Heuristics We have heuristics for defining the plasticity of a resource, as described below.  ... 
doi:10.1103/physrevstper.4.020105 fatcat:jvrwuypddbbjtbzz5r7r2eyj3y

Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics

Rostislav Horčík, Daniel Fišer, Álvaro Torralba
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We propose a novel method for computing lifted (admissible) delete-free relaxed heuristics via grounding of the smaller task and computing the (admissible) delete-free relaxed heuristics there.  ...  This allows us to transfer the knowledge about relaxed heuristics from the grounded level to the lifted level.  ...  Abstraction heuristics, such as Pattern Databases (Edelkamp 2001) , Merge-and-Shrink (Helmert et al. 2014) and Cartesian abstractions (Seipp and Helmert 2018) , also induce a homomorphism on the state  ... 
doi:10.1609/aaai.v36i9.21212 fatcat:dwhq4yv37vbrzeelqqumqw4rsq
« Previous Showing results 1 — 15 out of 4,943 results