List of Papers Accepted to ICAPS 2023

Find below the list of the 56 papers accepted to the Main Track

Explainable Goal Recognition: A Framework Based on Weight of Evidence

Abeer Alshehri, Timothy Miller and Mor Vered

Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases

Daniel Gnad, Silvan Sievers and Álvaro Torralba

Using Simple Incentives to Improve Two-Sided Fairness in Ridesharing Systems

Ashwin Kumar, Yevgeniy Vorobeychik and William Yeoh

An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem

Quang Anh Pham, Hoong Chuin Lau, Minh Hoàng Hà and Lam Vu

A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size

Frederico Messa and André Grahl Pereira

Finding Matrix Multiplication Algorithms with Classical Planning

David Speck, Paul Höft, Daniel Gnad and Jendrik Seipp

Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent

Arec Jamgochian, Anthony Corso and Mykel Kochenderfer

Optimality Certificates for Classical Planning

Esther Mugdan, Remo Christen and Salomé Eriksson

On Using Action Inheritance and Modularity in PDDL Domain Modelling

Alan Lindsay

Robust Metric Hybrid Planning in Stochastic Nonlinear Domains using Mathematical Optimization

Buser Say

Falsification of Cyber-Physical Systems Using PDDL+ Planning

Diego Aineto, Enrico Scala, Eva Onaindia and Ivan Serina

Exploiting Geometric Constraints in Multi-Agent Pathfinding

Dor Atzmon, Sara Bernardini, Fabio Fagnani and David Fairbairn

Landmark Progression in Heuristic Search

Clemens Büchner, Thomas Keller, Salomé Eriksson and Malte Helmert

Priority-Based Search for the Virtual Network Embedding Problem

Yi Zheng, Hang Ma, Sven Koenig, Erik Kline and T. K. Satish Kumar

The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True

Bernhard Nebel

Improving Zero-Shot Coordination Performance Based on Policy Similarity

Lebin Yu, Yunbo Qiu, Quanming Yao, Xudong Zhang and Jian Wang

Operator Pruning using Lifted Mutex Groups via Compilation on Lifted Level

Daniel Fišer

Safety Shielding under Delayed Observation

Filip Cano Córdoba, Alexander Palmisano, Martin Fränzle, Roderick Bloem and Bettina Könighofer

Generalizing Action Justification and Causal Links to Policies

Sarath Sreedharan, Christian Muise and Subbarao Kambhampati

Parallel Batch Processing for the Coating Problem

Matthias Horn, Emir Demirović and Neil Yorke-Smith

Convexity Hierarchies in Grid Networks

Johannes Blum, Sabine Storandt and Ruoying Li

Planning with Multiple Action-Cost Estimates

Eyal Weiss and Gal A. Kaminka

Deadline-Aware Multi-Agent Tour Planning

Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph Durham, Jiaoyang Li, Bistra Dilkina and Sven Koenig

Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic

Luigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Emilio Gerevini and Enrico Scala

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search

Dor Atzmon, Shahaf Shperberg, Netanel Sabah, Ariel Felner and Nathan Sturtevant

Planning with Multi-Agent Belief Using Justified Perspectives

Guang Hu, Tim Miller and Nir Lipovetzky

Efficient Reasoning about Infeasible One Machine Sequencing

Raúl Mencía, Carlos Mencía and Joao Marques-Silva

Adaptation and Communication in Human Robot Teaming to Handle Discrepancy in Agents' Beliefs about Plans

Yuening Zhang and Brian Williams

Planning over Integers: Compilations and Undecidability

Daniel Gnad, Malte Helmert, Peter Jonsson and Alexander Shleyfman

On Partial Satisfaction Planning with Total-Order HTNs

Gregor Behnke, David Speck, Michael Katz and Shirin Sohrabi

Planning for Attacker Entrapment in Adversarial Settings

Brittany Cates, Anagha Kulkarni and Sarath Sreedharan

Runahead A* : Speculative Parallelism for A* with Slow Expansions

Mohammad Bakhshalipour, Mohamad Qadri, Dominic Guri, Seyed Borna Ehsani, Maxim Likhachev and Phillip Gibbons

Lifted Stackelberg Planning

Philipp Sauer, Marcel Steinmetz, Robert Kuennemann and Joerg Hoffmann

A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems

Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz and Silvan Sievers

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search

Edward Lam, Daniel Harabor, Peter J. Stuckey and Jiaoyang Li

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies

Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa and Sven Koenig

Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization

Ryo Kuroiwa and Chris Beck

A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem

Sergey Polyakovskiy and Peter Stuckey

Fixing Plans for PDDL+ Problems: Theoretical and Practical Implications

Francesco Percassi, Enrico Scala and Mauro Vallati

Act-Then-Measure: Reinforcement Learning for Partially Observable Environments with Active Measuring

Merlijn Krale, Thiago D. Simão and Nils Jansen

Sensitivity Analysis for Dynamic Control of PSTNs with Skewed Distributions

Rosy Chen, Yiran Ma, Siqi Wu and James Boerkoel

Automatic Metamorphic Test Oracles for Action-Policy Testing

Jan Eisenhut, Álvaro Torralba, Maria Christakis and Joerg Hoffmann

Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement

Raphael Kreft, Clemens Büchner, Silvan Sievers and Malte Helmert

Planning in Multi-Agent Domains with Untruthful Announcements

Loc Pham, Tran Cao Son and Enrico Pontelli

A Column Generation Approach to Correlated Simple Temporal Networks

Andrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper and Jeremy Frank

Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning

Alexander Shleyfman, Ryo Kuroiwa and J. Christopher Beck

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving

Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening and Stefan Woltran

Model Checking for Adversarial Multi-Agent Reinforcement Learning with Reactive Defense Methods

Dennis Groß, Christoph Schmidl, Nils Jansen and Guillermo Perez

Multi Agent Path Finding Under Obstacle Uncertainty

Bar Shofer, Guy Shani and Roni Stern

Goal Recognition with Timing Information

Chenyuan Zhang, Charles Kemp and Nir Lipovetzky

Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search

Ryo Kuroiwa and Chris Beck

Beyond Pairwise Reasoning in Multi-Agent Path Finding

Bojie Shen, Zhe Chen, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Harabor and Peter Stuckey

Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks

Conny Olz and Pascal Bercher

Cost Splitting for Multi-Objective Conflict-Based Search

Cheng Ge, Han Zhang, Jiaoyang Li and Sven Koenig

A Planning Approach to Repair Domains with Incomplete Action Effects

Alba Gragera, Raquel Fuentetaja, Ángel García-Olaya and Fernando Fernández

Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding

Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam and Howie Choset

Application Track

Find below the list of the 8 papers accepted to the Application Track

Dynamic Weight Setting for Personnel Scheduling with Many Objectives

Lucas Kletzander and Nysret Musliu

Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time Windows

Matthias Horn, Emir Demirović and Neil Yorke-Smith

Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+

Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern and Shiwali Mohan

Combining Clinical and Spatial Constraints into Temporal Planning to Personalize Physical Rehabilitation

Alessandro Umbrico, Marco Benadduci, Roberta Bevilacqua, Amedeo Cesta, Francesca Fracasso, Elvira Maranesi, Andrea Orlandini and Gabriella Cortellessa

Combining Heuristic Search and Linear Programming to Compute Realistic Financial Plans

Alberto Pozanco, Kassiani Papasotiriou, Daniel Borrajo and Manuela Veloso

Moving trains like pebbles: a feasibility study on tree yards

Issa Hanou, Mathijs de Weerdt and Jesse Mulderij

Automated Planning to Prioritise Digital Forensics Investigation Cases Containing Indecent Images of Children

Saad Khan, Simon Parkinson, Monika Roopak, Rachel Armitage and Andrew Barlow

(abstract) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry

Felix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz

Check the PDF

Robotic Track

Find below the list of the 4 papers accepted to the Robotic Track

Approximating the Value of Collaborative Team Actions for Efficient Multiagent Navigation in Uncertain Graphs

Martina Stadler, Jacopo Banfi and Nicholas Roy

Planning for Automated Testing of Implicit Constraints in Behavior Trees

Uwe Köckemann, Daniele Calisi, Guglielmo Gemignani, Jennifer Renoux and Alessandro Saffiotti

Planning for Manipulation Among Movable Objects: Deciding Which Objects Go Where, In What Order, And How

Dhruv Saxena and Maxim Likhachev

Understanding Natural Language in Context

Avichai Levy and Erez Karpas

Learning Track

Find below the list of the 12 papers accepted to the Learning Track

Reinforcement Learning for Omega-Regular Specifications on Continuous-Time MDP

Amin Falah, Shibashis Guha and Ashutosh Trivedi

An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming

Pierre Tassel, Martin Gebser and Konstantin Schekotihin

Fast and Robust Resource-Constrained Scheduling with Graph Neural Networks

Florent Teichteil-Königsbuch, Guillaume Povéda, Guillermo Gonzalez de Garibay Barba, Tim Luchterhand and Sylvie Thiebaux

Automaton-guided Curriculum Generation for Reinforcement Learning Agents

Yash Shukla, Abhishsek Kulkarni, Robert Wright, Alvaro Velasquez and Jivko Sinapov

Imitation Improvement Learning for Large-scale Capacitated Vehicle Routing Problems

Viet Bui and Tien Mai

Timed Partial Order Inference Algorithm

Kandai Watanabe, Bardh Hoxha, Danil Prokhorov, Georgios Fainekos, Morteza Lahijanian, Sriram Sankaranarayanan and Tomoya Yamaguchi

Deceptive Reinforcement Learning in Model-Free Domains

Alan Lewis and Tim Miller

Exploration Policies for On-the-fly Controller Synthesis: a Reinforcement Learning Approach

Tomás Delgado, Marco Sánchez Sorondo, Víctor Braberman and Sebastián Uchitel

Task Phasing: Automated Curriculum Learning from Demonstrations

Vaibhav Bajaj, Guni Sharon and Peter Stone

Learning Local Heuristics for Search-Based Navigation Planning

Rishi Veerapaneni, Muhammad Suhail Saleem and Maxim Likhachev

Goal Recognition as a Deep Learning Task: the GRNet Approach

Mattia Chiari, Alfonso Emilio Gerevini, Luca Putelli, Francesco Percassi and Ivan Serina

Safe MDP Planning by Learning Temporal Patterns of Undesirable Trajectories and Averting Negative Side Effects

Siow Meng Low, Akshat Kumar and Scott Sanner

Journal Track

Find below the list of the 7 papers accepted to the Journal Track

ProSeqqo: A Generic Solver for Process Planning and Sequencing in Industrial Robotics

László Zahorán (EPIC InnoLabs Nonprofit Ltd., Budapest, Hungary) and András Kovács (Institute for Computer Science and Control (SZTAKI))

Robotics and Computer-Integrated Manufacturing - https://www.sciencedirect.com/science/article/pii/S0736584522000746

Planning with Perspectives -- Decomposing Epistemic Planning using Functional STRIPS.

Guang Hu (The University of Melbourne), Tim Miller (The University of Melbourne) and Nir Lipovetzky (The University of Melbourne)

JAIR - https://www.jair.org/index.php/jair/article/view/13446

Unavoidable deadends in deterministic partially observable contingent planning

Guy Shani (Ben Gurion University), Lera Shtotland (ben gurion university), Dorin Shmaryahu (Ben-Gurion University of the Negev) and Ronen Brafman (Computer Science, Ben Gurion University)

JAAMAS - https://link.springer.com/article/10.1007/s10458-022-09570-w

Online Learning of Variable Ordering Heuristics for Constraint Optimisation Problems

Floris Doolaard (Delft University of Technology) and Neil Yorke-Smith (Delft University of Technology)

AMAI - https://link.springer.com/article/10.1007/s10472-022-09816-z

Decentralized Observation Allocation for a Large-Scale Constellation

Shreya Parjan (Jet Propulsion Laboratory, California Institute of Technology) and Steve Chien (Jet Propulsion Laboratory, California Institute of Technology)

JAIS - https://arc.aiaa.org/doi/abs/10.2514/1.I011215

Multi-UAV Planning for Cooperative Wildfire Coverage and Tracking with Quality-of-Service Guarantees

Esmaeil Seraj (Georgia Institute of Technology), Andrew Silva (Georgia Institute of Technology) and Matthew Gombolay (Georgia Institute of Technology)

JAAMAS - https://link.springer.com/article/10.1007/s10458-022-09566-6

Search-based task and motion planning for hybrid systems: Agile autonomous vehicles

Zlatan Ajanovic (TU Delft), Enrico Regolin (University of Pavia), Barys Shyrokau (TU Delft), Hana Ćatić (University of Sarajevo), Martin Horn (Graz University of Technology) and Antonella Ferrara (University of Pavia)

EAAI - https://www.sciencedirect.com/science/article/pii/S0952197623000775