Search

Search Results

• On Speeding Up Methods for Identifying Redundant Actions in Plans

  Jakub Med, Lukáš Chrpa

  252-260

  2022-06-13

• Simple Temporal Networks for Improvisational Teamwork

  Malia Morgan, Julianna Schalkwyk, Huaxiaoyue Wang, Hannah Davalos, Ryan Martinez, Vibha Rohilla, James Boerkoel

  261-269

  2022-06-13

• Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution

  Keisuke Okumura, Xavier Défago

  270-278

  2022-06-13

• Conflict-Directed Diverse Planning for Logic-Geometric Programming

  Joaquim Ortiz-Haro, Erez Karpas, Marc Toussaint, Michael Katz

  279-287

  2022-06-13

• The Power of Reformulation: From Validation to Planning in PDDL+

  Francesco Percassi, Enrico Scala, Mauro Vallati

  288-296

  2022-06-13

• A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations

  Quang Anh Pham, Minh Hoàng Hà, Duy Manh Vu, Huy Hoang Nguyen

  297-306

  2022-06-13

• Planning for Risk-Aversion and Expected Value in MDPs

  Marc Rigter, Paul Duckworth, Bruno Lacerda, Nick Hawes

  307-315

  2022-06-13

• Optimising the Stability in Plan Repair via Compilation

  Alessandro Saetti, Enrico Scala

  316-320

  2022-06-13

• Euclidean Distance-Optimal Post-processing of Grid-Based Paths

  Guru Koushik Senthil Kumar, Sandip Aine, Maxim Likhachev

  321-328

  2022-06-13

• Classical Planning as QBF without Grounding

  Irfansha Shaik, Jaco van de Pol

  329-337

  2022-06-13

• Improving Time-Dependent Contraction Hierarchies

  Bojie Shen, Muhammad Aamir Cheema, Daniel D. Harabor, Peter J. Stuckey

  338-347

  2022-06-13

• New Refinement Strategies for Cartesian Abstractions

  David Speck, Jendrik Seipp

  348-352

  2022-06-13

• Debugging a Policy: Automatic Action-Policy Testing in AI Planning

  Marcel Steinmetz, Daniel Fišer, Hasan Ferit Eniser, Patrick Ferber, Timo P. Gros, Philippe Heim, Daniel Höller, Xandra Schuler, Valentin Wüstholz, Maria Christakis, Jörg Hoffmann

  353-361

  2022-06-13

• Learning to Estimate Search Progress Using Sequence of States

  Matan Sudry, Erez Karpas

  362-370

  2022-06-13

• Neural Network Action Policy Verification via Predicate Abstraction

  Marcel Vinzent, Marcel Steinmetz, Jörg Hoffmann

  371-379

  2022-06-13

• Loopless Top-K Planning

  Julian von Tschammer, Robert Mattmüller, David Speck

  380-384

  2022-06-13

• Lazy Rearrangement Planning in Confined Spaces

  Rui Wang, Kai Gao, Jingjin Yu, Kostas Bekris

  385-393

  2022-06-13

• A*pex: Efficient Approximate Multi-Objective Search on Graphs

  Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig

  394-403

  2022-06-13

• Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware

  Jiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck

  404-412

  2022-06-13

• Uniform Machine Scheduling with Predictions

  Tianming Zhao, Wei Li, Albert Y. Zomaya

  413-422

  2022-06-13

• Conflict-Based Search for the Virtual Network Embedding Problem

  Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar

  423-433

  2022-06-13

• Deep Reinforcement Learning for a Multi-Objective Online Order Batching Problem

  Martijn Beeks, Reza Refaei Afshar, Yingqian Zhang, Remco Dijkman, Claudy van Dorst, Stijn de Looijer

  435-443

  2022-06-13

• OFFICERS: Operational Framework for Intelligent Crime-and-Emergency Response Scheduling

  Jonathan Chase, Siong Thye Goh, Phong Tran, Hoong Chuin Lau

  444-452

  2022-06-13

• Reinforcement Learning Approach to Solve Dynamic Bi-objective Police Patrol Dispatching and Rescheduling Problem

  Waldy Joe, Hoong Chuin Lau, Jonathan Pan

  453-461

  2022-06-13

• Hyper-Heuristics for Personnel Scheduling Domains

  Lucas Kletzander, Nysret Musliu

  462-470

  2022-06-13