Proceedings of the Fifth Annual Symposium on Combinatorial Search
Edited by Daniel Borrajo, Ariel Felner, Richard Korf, Maxim Likhachev, Carlos Linares Lopez, Wheeler Ruml, and Nathan Sturtevant
Niagara Falls, Ontario, Canada, July 19–21, 2012. Published by The AAAI Press, Menlo Park, California. This proceedings is also available in book format.
Frontmatter
SoCS 2012 Organization — PDF
Maxim Likhachev
Invited Speakers — PDF
Tristan Cazenave, Stefan Edelkamp
Preface — PDF
Daniel Borrajo, Ariel Felner, Richard Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan Sturtevant
Full Papers
HTN Problem Spaces: Structure, Algorithms, Termination — [PDF]
Ron Alford, Vikas Shivashankar, Ugur Kuter, Dana Nau
Abstracting Abstraction in Search II: Complexity Analysis — [PDF]
Christer Backstrom, Peter Jonsson
Automatic Move Pruning Revisited — [PDF]
Neil Burch, Robert C. Holte
Implementing Fast Heuristic Search Code — [PDF]
Ethan Andrew Burns, Matthew Hatem, Michael J. Leighton, Wheeler Ruml
Real-Time Motion Planning with Dynamic Obstacles — [PDF]
Jarad Cannon, Kevin Rose, Wheeler Ruml
Execution Ordering in AND/OR Graphs with Failure Probabilities — [PDF]
Priyankar Ghosh, P. P. Chakrabarti, Pallab Dasgupta
Efficient Single Frontier Bidirectional Search — [PDF]
Marco Lippi, Marco Ernandes, Ariel Felner
A Theoretical Framework for Studying Random Walk Planning — [PDF]
Hootan Nakhost, Martin Mueller
Performance Analysis of Planning Portfolios — [PDF]
Sergio Núñez, Daniel Borrajo, Carlos Linares López
Multimapping Abstractions and Hierarchical Heuristic Search — [PDF]
Bo Pang, Robert C. Holte
Bidirectional A* Search with Additive Approximation Bounds — [PDF]
Michael N. Rice, Vassilis J. Tsotras
Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives — [PDF]
Qandeel Sajid, Ryan Luna, Kostas E. Bekris
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding — [PDF]
Guni Sharon, Roni Stern, Ariel Felner, Nathan Sturtevant
Efficient Implementation of Pattern Database Heuristics for Classical Planning — [PDF]
Silvan Sievers, Manuela Ortlieb, Malte Helmert
Search-Aware Conditions for Probably Approximately Correct Heuristic Search — [PDF]
Roni Tzvi Stern, Ariel Felner, Robert C. Holte
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions — [PDF]
Jordan Tyler Thayer, J. Benton, Malte Helmert
Are We There Yet? — Estimating Search Progress — [PDF]
Jordan Tyler Thayer, Roni Stern, Levi H.S. Lelis
When Does Weighted A* Fail? — [PDF]
Christopher Makoto Wilt, Wheeler Ruml
Adaptive Parallelization for Constraint Satisfaction Search — [PDF]
Xi Yun, Susan Epstein
Short Papers
On Improving Plan Quality via Local Enhancements — [PDF]
Tomas Balyo, Roman Bartak, Pavel Surynek
A* Variants for Optimal Multi-Agent Pathfinding — [PDF]
Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer
Position Paper: Incremental Search Algorithms Considered Poorly Understood — [PDF]
Carlos Hernandez, Jorge A. Baier, Tansel Uras, Sven Koenig
Abstraction-Guided Sampling for Motion Planning — [PDF]
Scott Kiesel, Ethan Burns, Wheeler Ruml
Diverse Depth-First Search in Satisificing Planning — [PDF]
Akihiro Kishimoto, Rong Zhou, Tatsuya Imai
Learning Heuristic Functions Faster by Using Predicted Solution Costs — [PDF]
Levi H. S. Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte
Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs — [PDF]
Chonhyon Park, Jia Pan, Dinesh Manocha
Motion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces — [PDF]
Erion Plaku
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984) — [PDF]
Gabriele Röger, Malte Helmert
Alternative Forms of Bounded Suboptimal Search — [PDF]
Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Thayer, Roni Stern
Subdimensional Expansion and Optimal Task Reassignment — [PDF]
Glenn Wagner, Howie Choset, Nora Ayanian
Extended Abstracts of Papers Presented Elsewhere
Partial-Expansion A* with Selective Node Generation — [PDF]
Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Robert Holte, Jonathan Schaeffer
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract) — [PDF]
Alex Fukunaga, Akihiro Kishimoto, Adi Botea
Paper Summary: Time-Bounded Adaptive A* — [PDF]
Carlos Hernandez, Jorge A. Baier, Tansel Uras, Sven Koenig
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract) — [PDF]
Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte
E-Graphs: Bootstrapping Planning with Experience Graphs — [PDF]
Mike Phillips, Benjamin Cohen, Sachin Chitta, Maxim Likhachev
Conflict-Based Search for Optimal Multi-Agent Path Finding — [PDF]
Guni Sharon, Roni Stern, Ariel Felner, Nathan Sturtevant
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints — [PDF]
Pavel Surynek
MCTS Based on Simple Rerget — [PDF]
David Tolpin, Solomon Eyal Shimony
Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract — [PDF]
Paul Vernaza, Venkatraman Narayanan, Maxim Likhachev
Grid-Based Path Planning Competition
Tree Cache — [PDF]
Kenneth Anderson
Fast, Optimal Pathfinding with Compressed Path Databases — [PDF]
Adi Botea
2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues — [PDF]
Jose Guivant, Brett Seton, Mark Whitty
The JPS Pathfinding System — [PDF]
Daniel Damir Harabor, Alban Grastien
Fast Path Planning Through Segmentation of the Map into Manhattan-Cohesive Areas — [PDF]
Ioannis Papikas, Ioannis Refanidis
Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding — [PDF]
Álvaro Parra, Álvaro Torralba, Carlos Linares López
Subgoal Graphs for Eight-Neighbor Gridworlds — [PDF]
Tansel Uras, Sven Koenig, Carlos Hernandez
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.