Abstract is missing.
- Adapting a Rapidly-Exploring Random Tree for Automated PlanningVidal Alcázar, Manuela M. Veloso, Daniel Borrajo. 2-9 [doi]
- All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than OthersChrister Bäckström, Peter Jonsson. 10-17 [doi]
- Degrees of Separation in Social NetworksReza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer. 18-23 [doi]
- Repeated-Task Canadian Traveler ProblemZahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony. 24-30 [doi]
- Automatic Move Pruning in General Single-Player GamesNeil Burch, Robert C. Holte. 31-38 [doi]
- Deadline-Aware Search Using On-Line Measures of BehaviorAustin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml. 39-46 [doi]
- Position Paper: Dijkstra s Algorithm versus Uniform Cost Search or a Case Against Dijkstra s AlgorithmAriel Felner. 47-51 [doi]
- Path Planning with Adaptive DimensionalityKalin Gochev, Benjamin J. Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev. 52-59 [doi]
- Search-Based Planning with Provable Suboptimality Bounds for Continuous State SpacesJuan Pablo Gonzalez, Maxim Likhachev. 60-67 [doi]
- A Novel Technique for Compressing Pattern Databases in the Pancake Sorting ProblemsMorteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati. 68-75 [doi]
- A Polynomial-Time Algorithm for Non-Optimal Multi-Agent PathfindingMokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant. 76-83 [doi]
- A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search ProblemsLars Kotthoff, Ian P. Gent, Ian Miguel. 84-91 [doi]
- Faster Optimal and Suboptimal Hierarchical SearchMichael J. Leighton, Wheeler Ruml, Robert C. Holte. 92-99 [doi]
- Predicting Solution Cost with Conditional ProbabilitiesLevi Lelis, Roni Stern, Shahab Jabbari Arfaee. 100-107 [doi]
- Improved Prediction of IDA* s Performance via Epsilon-TruncationLevi Lelis, Sandra Zilles, Robert C. Holte. 108-116 [doi]
- Anytime AND/OR Depth-First Search for Combinatorial OptimizationLars Otten, Rina Dechter. 117-124 [doi]
- State-Set SearchBo Pang, Robert C. Holte. 125-133 [doi]
- Best-First Search for Bounded-Depth TreesKevin Rose, Ethan Burns, Wheeler Ruml. 134-141 [doi]
- Representing Pattern Databases with Succinct Data StructuresTim Schmidt, Rong Zhou. 142-149 [doi]
- Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent PathfindingGuni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner. 150-157 [doi]
- Probably Approximately Correct Heuristic SearchRoni Stern, Ariel Felner, Robert Holte. 158-163 [doi]
- Size-Independent Additive Pattern Databases for the Pancake ProblemÁlvaro Torralba Arias de Reyna, Carlos Linares López. 164-171 [doi]
- Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator CostsChristopher Makoto Wilt, Wheeler Ruml. 172-179 [doi]
- Scalable Distributed Monte-Carlo Tree SearchKazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa. 180-187 [doi]
- Evolving Solvers for FreeCell and the Sliding-Tile PuzzleAchiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper. 189-190 [doi]
- The Compressed Differential HeuristicMeir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer. 191-192 [doi]
- Real-Time Adaptive A* with Depression AvoidanceCarlos Hernández, Jorge A. Baier. 193-194 [doi]
- Optimal Packing of High-Precision RectanglesEric Huang, Richard E. Korf. 195-196 [doi]
- A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing PlanningTatsuya Imai, Akihiro Kishimoto. 197-198 [doi]
- Planning for Landing Site Selection in the Aerial Supply DeliveryAleksandr Kushleyev, Brian MacAllister, Maxim Likhachev. 199-200 [doi]
- Efficient and Complete Centralized Multi-Robot Path PlanningRyan Luna, Kostas E. Bekris. 201-202 [doi]
- Planning in Domains with Cost Function Dependent ActionsMike Phillips, Maxim Likhachev. 203-204 [doi]
- Graduated Fidelity Motion PlanningMihail Pivtoraiko, Alonzo Kelly. 205-206 [doi]
- Distance Learning in Agent-Centered Heuristic SearchNathan R. Sturtevant. 207-208 [doi]
- On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent PathfindingKo-Hsin Cindy Wang, Adi Botea, Philip Kilby. 209-210 [doi]
- Abstract: Block A* and Any-Angle Path-PlanningPeter Kai Yue Yap, Neil Burch, Robert C. Holte, Jonathan Schaeffer. 211-212 [doi]