Michael Katz

CoRR, 2024

Choosing a Classical Planner with Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2024

Generalized Planning in PDDL Domains with Pretrained Large Language Models.

[BibT_eX]

[DOI]

Leslie Pack Kaelbling

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Partially Observable Hierarchical Reinforcement Learning with AI Planning (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Large Language Models as Planning Domain Generators (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Interactive Plan Selection Using Linear Temporal Logic, Disjunctive Action Landmarks, and Natural Language Instruction.

[BibT_eX]

[DOI]

Tathagata Chakraborti

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

K∗ and Partial Order Reduction for Top-Quality Planning.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

On K* Search for Top-K Planning.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Generating SAS+ Planning Tasks of Specified Causal Structure.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Action Space Reduction for Planning Domains.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

K∗ Search over Orbit Space for Top-k Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

PARIS: Planning Algorithms for Reconfiguring Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

On Partial Satisfaction Planning with Total-Order HTNs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

A Conflict-Driven Interface Between Symbolic Planning and Nonlinear Constraint Solving.

[BibT_eX]

[DOI]

Joaquim Ortiz de Haro

Marc Toussaint

IEEE Robotics Autom. Lett., 2022

AI Planning Annotation for Sample Efficient Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2022

On Producing Shortest Cost-Optimal Plans.

[BibT_eX]

[DOI]

Gabriele Röger

Malte Helmert

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Conflict-Directed Diverse Planning for Logic-Geometric Programming.

[BibT_eX]

[DOI]

Joaquim Ortiz de Haro

Marc Toussaint

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators.

[BibT_eX]

[DOI]

Leslie Pack Kaelbling

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

How to Reduce Action Space for Planning Domains? (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Bounding Quality in Diverse Planning.

[BibT_eX]

[DOI]

Octavian Udrea

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

A* Search and Bound-Sensitive Heuristics for Oversubscription Planning.

[BibT_eX]

[DOI]

Emil Keyder

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

The Fewer the Merrier: Pruning Preferred Operators with Novelty.

[BibT_eX]

[DOI]

Alexander Tuisov

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Custom-Design of FDR Encodings: The Case of Red-Black Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Efficient Black-Box Planning Using Macro-Actions with Focused Effects.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

IBM Scenario Planning Advisor: A Neuro-Symbolic ERM Solution.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Symbolic Search for Oversubscription Planning.

[BibT_eX]

[DOI]

David Speck

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Exploring Context-Free Languages via Planning: The Case for Automating Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Online Planner Selection with Graph Neural Networks and Adaptive Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Top-Quality Planning: Finding Practically Useful Sets of Best Plans.

[BibT_eX]

[DOI]

Octavian Udrea

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Causal Knowledge Extraction through Large-Scale Text Mining.

[BibT_eX]

[DOI]

Oktie Hassanzadeh

Debarun Bhattacharjya

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Reshaping Diverse Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

IPC: A Benchmark Data Set for Learning with Graph-Structured Data.

[BibT_eX]

[DOI]

CoRR, 2019

IBM Scenario Planning Advisor: Plan recognition as AI planning in practice.

[BibT_eX]

[DOI]

AI Commun., 2019

Answering Binary Causal Questions Through Large-Scale Text Mining: An Evaluation Using Cause-Effect Pairs from Human Experts.

[BibT_eX]

[DOI]

Oktie Hassanzadeh

Debarun Bhattacharjya

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Towards Automated Planning for Enterprise Services: Opportunities and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Service-Oriented Computing - 17th International Conference, 2019

Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Oversubscription Planning as Classical Planning with Multiple Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Red-Black Heuristics for Planning Tasks with Conditional Effects.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Adaptive Planner Scheduling with Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2018

IBM Scenario Planning Advisor: Plan Recognition as AI Planning in Practice.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Symmetry-Based Task Reduction for Relaxed Reachability Analysis.

[BibT_eX]

[DOI]

Gabriele Röger

Silvan Sievers

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

A Novel Iterative Approach to Top-k Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

An AI Planning Solution to Scenario Generation for Enterprise Risk Management.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Semi-Black Box: Rapid Development of Planning Based Solutions.

[BibT_eX]

[DOI]

Dany Moshkovich

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Strengthening Canonical Pattern Databases with Structural Symmetries.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Stubborn Sets for Fully Observable Nondeterministic Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Adapting Novelty to Classical Planning as Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Structural Symmetries for Fully Observable Nondeterministic Planning.

[BibT_eX]

[DOI]

Dominik Winterer

Martin Wehrle

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

In Search of Tractability for Partial Satisfaction Planning.

[BibT_eX]

[DOI]

Vitaly Mirkis

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Red-black planning: A new systematic approach to partial delete relaxation.

[BibT_eX]

[DOI]

Artif. Intell., 2015

An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Factored Symmetries for Merge-and-Shrink Abstractions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Heuristics and Symmetries in Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013

Red-Black Relaxed Plan Heuristics Reloaded.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Completeness and Ambiguity of Schema Cover.

[BibT_eX]

[DOI]

Nguyen Quoc Viet Hung

Zoltán Miklós

Eliezer Levy

Victor Shafran

Proceedings of the On the Move to Meaningful Internet Systems: OTM 2013 Conferences, 2013

Who Said We Need to Relax All Variables?

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Symmetry Breaking: Satisficing Planning and Landmark Heuristics.

[BibT_eX]

[DOI]

Alexander Shleyfman

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Red-Black Relaxed Plan Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Landmark-enhanced abstraction heuristics.

[BibT_eX]

[DOI]

Sagi Lefler

Artif. Intell., 2012

How to Relax a Bisimulation?

[BibT_eX]

[DOI]

Malte Helmert

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search.

[BibT_eX]

[DOI]

Alexander Shleyfman

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning.

[BibT_eX]

[DOI]

Emil Keyder

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Implicit abstraction heuristics for cost-optimal planning.

[BibT_eX]

[DOI]

AI Commun., 2011

When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings.

[BibT_eX]

[DOI]

Shaul Markovitch

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010

Implicit Abstraction Heuristics.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2010

Optimal admissible composition of abstraction heuristics.

[BibT_eX]

[DOI]

Artif. Intell., 2010

When Abstractions Met Landmarks.

[BibT_eX]

[DOI]

Sagi Lefler

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009

Structural-Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

New Islands of Tractability of Cost-Optimal Planning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2008

Structural Patterns Heuristics via Fork Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Optimal Additive Composition of Abstraction-based Admissible Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007

Structural Patterns of Tractable Sequentially-Optimal Planning.

[BibT_eX]

[DOI]