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