default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SOCS 2023: Prague, Czech Republic
- Roman Barták, Wheeler Ruml, Oren Salzman:
Sixteenth International Symposium on Combinatorial Search, SOCS 2023, Prague, Czech Republic, July 14-16, 2023. AAAI Press 2023 - Frontmatter.
Long Papers
- Adi Botea, Vadim Bulitko:
Core Expansion in Optimization Crosswords. 2-10 - Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig:
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. 11-19 - Tzvika Geft:
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. 20-28 - Michael Katz, Junkyu Lee
, Shirin Sohrabi:
Generating SAS+ Planning Tasks of Specified Causal Structure. 29-37 - Junkyu Lee, Michael Katz, Shirin Sohrabi:
On K* Search for Top-K Planning. 38-46 - Jonathan Morag, Roni Stern, Ariel Felner:
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. 47-55 - Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh:
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. 56-64 - Conny Olz, Pascal Bercher:
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. 65-73 - Takumi Shimoda, Alex Fukunaga:
Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search. 74-82 - Václav Sobotka, Hana Rudová:
Real-World Pickup and Delivery Problem with Transfers. 83-91 - David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman:
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. 92-100 - 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. 101-109 - Xiaodi Zhang, Alban Grastien:
Improvements to CPCES. 110-118 - Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Efficient Multi Agent Path Finding with Turn Actions. 119-127 - Shizhe Zhao, Daniel Harabor, Peter J. Stuckey:
Reducing Redundant Work in Jump Point Search. 128-136
Short Papers
- Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan:
SAT Feature Analysis for Machine Learning Classification Tasks. 138-142 - Michael Katz, Junkyu Lee:
K∗ and Partial Order Reduction for Top-Quality Planning. 143-147 - Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Novelty and Lifted Helpful Actions in Generalized Planning. 148-152 - Shohin Mukherjee, Maxim Likhachev:
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations. 153-157 - Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. 158-162 - Hanlan Yang, Shohin Mukherjee, Maxim Likhachev:
A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations. 163-167
Extended Abstracts
- Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory M. Provan:
Using Machine Learning Classifiers in SAT Branching [Extended Abstract]. 169-170 - Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave:
Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]. 171-172 - Andrii Nyporko, Lukás Chrpa:
Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]. 173-174 - Adittyo Paul, Ying Feng, Jiaoyang Li:
A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. 175-176 - Francesco Percassi, Enrico Scala, Mauro Vallati:
On the Notion of Fixability of PDDL+ Plans [Extended Abstract]. 177-178 - Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan:
Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]. 179-180 - Zhongqiang Ren, Sivakumar Rathinam, Howie Choset:
Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]. 181-182 - 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]. 183-184 - 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]. 185-186 - Oleg Tarakanov:
Complete Search of Sliding Tile Puzzles on a Personal Computer [Extended Abstract]. 187-188
Student Papers
- David L. Fairbairn:
Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). 190-191 - Ryo Kuroiwa:
Domain-Independent Dynamic Programming (Student Abstract). 192-193 - Thomas K. Nobes:
Pipe-Routing and Pathfinding in 3D (Student Abstract). 194-195 - Alison Paredes:
Structural Bias in Heuristic Search (Student Abstract). 196-197 - Enrico Saccon:
Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract). 198-199 - Bojie Shen:
Tracking Progress in Multi-Agent Path Finding (Student Abstract). 200-201 - Václav Sobotka:
Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract). 202-203 - Devin Wild Thomas:
Domain Specific Situated Planning (Student Abstract). 204-205 - Eyal Weiss:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). 206-207 - Stephen Wissow:
Searching with Distributional Heuristics (Student Abstract). 208-209
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 2026-08-11 00:17 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
