default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. SOCS 2012: Niagara Falls, Ontario, Canada
- Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012. AAAI Press 2012
Full Papers
- Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
HTN Problem Spaces: Structure, Algorithms, Termination. 2-9 - Christer Bäckström, Peter Jonsson:
Abstracting Abstraction in Search II: Complexity Analysis. 10-17 - Neil Burch, Robert C. Holte:
Automatic Move Pruning Revisited. 18-24 - Ethan Andrew Burns, Matthew Hatem, Michael J. Leighton, Wheeler Ruml:
Implementing Fast Heuristic Search Code. 25-32 - Jarad Cannon, Kevin Rose, Wheeler Ruml:
Real-Time Motion Planning with Dynamic Obstacles. 33-40 - Priyankar Ghosh, P. P. Chakrabarti, Pallab Dasgupta:
Execution Ordering in AND/OR Graphs with Failure Probabilities. 41-48 - Marco Lippi, Marco Ernandes, Ariel Felner:
Efficient Single Frontier Bidirectional Search. 105-111 - Hootan Nakhost, Martin Müller:
A Theoretical Framework for Studying Random Walk Planning. 57-64 - Sergio Núñez, Daniel Borrajo, Carlos Linares López:
Performance Analysis of Planning Portfolios. 65-71 - Bo Pang, Robert C. Holte:
Multimapping Abstractions and Hierarchical Heuristic Search. 72-79 - Michael N. Rice, Vassilis J. Tsotras:
Bidirectional A* Search with Additive Approximation Bounds. 80-87 - Qandeel Sajid, Ryan Luna, Kostas E. Bekris:
Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives. 88-96 - Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. 97-104 - Silvan Sievers, Manuela Ortlieb, Malte Helmert:
Efficient Implementation of Pattern Database Heuristics for Classical Planning. 49-56 - Roni Tzvi Stern, Ariel Felner, Robert C. Holte:
Search-Aware Conditions for Probably Approximately Correct Heuristic Search. 112-119 - Jordan Tyler Thayer, J. Benton, Malte Helmert:
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. 120-128 - Jordan Tyler Thayer, Roni Stern, Levi H. S. Lelis:
Are We There Yet? - Estimating Search Progress. 129-136 - Christopher Makoto Wilt, Wheeler Ruml:
When Does Weighted A* Fail? 137-144 - Xi Yun, Susan L. Epstein:
Adaptive Parallelization for Constraint Satisfaction Search. 145-152
Short Papers
- Tomás Balyo, Roman Barták, Pavel Surynek:
On Improving Plan Quality via Local Enhancements. 154-156 - Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. 157-158 - Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Position Paper: Incremental Search Algorithms Considered Poorly Understood. 159-161 - Scott Kiesel, Ethan Burns, Wheeler Ruml:
Abstraction-Guided Sampling for Motion Planning. 162-163 - Akihiro Kishimoto, Rong Zhou, Tatsuya Imai:
Diverse Depth-First Search in Satisificing Planning. 164-165 - Levi H. S. Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning Heuristic Functions Faster by Using Predicted Solution Costs. 166-167 - Chonhyon Park, Jia Pan, Dinesh Manocha:
Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs. 168-170 - Erion Plaku:
Motion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces. 171-172 - Gabriele Röger, Malte Helmert:
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). 173-174 - Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern:
Alternative Forms of Bounded Suboptimal Search. 175-176 - Glenn Wagner, Howie Choset, Nora Ayanian:
Subdimensional Expansion and Optimal Task Reassignment. 177-178
Extended Abstracts of Papers Presented Elsewhere
- Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Robert Holte, Jonathan Schaeffer:
Partial-Expansion A* with Selective Node Generation. 180-181 - Alex Fukunaga, Akihiro Kishimoto, Adi Botea:
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). 182-183 - Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Paper Summary: Time-Bounded Adaptive A. 184-185 - Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). 186-187 - Mike Phillips, Benjamin J. Cohen, Sachin Chitta, Maxim Likhachev:
E-Graphs: Bootstrapping Planning with Experience Graphs. 188-189 - Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. 190 - Pavel Surynek:
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. 191-192 - David Tolpin, Solomon Eyal Shimony:
MCTS Based on Simple Rerget. 193-199 - Paul Vernaza, Venkatraman Narayanan, Maxim Likhachev:
Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract. 201-202
Grid-Based Path Planning Competition
- Ken Anderson:
Tree Cache. 203 - Adi Botea:
Fast, Optimal Pathfinding with Compressed Path Databases. 204-205 - José E. Guivant, Brett Seton, Mark Albert Whitty:
2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues. 206 - Daniel Damir Harabor, Alban Grastien:
The JPS Pathfinding System. 207-208 - Ioannis P. Papikas, Ioannis Refanidis:
Fast Path Planning Through Segmentation of the Map into Manhattan-Cohesive Areas. 209-210 - Álvaro Parra, Álvaro Torralba Arias de Reyna
, Carlos Linares López:
Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding. 211-212 - Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Eight-Neighbor Gridworlds. 213-214
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 22:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
