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 |
| Path Planning with Adaptive Dimensionality | |
| Kalin Gochev, Benjamin Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev |
| Best-First Search for Bounded-Depth Trees | |
| Kevin Rose, Ethan Burns, Wheeler Ruml |
Abstracts
| Real-Time Adaptive A* with Depression Avoidance | |
| Carlos Hernandez, Jorge A Baier |
| Efficient and Complete Centralized Multi-Robot Path Planning | |
| Ryan Luna, Kostas E. Bekris |
| 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 |