Full Papers
| Adapting a Rapidly-Exploring Random Tree for Automated Planning | |
| Vidal Alcázar, Manuela Veloso, Daniel Borrajo |
| All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others | |
| Christer Backstrom, Peter Jonsson |
| Degrees of Separation in Social Networks | |
| Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer |
| Repeated-Task Canadian Traveler Problem | |
| Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony |
| Automatic Move Pruning in General Single-Player Games | |
| Neil Burch, Robert C. Holte |
| Deadline-Aware Search Using On-Line Measures of Behavior | |
| Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml |
| Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm | |
| Ariel Felner |
| Path Planning with Adaptive Dimensionality | |
| Kalin Gochev, Benjamin Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev |
| Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces | |
| Juan Pablo Gonzalez, Maxim Likhachev |
| A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems | |
| Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati |
| A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding | |
| Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant |
| A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems | |
| Lars Kotthoff, Ian P. Gent, Ian Miguel |
| Faster Optimal and Suboptimal Hierarchical Search | |
| Michael J. Leighton, Wheeler Ruml, Robert C. Holte |
| Predicting Solution Cost with Conditional Probabilities | |
| Levi Lelis, Roni Stern, Shahab Jabbari Arfaee |
| Improved Prediction of IDA*'s Performance via Epsilon-Truncation | |
| Levi Lelis, Sandra Zilles, Robert Craig Holte |
| Anytime AND/OR Depth-First Search for Combinatorial Optimization | |
| Lars Otten, Rina Dechter |
| State-Set Search | |
| Bo Pang, Robert C. Holte |
| Best-First Search for Bounded-Depth Trees | |
| Kevin Rose, Ethan Burns, Wheeler Ruml |
| Representing Pattern Databases with Succinct Data Structures | |
| Tim Schmidt, Rong Zhou |
| Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding | |
| Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner |
| Probably Approximately Correct Heuristic Search | |
| Roni Stern, Ariel Felner, Robert Holte |
| Size-Independent Additive Pattern Databases for the Pancake Problem | |
| Álvaro Torralba Arias de Reyna, Carlos Linares López |
| Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs | |
| Christopher Makoto Wilt, Wheeler Ruml |
| Scalable Distributed Monte-Carlo Tree Search | |
| Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa |
Abstracts
| Evolving Solvers for FreeCell and the Sliding-Tile Puzzle | |
| Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper |
| The Compressed Differential Heuristic | |
| Meir Goldenberg, Nathan Sturtevant, Ariel Felner, Jonathan Schaeffer |
| Real-Time Adaptive A* with Depression Avoidance | |
| Carlos Hernandez, Jorge A Baier |
| Optimal Packing of High-Precision Rectangles | |
| Eric Huang, Richard E. Korf |
| A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning | |
| Tatsuya Imai, Akihiro Kishimoto |
| Planning for Landing Site Selection in the Aerial Supply Delivery | |
| Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev |
| Efficient and Complete Centralized Multi-Robot Path Planning | |
| Ryan Luna, Kostas E. Bekris |
| Planning in Domains with Cost Function Dependent Actions | |
| Mike Phillips, Maxim Likhachev |
| Graduated Fidelity Motion Planning | |
| Mihail Pivtoraiko, Alonzo Kelly |
| Distance Learning in Agent-Centered Heuristic Search | |
| Nathan R. Sturtevant |
| On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding | |
| Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby |
| Abstract: Block A* and Any-Angle Path-Planning | |
| Peter Kai Yue Yap, Neil Burch, Robert C. Holte, Jonathan Schaeffer |