3. SOCS 2011: Castell de Cardona, Barcelona, Spain

Full Papers

• Vidal Alcázar, Manuela M. Veloso, Daniel Borrajo:
  Adapting a Rapidly-Exploring Random Tree for Automated Planning.
  
• Christer Bäckström, Peter Jonsson:
  All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others.
  
• Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer:
  Degrees of Separation in Social Networks.
  
• Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony:
  Repeated-Task Canadian Traveler Problem.
  
• Neil Burch, Robert C. Holte:
  Automatic Move Pruning in General Single-Player Games.
  
• Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml:
  Deadline-Aware Search Using On-Line Measures of Behavior.
  
• Ariel Felner:
  Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm.
  
• Kalin Gochev, Benjamin J. Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev:
  Path Planning with Adaptive Dimensionality.
  
• Juan Pablo Gonzalez, Maxim Likhachev:
  Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces.
  
• Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati:
  A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems.
  
• Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant:
  A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding.
  
• Lars Kotthoff, Ian P. Gent, Ian Miguel:
  A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems.
  
• Michael J. Leighton, Wheeler Ruml, Robert C. Holte:
  Faster Optimal and Suboptimal Hierarchical Search.
  
• Levi Lelis, Roni Stern, Shahab Jabbari Arfaee:
  Predicting Solution Cost with Conditional Probabilities.
  
• Levi Lelis, Sandra Zilles, Robert C. Holte:
  Improved Prediction of IDA*'s Performance via Epsilon-Truncation.
  
• Lars Otten, Rina Dechter:
  Anytime AND/OR Depth-First Search for Combinatorial Optimization.
  
• Bo Pang, Robert C. Holte:
  State-Set Search.
  
• Kevin Rose, Ethan Burns, Wheeler Ruml:
  Best-First Search for Bounded-Depth Trees.
  
• Tim Schmidt, Rong Zhou:
  Representing Pattern Databases with Succinct Data Structures.
  
• Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
  Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding.
  
• Roni Stern, Ariel Felner, Robert Holte:
  Probably Approximately Correct Heuristic Search.
  
• Álvaro Torralba Arias de Reyna, Carlos Linares López:
  Size-Independent Additive Pattern Databases for the Pancake Problem.
  
• Christopher Makoto Wilt, Wheeler Ruml:
  Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs.
  
• Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa:
  Scalable Distributed Monte-Carlo Tree Search.
  

Abstracts

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

Last update Fri May 25 08:40:38 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page