Table of Contents

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