Search

Search Results

• Graduated Fidelity Motion Planning

  Mihail Pivtoraiko, Alonzo Kelly

  205-206

  2011-07-15

• Planning in Domains with Cost Function Dependent Actions

  Mike Phillips, Maxim Likhachev

  203-204

  2011-07-15

• Real-Time Adaptive A* with Depression Avoidance

  Carlos Hernandez, Jorge Baier

  193-194

  2011-07-15

• Planning for Landing Site Selection in the Aerial Supply Delivery

  Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev

  199-200

  2011-07-15

• The Compressed Differential Heuristic

  Meir Goldenberg, Nathan Sturtevant, Ariel Felner, Jonathan Schaeffer

  191-192

  2011-07-15

• Evolving Solvers for FreeCell and the Sliding-Tile Puzzle

  Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper

  189-190

  2011-07-15

• Optimal Packing of High-Precision Rectangles

  Eric Huang, Richard Korf

  195-196

  2011-07-15

• Abstract: Block A* and Any-Angle Path-Planning

  Peter Yap, Neil Burch, Robert Holte, Jonathan Schaeffer

  211-212

  2011-07-15

• Efficient and Complete Centralized Multi-Robot Path Planning

  Ryan Luna, Kostas Bekris

  201-202

  2011-07-15

• A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning

  Tatsuya Imai, Akihiro Kishimoto

  197-198

  2011-07-15

• Probably Approximately Correct Heuristic Search

  Roni Stern, Ariel Felner, Robert Holte

  158-163

  2011-07-15

• Best-First Search for Bounded-Depth Trees

  Kevin Rose, Ethan Burns, Wheeler Ruml

  134-141

  2011-07-15

• A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding

  Mokhtar Khorshid, Robert Holte, Nathan Sturtevant

  76-83

  2011-07-15

• Path Planning with Adaptive Dimensionality

  Kalin Gochev, Benjamin Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev

  52-59

  2011-07-15

• Faster Optimal and Suboptimal Hierarchical Search

  Michael Leighton, Wheeler Ruml, Robert Holte

  92-99

  2011-07-15

• Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs

  Christopher Wilt, Wheeler Ruml

  172-179

  2011-07-15

• Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding

  Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner

  150-157

  2011-07-15

• Degrees of Separation in Social Networks

  Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer

  18-23

  2011-07-15

• Deadline-Aware Search Using On-Line Measures of Behavior

  Austin Dionne, Jordan Thayer, Wheeler Ruml

  39-46

  2011-07-15

• Improved Prediction of IDA*'s Performance via Epsilon-Truncation

  Levi Lelis, Sandra Zilles, Robert Holte

  108-116

  2011-07-15

• Repeated-Task Canadian Traveler Problem

  Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Shimony

  24-30

  2011-07-15

• Predicting Solution Cost with Conditional Probabilities

  Levi Lelis, Roni Stern, Shahab Jabbari Arfaee

  100-107

  2011-07-15

• Representing Pattern Databases with Succinct Data Structures

  Tim Schmidt, Rong Zhou

  142-149

  2011-07-15

• Scalable Distributed Monte-Carlo Tree Search

  Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa

  180-187

  2011-07-15

• Size-Independent Additive Pattern Databases for the Pancake Problem

  Álvaro Torralba Arias de Reyna, Carlos Linares López

  164-171

  2011-07-15