ICAPS 2023 Schedule

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

Amin Falah, Shibashis Guha and Ashutosh Trivedi

Long paper, time: 15 min.

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

Long paper, time: 15 min.

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

Pierre Tassel, Martin Gebser and Konstantin Schekotihin

Long paper, time: 15 min.

Deceptive Reinforcement Learning in Model-Free Domains

Alan Lewis and Tim Miller

Long paper, time: 15 min.

Imitation Improvement Learning for Large-scale Capacitated Vehicle Routing Problems

Viet Bui and Tien Mai

Long paper, time: 15 min.

Timed Partial Order Inference Algorithm

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

Long paper, time: 15 min.

Goal Recognition as a Deep Learning Task: the GRNet Approach

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

Long paper, time: 15 min.

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

Siow Meng Low, Akshat Kumar and Scott Sanner

Long paper, time: 15 min.

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

Long paper, time: 15 min.

Learning Local Heuristics for Search-Based Navigation Planning

Rishi Veerapaneni, Muhammad Suhail Saleem and Maxim Likhachev

Short paper, time: 7.5 min.

Automaton-guided Curriculum Generation for Reinforcement Learning Agents

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

Long paper, time: 15 min.

Task Phasing: Automated Curriculum Learning from Demonstrations

Vaibhav Bajaj, Guni Sharon and Peter Stone

Long paper, time: 15 min.

Improving Zero-Shot Coordination Performance Based on Policy Similarity

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

Short paper, time: 7.5 min.

Planning for Automated Testing of Implicit Constraints in Behavior Trees

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

Long paper, time: 15 min.

Understanding Natural Language in Context

Avichai Levy and Erez Karpas

Long paper, time: 15 min.

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

Martina Stadler, Jacopo Banfi and Nicholas Roy

Long paper, time: 15 min.

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

Dhruv Saxena and Maxim Likhachev

Long paper, time: 15 min.

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

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

Long paper, time: 15 min.

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

Matthias Horn, Emir Demirović and Neil Yorke-Smith

Long paper, time: 15 min.

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

Long paper, time: 15 min.

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

Felix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz

Abstract paper, time: 7.5 min.

Dynamic Weight Setting for Personnel Scheduling with Many Objectives

Lucas Kletzander and Nysret Musliu

Long paper, time: 15 min.

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

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

Long paper, time: 15 min.

Combining Heuristic Search and Linear Programming to Compute Realistic Financial Plans

Alberto Pozanco, Kassiani Papasotiriou, Daniel Borrajo and Manuela Veloso

Short paper, time: 7.5 min.

Moving trains like pebbles: a feasibility study on tree yards

Issa Hanou, Mathijs de Weerdt and Jesse Mulderij

Long paper, time: 15 min.

Fixing Plans for PDDL+ Problems: Theoretical and Practical Implications

Francesco Percassi, Enrico Scala and Mauro Vallati

Long paper, time: 15 min.

Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning

Alexander Shleyfman, Ryo Kuroiwa and J. Christopher Beck

Long paper, time: 15 min.

Planning over Integers: Compilations and Undecidability

Daniel Gnad, Malte Helmert, Peter Jonsson and Alexander

Short paper, time: 7.5 min.

Robust Metric Hybrid Planning in Stochastic Nonlinear Domains using Mathematical Optimization

Buser Say

Long paper, time: 15 min.

Falsification of Cyber-Physical Systems Using PDDL+ Planning

Diego Aineto, Enrico Scala, Eva Onaindia and Ivan Serina

Short paper, time: 7.5 min.

Planning with Multi-agent Belief using Justified Perspectives

Guang Hu, Tim Miller and Nir Lipovetzky

Long paper, time: 15 min.

Deadline-Aware Multi-Agent Tour Planning

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

Long paper, time: 15 min.

Planning for Attacker Entrapment in Adversarial Settings

Brittany Cates, Anagha Kulkarni and Sarath Sreedharan

Long paper, time: 15 min.

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

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

Long paper, time: 15 min.

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

Ryo Kuroiwa and Chris Beck

Long paper, time: 15 min.

Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search

Ryo Kuroiwa and Chris Beck

Long paper, time: 15 min.

An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem

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

Long paper, time: 15 min.

A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem

Sergey Polyakovskiy and Peter Stuckey

Long paper, time: 15 min.

Optimality Certificates for Classical Planning

Esther Mugdan, Remo Christen and Salomé Eriksson

Long paper, time: 15 min.

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

Long paper, time: 15 min.

Planning with Multiple Action-Cost Estimates

Eyal Weiss and Gal A. Kaminka

Long paper, time: 15 min.

A Planning Approach to Repair Domains with Incomplete Action Effects

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

Long paper, time: 15 min.

Safety Shielding under Delayed Observation

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

Short paper, time: 7.5 min.

A Column Generation Approach to Correlated Simple Temporal Networks

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

Long paper, time: 15 min.

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

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

Long paper, time: 15 min.

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

Frederico Messa and André Grahl Pereira

Long paper, time: 15 min.

Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent

Arec Jamgochian, Anthony Corso and Mykel Kochenderfer

Short paper, time: 7.5 min.

Explainable Goal Recognition: A Framework Based on Weight of Evidence

Abeer Alshehri, Timothy Miller and Mor Vered

Long paper, time: 15 min.

Goal Recognition with Timing Information

Chenyuan Zhang, Charles Kemp and Nir Lipovetzky

Long paper, time: 15 min.

Generalizing Action Justification and Causal Links to Policies

Sarath Sreedharan, Christian Muise and Subbarao Kambhampati

Long paper, time: 15 min.

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

Yuening Zhang and Brian Williams

Long paper, time: 15 min.

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

Conny Olz and Pascal Bercher

Long paper, time: 15 min.

On Partial Satisfaction Planning with Total-Order HTNs

Gregor Behnke, David Speck, Michael Katz and Shirin Sohrabi

Long paper, time: 15 min.

Operator Pruning using Lifted Mutex Groups via Compilation on Lifted Level

Daniel Fišer

Long paper, time: 15 min.

Lifted Stackelberg Planning

Philipp Sauer, Marcel Steinmetz, Robert Kuennemann and Joerg Hoffmann

Short paper, time: 7.5 min.

Efficient Reasoning about Infeasible One Machine Sequencing

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

Long paper, time: 15 min.

Sensitivity Analysis for Dynamic Control of PSTNs with Skewed Distributions

Rosy Chen, Yiran Ma, Siqi Wu and James Boerkoel

Short paper, time: 7.5 min.

Parallel Batch Processing for the Coating Problem

Matthias Horn, Emir Demirović and Neil Yorke-Smith

Long paper, time: 15 min.

On Using Action Inheritance and Modularity in PDDL Domain Modelling

Alan Lindsay

Long paper, time: 15 min.

Landmark Progression in Heuristic Search

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

Long paper, time: 15 min.

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

Long paper, time: 15 min.

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

Daniel Gnad, Silvan Sievers and Álvaro Torralba

Long paper, time: 15 min.

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

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

Short paper, time: 7.5 min.

Finding Matrix Multiplication Algorithms with Classical Planning

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

Short paper, time: 7.5 min.

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

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

Long paper, time: 15 min.

Exploiting Geometric Constraints in Multi-Agent Pathfinding

Dor Atzmon, Sara Bernardini, Fabio Fagnani and David Fairbairn

Long paper, time: 15 min.

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

Long paper, time: 15 min.

Cost Splitting for Multi-Objective Conflict-Based Search

Cheng Ge, Han Zhang, Jiaoyang Li and Sven Koenig

Long paper, time: 15 min.

Multi Agent Path Finding Under Obstacle Uncertainty

Bar Shofer, Guy Shani and Roni Stern

Long paper, time: 15 min.

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

Ashwin Kumar, Yevgeniy Vorobeychik and William Yeoh

Long paper, time: 15 min.

Priority-Based Search for the Virtual Network Embedding Problem

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

Long paper, time: 15 min.

Planning in Multi-Agent Domains with Untruthful Announcements

Loc Pham, Tran Cao Son and Enrico Pontelli

Long paper, time: 15 min.

Automatic Metamorphic Test Oracles for Action-Policy Testing

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

Long paper, time: 15 min.

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

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

Long paper, time: 15 min.

Convexity Hierarchies in Grid Networks

Johannes Blum, Sabine Storandt and Ruoying Li

Long paper, time: 15 min.

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

Short paper, time: 7.5 min.

Beyond Pairwise Reasoning in Multi-Agent Path Finding

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

Long paper, time: 15 min.

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

Bernhard Nebel

Long paper, time: 15 min.

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

Long paper, time: 15 min.

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search

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

Short paper, time: 7.5 min.

Planning with Perspectives -- Decomposing Epistemic Planning using Functional STRIPS

Guang Hu, Tim Miller and Nir Lipovetzky

Long paper, time: 15 min.

Unavoidable deadends in deterministic partially observable contingent planning

Guy Shani, Lera Shtotland, Dorin Shmaryahu and Ronen Brafman

Long paper, time: 15 min.

Online Learning of Variable Ordering Heuristics for Constraint Optimisation Problems

Floris Doolaard and Neil Yorke-Smith

Long paper, time: 15 min.

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

László Zahorán and András Kovács

Long paper, time: 15 min.

Decentralized Observation Allocation for a Large-Scale Constellation

Shreya Parjan and Steve Chien

Long paper, time: 15 min.

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

Esmaeil Seraj, Andrew Silva and Matthew Gombolay

Long paper, time: 15 min.

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

Zlatan Ajanovic, Enrico Regolin, Barys Shyrokau, Hana Ćatić, Martin Horn and Antonella Ferrara

Long paper, time: 15 min.