SOCS B

37 papers

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