SOCS B

47 papers

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