Search

Search Results

• Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984)

  Gabriele Röger, Malte Helmert

  173-174

  2012-07-19

• Alternative Forms of Bounded Suboptimal Search

  Richard Valenzano, Shahab Jabbari Arfaee, Jordan Thayer, Roni Stern

  175-176

  2012-07-19

• Abstraction-Guided Sampling for Motion Planning

  Scott Kiesel, Ethan Burns, Wheeler Ruml

  162-163

  2012-07-19

• Motion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces

  Erion Plaku

  171-172

  2012-07-19

• Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs

  Chonhyon Park, Jia Pan, Dinesh Manocha

  168-170

  2012-07-19

• Diverse Depth-First Search in Satisificing Planning

  Akihiro Kishimoto, Rong Zhou, Tatsuya Imai

  164-165

  2012-07-19

• Subdimensional Expansion and Optimal Task Reassignment

  Glenn Wagner, Howie Choset, Nora Ayanian

  177-178

  2012-07-19

• On Improving Plan Quality via Local Enhancements

  Tomas Balyo, Roman Bartak, Pavel Surynek

  154-156

  2012-07-19

• A* Variants for Optimal Multi-Agent Pathfinding

  Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer

  157-158

  2012-07-19

• Learning Heuristic Functions Faster by Using Predicted Solution Costs

  Levi Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert Holte

  166-167

  2012-07-19

• Tree Cache

  Kenneth Anderson

  203

  2012-07-19

• Fast Path Planning Through Segmentation of the Map into Manhattan-Cohesive Areas

  Ioannis Papikas, Ioannis Refanidis

  209-210

  2012-07-19

• 2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues

  Jose Guivant, Brett Seton, Mark Whitty

  206

  2012-07-19

• The JPS Pathfinding System

  Daniel Harabor, Alban Grastien

  207-208

  2012-07-19

• Subgoal Graphs for Eight-Neighbor Gridworlds

  Tansel Uras, Sven Koenig, Carlos Hernandez

  213-214

  2012-07-19

• Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding

  Álvaro Parra, Álvaro Torralba, Carlos Linares López

  211-212

  2012-07-19

• Fast, Optimal Pathfinding with Compressed Path Databases

  Adi Botea

  204-205

  2012-07-19

• When Does Weighted A* Fail?

  Christopher Wilt, Wheeler Ruml

  137-144

  2012-07-19

• Real-Time Motion Planning with Dynamic Obstacles

  Jarad Cannon, Kevin Rose, Wheeler Ruml

  33-40

  2012-07-19

• Efficient Single Frontier Bidirectional Search

  Marco Lippi, Marco Ernandes, Ariel Felner

  105-111

  2012-07-19

• A Theoretical Framework for Studying Random Walk Planning

  Hootan Nakhost, Martin Mueller

  57-64

  2012-07-19

• Execution Ordering in AND/OR Graphs with Failure Probabilities

  Priyankar Ghosh, P. Chakrabarti, Pallab Dasgupta

  41-48

  2012-07-19

• Implementing Fast Heuristic Search Code

  Ethan Burns, Matthew Hatem, Michael Leighton, Wheeler Ruml

  25-32

  2012-07-19

• Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding

  Guni Sharon, Roni Stern, Ariel Felner, Nathan Sturtevant

  97-104

  2012-07-19

• Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives

  Qandeel Sajid, Ryan Luna, Kostas Bekris

  88-96

  2012-07-19