Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th SOCS 2024: Kananaskis, AB, Canada
- Ariel Felner, Jiaoyang Li:
Seventeenth International Symposium on Combinatorial Search, SOCS 2024, Kananaskis, Alberta, Canada, June 6-8, 2024. AAAI Press 2024
Long Papers
- Abdallah Abu-Aisha, Mark Wallace, Daniel Harabor, Bojie Shen:
Efficient and Exact Public Transport Routing via a Transfer Connection Database. 2-10 - Chao Cao, Jinyun Xu, Ji Zhang, Howie Choset, Zhongqiang Ren:
Heuristic Search for the Orienteering Problem with Time-Varying Reward. 11-19 - Mark Carlson, Daniel Harabor, Peter J. Stuckey:
Avoiding Node Re-Expansions Can Break Symmetry Breaking. 20-27 - Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz:
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. 28-36 - Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi Agent Path Finding. 37-45 - Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. 46-54 - Songtuan Lin, Daniel Höller, Pascal Bercher:
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions. 55-63 - Yihao Liu, Xueyan Tang, Wentong Cai, Jingning Li:
Multi-Agent Path Execution with Uncertainty. 64-72 - Evgeny Mishlyakov, Mikhail Gruntov, Alexander Shleyfman, Erez Karpas:
A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications. 73-81 - Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern:
Prioritised Planning with Guarantees. 82-90 - Sumedh Pendurkar, Levi H. S. Lelis, Nathan R. Sturtevant, Guni Sharon:
Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms. 91-99 - Francesco Percassi, Enrico Scala, Alfonso Emilio Gerevini:
Optimised Variants of Polynomial Compilation for Conditional Effects in Classical Planning. 100-108 - Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev, Jiaoyang Li:
Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality. 109-117 - Pouya Shati, Eldan Cohen, Sheila A. McIlraith:
Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP. 118-126 - Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant:
On the Properties of All-Pair Heuristics. 127-133 - Yimin Tang, Sven Koenig, Jiaoyang Li:
ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem. 134-142 - Dawson Tomasz, Richard Valenzano:
The Bench Transition System and Stochastic Exploration. 143-151 - Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. 152-160 - Devin Wild Thomas, Wheeler Ruml, Solomon Eyal Shimony:
Real-time Safe Interval Path Planning. 161-169 - Stephen Wissow, Fanhao Yu, Wheeler Ruml:
Tunable Suboptimal Heuristic Search. 170-178 - Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. 179-187 - Shanhe Zhong, Pouya Shati, Eldan Cohen:
Bi-Criteria Diverse Plan Selection via Beam Search Approximation. 188-196
Short Papers
- Clemens Büchner, Remo Christen, Salomé Eriksson, Thomas Keller:
Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning. 198-202 - Dillon Z. Chen, Sylvie Thiébaux:
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning. 203-207 - Carlos Hernández Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman:
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. 208-212 - Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi:
Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning. 213-217 - Pierre Le Bodic, Edward Lam:
Optimal Unlabeled Pebble Motion on Trees. 218-222 - Rishi Veerapaneni, Jonathan Park, Muhammad Suhail Saleem, Maxim Likhachev:
A Data Efficient Framework for Learning Local Heuristics. 223-227 - Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. 228-232
Position Papers
- Jiang He, Yulun Zhang, Rishi Veerapaneni, Jiaoyang Li:
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities. 234-242 - Grigorios Mouratidis, Bernhard Nebel, Sven Koenig:
Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS. 243-251
Extended Abstracts
- Saman Ahmadi:
Parallelizing Multi-objective A* Search (Extended Abstract). 253-254 - Pablo Araneda, Carlos Hernández Ulloa, Nicolás Rivera, Jorge A. Baier:
Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract). 255-256 - Masataro Asai, Stephen Wissow:
Extreme Value Monte Carlo Tree Search (Extended Abstract). 257-258 - Shahar Bardugo, Dor Atzmon:
Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract). 259-260 - Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg, Wiktor Piotrowski, Roni Stern:
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract). 261-262 - Matteo Cardellini, Marco Maratea, Francesco Percassi, Enrico Scala, Mauro Vallati:
Taming Discretised PDDL+ through Multiple Discretisations (Extended Abstract). 263-264 - Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). 265-266 - Md. Solimul Chowdhury, Martin Müller, Jia-Huai You:
Exploring Conflict Generating Decisions: Initial Results (Extended Abstract). 267-268 - Anas El Kouaiti, Francesco Percassi, Alessandro Saetti, Thomas Leo McCluskey, Mauro Vallati:
Deployable Yet Effective Traffic Signal Optimisation via Automated Planning (Extended Abstract). 269-270 - Santiago Franco, Jamie O. Roberts, Sara Bernardini:
Lazy Evaluation of Negative Preconditions in Planning Domains (Extended Abstract). 271-272 - Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). 273-274 - Rodrigo López, Roberto Javier Asín Achá, Jorge A. Baier:
A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract). 275-276 - Sean Mariasin, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract). 277-278 - Cheng Qian, Yulun Zhang, Jiaoyang Li:
A Quality Diversity Approach to Automatically Generate Multi-Agent Path Finding Benchmark Maps (Extended Abstract). 279-280 - Irene Saccani, Kristýna Janovská, Pavel Surynek:
Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). 281-282 - Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search (Extended Abstract). 283-284 - Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito:
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). 285-286 - Pavel Surynek:
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). 287-288 - Jingtao Tang, Hang Ma:
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract). 289-290 - Jingtao Tang, Hang Ma:
Large-Scale Multi-Robot Coverage Path Planning via Local Search (Extended Abstract). 291-292 - Yu Wu, Rishi Veerapaneni, Jiaoyang Li, Maxim Likhachev:
From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS (Extended Abstract). 293-294 - Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract). 295-296 - Jingtian Yan, Jiaoyang Li:
Multi-agent Motion Planning through Stationary State Search (Extended Abstract). 297-298 - Jingtian Yan, Jiaoyang Li:
Multi-Agent Motion Planning with Bézier Curve Optimization under Kinodynamic Constraints (Extended Abstract). 299-300 - Yuanhang Zhang, Hesheng Wang, Zhongqiang Ren:
A Short Summary of Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration (Extended Abstract). 301-302 - Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). 303-304 - Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li:
Multi-Robot Coordination and Layout Design for Automated Warehousing (Extended Abstract). 305-306 - Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li:
Arbitrarily Scalable Environment Generators via Neural Cellular Automata (Extended Abstract). 307-308
a service of 
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 2024-06-19 22:07 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
