Search

Search Results

• Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search

  Lior Siag, Shahaf Shperberg, Ariel Felner, Nathan R. Sturtevant

  158-162

  2023-07-02

• A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations

  Hanlan Yang, Shohin Mukherjee, Maxim Likhachev

  163-167

  2023-07-02

• Using Machine Learning Classifiers in SAT Branching [Extended Abstract]

  Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory Provan

  169-170

  2023-07-02

• Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]

  Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave

  171-172

  2023-07-02

• Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]

  Andrii Nyporko, Lukáš Chrpa

  173-174

  2023-07-02

• A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]

  Adittyo Paul, Ying Feng, Jiaoyang Li

  175-176

  2023-07-02

• On the Notion of Fixability of PDDL+ Plans [Extended Abstract]

  Francesco Percassi, Enrico Scala, Mauro Vallati

  177-178

  2023-07-02

• Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]

  Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan

  179-180

  2023-07-02

• Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]

  Zhongqiang Ren, Sivakumar Rathinam, Howie Choset

  181-182

  2023-07-02

• Must-Expand Nodes in Multi-Objective Search [Extended Abstract]

  Shawn Skyler, Shahaf Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa

  183-184

  2023-07-02

• Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]

  Jiří Švancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko, Roland Kaminski

  185-186

  2023-07-02

• Complete Search of Sliding Tile Puzzles on a Personal Computer [Extended Abstract]

  Oleg Tarakanov

  187-188

  2023-07-02

• Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)

  David Fairbairn

  190-191

  2023-07-02

• Domain-Independent Dynamic Programming (Student Abstract)

  Ryo Kuroiwa

  192-193

  2023-07-02

• Pipe-Routing and Pathfinding in 3D (Student Abstract)

  Thomas K. Nobes

  194-195

  2023-07-02

• Structural Bias in Heuristic Search (Student Abstract)

  Alison Paredes

  196-197

  2023-07-02

• Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract)

  Enrico Saccon

  198-199

  2023-07-02

• Tracking Progress in Multi-Agent Path Finding (Student Abstract)

  Bojie Shen

  200-201

  2023-07-02

• Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract)

  Václav Sobotka

  202-203

  2023-07-02

• Domain Specific Situated Planning (Student Abstract)

  Devin Wild Thomas

  204-205

  2023-07-02

• A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)

  Eyal Weiss

  206-207

  2023-07-02

• Searching with Distributional Heuristics (Student Abstract)

  Stephen Wissow

  208-209

  2023-07-02

• Frontmatter

  Roman Barták, Wheeler Ruml, Oren Salzman

  2023-07-02

• Efficient and Exact Public Transport Routing via a Transfer Connection Database

  Abdallah Abuaisha, Mark Wallace, Daniel Harabor, Bojie Shen

  2-10

  2024-06-01

• Heuristic Search for the Orienteering Problem with Time-Varying Reward

  Chao Cao, Jinyun Xu, Ji Zhang, Howie Choset, Zhongqiang Ren

  11-19

  2024-06-01