Presentations and Authors


Last name A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Track:
 

Long Papers

On Realizing Planning Programs in Domains with Dead-End States PDF
Federico Falcone, Alfonso E. Gerevini, Alessandro Saetti
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges PDF
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan Sturtevant, Glenn Wagner, Pavel Surynek
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning PDF
Maximilian Fickert, Jörg Hoffmann
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search PDF
Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant

Short Papers

Dynamic Potential Search on Weighted Graphs PDF
Daniel Gilon, Ariel Felner, Roni Stern
On Variable Dependencies and Compressed Pattern Databases PDF
Malte Helmert, Nathan R. Sturtevant, Ariel Felner
Block-Parallel IDA* for GPUs PDF
Satoru Horie, Alex Fukunaga

Extended Abstracts

k-Robust Multi-Agent Path Finding PDF
Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou
Using an Algorithm Portfolio to Solve Sokoban PDF
Nils Christian Froleyks, Tomas Balyo
Shortest Path for K Goals PDF
Roni Tzvi Stern, Meir Goldenberg, Ariel Felner
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants PDF
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski

Previously Published Paper Summaries

Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track PDF
Alex Fukunaga, Akihiro Kishimoto