Navigation


SoCS 2011


Related Conferences


Past SoCS Conferences
2010 Atlanta, GA
2009 Lake Arrowhead, CA
2008 Chicago, IL


SoCS 2011: The Fourth Annual Symposium on Combinatorial Search

Accepted Papers

The papers can be downloaded at SoCS'11 Proceedings webpage maintained by AAAI Press.

Full-length papers
Christer Bäckström and Peter Jonsson, All PSPACE-complete Planning Problems are Equal but some are more Equal than Others
Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto and Yutaka Ishikawa, Scalable Distributed Monte-Carlo Tree Search
Neil Burch and Robert Holte, Automatic Move Pruning in General Single-Player Games
Lars Kotthoff, Ian Gent and Ian Miguel, A Critical Evaluation of Machine Learning in Algorithm Selection for Search Problems
Lars Otten and Rina Dechter, Anytime AND/OR Depth-first Search for Combinatorial Optimization
Tim Schmidt and Rong Zhou, Representing Pattern Databases with Succinct Data Structures
Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony, Repeated-task Canadian traveler problem
Kalin Gochev, Benjamin Cohen and Maxim Likhachev, Path Planning with Adaptive Dimensionality
Levi Lelis, Sandra Zilles and Robert Holte, Improved Prediction of IDA*'s Performance via $\epsilon$-Truncation
Roni Stern, Ariel Felner and Robert Holte, Probably Approximately Correct Heuristic Search
Levi Lelis, Roni Stern and Shahab Jabbari Arfaee, Predicting Solution Cost with Conditional Probabilities
Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar and Jonathan Schaeffer, Degrees of Separation in Social Networks
Bo Pang and Robert Holte, State-Set Search
Mokhtar Khorshid, Robert Holte and Nathan Sturtevant, A Polynomial-time Algorithm for Non-optimal Multi-Agent Pathfinding
Álvaro Torralba Arias De Reyna and Carlos Linares López, Size-independent Additive Pattern Databases for the Pancake Problem
Vidal Alcazar, Manuela Veloso and Daniel Borrajo, Adapting an RRT for Automated Planning
Ariel Felner, Position paper: Dijsktra's Algorithm Vs. Uniform Cost Search or A Case Against Dijsktra's Algorithm
Christopher Wilt and Wheeler Ruml, Cost-Based Heuristic Search is Sensitive to the Ratio of Operator Costs
Michael Leighton, Wheeler Ruml and Robert Holte, Faster Optimal and Suboptimal Hierarchical Search
Morteza Keshtkaran, Roohollah Taghizadeh and Koorush Ziarati, A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems
Austin Dionne, Jordan Thayer and Wheeler Ruml, Deadline-Aware Search Using On-line Measures of Behavior
Juan Pablo Gonzalez and Maxim Likhachev, Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces
Kevin Rose, Ethan Burns and Wheeler Ruml, Best-first Search for Bounded-depth Trees
Guni Sharon, Roni Stern, Meir Goldenberg and Ariel Felner, Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding


Short papers
Peter Yap, Neil Burch, Rob Holte and Jonathan Schaeffer, Block A*: Database-Driven Search with Applications in Any-angle Path-Planning
Meir Goldenberg, Nathan Sturtevant, Ariel Felner and Jonathan Schaeffer, The Compressed Differential Heuristic
Eric Huang and Richard E. Korf, Optimal Packing of High-Precision Rectangles
Nathan Sturtevant, Distance Learning in Agent-Centered Heuristic Search
Mike Phillips and Maxim Likhachev, Planning in Domains with Cost Function Dependent Actions
Tatsuya Imai and Akihiro Kishimoto, A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
Ryan Luna and Kostas E Bekris, Efficient and Complete Centralized Multi-Robot Path Planning
Carlos Hernández Ulloa and Jorge Baier, Real-Time Adaptive A* with Depression Avoidance
Achiya Elyasaf, Yael Zaritsky, Ami Hauptman and Moshe Sipper, Evolving Solvers for FreeCell and the Sliding-Tile Puzzle
Ko-Hsin Cindy Wang, Adi Botea and Philip Kilby, On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding
Mihail Pivtoraiko and Alonzo Kelly, Differentially Constrained Motion Replanning Using State Lattices with Graduated Fidelity
Aleksandr Kushleyev, Brian Macallister and Maxim Likhachev, Planning for Landing Site Selection in the Aerial Supply Delivery Problem