SOCS B

32 papers

YearTitle / Authors
2017A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
Hong Xu, T. K. Satish Kumar, Sven Koenig
2017Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track.
Alex Fukunaga, Akihiro Kishimoto
2017An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle.
Richard Anthony Valenzano, Danniel Sihui Yang
2017Better Orders for Saturated Cost Partitioning in Optimal Classical Planning.
Jendrik Seipp
2017Block-Parallel IDA* for GPUs.
Satoru Horie, Alex S. Fukunaga
2017Boost SAT Solver with Hybrid Branching Heuristic.
Seongsoo Moon, Mary Inaba
2017Cost-Based Heuristics and Node Re-Expansions across the Phase Transition.
Eldan Cohen, J. Christopher Beck
2017Dynamic Potential Search on Weighted Graphs.
Daniel Gilon, Ariel Felner, Roni Stern
2017Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths.
Shunhao Oh, Hon Wai Leong
2017Fast and Almost Optimal Any-Angle Pathfinding Using the 2
Nicolás Hormazábal, Antonio Díaz, Carlos Hernández, Jorge A. Baier
2017Feasibility Study: Subgoal Graphs on State Lattices.
Tansel Uras, Sven Koenig
2017Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA.
Francesco Percassi, Alfonso Emilio Gerevini, Hector Geffner
2017Improving a Planner's Performance through Online Heuristic Configuration of Domain Models.
Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey
2017Interval Based Relaxation Heuristics for Numeric Planning with Action Costs.
Johannes Aldinger, Bernhard Nebel
2017Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2017Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping.
Alberto Camacho, Oscar Chen, Scott Sanner, Sheila A. McIlraith
2017On Realizing Planning Programs in Domains with Dead-End States.
Federico Falcone, Alfonso Emilio Gerevini, Alessandro Saetti
2017On Variable Dependencies and Compressed Pattern Databases.
Malte Helmert, Nathan R. Sturtevant, Ariel Felner
2017Optimal Solutions to Large Logistics Planning Domain Problems.
Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert
2017Proceedings of the Tenth International Symposium on Combinatorial Search, SOCS 2017, 16-17 June 2017, Pittsburgh, Pennsylvania, USA.
Alex Fukunaga, Akihiro Kishimoto
2017Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
Maximilian Fickert, Jörg Hoffmann
2017Search Reduction through Conservative Abstract-Space Based Heuristic.
Ishani Chatterjee, Maxim Likhachev, Manuela M. Veloso
2017Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek
2017Shortest Path for K Goals.
Roni Tzvi Stern, Meir Goldenberg, Ariel Felner
2017Solving Graph Optimization Problems in a Framework for Monte-Carlo Search.
Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske
2017Strengthening Canonical Pattern Databases with Structural Symmetries.
Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz
2017Symbolic Leaf Representation in Decoupled Search.
Daniel Gnad, Álvaro Torralba, Jörg Hoffmann
2017The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search.
Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant
2017Understanding the Search Behaviour of Greedy Best-First Search.
Manuel Heusner, Thomas Keller, Malte Helmert
2017Using an Algorithm Portfolio to Solve Sokoban.
Nils Christian Froleyks, Tomás Balyo
2017Variable Annealing Length and Parallelism in Simulated Annealing.
Vincent A. Cicirello
2017k-Robust Multi-Agent Path Finding.
Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou