Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling
Edited by Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang,
Hankz Hankui Zhuo
held virtually from Guangzhou, China — August 2–13, 2021
Published by the AAAI Press, Palo Alto, California USA
Copyright © 2021, Association for the Advancement of Artificial Intelligence
2275 East Bayshore Road, Suite 160 Palo Alto, California 94303
All Rights Reserved
681pp., illus, references.
ISSN 2334-0843 (online)
ISSN 2334-0835 (print)
ISBN 978-1-57735-867-1
The Proceedings of the The International Conference on Automated Planning and Scheduling is the premier forum for exchanging news and research results on theory and applications of intelligent and automated planning and scheduling technology.
For 2021, ICAPS invited paper submissions related to automated planning and scheduling, including, but not limited to, theoretical and empirical studies of planning and scheduling problems and algorithms; novel techniques and approaches that extend the scope and scale of problems that can be solved; analytic and implemented tools supporting automated planning and scheduling; and studies of applying automated planning and scheduling technologies to significant problems with deep technical insight.
Contents
Main Track
Blind Decision Making: Reinforcement Learning with Delayed Observations
Mridul Agarwal, Vaneet Aggarwal
Pages 2-6 |
PDF
The Consistent Case in Bidirectional Search and a Bucket-to-Bucket
Algorithm as a Middle Ground between Front-to-End and Front-to-Front
Vidal Alcázar
Pages 7-15 |
PDF
Conflict-Free Multi-Agent Meeting
Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel
Felner
Pages 16-24 |
PDF
Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN
Planning
Gregor Behnke
Pages 25-35 |
PDF
A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in
Partial Order Causal Link (POCL) Planning
Pascal Bercher
Pages 36-45 |
PDF
On Planning with Qualitative State-Trajectory Constraints in PDDL3 by
Compiling them Away
Luigi Bonassi, Alfonso Emilio Gerevini, Francesco Percassi, Enrico Scala
Pages 46-50 |
PDF
Computing Opportunities to Augment Plans for Novel Replanning during
Execution
Daniel Borrajo, Manuela Veloso
Pages 51-55 |
PDF
Explaining Path Plan Optimality: Fast Explanation Methods for Navigation
Meshes Using Full and Incremental Inverse Optimization
Martim Brandão, Amanda Coles, Daniele Magazzeni
Pages 56-64 |
PDF
Exploiting Cyclic Dependencies in Landmark Heuristics
Clemens Büchner, Thomas Keller, Malte Helmert
Pages 65-73 |
PDF
Fully Observable Nondeterministic HTN Planning -- Formalisation and
Complexity Results
Dillon Chen, Pascal Bercher
Pages 74-84 |
PDF
S*: A Heuristic Information-Based Approximation Framework for Multi-Goal
Path Finding
Kenny Chour, Sivakumar Rathinam, Ramamoorthi Ravi
Pages 85-93 |
PDF
Delete-Relaxation Heuristics for Lifted Classical Planning
Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert
Pages 94-102 |
PDF
Improving AlphaZero Using Monte-Carlo Graph Search
Johannes Czech, Patrick Korus, Kristian Kersting
Pages 103-111 |
PDF
OMCoRP: An Online Mechanism for Competitive Robot Prioritization
Sankar Narayan Das, Swaprava Nath, Indranil Saha
Pages 112-121 |
PDF
Compositional Approach to Translate LTLf/LDLf into Deterministic Finite
Automata
Giuseppe De Giacomo, Marco Favorito
Pages 122-130 |
PDF
Subset-Saturated Transition Cost Partitioning
Dominik Drexler, Jendrik Seipp, David Speck
Pages 131-139 |
PDF
Multiple Plans are Better than One: Diverse Stochastic Planning
Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu
Pages 140-148 |
PDF
Approximate Bi-Criteria Search by Efficient Representation of Subsets of
the Pareto-Optimal Frontier
Boris Goldin, Oren Salzman
Pages 149-158 |
PDF
Translating Totally Ordered HTN Planning Problems to Classical Planning
Problems Using Regular Approximation of Context-Free Languages
Daniel Höller
Pages 159-167 |
PDF
Loop Detection in the PANDA Planning System
Daniel Höller, Gregor Behnke
Pages 168-173 |
PDF
Endomorphisms of Lifted Planning Problems
Rostislav Horčík, Daniel Fišer
Pages 174-183 |
PDF
Jump Point Search with Temporal Obstacles
Shuli Hu, Daniel D. Harabor, Graeme Gange, Peter J. Stuckey, Nathan R.
Sturtevant
Pages 184-191 |
PDF
Total Completion Time Minimization for Scheduling with Incompatibility
Cliques
Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
Pages 192-200 |
PDF
Pattern Databases for Goal-Probability Maximization in Probabilistic
Planning
Thorsten Klößner, Jörg Hoffmann, Marcel Steinmetz, Álvaro Torralba
Pages 201-209 |
PDF
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with
Simple Conditions
Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro,
J. Christopher Beck
Pages 210-218 |
PDF
Width-Based Backward Search
Chao Lei, Nir Lipovetzky
Pages 219-224 |
PDF
Decentralized Refinement Planning and Acting
Ruoxi Li, Sunandita Patra, Dana S. Nau
Pages 225-233 |
PDF
A Competitive Analysis of Online Multi-Agent Path Finding
Hang Ma
Pages 234-242 |
PDF
Rule-based Shielding for Partially Observable Monte-Carlo Planning
Giulio Mazzi, Alberto Castellini, Alessandro Farinelli
Pages 243-251 |
PDF
Translations from Discretised PDDL+ to Numeric Planning
Francesco Percassi, Enrico Scala, Mauro Vallati
Pages 252-261 |
PDF
Scheduling with Complete Multipartite Incompatibility Graph on Parallel
Machines
Tytus Pikies, Krzysztof Turowski, Marek Kubale
Pages 262-270 |
PDF
Dantzig-Wolfe Decomposition for Cost Partitioning
Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp,
Silvan Sievers, Malte Helmert
Pages 271-280 |
PDF
Distributed Fair Scheduling for Information Exchange in Multi-Agent
Systems
Majid Raeis, S. Jamaloddin Golestani
Pages 281-289 |
PDF
Flexible FOND Planning with Explicit Fairness Assumptions
Ivan D. Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner
Pages 290-298 |
PDF
Non-Deterministic Conformant Planning Using a Counterexample-Guided
Incremental Compilation to Classical Planning
Enrico Scala, Alban Grastien
Pages 299-307 |
PDF
Knowledge Compilation for Nondeterministic Action Languages
Sergej Scheck, Alexandre Niveau, Bruno Zanuttini
Pages 308-316 |
PDF
Online Saturated Cost Partitioning for Classical Planning
Jendrik Seipp
Pages 317-321 |
PDF
Contracting and Compressing Shortest Path Databases
Bojie Shen, Muhammad Aamir Cheema, Daniel D. Harabor, Peter J. Stuckey
Pages 322-330 |
PDF
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory
Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R.
Sturtevant
Pages 331-339 |
PDF
Situated Temporal Planning Using Deadline-aware Metareasoning
Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon E.
Shimony
Pages 340-348 |
PDF
Approximate Novelty Search
Anubhav Singh, Nir Lipovetzky, Miquel Ramirez, Javier Segovia-Aguas
Pages 349-357 |
PDF
On the Compilability and Expressive Power of State-Dependent Action Costs
David Speck, David Borukhson, Robert Mattmüller, Bernhard Nebel
Pages 358-366 |
PDF
Scheduling Stochastic Jobs - Complexity and Approximation Algorithms
Liangde Tao, Lin Chen, Guochuan Zhang
Pages 367-375 |
PDF
Automatic Instance Generation for Classical Planning
Álvaro Torralba, Jendrik Seipp, Silvan Sievers
Pages 376-384 |
PDF
Conflict-Based Increasing Cost Search
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang
Li, T. K. Satish Kumar
Pages 385-395 |
PDF
Online Hedge Reservation for Diverse Plans and Competitive Analysis
Binghan Wu, Wei Bao, Dong Yuan, Bing Zhou
Pages 396-404 |
PDF
Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles
Konstantin Yakovlev, Anton Andreychuk
Pages 405-414 |
PDF
Temporal Reasoning with Kinodynamic Networks
Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar
Pages 415-425 |
PDF
Privacy-Preserving Algorithm for Decoupling of Multi-Agent Plans with
Uncertainty
Yuening Zhang, Brian Williams
Pages 426-434 |
PDF
Novel Applications Track
A Simulator-based Planning Framework for Optimizing Autonomous Greenhouse
Control Strategy
Zhicheng An, Xiaoyan Cao, Yao Yao, Wanpeng Zhang, Lanqing Li, Yue Wang,
Shihui Guo, Dijun Luo
Pages 436-444 |
PDF
Automated Design of fMRI Paradigms
Katherine Bianchini Esper, Felipe Meneguzzi
Pages 445-449 |
PDF
In-Station Train Dispatching: A PDDL+ Planning Approach
Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca
Oneto
Pages 450-458 |
PDF
GRAND-VISION: An Intelligent System for Optimized Deployment Scheduling of
Law Enforcement Agents
Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau
Pages 459-467 |
PDF
A Deep Ensemble Method for Multi-Agent Reinforcement Learning: A Case
Study on Air Traffic Control
Supriyo Ghosh, Sean Laguna, Shiau Hong Lim, Laura Wynter, Hasan Poonawala
Pages 468-476 |
PDF
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge
Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J.
Stuckey, Hang Ma, Sven Koenig
Pages 477-485 |
PDF
vPlanSim: An Open Source Graphical Interface for the Visualisation and
Simulation of AI Systems
Jamie O. Roberts, Georgios Mastorakis, Brad Lazaruk, Santiago Franco, Adam
A. Stokes, Sara Bernardini
Pages 486-490 |
PDF
Autonomous Building of Structures in Unstructured Environments via AI
Planning
Jamie O. Roberts, Santiago Franco, Adam A. Stokes, Sara Bernardini
Pages 491-499 |
PDF
Automated Production Scheduling for Artificial Teeth Manufacturing
Felix Winter, Christoph Mrkvicka, Nysret Musliu, Jakob Preininger
Pages 500-508 |
PDF
Special Track on Planning and Learning
DeepFreight: A Model-free Deep-reinforcement-learning-based Algorithm for
Multi-transfer Freight Delivery
Jiayu Chen, Abhishek K. Umrawal, Tian Lan, Vaneet Aggarwal
Pages 510-518 |
PDF
Hierarchical Width-Based Planning and Learning
Miquel Junyent, Vicenç Gómez, Anders Jonsson
Pages 519-527 |
PDF
Speeding Up Search-Based Motion Planning using Expansion Delay Heuristics
Jasmeet Kaur, Ishani Chatterjee, Maxim Likhachev
Pages 528-532 |
PDF
RePReL: Integrating Relational Planning and Reinforcement Learning for
Effective Abstraction
Harsha Kokel, Arjun Manoharan, Sriraam Natarajan, Balaraman Ravindran,
Prasad Tadepalli
Pages 533-541 |
PDF
Integrating Knowledge Compilation with Reinforcement Learning for Routes
Jiajing Ling, Kushagra Chandak, Akshat Kumar
Pages 542-550 |
PDF
Meta Reinforcement Learning for Heuristic Planing
Ricardo Luna Gutierrez, Matteo Leonetti
Pages 551-559 |
PDF
Abstraction-Guided Policy Recovery from Expert Demonstrations
Canmanie T. Ponnambalam, Frans A. Oliehoek, Matthijs T. J. Spaan
Pages 560-568 |
PDF
Generalized Planning as Heuristic Search
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
Pages 569-577 |
PDF
Robust Opponent Modeling via Adversarial Ensemble Reinforcement Learning
Macheng Shen, Jonathan P. How
Pages 578-587 |
PDF
Learning and Exploiting Shaped Reward Models for Large Scale Multiagent RL
Arambam James Singh, Akshat Kumar, Hoong Chuin Lau
Pages 588-596 |
PDF
Learning Heuristic Selection with Dynamic Algorithm Configuration
David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius
Lindauer
Pages 597-605 |
PDF
Data-Driven Decision-Theoretic Planning using Recurrent Sum-Product-Max
Networks
Hari Tatavarti, Prashant Doshi, Layton Hayes
Pages 606-614 |
PDF
Special Track on Robotics
Predicted Composite Signed-Distance Fields for Real-Time Motion Planning
in Dynamic Environments
Mark Nicholas Finean, Wolfgang Merkt, Ioannis Havoutis
Pages 616-624 |
PDF
Guiding Robot Exploration in Reinforcement Learning via Automated Planning
Yohei Hayamizu, Saeid Amiri, Kishan Chandan, Keiki Takadama, Shiqi Zhang
Pages 625-633 |
PDF
E2Coop: Energy Efficient and Cooperative Obstacle Detection and Avoidance
for UAV Swarms
Shuangyao Huang, Haibo Zhang, Zhiyi Huang
Pages 634-642 |
PDF
Task-Aware Waypoint Sampling for Robotic Planning
Sarah Keren, Gerard Canal, Michael Cashmore
Pages 643-651 |
PDF
PLGRIM: Hierarchical Value Learning for Large-scale Exploration in Unknown
Environments
Sung-Kyun Kim, Amanda Bouman, Gautam Salhotra, David D. Fan, Kyohei Otsu,
Joel Burdick, Ali-akbar Agha-mohammadi
Pages 652-662 |
PDF
Hierarchical Freespace Planning for Navigation in Unfamiliar Worlds
Raj Korpan, Susan L. Epstein
Pages 663-672 |
PDF
Verifying Plans and Scripts for Robotics Tasks Using Performance Level
Profiles
Alexander Kovalchuk, Shashank Shekhar, Ronen I. Brafman
Pages 673-681 |
PDF
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.