ICAPS-2022 Accepted Papers

Erez Karpas. A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning | Session-1 (5a) | Session-2 (10a)
Xiaoyou Lin, Qingliang Chen, Liangda Fang, Quanlong Guan, Weiqi Luo and Kaile Su. Generalized Linear Integer Numeric Planning | Session-1 (1a) | Session-2 (12a)
Loïs Vanhée, Laurent Jeanpierre and Mouaddib Abdel-Illah. Anxiety-Sensitive Planning: From Formal Foundations to Algorithms and Applications | Session-1 (7a) | Session-2 (27b)
Matan Sudry and Erez Karpas. Learning To Estimate Search Progress Using Sequence Of States | Session-1 (6b) | Session-2 (20b)
Daniel Höller, Julia Wichlacz, Pascal Bercher and Gregor Behnke. Compiling HTN Plan Verification Problems into HTN Planning Problems | Session-1 (14b) | Session-2 (27a)
Joaquim Ortiz de Haro, Erez Karpas, Marc Toussaint and Michael Katz. Conflict-Directed Diverse Planning for Logic-Geometric Programming | Session-1 (18b) | Session-2 (29b)
Julian von Tschammer, Robert Mattmüller and David Speck. Loopless Top-k Planning | Session-1 (3a) | Session-2 (28a)
Malia Morgan, Julianna Schalkwyk, Huaxiaoyue Wang, Hannah Davalos, Ryan Martinez, Vibha Rohilla and James Boerkoel. Simple Temporal Networks for Improvisational Teamwork | Session-1 (7b) | Session-2 (30a)
Kin-Ho Lam, Delyar Tabatabai, Jed Irvine, Donald Bertucci, Anita Ruangrotsakun, Minsuk Kahng and Alan Fern. Beyond Value: CheckList for Testing Inferences in Planning-Based RL | Session-1 (16b) | Session-2 (23b)
Keisuke Okumura and Xavier Defago. Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution | Session-1 (6a) | Session-2 (19b)
Marcel Vinzent, Marcel Steinmetz and Jörg Hoffmann. Neural Network Action Policy Verification via Predicate Abstraction | Session-1 (1b) | Session-2 (12b)
Songtuan Lin and Pascal Bercher. On the Expressive Power of Planning Formalisms in Conjunction with LTL | Session-1 (8a) | Session-2 (19a)
Martijn Beeks, Reza Refaei Afshar, Yingqian Zhang, Remco Dijkman, Claudy van Dorst and Stijn de Looijer. Deep reinforcement learning for a multi-objective online order batching problem | Session-1 (2a) | Session-2 (24a)
Sofia Lemons, Carlos Linares, Robert Holte and Wheeler Ruml. Beam Search: Faster and Monotonic | Session-1 (4a) | Session-2 (25a)
Daniel Höller and Gregor Behnke. Encoding Lifted Classical Planning in Propositional Logic | Session-1 (3a) | Session-2 (28a)
Clement Gehring, Masataro Asai, Rohan Chitnis, Tom Silver, Leslie Kaelbling, Shirin Sohrabi and Michael Katz. Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators | Session-1 (26a) | Session-2 (30b)
Marc Rigter, Paul Duckworth, Bruno Lacerda and Nick Hawes. Planning for Risk-Aversion and Expected Value in MDPs | Session-1 (7a) | Session-2 (27b)
Irfansha Shaik and Jaco van de Pol. Classical Planning as QBF without Grounding | Session-1 (3a) | Session-2 (28a)
Michael Katz and Shirin Sohrabi. Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria | Session-1 (5a) | Session-2 (24b)
Benjamin Ayton and Masataro Asai. Width-Based Planning and Active Learning for Atari | Session-1 (6b) | Session-2 (15a)
Tianming Zhao, Wei Li and Albert Zomaya. Uniform Machine Scheduling with Predictions | Session-1 (1a) | Session-2 (26b)
Rostislav Horčík, Alvaro Torralba, Pavel Rytíř, Lukáš Chrpa and Stefan Edelkamp. Optimal Mixed Strategies for Cost-Adversarial Planning Games | Session-1 (4b) | Session-2 (9b)
Sara Bernardini, Fabio Fagnani, Santiago Franco and Alexandra Neacsu. A Network Flow Interpretation of Robust Goal Legibility in Path Finding | Session-1 (5a) | Session-2 (10a)
Maxence Grand, Damien Pellier and Humbert Fiorino. TempAMLSI: Temporal Action Model Learning based on STRIPS translation | Session-1 (21b) | Session-2 (28b)
Aakash Aakash and Indranil Saha. It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot Systems | Session-1 (4b) | Session-2 (9b)
Ashwin Kumar, Stylianos Loukas Vasileiou, Melanie Bancilhon, Alvitta Ottley and William Yeoh. VizXP: A Visualization Framework for Conveying Explanations to Users in Model Reconciliation Problems | Session-1 (15b) | Session-2 (31a)
Yang Zhou, Wang Fang, Shi Zhan and Feng Dan. An End-to-End Automatic Cache Replacement Policy Using Deep Reinforcement Learning | Session-1 (6b) | Session-2 (24a)
Bojie Shen, Muhammad Aamir Cheema, Daniel D. Harabor and Peter J. Stuckey. Improving Time-dependent Contraction Hierarchies | Session-1 (17b) | Session-2 (19b)
Patrick Ferber, Florian Geißer, Felipe Trevizan, Malte Helmert and Joerg Hoffmann. Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods | Session-1 (11a) | Session-2 (30b)
Marcel Steinmetz, Daniel Fišer, Hasan Ferit Enişer, Patrick Ferber, Timo Gros, Philippe Heim, Daniel Höller, Xandra Schuler, Valentin Wüstholz, Maria Christakis and Joerg Hoffmann. Debugging a Policy: Automatic Action-Policy Testing in AI Planning | Session-1 (1b) | Session-2 (12b)
Martim Brandao, Amanda Coles, Andrew Coles and Joerg Hoffmann. Merge and Shrink Abstractions for Temporal Planning | Session-1 (23a) | Session-2 (28b)
Simon Ståhlberg, Blai Bonet and Hector Geffner. Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits | Session-1 (15a) | Session-2 (19a)
Lihan Chen, Jingping Liu, Sihang Jiang, Chao Wang, Jiaqing Liang, Yanghua Xiao, Sheng Zhang and Rui Song. Crossword Puzzle Resolution via Monte Carlo Tree Search | Session-1 (9a) | Session-2 (29a)
Rebecca Eifler, Martim Brandao, Amanda Coles, Jeremy Frank and Joerg Hoffmann. Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study | Session-1 (20a) | Session-2 (31a)
Augusto B. Corrêa and Jendrik Seipp. Best-First Width Search for Lifted Classical Planning | Session-1 (4a) | Session-2 (9a)
Sanket Shah, Meghna Lowalekar and Pradeep Varakantham. Joint Pricing and Matching for City-Scale Ride-Pooling | Session-1 (17a) | Session-2 (21a)
Malte Helmert, Silvan Sievers, Alexander Rovner and Augusto B. Corrêa. On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond | Session-1 (11a) | Session-2 (30b)
Geert Leonardus Johannes Pingen, Christian Rijk van Ommeren, Cornelis Jan van Leeuwen, Ruben Fransen, Tijmen Elfrink, Yorick Christiaan de Vries, Janarthanan Karunakaran, Emir Demirović and Neil Yorke-Smith. Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics | Session-1 (7b) | Session-2 (30a)
Thorsten Klößner, Marcel Steinmetz, Álvaro Torralba and Jörg Hoffmann. Pattern Selection Strategies for Pattern Databases in Probabilistic Planning | Session-1 (23a) | Session-2 (27b)
Maayan Shvo, Toryn Q. Klassen and Sheila A. McIlraith. Resolving Misconceptions about the Plans of Agents via Theory of Mind | Session-1 (13a) | Session-2 (25b)
Cyrus Neary, Christos Verginis, Murat Cubuktepe and Ufuk Topcu. Verifiable and Compositional Reinforcement Learning Systems | Session-1 (16b) | Session-2 (23b)
Jakub Med and Lukas Chrpa. On Speeding up Methods for Identifying Redundant Actions in Plans | Session-1 (14a) | Session-2 (18a)
Waldy Joe, Hoong Chuin Lau and Jonathan Pan. Reinforcement Learning Approach to Solve Dynamic Bi-Objective Police Patrol Dispatching and Rescheduling Problem | Session-1 (2a) | Session-2 (29b)
Justin Kottinger, Shaull Almagor and Morteza Lahijanian. Conflict-Based Search for Explainable Multi-Agent Path Finding | Session-1 (6a) | Session-2 (16a)
Franck Djeumou, Murat Cubuktepe, Craig Lennon and Ufuk Topcu. Task-Guided Inverse Reinforcement Learning Under Partial Information | Session-1 (7a) | Session-2 (22a)
Jingqing Ruan, Linghui Meng, Xuantang Xiong, Dengpeng Xing and Bo Xu. Learning Multi-agent Action Coordination via Electing First-move Agent | Session-1 (2a) | Session-2 (12b)
Shuli Hu, Daniel Harabor, Graeme Gange, Peter Stuckey and Nathan Sturtevant. Multi-Agent Path Finding with Temporal Jump Point Search | Session-1 (19b) | Session-2 (29a)
Jiachen Zhang, Giovanni Lo Bianco and Chris Beck. Solving Job-Shop Scheduling Problems with QUBO-based Specialized Hardware | Session-1 (26b) | Session-2 (31b)
Zheyuan Wang and Matthew Gombolay. Stochastic Resource Optimization over Heterogeneous Graph Neural Networks for Failure-Predictive Maintenance Scheduling | Session-1 (3b) | Session-2 (17a)
Jin Yu, Haiyin Piao, Yaqing Hou, Li Mo, Xin Yang and Deyun Zhou. DOMA: Deep Smooth Trajectory Generation Learning for Real-time UAV Motion Planning | Session-1 (18b) | Session-2 (29b)
Florian Geißer, Patrik Haslum, Sylvie Thiebaux and Felipe Trevizan. Admissible Heuristics for Multi-Objective Planning | Session-1 (11a) | Session-2 (26a)
Daniel Gnad, Álvaro Torralba and Daniel Fišer. Beyond Stars - Generalized Topologies for Decoupled Search | Session-1 (4a) | Session-2 (18a)
Dillon Chen and Pascal Bercher. Flexible FOND HTN planning: A Complexity Analysis | Session-1 (8a) | Session-2 (19a)
Alberto Pozanco, Francesca Mosca, Parisa Zehtabi, Daniele Magazzeni and Sarit Kraus. Explaining Preference-driven Schedules: the EXPRES Framework | Session-1 (15b) | Session-2 (20a)
Masood Feyzbakhsh Rankooh and Jussi Rintanen. Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming | Session-1 (2b) | Session-2 (13b)
Cédric Pralet, David Doose, Julien Anxionnat and Jérémie Pouly. Building resource-dependent conditional plans for an Earth monitoring satellite | Session-1 (11b) | Session-2 (31b)
Quang Anh Pham, Minh Hoàng Hà, Duy Manh Vu and Huy Hoang Nguyen. A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations | Session-1 (11b) | Session-2 (21a)
Daniel Fišer, Álvaro Torralba and Joerg Hoffmann. Operator-Potentials in Symbolic Search: From Forward to Bi-Directional Search | Session-1 (5b) | Session-2 (20b)
Lucas Kletzander and Nysret Musliu. Hyper-heuristics for Personnel Scheduling Domains | Session-1 (10b) | Session-2 (31b)
Remo Christen, Salomé Eriksson, Florian Pommerening and Malte Helmert. Detecting Unsolvability Based on Separating Functions | Session-1 (2b) | Session-2 (13b)
Simon Bøgh, Peter G. Jensen, Martin Kristjansen, Kim G. Larsen and Ulrik Nyman. Distributed Fleet Management in Noisy Environments via Model-Predictive Control | Session-1 (7b) | Session-2 (9b)
Taylor Dohmen, Noah Topper, George Atia, Andre Beckus, Ashutosh Trivedi and Alvaro Velasquez. Inferring Probabilistic Reward Machines from Non-Markovian Reward Signals for Reinforcement Learning | Session-1 (8b) | Session-2 (22a)
Ryo Kuroiwa, Alexander Shleyfman and Chris Beck. LM-Cut Heuristics for Optimal Linear Numeric Planning | Session-1 (12a) | Session-2 (26a)
Jonathan Chase, Siong Thye Goh, Phong Tran and Hoong Chuin Lau. OFFICERS: Operational Framework For Intelligent Crime-and-Emergency Response Scheduling | Session-1 (3b) | Session-2 (10b)
David Speck and Jendrik Seipp. New Refinement Strategies for Cartesian Abstractions | Session-1 (2b) | Session-2 (23a)
Ryo Kuroiwa and Chris Beck. Biased Exploration for Satisficing Heuristic Search | Session-1 (13b) | Session-2 (25a)
Alessandro Saetti and Enrico Scala. Optimising the Stability in Plan Repair via Compilation | Session-1 (4b) | Session-2 (27a)
Pierre Tassel, Benjamin Kovács, Martin Gebser, Konstantin Schekotihin, Wolfgang Kohlenbrein and Philipp Schrott-Kostwein. Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial Scheduling | Session-1 (3b) | Session-2 (24a)
Valentin Honoré, Bertrand Simon and Frédéric Suter. An Exact Algorithm for the Linear Tape Scheduling Problem | Session-1 (10b) | Session-2 (21a)
Thorsten Klößner, Florian Pommerening, Thomas Keller and Gabriele Röger. Cost Partitioning Heuristics for Stochastic Shortest Path Problems | Session-1 (5b) | Session-2 (20b)
Gabriel Cantareira, Gerard Canal and Rita Borgo. Actor-focused interactive visualization for AI Planning | Session-1 (24b) | Session-2 (31a)
Dominik Drexler, Jendrik Seipp and Hector Geffner. Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width | Session-1 (1a) | Session-2 (15a)
Ramon Fraga Pereira, André Grahl Pereira, Frederico Messa and Giuseppe De Giacomo. Iterative Depth-First Search for Fully Observable Non-Deterministic Planning | Session-1 (5b) | Session-2 (9a)
Sriram Gopalakrishnan and Daniel Borrajo. Assignment and Prioritization Of Tasks With Uncertain Durations For Satisfying Makespans In Decentralized Execution | Session-1 (26b) | Session-2 (30a)
Francesco Percassi, Enrico Scala and Mauro Vallati. The Power of Reformulation: PDDL+ Validation Through Planning | Session-1 (14b) | Session-2 (27a)
Abhinav Bhatia, Justin Svegliato, Samer Nashed and Shlomo Zilberstein. Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning | Session-1 (16b) | Session-2 (23b)
Rui Wang, Kai Gao, Jingjin Yu and Kostas Bekris. Lazy Rearrangement Planning in Confined Spaces | Session-1 (17b) | Session-2 (22b)
Alvaro Velasquez, Brett Bissey, Lior Barak, Daniel Melcer, Andre Beckus, Ismail Alkhouri and George Atia. Multi-Agent Tree Search with Dynamic Reward Shaping | Session-1 (16a) | Session-2 (29a)
Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig and T. K. Satish Kumar. Conflict-Based Search for the Virtual Network Embedding Problem | Session-1 (6a) | Session-2 (16a)
Noah Topper, George Atia, Ashutosh Trivedi and Alvaro Velasquez. Active Grammatical Inference for Non-Markovian Planning | Session-1 (8b) | Session-2 (21b)
Karthik Valmeekam, Sarath Sreedharan, Sailik Sengupta and Subbarao Kambhampati. RADAR-X: An Interactive Mixed Initiative Planning Interface Pairing Contrastive Explanations and Revised Plan Suggestions | Session-1 (15b) | Session-2 (31a)
Daniel Wang, Joseph Russino, Connor Basich and Steve Chien. Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander | Session-1 (8a) | Session-2 (22b)
Guru Koushik Senthil Kumar, Sandip Aine and Maxim Likhachev. Euclidean Distance-Optimal Post-Processing of Grid-Based Paths | Session-1 (17b) | Session-2 (22b)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa and Sven Koenig. A*pex: Approximate and Efficient Multi-Objective Search on Graphs | Session-1 (14a) | Session-2 (25a)
Richard Levinson, Samantha Niemoeller, Sreeja Nag and Vinay Ravindra. Planning Satellite Swarm Measurements for Earth Science Models: Comparing Constraint Processing and MILP methods | Session-1 (17a) | Session-2 (31b)