Search

Search Results

• Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning

  Marcel Steinmetz, Sylvie Thiébaux, Daniel Höller, Florent Teichteil-Königsbuch

  555-564

  2024-05-30

• Addressing Myopic Constrained POMDP Planning with Recursive Dual Ascent

  Paula Stocco, Suhas Chundi, Arec Jamgochian, Mykel J. Kochenderfer

  565-569

  2024-05-30

• Robust Multi-Agent Pathfinding with Continuous Time

  Wen Jun Tan, Xueyan Tang, Wentong Cai

  570-578

  2024-05-30

• Multi-Robot Connected Fermat Spiral Coverage

  Jingtao Tang, Hang Ma

  579-587

  2024-05-30

• Optimal Infinite Temporal Planning: Cyclic Plans for Priced Timed Automata

  Rasmus G. Tollund, Nicklas S. Johansen, Kristian Ø. Nielsen, Álvaro Torralba, Kim G. Larsen

  588-596

  2024-05-30

• Improving Learnt Local MAPF Policies with Heuristic Search

  Rishi Veerapaneni, Qian Wang, Kevin Ren, Arthur Jakobsson, Jiaoyang Li, Maxim Likhachev

  597-606

  2024-05-30

• Neural Action Policy Safety Verification: Applicablity Filtering

  Marcel Vinzent, Jörg Hoffmann

  607-612

  2024-05-30

• Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding

  Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li

  613-622

  2024-05-30

• MAPF in 3D Warehouses: Dataset and Analysis

  Qian Wang, Rishi Veerapaneni, Yu Wu, Jiaoyang Li, Maxim Likhachev

  623-632

  2024-05-30

• Learning Generalised Policies for Numeric Planning

  Ryan Xiao Wang, Sylvie Thiébaux

  633-642

  2024-05-30

• Tightest Admissible Shortest Path

  Eyal Weiss, Ariel Felner, Gal A. Kaminka

  643-652

  2024-05-30

• Neuro-Symbolic Learning of Lifted Action Models from Visual Traces

  Kai Xi, Stephen Gould, Sylvie Thiébaux

  653-662

  2024-05-30

• Control in Stochastic Environment with Delays: A Model-based Reinforcement Learning Approach

  Zhiyuan Yao, Ionut Florescu, Chihoon Lee

  663-670

  2024-05-30

• Contrastive Explanations of Centralized Multi-agent Optimization Solutions

  Parisa Zehtabi, Alberto Pozanco, Ayala Bolch, Daniel Borrajo, Sarit Kraus

  671-679

  2024-05-30

• Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths

  Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig

  680-688

  2024-05-30

• A Counter-Example Based Approach to Probabilistic Conformant Planning

  Xiaodi Zhang, Alban Grastien, Charles Gretton

  689-697

  2024-05-30

• Improving the Efficiency and Efficacy of Multi-Agent Reinforcement Learning on Complex Railway Networks with a Local-Critic Approach

  Yuan Zhang, Umashankar Deekshith, Jianhong Wang, Joschka Boedecker

  698-706

  2024-05-30

• Planning and Execution in Multi-Agent Path Finding: Models and Algorithms

  Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

  707-715

  2024-05-30

• Decentralized, Decomposition-Based Observation Scheduling for a Large-Scale Satellite Constellation

  Itai Zilberstein, Ananya Rao, Matthew Salis, Steve Chien

  716-724

  2024-05-30

• An Improved Lower Bound on the Length of Locally-Improving Policy Sequences in MDPs with Large Action Sets

  Pratyush Agarwal, Mulinti Shaik Wajid, Shivaram Kalyanakrishnan

  2-10

  2025-09-16

• Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning

  Pascal Bachor, P. Maurice Dekker, Gregor Behnke

  11-20

  2025-09-16

• Initial Condition Retrieving for Hybrid and Numeric Planning Problems

  Matteo Cardellini, Francesco Percassi, Marco Maratea, Mauro Vallati

  21-29

  2025-09-16

• A Formalism for Optimal Search with Dynamic Heuristics

  Remo Christen, Florian Pommerening, Clemens Büchner, Malte Helmert

  30-39

  2025-09-16

• Delete-Free Planning with Object Creation is Undecidable

  Augusto B. Corrêa

  40-44

  2025-09-16

• Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning

  P. Maurice Dekker, Gregor Behnke

  45-53

  2025-09-16