Skip to main content Skip to main navigation menu Skip to site footer
Proceedings of the International Symposium on Combinatorial Search
  • Current
  • Archives
  • About
    • About the Journal
    • Submissions
    • Privacy Statement
  • Login
  1. Home /
  2. Search

Search

Advanced filters
Published After
Published Before

Search Results

Found 653 items.
  • Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract)

    Konstantin Yakovlev, Anton Andreychuk, Roni Stern
    295-296
    2024-06-01
  • Multi-agent Motion Planning through Stationary State Search (Extended Abstract)

    Jingtian Yan, Jiaoyang Li
    297-298
    2024-06-01
  • Multi-Agent Motion Planning with Bézier Curve Optimization under Kinodynamic Constraints (Extended Abstract)

    Jingtian Yan, Jiaoyang Li
    299-300
    2024-06-01
  • A Short Summary of Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration (Extended Abstract)

    Yuanhang Zhang, Hesheng Wang, Zhongqiang Ren
    301-302
    2024-06-01
  • Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract)

    Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
    303-304
    2024-06-01
  • Multi-Robot Coordination and Layout Design for Automated Warehousing (Extended Abstract)

    Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li
    305-306
    2024-06-01
  • Arbitrarily Scalable Environment Generators via Neural Cellular Automata (Extended Abstract)

    Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li
    307-308
    2024-06-01
  • A Conflict-Driven Approach for Reaching Goals Specified with Negation as Failure

    Forest Agostinelli
    2-10
    2025-07-20
  • Sorting Colored Balls in Colored Tubes

    Ernst Althaus, Markus Blumenstock, Nick Rassau, Felix Martin Schuhknecht, Anton Quentin Zimdars
    11-19
    2025-07-20
  • Finding All Optimal Solutions in Multi-Agent Path Finding

    Shahar Bardugo, Daniel Koyfman, Dor Atzmon
    20-28
    2025-07-20
  • A Problem with the Current Methodology for Comparing Search Algorithms and a Proposed Solution

    Michael Barley, Natasha de Kriek, Santiago Franco, Angel Garcia-Olaya, Tim Hartill, Christopher Triggs, Henry Zwart, Vidal Alcázar, Patricia Riddle
    29-37
    2025-07-20
  • Sub-Microsecond Grid Path Planning, at What Cost?

    Mark Carlson, Daniel Harabor, Peter J. Stuckey
    38-46
    2025-07-20
  • New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding

    Shao-Hung Chan, Thomy Phan, Jiaoyang Li, Sven Koenig
    47-55
    2025-07-20
  • A Bucket-Based Priority Queue for Bounded-Suboptimal and Anytime A* Search

    Garrett M. Fereday, Eric A. Hansen
    56-64
    2025-07-20
  • A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives

    Yaron Halle, Ariel Felner, Sven Koenig, Oren Salzman
    65-73
    2025-07-20
  • Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance

    Weimin Huang, Natalie M. Isenberg, Ján Drgoňa, Draguna L Vrabie, Bistra Dilkina
    74-82
    2025-07-20
  • Minimizing Fuel in Multi-Agent Pathfinding

    Daniel Koyfman, Dor Atzmon, Shahaf Shperberg, Ariel Felner
    83-91
    2025-07-20
  • Low-Level Search on Time Intervals in Branch-and-Cut-and-Price for Multi-Agent Path Finding

    Edward Lam, Peter J. Stuckey
    92-100
    2025-07-20
  • Hierarchical DeepPruner: A Novel Framework for Search Space Reduction

    Ankur Nath, Alan Kuhnle
    101-109
    2025-07-20
  • Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding

    Keisuke Okumura, Hiroki Nagai
    110-117
    2025-07-20
  • Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions

    Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev
    118-126
    2025-07-20
  • From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search

    Dominik Schreiber, Christoph Jabs, Jeremias Berg
    127-135
    2025-07-20
  • From Agent Centric to Obstacle Centric Planning: A Makespan-Optimal Algorithm for the Multi-Agent Warehouse Rearrangement Problem

    Yaakov Sherma, Eyal Weiss, Oren Salzman
    136-144
    2025-07-20
  • Heuristics for Bounded-Suboptimal Search

    Lior Siag, Ariel Felner, Shahaf Shperberg
    145-153
    2025-07-20
  • Task and Motion Planning Using Infinite Completion Tree and Agnostic Skills

    Matan Sudry, Tom Jurgenson, Erez Karpas
    154-161
    2025-07-20
601 - 625 of 653 items << < 20 21 22 23 24 25 26 27 > >> 
More information about the publishing system, Platform and Workflow by OJS/PKP.