default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th SOCS 2022: Vienna, Austria
- Lukás Chrpa, Alessandro Saetti:
Proceedings of the Fifteenth International Symposium on Combinatorial Search, SOCS 2022, Vienna, Austria, July 21-23, 2022. AAAI Press 2022, ISBN 1-57735-873-2
Long Papers
- Saman Ahmadi
, Guido Tack, Daniel Harabor, Philip Kilby:
Weight Constrained Path Finding with Bidirectional A. 2-10 - Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig:
On Merging Agents in Multi-Agent Pathfinding Algorithms. 11-19 - Zhaoxing Bu, Richard E. Korf:
Iterative-Deepening Uniform-Cost Heuristic Search. 20-28 - Vadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis:
Portability and Explainability of Synthesized Formula-based Heuristics. 29-37 - Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. 38-46 - Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp:
Effective Planning in Resource-Competition Problems by Task Decomposition. 47-55 - Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner:
Generalized Longest Path Problems. 56-64 - Manash Pratim Das, Damon M. Conover, Sungmin Eum, Heesung Kwon, Maxim Likhachev:
MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex Terrains. 65-73 - Chao Gao, Jingwei Chen, Tong Mo, Tanvir Sajed, Shangling Jui, Min Qin, Laiyuan Gong, Wei Lu:
A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs. 74-82 - Tianyi Gu, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas:
When to Commit to an Action in Online Planning and Search. 83-90 - Kilian Hu, David Speck:
On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE. 91-99 - Michael Katz, Gabriele Röger, Malte Helmert:
On Producing Shortest Cost-Optimal Plans. 100-108 - Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner:
Optimal Search with Neural Networks: Challenges and Approaches. 109-117 - Nitzan Madar, Kiril Solovey, Oren Salzman:
Leveraging Experience in Lifelong Multi-Agent Pathfinding. 118-126 - Shuwa Miura, Kyle Hollins Wray, Shlomo Zilberstein:
Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs. 127-135 - Shohin Mukherjee, Sandip Aine, Maxim Likhachev:
ePA*SE: Edge-Based Parallel A* for Slow Evaluations. 136-144 - Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh:
The JPS Pathfinding System in 3D. 145-152 - John R. Peterson, Anagha Kulkarni, Emil Keyder, Joseph Kim, Shlomo Zilberstein:
Trajectory Constraint Heuristics for Optimal Probabilistic Planning. 153-161 - Zhongqiang Ren, Richard Zhan, Sivakumar Rathinam, Maxim Likhachev, Howie Choset:
Enhanced Multi-Objective A* Using Balanced Binary Search Trees. 162-170 - Javier Segovia-Aguas, Sergio Jiménez Celorrio, Laura Sebastiá, Anders Jonsson:
Scaling-Up Generalized Planning as Heuristic Search with Landmarks. 171-179 - Silvan Sievers, Daniel Gnad, Álvaro Torralba:
Additive Pattern Databases for Decoupled Search. 180-189 - Sumanth Varambally, Jiaoyang Li, Sven Koenig:
Which MAPF Model Works Best for Automated Warehousing? 190-198 - Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. 199-207 - Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. 208-216
Short Papers
- Daniel Harabor, Ryan Hechenberger, Thomas Jahn:
Benchmarks for Pathfinding Search: Iron Harvest. 218-222 - Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jörg Hoffmann:
Neural Network Heuristic Functions: Taking Confidence into Account. 223-228 - Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski:
Online Multi-Agent Path Finding: New Results. 229-233 - Claudius Proissl:
Light Contraction Hierarchies: Hierarchical Search Without Shortcuts. 234-238 - Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Bounded-Cost Bi-Objective Heuristic Search. 239-243 - Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner:
Meeting at the Border of Two Separate Domains. 244-248 - Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation in Multi-Agent Path Finding for Large Agents. 249-253
Extended Abstracts
- Jorge A. Baier, Nicolás Rivera, Carlos Hernández Ulloa:
Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract). 255-257 - Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi:
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). 258-260 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. 261-263 - Vianney Coppé, Pierre Schaus:
A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). 264-266 - Ali Davoodi, Mark Wallace, Daniel Harabor:
Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). 267-269 - Zuzana Fílová, Pavel Surynek:
Lazy Compilation in Classical Planning (Extended Abstract). 270-272 - Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization (Extended Abstract). 273-275 - Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract). 276-278 - Matias Greco, Jorge Toro, Carlos Hernández Ulloa, Jorge A. Baier:
K-Focal Search for Slow Learned Heuristics (Extended Abstract). 279-281 - Matias Greco, Pablo Araneda, Jorge A. Baier:
Focal Discrepancy Search for Learned Heuristics (Extended Abstract). 282-284 - Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor:
Dual Euclidean Shortest Path Search (Extended Abstract). 285-287 - Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos:
IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract). 288-290 - Franc Ivankovic, Mauro Vallati, Lukás Chrpa, Marco Roveri:
Urban Traffic Control via Planning with Global State Constraints (Extended Abstract). 291-293 - Kristýna Janovská, Pavel Surynek:
Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). 294-296 - Richard E. Korf:
A Jeep Crossing a Desert of Unknown Width (Extended Abstract). 297-298 - Elad Levy, Guy Shani, Roni Stern:
An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract). 299-301 - Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner:
Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract). 302-304 - Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank:
Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract). 305-307 - Stefan O'Toole, Miquel Ramírez, Nir Lipovetzky, Adrian R. Pearce:
Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract). 308-310 - Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). 311-313 - Francesco Percassi, Enrico Scala, Mauro Vallati:
On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract). 314-316 - Pavel Surynek:
Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). 317-319 - Jirí Svancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub:
Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). 320-322 - Devin Wild Thomas, Tianyi Gu, Wheeler Ruml, Solomon Eyal Shimony:
Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract). 323-325 - Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev:
Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract). 326-328 - David Zahrádka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev:
Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract). 329-331
Student Papers
- Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp:
Deep RRT. 333-335 - Matias Greco, Jorge A. Baier:
Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search. 336-338 - Shuwa Miura:
Beyond Markov Decision Process with Scalar Markovian Rewards. 339-340
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-09-02 00:55 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.
