| 2025 | Quality Diversity for Variational Quantum Circuit Optimization. | Maximilian Zorn, Jonas Stein, Maximilian Balthasar Mansky, Philipp Altmann, Michael Klle, Claudia Linnhoff-Popien |
| 2025 | Posthoc: The Visualisation Platform for Search. | Kevin Zheng, Daniel Harabor, Michael Wybrow |
| 2025 | Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes. | Yunuo Zhang, Baiting Luo, Ayan Mukhopadhyay, Abhishek Dubey |
| 2025 | HTN Plan Repair Algorithms Compared: Strengths and Weaknesses of Different Methods. | Paul Zaidins, Robert P. Goldman, Ugur Kuter, Dana S. Nau, Mark Roberts |
| 2025 | Going Topological in Multi-risk Extended Markov Ratio Decision Processes. | Alexander Zadorojniy, Orit Davidovich, Takayuki Osogami |
| 2025 | DynTaskMAS: A Dynamic Task Graph-driven Framework for Asynchronous and Parallel LLM-based Multi-Agent Systems. | Junwei Yu, Yepeng Ding, Hiroyuki Sato |
| 2025 | Partially Observable Monte-Carlo Graph Search. | Yang You, Vincent Thomas, Alex Schutz, Robert Skilton, Nick Hawes, Olivier Buffet |
| 2025 | How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning. | Mohammad Yousefi, Mario Schmautz, Patrik Haslum, Pascal Bercher |
| 2025 | Agent Planning Programs as Non-deterministic Planning under Fairness. | Nitin Yadav, Sebastian Sardia, Hector Geffner |
| 2025 | Leveraging Action Relational Structures for Integrated Learning and Planning. | Ryan Xiao Wang, Felipe W. Trevizan |
| 2025 | Knowledge Engineering for Planning and Scheduling in the LLM Era. | Mauro Vallati, Roman Bartk, Luks Chrpa, Thomas L. McCluskey, Ronald P. A. Petrick |
| 2025 | A* for Bounding Shortest Paths in the Graphs of Convex Sets. | Kaarthik Sundar, Sivakumar Rathinam |
| 2025 | Automating the Generation of Prompts for LLM-based Action Choice in PDDL Planning. | Katharina Stein, Daniel Fiser, Jrg Hoffmann, Alexander Koller |
| 2025 | A Flow Based Planning Method for Multi-Agent Progression with Deployable Agents and Communication Constraints. | Emile Siboulet, Roland Godet, Arthur Bit-Monnot, Marc-Emmanuel Coupvent des Graviers, Christophe Guettier, Simon Lacroix |
| 2025 | On Using Lazy Greedy Best-First Search with Subgoaling Relaxation in Numeric Planning Problems. | Enrico Scala, Luigi Bonassi |
| 2025 | SibylSatOpt: a MaxSAT-based Greedy Optimal Search for TOHTN Planning. | Gaspard Quenard, Damien Pellier, Humbert Fiorino |
| 2025 | Landmark Generation in HTN Planning Revisited. | Victor Scherer Putrich, Felipe Meneguzzi, Andr Grahl Pereira |
| 2025 | On the Notion of Plan Quality for PDDL+. | Francesco Percassi, Enrico Scala, Mauro Vallati |
| 2025 | Platform-Aware Mission Planning. | Stefan Panjkovic, Alessandro Cimatti, Andrea Micheli, Stefano Tonetta |
| 2025 | Revisiting LLMs in Planning from Literature Review: a Semi-Automated Analysis Approach and Evolving Categories Representing Shifting Perspectives. | Vishal Pallagani, Nitin Gupta, Bharath C. Muppasani, Biplav Srivastava |
| 2025 | Strategies to Improve Goal Selection in Satisficing Oversubscription Planning. | ngel Garca Olaya, Patricia J. Riddle, Michael W. Barley |
| 2025 | Howard's Policy Iteration is Subexponential for Deterministic Markov Decision Problems with Rewards of Fixed Bit-size and Arbitrary Discount Factor. | Dibyangshu Mukherjee, Shivaram Kalyanakrishnan |
| 2025 | Analyzing Launch Operations Using the Spaceport Throughput Analysis Resource (STAR). | Richard Levinson, Vijayakumar Baskaran, Jeffrey Brink, Jeremy Frank |
| 2025 | Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted hᵃᵈᵈ. | Pascal Lauer, lvaro Torralba, Daniel Hller, Jrg Hoffmann |
| 2025 | Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence. | Pascal Lauer, Songtuan Lin, Pascal Bercher |