Search

Search Results

• Automating Thought of Search: A Journey Towards Soundness and Completeness

  Daniel Cao, Michael Katz, Harsha Kokel, Kavitha Srinivas, Shirin Sohrabi

  591-600

  2026-06-08

• PDDL Axioms Are Equivalent to Least Fixed Point Logic

  Claudia Grundke, Gabriele Röger

  104-112

  2026-06-08

• H-ANTS: Hierarchical Ant System with Insert-and-Prune Charging for Capacitated Electric Vehicle Routing

  Chu-Yin Peng, Feng-Feng Wei, Wei-Neng Chen

  210-218

  2026-06-08

• Risk-Bounded Multi-Agent Visual Navigation via Iterative Risk Allocation

  Viraj Parimi, Brian Williams

  200-209

  2026-06-08

• Relaxing Is Hard: Complexity Results for Lifted Partial Order Causal Link Planning

  Harrison Oates, Pascal Bercher

  191-199

  2026-06-08

• Reversibility and Reachability in HTN Planning: Formalization and Computational Complexities in the Totally-Ordered Setting

  Jakub Med, Mohammad Yousefi, Lukáš Chrpa, Pascal Bercher

  181-190

  2026-06-08

• Domain-Independent Dynamic Programming with Constraint Propagation

  Imko Marijnissen, J. Christopher Beck, Emir Demirović, Ryo Kuroiwa

  171-180

  2026-06-08

• I Always Told My Mom That Order Is Overrated: Unordered HTN Planning Is in PSPACE and Models Problems Beyond STRIPS

  Pascal Lauer, Yifan Zhang, Patrik Haslum, Pascal Bercher

  161-170

  2026-06-08

• Leveraging the Value of Information in POMDP Planning

  Zakariya Laouar, Qi Heng Ho, Zachary Sunberg

  152-160

  2026-06-08

• Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games

  Vojtěch Kůr, Vít Musil, Vojtěch Řehák

  142-151

  2026-06-08

• Sampling-Based Multi-Agent Path Planning Guided by Spatio-Temporal Logic Mission Objectives

  Vidisha Kudalkar, Sujit Ponguluri, Anand Balakrishnan, Jyotirmoy V. Deshmukh

  133-141

  2026-06-08

• Optimal Path Planning in Hostile Environments

  Andrzej Kaczmarczyk, Šimon Schierreich, Nicholas Axel Tanujaya, Haifeng Xu

  123-132

  2026-06-08

• PING: A Physics-Informed Neuro-Symbolic Generator for Continuous-Time Planning

  Mahyar Jahani-nasab, Hamid Rezatofighi, Mor Vered, Buser Say

  113-122

  2026-06-08

• Planning with Minimal Disruption

  Alberto Pozanco, Marianela Morales, Daniel Borrajo, Manuela Veloso

  219-227

  2026-06-08

• Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem

  Srikar Gouru, Ariel Felner, Jiaoyang Li

  95-103

  2026-06-08

• Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval

  Tzvika Geft, Kostas Bekris, Jingjin Yu

  86-94

  2026-06-08

• Dynamic Shelf Arrangement and Task Assignment with Stable Matching for Multi-Agent Pickup and Delivery with Multi-Item Packing Problem

  Yosuke Fujisawa, Yusaku Wakasugi, Kazuya Nakazawa, Ryo Matsubara, Toshiharu Sugawara

  77-85

  2026-06-08

• When Both Grounding and Not Grounding Are Bad – a Partially Grounded Encoding of Planning into SAT

  João Filipe, Gregor Behnke

  67-76

  2026-06-08

• Incremental LTLf Synthesis

  Giuseppe De Giacomo, Yves Lespérance, Gianmarco Parretti, Fabio Patrizi, Moshe Y. Vardi

  57-66

  2026-06-08

• Compiling Expressive Planning with Data Types

  Carla Davesa, Joan Espasa, Ian Miguel, Mateu Villaret

  47-56

  2026-06-08

• Complete and Optimal Robust Planning Against Nature

  Lukáš Chrpa, Erez Karpas

  38-46

  2026-06-08

• Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity

  Anoop Bhat, Geordan Gutow, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

  29-37

  2026-06-08

• A Constraint Formulation for Domain Repair with Ground or Lifted Test Plans

  Nika Beriachvili, Arthur Bit-Monnot

  20-28

  2026-06-08

• Subgoaling Relaxation-based Heuristics for Numeric Planning with Infinite Actions

  Ángel Aso-Mollar, Diego Aineto, Enrico Scala, Eva Onaindia

  11-19

  2026-06-08

• Polynomial-time Configuration Generator for Connected Unlabeled Multi-Agent Pathfinding

  Takahiro Suzuki, Keisuke Okumura

  323-331

  2026-06-08