Search

Search Results

• Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods

  Nicolás Hormazábal, Antonio Díaz, Carlos Hernández, Jorge Baier

  139-143

  2017-06-16

• Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA

  Francesco Percassi, Alfonso Emilio Gerevini, Hector Geffner

  144-148

  2017-06-16

• Block-Parallel IDA* for GPUs

  Satoru Horie, Alex Fukunaga

  134-138

  2017-06-16

• Symbolic Leaf Representation in Decoupled Search

  Daniel Gnad, Álvaro Torralba, Jörg Hoffmann

  124-128

  2017-06-16

• Better Orders for Saturated Cost Partitioning in Optimal Classical Planning

  Jendrik Seipp

  149-153

  2017-06-16

• On Variable Dependencies and Compressed Pattern Databases

  Malte Helmert, Nathan Sturtevant, Ariel Felner

  129-133

  2017-06-16

• Dynamic Potential Search on Weighted Graphs

  Daniel Gilon, Ariel Felner, Roni Stern

  119-123

  2017-06-16

• Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track

  Alex Fukunaga, Akihiro Kishimoto

  176-178

  2017-06-16

• Feasibility Study: Subgoal Graphs on State Lattices

  Tansel Uras, Sven Koenig

  100-108

  2017-06-16

• An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle

  Richard Valenzano, Danniel Yang

  109-117

  2017-06-16

• Cost-Based Heuristics and Node Re-Expansions across the Phase Transition

  Eldan Cohen, J. Beck

  11-19

  2017-06-16

• On Realizing Planning Programs in Domains with Dead-End States

  Federico Falcone, Alfonso Gerevini, Alessandro Saetti

  20-28

  2017-06-16

• Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning

  Maximilian Fickert, Jörg Hoffmann

  38-46

  2017-06-16

• Strengthening Canonical Pattern Databases with Structural Symmetries

  Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz

  91-99

  2017-06-16

• Optimal Solutions to Large Logistics Planning Domain Problems

  Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert

  73-81

  2017-06-16

• Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths

  Shunhao Oh, Hon Wai Leong

  64-72

  2017-06-16

• The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search

  Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan Sturtevant

  82-90

  2017-06-16

• Understanding the Search Behaviour of Greedy Best-First Search

  Manuel Heusner, Thomas Keller, Malte Helmert

  47-55

  2017-06-16

• Variable Annealing Length and Parallelism in Simulated Annealing

  Vincent Cicirello

  2-10

  2017-06-16

• Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges

  Ariel Felner, Roni Stern, Solomon Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan Sturtevant, Glenn Wagner, Pavel Surynek

  29-37

  2017-06-16

• Boost SAT Solver with Hybrid Branching Heuristic

  Seongsoo Moon, Mary Inaba

  56-63

  2017-06-16

• Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping

  Alberto Camacho, Oscar Chen, Scott Sanner, Sheila McIlraith

  159-160

  2017-06-16

• Search Reduction through Conservative Abstract-Space Based Heuristic

  Ishani Chatterjee, Maxim Likhachev, Manuela Veloso

  161-162

  2017-06-16

• Solving Graph Optimization Problems in a Framework for Monte-Carlo Search

  Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske

  163-164

  2017-06-16

• Interval Based Relaxation Heuristics for Numeric Planning with Action Costs

  Johannes Aldinger, Bernhard Nebel

  155-156

  2017-06-16