Malte Helmert - RankMe

145 papers A* 85A 9B 19Misc 5Journal 18Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Formalism for Optimal Search with Dynamic Heuristics. CoRR Remo Christen, Florian Pommerening, Clemens Büchner, Malte Helmert
2025	A*	`conf`	Domain-Independent Instance Generation for Classical Planning. KR Claudia Grundke, Malte Helmert, Gabriele Röger
2025	A	`conf`	On Performance Guarantees for Symbolic Search in Classical Planning. ECAI David Speck, Malte Helmert
2025	J	`jnl`	Pseudo-Boolean Proof Logging for Optimal Classical Planning. CoRR Simon Dold, Malte Helmert, Jakob Nordström, Gabriele Röger, Tanja Schindler
2024	A*	`conf`	Abstraction Heuristics for Factored Tasks. ICAPS Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert
2024	A*	`conf`	Formal Representations of Classical Planning Domains. ICAPS Claudia Grundke, Gabriele Röger, Malte Helmert
2024	A*	`conf`	Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. ICAPS Simon Dold, Malte Helmert
2024	J	`jnl`	Improving Reproducibility in AI Research: Four Mechanisms Adopted by JAIR. J. Artif. Intell. Res. Odd Erik Gundersen, Malte Helmert, Holger H. Hoos
2024	A*	`conf`	Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning. AAAI Simon Dold, Malte Helmert
2024	A*	`conf`	On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. AAAI Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher
2024	A*	`conf`	Planning with Object Creation. ICAPS Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin
2023	A*	`conf`	Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. ICAPS Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert
2023	A*	`conf`	Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran
2023	A*	`conf`	Landmark Progression in Heuristic Search. ICAPS Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert
2023	A*	`conf`	Planning over Integers: Compilations and Undecidability. ICAPS Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman
2022	A*	`conf`	Detecting Unsolvability Based on Separating Functions. ICAPS Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert
2022	A*	`conf`	Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. ICAPS Patrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann
2022	B	`conf`	On Producing Shortest Cost-Optimal Plans. SOCS Michael Katz, Gabriele Röger, Malte Helmert
2022	A*	`conf`	On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. ICAPS Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa
2022	A*	`conf`	The FF Heuristic for Lifted Classical Planning. AAAI Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès
2021	A*	`conf`	Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert
2021	A*	`conf`	Delete-Relaxation Heuristics for Lifted Classical Planning. ICAPS Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert
2021	A*	`conf`	Exploiting Cyclic Dependencies in Landmark Heuristics. ICAPS Clemens Büchner, Thomas Keller, Malte Helmert
2021	J	`jnl`	Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. J. Artif. Intell. Res. Silvan Sievers, Malte Helmert
2021	A*	`conf`	Saturated Post-hoc Optimization for Classical Planning. AAAI Jendrik Seipp, Thomas Keller, Malte Helmert
2020	B	`conf`	A Guide to Budgeted Tree Search. SOCS Nathan R. Sturtevant, Malte Helmert
2020	B	`conf`	An Atom-Centric Perspective on Stubborn Sets. SOCS Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers
2020	A*	`conf`	Certified Unsolvability for SAT Planning with Property Directed Reachability. ICAPS Salomé Eriksson, Malte Helmert
2020	A*	`conf`	Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert
2020	A*	`conf`	Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. ICAPS Jendrik Seipp, Samuel von Allmen, Malte Helmert
2020	A*	`conf`	Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2020	A*	`conf`	Lifted Successor Generation Using Query Optimization Techniques. ICAPS Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès
2020	A	`conf`	Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. ECAI Patrick Ferber, Malte Helmert, Jörg Hoffmann
2020	—	`ch.`	Planen. Handbuch der Künstlichen Intelligenz Jörg Hoffmann, Malte Helmert, Daniel Gnad, Florian Pommerening
2020	J	`jnl`	Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. Jendrik Seipp, Thomas Keller, Malte Helmert
2019	A*	`conf`	Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS Alexander Rovner, Silvan Sievers, Malte Helmert
2019	J	`jnl`	Exponential-Binary State-Space Search. CoRR Nathan R. Sturtevant, Malte Helmert
2019	J	`jnl`	Higher-Dimensional Potential Heuristics for Optimal Classical Planning. CoRR Florian Pommerening, Malte Helmert, Blai Bonet
2019	A*	`conf`	Iterative Budgeted Exponential Search. IJCAI Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
2019	J	`jnl`	Iterative Budgeted Exponential Search. CoRR Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
2019	A*	`conf`	Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2019	A*	`conf`	Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS Jendrik Seipp, Malte Helmert
2018	A*	`conf`	A Proof System for Unsolvable Planning Tasks. ICAPS Salomé Eriksson, Gabriele Röger, Malte Helmert
2018	A*	`conf`	Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI Manuel Heusner, Thomas Keller, Malte Helmert
2018	J	`jnl`	Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. J. Artif. Intell. Res. Jendrik Seipp, Malte Helmert
2018	A*	`conf`	Inductive Certificates of Unsolvability for Domain-Independent Planning. IJCAI Salomé Eriksson, Gabriele Röger, Malte Helmert
2018	A*	`conf`	Search Progress and Potentially Expanded States in Greedy Best-First Search. IJCAI Manuel Heusner, Thomas Keller, Malte Helmert
2017	A*	`conf`	A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS Jendrik Seipp, Thomas Keller, Malte Helmert
2017	A*	`conf`	Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS Florian Pommerening, Malte Helmert, Blai Bonet
2017	A*	`conf`	Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI Florian Pommerening, Malte Helmert, Blai Bonet
2017	A*	`conf`	Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI Jendrik Seipp, Thomas Keller, Malte Helmert
2017	B	`conf`	On Variable Dependencies and Compressed Pattern Databases. SOCS Malte Helmert, Nathan R. Sturtevant, Ariel Felner
2017	B	`conf`	Optimal Solutions to Large Logistics Planning Domain Problems. SOCS Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert
2017	B	`conf`	Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz
2017	B	`conf`	Understanding the Search Behaviour of Greedy Best-First Search. SOCS Manuel Heusner, Thomas Keller, Malte Helmert
2017	A*	`conf`	Unsolvability Certificates for Classical Planning. ICAPS Salomé Eriksson, Gabriele Röger, Malte Helmert
2017	A*	`conf`	Value Compression of Pattern Databases. AAAI Nathan R. Sturtevant, Ariel Felner, Malte Helmert
2016	A*	`conf`	An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS Silvan Sievers, Martin Wehrle, Malte Helmert
2016	A*	`conf`	Correlation Complexity of Classical Planning Domains. IJCAI Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert
2016	A*	`conf`	Graph-Based Factorization of Classical Planning Problems. IJCAI Martin Wehrle, Silvan Sievers, Malte Helmert
2016	Misc	`ed.`	KI 2016: Advances in Artificial Intelligence - 39th Annual German Conference on AI, Klagenfurt, Austria, September 26-30, 2016, Proceedings KI Gerhard Friedrich, Malte Helmert, Franz Wotawa
2016	B	`conf`	Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS Gerald Paul, Malte Helmert
2015	Misc	`conf`	A Doppelkopf Player Based on UCT. KI Silvan Sievers, Malte Helmert
2015	A*	`conf`	A Normal Form for Classical Planning Tasks. ICAPS Florian Pommerening, Malte Helmert
2015	Misc	`conf`	An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. KI Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz
2015	A*	`conf`	Automatic Configuration of Sequential Planning Portfolios. AAAI Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter
2015	A*	`conf`	Factored Symmetries for Merge-and-Shrink Abstractions. AAAI Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz
2015	A*	`conf`	From Non-Negative to General Operator Cost Partitioning. AAAI Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp
2015	A*	`conf`	Heuristics and Symmetries in Classical Planning. AAAI Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle
2015	A*	`conf`	Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. IJCAI Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet
2015	A*	`conf`	Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz
2015	A*	`conf`	New Optimization Functions for Potential Heuristics. ICAPS Jendrik Seipp, Florian Pommerening, Malte Helmert
2015	A*	`conf`	On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS Malte Helmert, Gabriele Röger, Silvan Sievers
2014	A	`conf`	Bounded Intention Planning Revisited. ECAI Silvan Sievers, Martin Wehrle, Malte Helmert
2014	A*	`conf`	Diverse and Additive Cartesian Abstraction Heuristics. ICAPS Jendrik Seipp, Malte Helmert
2014	A*	`conf`	Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. ICAPS Martin Wehrle, Malte Helmert
2014	B	`conf`	Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS Nathan R. Sturtevant, Ariel Felner, Malte Helmert
2014	A*	`conf`	Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI Silvan Sievers, Martin Wehrle, Malte Helmert
2014	A*	`conf`	LP-Based Heuristics for Cost-Optimal Planning. ICAPS Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet
2014	J	`jnl`	Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces. J. ACM Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim
2014	J	`jnl`	Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. CoRR Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore
2014	A	`conf`	Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI Gabriele Röger, Florian Pommerening, Malte Helmert
2014	A*	`conf`	Under-Approximation Refinement for Classical Planning. ICAPS Manuel Heusner, Martin Wehrle, Florian Pommerening, Malte Helmert
2013	—	`conf`	Additive Counterexample-Guided Cartesian Abstraction Refinement. AAAI (Late-Breaking Developments) Jendrik Seipp, Malte Helmert
2013	J	`jnl`	Automating the evaluation of planning systems. AI Commun. Carlos Linares López, Sergio Jiménez Celorrio, Malte Helmert
2013	A*	`conf`	Counterexample-Guided Cartesian Abstraction Refinement. ICAPS Jendrik Seipp, Malte Helmert
2013	A*	`conf`	Getting the Most Out of Pattern Databases for Classical Planning. IJCAI Florian Pommerening, Gabriele Röger, Malte Helmert
2013	A*	`conf`	Incremental LM-Cut. ICAPS Florian Pommerening, Malte Helmert
2013	B	`conf`	Preface. SOCS Malte Helmert, Gabriele Röger
2013	B	`ed.`	Proceedings of the Sixth Annual Symposium on Combinatorial Search, SOCS 2013, Leavenworth, Washington, USA, July 11-13, 2013. SOCS Malte Helmert, Gabriele Röger
2013	A*	`conf`	Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS Patrik Haslum, Malte Helmert, Anders Jonsson
2013	B	`conf`	SoCS 2013 Organization. SOCS Malte Helmert, Gabriele Röger
2013	A*	`conf`	Stronger Abstraction Heuristics Through Perimeter Search. ICAPS Patrick Eyerich, Malte Helmert
2013	A*	`conf`	The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller
2013	A*	`conf`	Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS Thomas Keller, Malte Helmert
2012	A	`conf`	A Stubborn Set Algorithm for Optimal Planning. ECAI Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller, Malte Helmert
2012	A*	`conf`	About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS Martin Wehrle, Malte Helmert
2012	B	`conf`	Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS Jordan Tyler Thayer, J. Benton, Malte Helmert
2012	B	`conf`	Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS Silvan Sievers, Manuela Ortlieb, Malte Helmert
2012	A*	`conf`	How to Relax a Bisimulation? ICAPS Michael Katz, Jörg Hoffmann, Malte Helmert
2012	A*	`conf`	Learning Portfolios of Automatically Tuned Planners. ICAPS Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert
2012	—	`conf`	Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984). MAPF@AAAI Gabriele Röger, Malte Helmert
2012	B	`conf`	Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS Gabriele Röger, Malte Helmert
2012	A*	`conf`	Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS Florian Pommerening, Malte Helmert
2011	A*	`conf`	Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI Raz Nissim, Jörg Hoffmann, Malte Helmert
2011	A*	`ed.`	Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011 ICAPS Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert
2011	J	`jnl`	The Fast Downward Planning System CoRR Malte Helmert
2010	A*	`conf`	High-Quality Policies for the Canadian Traveler's Problem. AAAI Patrick Eyerich, Thomas Keller, Malte Helmert
2010	B	`conf`	High-Quality Policies for the Canadian Traveler's Problem. SOCS Patrick Eyerich, Thomas Keller, Malte Helmert
2010	B	`conf`	Landmark Heuristics for the Pancake Problem. SOCS Malte Helmert
2010	A*	`conf`	Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher
2010	A	`conf`	Relative-Order Abstractions for the Pancake Problem. ECAI Malte Helmert, Gabriele Röger
2010	A	`conf`	Sound and Complete Landmarks for And/Or Graphs. ECAI Emil Keyder, Silvia Richter, Malte Helmert
2010	A	`conf`	Strengthening Landmark Heuristics via Hitting Sets. ECAI Blai Bonet, Malte Helmert
2010	A*	`conf`	The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. ICAPS Gabriele Röger, Malte Helmert
2010	A*	`conf`	The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS Malte Helmert, Hauke Lasinger
2009	J	`jnl`	Concise finite-domain representations for PDDL planning tasks. Artif. Intell. Malte Helmert
2009	A*	`conf`	Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS Dunbo Cai, Jörg Hoffmann, Malte Helmert
2009	A*	`conf`	Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS Malte Helmert, Carmel Domshlak
2009	—	`conf`	Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? Graph Search Engineering Malte Helmert, Carmel Domshlak
2009	J	`jnl`	Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. J. Artif. Intell. Res. Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore
2009	Misc	`conf`	Planning with KI Christoph Betz, Malte Helmert
2009	A*	`conf`	Preferred Operators and Deferred Evaluation in Satisficing Planning. ICAPS Silvia Richter, Malte Helmert
2009	B	`conf`	The Causal Graph Revisited for Directed Model Checking. SAS Martin Wehrle, Malte Helmert
2008	A*	`conf`	Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI Malte Helmert, Robert Mattmüller
2008	A*	`conf`	Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI Malte Helmert, Patrik Haslum, Jörg Hoffmann
2008	A*	`conf`	How Good is Almost Perfect?. AAAI Malte Helmert, Gabriele Röger
2008	A*	`conf`	Landmarks Revisited. AAAI Silvia Richter, Malte Helmert, Matthias Westphal
2008	A*	`conf`	On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. KR Gabriele Röger, Malte Helmert, Bernhard Nebel
2008	—	`book`	Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition. Malte Helmert
2008	A*	`conf`	Unifying the Causal Graph and Additive Heuristics. ICAPS Malte Helmert, Hector Geffner
2007	Misc	`conf`	A Stochastic Local Search Approach to Vertex Cover. KI Silvia Richter, Malte Helmert, Charles Gretton
2007	A*	`conf`	Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig
2007	A*	`conf`	Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS Malte Helmert, Patrik Haslum, Jörg Hoffmann
2006	—	`conf`	A Skat Player Based on Monte-Carlo Simulation. Computers and Games Sebastian Kupferschmid, Malte Helmert
2006	A	`conf`	Aproximation Properties of Planning Benchmarks. ECAI Malte Helmert, Robert Mattmüller, Gabriele Röger
2006	A*	`conf`	New Complexity Results for Classical Planning Benchmarks. ICAPS Malte Helmert
2006	B	`conf`	Selective Approaches for Solving Weak Games. ATVA Malte Helmert, Robert Mattmüller, Sven Schewe
2006	J	`jnl`	The Fast Downward Planning System. J. Artif. Intell. Res. Malte Helmert
2004	A*	`conf`	A Planning Heuristic Based on Causal Graph Analysis. ICAPS Malte Helmert
2003	J	`jnl`	Complexity results for standard benchmark domains in planning. Artif. Intell. Malte Helmert
2002	—	`conf`	Decidability and Undecidability Results for Planning with Numerical State Variables. AIPS Malte Helmert
2002	—	`conf`	Decidability and Undecidability Results for Planning with Numerical State Variables. PuK Malte Helmert
2001	J	`jnl`	MIPS: The Model-Checking Integrated Planning System. AI Mag. Stefan Edelkamp, Malte Helmert
1999	—	`conf`	Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. ECP Stefan Edelkamp, Malte Helmert