Search

Search Results

• A Planning Approach to Repair Domains with Incomplete Action Effects

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

  153-161

  2023-07-01

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

  Dennis Gross, Christoph Schmidl, Nils Jansen, Guillermo A. Pérez

  162-170

  2023-07-01

• Parallel Batch Processing for the Coating Problem

  Matthias Horn, Emir Demirović, Neil Yorke-Smith

  171-179

  2023-07-01

• Planning with Multi-Agent Belief Using Justified Perspectives

  Guang Hu, Tim Miller, Nir Lipovetzky

  180-188

  2023-07-01

• Deadline-Aware Multi-Agent Tour Planning

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

  189-197

  2023-07-01

• Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent

  Arec Jamgochian, Anthony Corso, Mykel J. Kochenderfer

  198-202

  2023-07-01

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

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

  203-211

  2023-07-01

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

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

  212-220

  2023-07-01

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

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

  221-226

  2023-07-01

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

  Ashwin Kumar, Yevgeniy Vorobeychik, William Yeoh

  227-235

  2023-07-01

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

  Ryo Kuroiwa, J. Christopher Beck

  236-244

  2023-07-01

• Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search

  Ryo Kuroiwa, J. Christopher Beck

  245-253

  2023-07-01

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

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

  254-258

  2023-07-01

• On Using Action Inheritance and Modularity in PDDL Domain Modelling

  Alan Lindsay

  259-267

  2023-07-01

• Efficient Reasoning about Infeasible One Machine Sequencing

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

  268-276

  2023-07-01

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

  Frederico Messa, André Grahl Pereira

  277-285

  2023-07-01

• Optimality Certificates for Classical Planning

  Esther Mugdan, Remo Christen, Salomé Eriksson

  286-294

  2023-07-01

• A Column Generation Approach to Correlated Simple Temporal Networks

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

  295-303

  2023-07-01

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

  Bernhard Nebel

  304-313

  2023-07-01

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

  Conny Olz, Pascal Bercher

  314-323

  2023-07-01

• Fixing Plans for PDDL+ Problems: Theoretical and Practical Implications

  Francesco Percassi, Enrico Scala, Mauro Vallati

  324-333

  2023-07-01

• Planning in Multi-Agent Domains with Untruthful Announcements

  Loc Pham, Tran Cao Son, Enrico Pontelli

  334-342

  2023-07-01

• An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem

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

  343-351

  2023-07-01

• A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem

  Sergey Polyakovskiy, Peter J. Stuckey

  352-360

  2023-07-01

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

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

  361-369

  2023-07-01