Abstract is missing.
- Blind Decision Making: Reinforcement Learning with Delayed ObservationsMridul Agarwal, Vaneet Aggarwal. 2-6 [doi]
- The Consistent Case in Bidirectional Search and a Bucket-to-Bucket Algorithm as a Middle Ground between Front-to-End and Front-to-FrontVidal Alcázar. 7-15 [doi]
- Conflict-Free Multi-Agent MeetingDor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner. 16-24 [doi]
- Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN PlanningGregor Behnke. 25-35 [doi]
- A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in Partial Order Causal Link (POCL) PlanningPascal Bercher. 36-45 [doi]
- On Planning with Qualitative State-Trajectory Constraints in PDDL3 by Compiling them AwayLuigi Bonassi, Alfonso Emilio Gerevini, Francesco Percassi, Enrico Scala. 46-50 [doi]
- Computing Opportunities to Augment Plans for Novel Replanning during ExecutionDaniel Borrajo, Manuela Veloso. 51-55 [doi]
- Explaining Path Plan Optimality: Fast Explanation Methods for Navigation Meshes Using Full and Incremental Inverse OptimizationMartim Brandão, Amanda Jane Coles, Daniele Magazzeni. 56-64 [doi]
- Exploiting Cyclic Dependencies in Landmark HeuristicsClemens Büchner, Thomas Keller 0001, Malte Helmert. 65-73 [doi]
- Fully Observable Nondeterministic HTN Planning - Formalisation and Complexity ResultsDillon Chen, Pascal Bercher. 74-84 [doi]
- S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path FindingKenny Chour, Sivakumar Rathinam, Ramamoorthi Ravi. 85-93 [doi]
- Delete-Relaxation Heuristics for Lifted Classical PlanningAugusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert. 94-102 [doi]
- Improving AlphaZero Using Monte-Carlo Graph SearchJohannes Czech, Patrick Korus, Kristian Kersting. 103-111 [doi]
- OMCoRP: An Online Mechanism for Competitive Robot PrioritizationSankar Narayan Das, Swaprava Nath, Indranil Saha. 112-121 [doi]
- Compositional Approach to Translate LTLf/LDLf into Deterministic Finite AutomataGiuseppe De Giacomo, Marco Favorito. 122-130 [doi]
- Subset-Saturated Transition Cost PartitioningDominik Drexler, Jendrik Seipp, David Speck 0001. 131-139 [doi]
- Multiple Plans are Better than One: Diverse Stochastic PlanningMahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu. 140-148 [doi]
- Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal FrontierBoris Goldin, Oren Salzman. 149-158 [doi]
- Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free LanguagesDaniel Höller. 159-167 [doi]
- Loop Detection in the PANDA Planning SystemDaniel Höller, Gregor Behnke. 168-173 [doi]
- Endomorphisms of Lifted Planning ProblemsRostislav Horcík, Daniel Fiser. 174-183 [doi]
- Jump Point Search with Temporal ObstaclesShuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant. 184-191 [doi]
- Total Completion Time Minimization for Scheduling with Incompatibility CliquesKlaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies. 192-200 [doi]
- Pattern Databases for Goal-Probability Maximization in Probabilistic PlanningThorsten Klößner, Jörg Hoffmann 0001, Marcel Steinmetz, Álvaro Torralba. 201-209 [doi]
- LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple ConditionsRyo Kuroiwa 0002, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck. 210-218 [doi]
- Width-Based Backward SearchChao Lei, Nir Lipovetzky. 219-224 [doi]
- Decentralized Refinement Planning and ActingRuoxi Li, Sunandita Patra, Dana S. Nau. 225-233 [doi]
- A Competitive Analysis of Online Multi-Agent Path FindingHang Ma 0001. 234-242 [doi]
- Rule-based Shielding for Partially Observable Monte-Carlo PlanningGiulio Mazzi, Alberto Castellini, Alessandro Farinelli. 243-251 [doi]
- Translations from Discretised PDDL+ to Numeric PlanningFrancesco Percassi, Enrico Scala, Mauro Vallati. 252-261 [doi]
- Scheduling with Complete Multipartite Incompatibility Graph on Parallel MachinesTytus Pikies, Krzysztof Turowski, Marek Kubale. 262-270 [doi]
- Dantzig-Wolfe Decomposition for Cost PartitioningFlorian Pommerening, Thomas Keller 0001, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert. 271-280 [doi]
- Distributed Fair Scheduling for Information Exchange in Multi-Agent SystemsMajid Raeis, S. Jamaloddin Golestani. 281-289 [doi]
- Flexible FOND Planning with Explicit Fairness AssumptionsIvan D. Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner. 290-298 [doi]
- Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical PlanningEnrico Scala, Alban Grastien. 299-307 [doi]
- Knowledge Compilation for Nondeterministic Action LanguagesSergej Scheck, Alexandre Niveau, Bruno Zanuttini. 308-316 [doi]
- Online Saturated Cost Partitioning for Classical PlanningJendrik Seipp. 317-321 [doi]
- Contracting and Compressing Shortest Path DatabasesBojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey. 322-330 [doi]
- Iterative-deepening Bidirectional Heuristic Search with Restricted MemoryShahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant. 331-339 [doi]
- Situated Temporal Planning Using Deadline-aware MetareasoningShahaf S. Shperberg, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony. 340-348 [doi]
- Approximate Novelty SearchAnubhav Singh, Nir Lipovetzky, Miquel Ramírez, Javier Segovia Aguas. 349-357 [doi]
- On the Compilability and Expressive Power of State-Dependent Action CostsDavid Speck 0001, David Borukhson, Robert Mattmüller, Bernhard Nebel. 358-366 [doi]
- Scheduling Stochastic Jobs - Complexity and Approximation AlgorithmsLiangde Tao, Lin Chen, Guochuan Zhang. 367-375 [doi]
- Automatic Instance Generation for Classical PlanningÁlvaro Torralba, Jendrik Seipp, Silvan Sievers. 376-384 [doi]
- Conflict-Based Increasing Cost SearchThayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li 0001, T. K. Satish Kumar. 385-395 [doi]
- Online Hedge Reservation for Diverse Plans and Competitive AnalysisBinghan Wu, Wei Bao, Dong Yuan, Bing Zhou. 396-404 [doi]
- Towards Time-Optimal Any-Angle Path Planning With Dynamic ObstaclesKonstantin S. Yakovlev, Anton Andreychuk. 405-414 [doi]
- Temporal Reasoning with Kinodynamic NetworksHan Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar. 415-425 [doi]
- Privacy-Preserving Algorithm for Decoupling of Multi-Agent Plans with UncertaintyYuening Zhang, Brian C. Williams. 426-434 [doi]
- A Simulator-based Planning Framework for Optimizing Autonomous Greenhouse Control StrategyZhicheng An, Xiaoyan Cao, Yao Yao, Wanpeng Zhang, Lanqing Li, Yue Wang, Shihui Guo, Dijun Luo. 436-444 [doi]
- Automated Design of fMRI ParadigmsKatherine Bianchini Esper, Felipe Meneguzzi. 445-449 [doi]
- In-Station Train Dispatching: A PDDL+ Planning ApproachMatteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto. 450-458 [doi]
- GRAND-VISION: An Intelligent System for Optimized Deployment Scheduling of Law Enforcement AgentsJonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau. 459-467 [doi]
- A Deep Ensemble Method for Multi-Agent Reinforcement Learning: A Case Study on Air Traffic ControlSupriyo Ghosh, Sean Laguna, Shiau Hong Lim, Laura Wynter, Hasan Poonawala. 468-476 [doi]
- Scalable Rail Planning and Replanning: Winning the 2020 Flatland ChallengeJiaoyang Li 0001, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma 0001, Sven Koenig. 477-485 [doi]
- vPlanSim: An Open Source Graphical Interface for the Visualisation and Simulation of AI SystemsJamie O. Roberts, Georgios Mastorakis, Brad Lazaruk, Santiago Franco, Adam A. Stokes, Sara Bernardini. 486-490 [doi]
- Autonomous Building of Structures in Unstructured Environments via AI PlanningJamie O. Roberts, Santiago Franco, Adam A. Stokes, Sara Bernardini. 491-499 [doi]
- Automated Production Scheduling for Artificial Teeth ManufacturingFelix Winter, Christoph Mrkvicka, Nysret Musliu, Jakob Preininger. 500-508 [doi]
- DeepFreight: A Model-free Deep-reinforcement-learning-based Algorithm for Multi-transfer Freight DeliveryJiayu Chen, Abhishek K. Umrawal, Tian Lan, Vaneet Aggarwal. 510-518 [doi]
- Hierarchical Width-Based Planning and LearningMiquel Junyent, Vicenç Gómez, Anders Jonsson. 519-527 [doi]
- Speeding Up Search-Based Motion Planning using Expansion Delay HeuristicsJasmeet Kaur, Ishani Chatterjee 0001, Maxim Likhachev. 528-532 [doi]
- RePReL: Integrating Relational Planning and Reinforcement Learning for Effective AbstractionHarsha Kokel, Arjun Manoharan, Sriraam Natarajan, Balaraman Ravindran, Prasad Tadepalli. 533-541 [doi]
- Integrating Knowledge Compilation with Reinforcement Learning for RoutesJiajing Ling, Kushagra Chandak, Akshat Kumar. 542-550 [doi]
- Meta Reinforcement Learning for Heuristic PlaningRicardo Luna Gutierrez, Matteo Leonetti. 551-559 [doi]
- Abstraction-Guided Policy Recovery from Expert DemonstrationsCanmanie T. Ponnambalam, Frans A. Oliehoek, Matthijs T. J. Spaan. 560-568 [doi]
- Generalized Planning as Heuristic SearchJavier Segovia Aguas, Sergio Jiménez 0003, Anders Jonsson. 569-577 [doi]
- Robust Opponent Modeling via Adversarial Ensemble Reinforcement LearningMacheng Shen, Jonathan P. How. 578-587 [doi]
- Learning and Exploiting Shaped Reward Models for Large Scale Multiagent RLArambam James Singh, Akshat Kumar, Hoong Chuin Lau. 588-596 [doi]
- Learning Heuristic Selection with Dynamic Algorithm ConfigurationDavid Speck 0001, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius Lindauer. 597-605 [doi]
- Data-Driven Decision-Theoretic Planning using Recurrent Sum-Product-Max NetworksHari Teja Tatavarti, Prashant Doshi, Layton Hayes. 606-614 [doi]
- Predicted Composite Signed-Distance Fields for Real-Time Motion Planning in Dynamic EnvironmentsMark Nicholas Finean, Wolfgang Merkt, Ioannis Havoutis. 616-624 [doi]
- Guiding Robot Exploration in Reinforcement Learning via Automated PlanningYohei Hayamizu, Saeid Amiri, Kishan Chandan, Keiki Takadama, ShiQi Zhang. 625-633 [doi]
- E2Coop: Energy Efficient and Cooperative Obstacle Detection and Avoidance for UAV SwarmsShuangyao Huang, Haibo Zhang, Zhiyi Huang. 634-642 [doi]
- Task-Aware Waypoint Sampling for Robotic PlanningSarah Keren, Gerard Canal, Michael Cashmore. 643-651 [doi]
- PLGRIM: Hierarchical Value Learning for Large-scale Exploration in Unknown EnvironmentsSung-Kyun Kim, Amanda Bouman, Gautam Salhotra, David D. Fan, Kyohei Otsu, Joel Burdick, Ali-akbar Agha-mohammadi. 652-662 [doi]
- Hierarchical Freespace Planning for Navigation in Unfamiliar WorldsRaj Korpan, Susan L. Epstein. 663-672 [doi]
- Verifying Plans and Scripts for Robotics Tasks Using Performance Level ProfilesAlexander Kovalchuk, Shashank Shekhar 0002, Ronen I. Brafman. 673-681 [doi]