Search

Search Results

• Planner Museum: Evaluating Classical Planners Over Time

  Arnaud Lequen, Oliver Joergensen, Windy Phung, Elliot Gestrin, Damien Van Meerbeeck, Markus Fritzsche, Dominik Drexler, Jendrik Seipp

  393-398

  2026-06-08

• Planning in the LLM Era: Building for Reliability and Efficiency

  Michael Katz, Harsha Kokel, Kavitha Srinivas, Shirin Sohrabi

  387-392

  2026-06-08

• LaCAM* Variants for Minimizing Makespan in Multi-Agent Path Finding

  Omer Idgar, Dor Atzmon, Ariel Felner

  382-386

  2026-06-08

• Finding Optimal Cost-Bounded Plan Reductions

  Martha Del Toro, Raquel Fuentetaja, Ángel García-Olaya

  377-381

  2026-06-08

• Potential Heuristics as Real-Valued Multilinear Polynomials

  Augusto B. Corrêa, Simon Dold, Malte Helmert

  372-376

  2026-06-08

• Planning Under Distribution Shifts with Causal POMDPs

  Matteo Ceriscioli, Karthika Mohan

  367-371

  2026-06-08

• On-Demand Mutex Constraints for Numeric Planning as SMT

  Mustafa F. Abdelwahed, Miquel Bofill, Joan Espasa, Mateu Villaret

  362-366

  2026-06-08

• Beyond Message Passing: Modern GNN Architectures for Online Planner Selection

  Jana Vatter, Ruben Mayer, Hans-Arno Jacobsen, Horst Samulowitz, Michael Katz

  351-360

  2026-06-08

• Online Learning for Decentralized Multi-Agent Planning in Repeated Hedonic Skill Games

  Jaber Valizadeh, Ray Telikani

  342-350

  2026-06-08

• Successor-Generator Planning with LLM-generated Heuristics

  Alexander Tuisov, Yonatan Vernik, Alexander Shleyfman

  332-341

  2026-06-08

• Simplifying Planning Tasks with Fact-Level Relevance Analysis

  Cameron Allen, Anita de Mello Koch, Harsha Kokel, George Konidaris, Michael Katz

  2-10

  2026-06-08

• Compiling Model Reconciliation Explanation Problems into Stackelberg and FOND Planning Problems

  Sarath Sreedharan, Pascal Bercher

  313-322

  2026-06-08

• Computing Planning Width: How Hard Is It, Really?

  Jiajia Song, Seeun William Umboh, Malte Helmert, Nir Lipovetzky, Sebastian Sardiña

  304-312

  2026-06-08

• Operator-Counting Heuristics for Domain-Independent Dynamic Programming

  Anubhav Singh, Florian Pommerening, Tanja Schindler, J. Christopher Beck, Malte Helmert

  294-303

  2026-06-08

• Complexity Results for Fixing Classical Models Using LTL to Express Which Solutions Are (Un)Desired

  Huanghua Sheng, Pascal Bercher

  284-293

  2026-06-08

• Proactive Assistance Agent with Online Goal Recognition

  Qihao Shen, Guang Hu, Chenyuan Zhang

  275-283

  2026-06-08

• Optimal Clifford Synthesis as Planning

  Irfansha Shaik, Jaco van de Pol

  266-274

  2026-06-08

• AUPO – Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm

  Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn

  256-265

  2026-06-08

• Finding a Dominating State in a Haystack: Efficient Data Structures for Dominance Pruning

  María Fernanda Salerno Garmendia, Daniel Fišer, Álvaro Torralba

  247-255

  2026-06-08

• Beyond Pruning: Leveraging Dominance Relations for Heuristic Propagation

  María Fernanda Salerno Garmendia, Daniel Fišer, Álvaro Torralba

  237-246

  2026-06-08

• Planning as Goal Recognition: Deriving Heuristics from Intention Models

  Giacomo Rosa, Jean Honorio, Nir Lipovetzky, Sebastian Sardiña

  228-236

  2026-06-08