SOCS

Keyphrases

Publications

2023

Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS (2023)
Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave
Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]. SOCS (2023)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS (2023)
Conny Olz, Pascal Bercher
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. SOCS (2023)
Michael Katz, Junkyu Lee, Shirin Sohrabi
Generating SAS+ Planning Tasks of Specified Causal Structure. SOCS (2023)
Hanlan Yang, Shohin Mukherjee, Maxim Likhachev
A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations. SOCS (2023)
Oleg Tarakanov
Complete Search of Sliding Tile Puzzles on a Personal Computer [Extended Abstract]. SOCS (2023)
Takumi Shimoda, Alex Fukunaga
Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search. SOCS (2023)
Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS (2023)
Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan
SAT Feature Analysis for Machine Learning Classification Tasks. SOCS (2023)
Václav Sobotka
Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract). SOCS (2023)
Thomas K. Nobes
Pipe-Routing and Pathfinding in 3D (Student Abstract). SOCS (2023)
Xiaodi Zhang, Alban Grastien
Improvements to CPCES. SOCS (2023)
Alison Paredes
Structural Bias in Heuristic Search (Student Abstract). SOCS (2023)
Jirí Svancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko, Roland Kaminski
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. SOCS (2023)
Devin Wild Thomas
Domain Specific Situated Planning (Student Abstract). SOCS (2023)
Václav Sobotka, Hana Rudová
Real-World Pickup and Delivery Problem with Transfers. SOCS (2023)
David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. SOCS (2023)
Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory M. Provan
Using Machine Learning Classifiers in SAT Branching [Extended Abstract]. SOCS (2023)
Enrico Saccon
Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract). SOCS (2023)
Stephen Wissow
Searching with Distributional Heuristics (Student Abstract). SOCS (2023)
Michael Katz, Junkyu Lee
K∗ and Partial Order Reduction for Top-Quality Planning. SOCS (2023)
Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS (2023)
Shohin Mukherjee, Maxim Likhachev
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations. SOCS (2023)
Andrii Nyporko, Lukás Chrpa
Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]. SOCS (2023)
Shizhe Zhao, Daniel Harabor, Peter J. Stuckey
Reducing Redundant Work in Jump Point Search. SOCS (2023)
David Fairbairn
Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). SOCS (2023)
Jonathan Morag, Roni Stern, Ariel Felner
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. SOCS (2023)
Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan
Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]. SOCS (2023)
Adittyo Paul, Ying Feng, Jiaoyang Li
A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. SOCS (2023)
Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Efficient Multi Agent Path Finding with Turn Actions. SOCS (2023)
Adi Botea, Vadim Bulitko
Core Expansion in Optimization Crosswords. SOCS (2023)
Bojie Shen
Tracking Progress in Multi-Agent Path Finding (Student Abstract). SOCS (2023)
Sixteenth International Symposium on Combinatorial Search, SOCS 2023, July 14-16, 2023, Prague, Czech Republic SOCS (2023)
Ryo Kuroiwa
Domain-Independent Dynamic Programming (Student Abstract). SOCS (2023)
Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. SOCS (2023)
Eyal Weiss
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). SOCS (2023)
Junkyu Lee, Michael Katz, Shirin Sohrabi
On K* Search for Top-K Planning. SOCS (2023)
Chao Lei, Nir Lipovetzky, Krista A. Ehinger
Novelty and Lifted Helpful Actions in Generalized Planning. SOCS (2023)
Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]. SOCS (2023)
Tzvika Geft
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. SOCS (2023)
Francesco Percassi, Enrico Scala, Mauro Vallati
On the Notion of Fixability of PDDL+ Plans [Extended Abstract]. SOCS (2023)
Frontmatter. SOCS (2023)

2022