default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. SOCS 2015: Ein Gedi, the Dead Sea, Israel
- Levi Lelis, Roni Stern:
Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, 11-13 June 2015, Ein Gedi, the Dead Sea, Israel. AAAI Press 2015, ISBN 978-1-57735-732-2
Full Papers
- Liron Cohen, Tansel Uras, Sven Koenig:
Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. 2-8 - Stefan Edelkamp, Zhihao Tang:
Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem. 9-17 - Gaojian Fan, Robert C. Holte:
The Spurious Path Problem in Abstraction. 18-27 - Ariel Felner:
Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. 28-34 - Raquel Fuentetaja, Lukás Chrpa, Thomas Leo McCluskey, Mauro Vallati:
Exploring the Synergy between Two Modular Learning Techniques for Automated Planning. 35-43 - Daniel Gnad, Jörg Hoffmann:
Red-Black Planning: A New Tractability Analysis and Heuristic Function. 44-52 - Daniel Gnad, Jörg Hoffmann, Carmel Domshlak:
From Fork Decoupling to Star-Topology Decoupling. 53-61 - Sergio Jiménez Celorrio, Anders Jonsson:
Computing Plans with Control Flow and Procedures Using a Classical Planner. 62-69 - Yisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Lior Rokach, Yuval Elovici, Bracha Shapira:
Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains. 70-77 - Venkatraman Narayanan, Sandip Aine, Maxim Likhachev:
Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics. 78-86 - Dylan O'Ceallaigh, Wheeler Ruml:
Metareasoning in Real-Time Heuristic Search. 87-95 - Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml:
Solving the Snake in the Box Problem with Heuristic Search: First Results. 96-104 - Jakub Pawlewicz, Ryan B. Hayward:
Sibling Conspiracy Number Search. 105-112 - Salomé Simon, Gabriele Röger:
Finding and Exploiting LTL Trajectory Constraints in Heuristic Search. 113-121 - Álvaro Torralba
, Peter Kissmann:
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink. 122-130 - Christopher Makoto Wilt, Wheeler Ruml:
Building a Heuristic for Greedy Search. 131-140
Short Papers
- Sandip Aine, Charupriya Sharma, Maxim Likhachev:
Learning to Search More Efficiently from Experience: A Multi-Heuristic Approach. 141-145 - Tomás Balyo, Roman Barták:
No One SATPlan Encoding To Rule Them All. 146-150 - Oded Betzalel, Ariel Felner, Solomon Eyal Shimony:
Type System Based Rational Lazy IDA. 151-155 - Zahy Bnaya, Alon Palombo, Rami Puzis, Ariel Felner:
Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search. 156-160 - Luca Ceriani, Alfonso Emilio Gerevini:
Planning with Always Preferences by Compilation into STRIPS with Action Costs. 161-165 - Lukás Chrpa, Enrico Scala, Mauro Vallati:
Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements. 166-170 - Rina Dechter, Levi H. S. Lelis, Lars Otten:
Caching in Context-Minimal OR Spaces. 171-175 - Robert Kolchmeyer, Andrew Joseph Dobson, Kostas E. Bekris:
Expected Path Degradation when Searching over a Sparse Grid Hierarchy. 176-180 - Athanasios Krontiris, Kostas E. Bekris:
Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths. 181-185 - Carlos Linares López, Abdallah Saffidine:
A Preliminary Selection of Problems in Heuristic Search. 186-190 - Julian R. H. Mariño, Levi H. S. Lelis:
Feature Selection as State-Space Search: An Empirical Study in Clustering Problems. 191-195 - Guni Sharon:
Partial Domain Search Tree for Constraint-Satisfaction Problems. 196-200 - David Tolpin, Frank D. Wood:
Maximum a Posteriori Estimation by Search in Probabilistic Programs. 201-205 - Tansel Uras, Sven Koenig:
An Empirical Comparison of Any-Angle Path-Planning Algorithms. 206-210
Original Research Abstracts
- William Lam, Kalev Kask, Rina Dechter:
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. 212-213 - Patricia J. Riddle, Michael W. Barley, Santiago Franco, Jordan Douglas:
Automated Transformation of PDDL Representations. 214-215 - Sascha Scherrer, Florian Pommerening, Martin Wehrle:
Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract). 216-217 - Vitali Sepetnitsky, Ariel Felner:
To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract). 218-219
Extended Abstracts
- Ron Alford, Pascal Bercher, David W. Aha:
Tight Bounds for HTN Planning with Task Insertion (Extended Abstract). 221-222 - Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, Solomon Eyal Shimony:
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. 223-225 - Benjamin J. Cohen, Mike Phillips, Maxim Likhachev:
Planning Single-Arm Manipulations with N-Arm Robots. 226-227 - Florian Geißer, Thomas Keller, Robert Mattmüller:
Delete Relaxations for Planning with State-Dependent Action Costs. 228-229 - Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet:
Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing Systems. 230-231 - Doron Nussbaum, Alper Yörükçü:
Moving Target Search with Subgoal Graphs. 232-233 - David Allen Surovik, Daniel J. Scheeres:
Heuristic Search and Receding-Horizon Planning in Complex Spacecraft Orbit Domains. 234-235 - Pavel Surynek:
UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. 236-237 - Zongzhang Zhang, David Hsu, Wee Sun Lee, Zhan Wei Lim, Aijun Bai:
PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces. 238-239
Invited Talks
- Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. 241-250
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-12-02 23:33 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:
