Mutex Propagation for SAT-based Multi-agent Path Finding. - Pavel Surynek; Jiaoyang Li 001; Han Zhang 018; T. K. Satish Kumar; Sven Koenig (PRIMA, 2020)

A Simple and Fast Bi-Objective Search Algorithm. - Carlos Hernández Ulloa; William Yeoh 001; Jorge A. Baier; Luis Suazo; Han Zhang 018; Sven Koenig (SOCS, 2020)

Conflict-Based Increasing Cost Search. - Thayne T. Walker; Nathan R. Sturtevant; Ariel Felner; Han Zhang 018; Jiaoyang Li 001; T. K. Satish Kumar (ICAPS, 2021)

Temporal Reasoning with Kinodynamic Networks. - Han Zhang 018; Neelesh Tiruviluamala; Sven Koenig; T. K. Satish Kumar (ICAPS, 2021)

A Hierarchical Approach to Multi-Agent Path Finding. - Han Zhang 018; Mingze Yao; Ziang Liu 002; Jiaoyang Li 001; Lucas Terr; Shao-Hung Chan; T. K. Satish Kumar; Sven Koenig (SOCS, 2021)

A*pex: Efficient Approximate Multi-Objective Search on Graphs. - Han Zhang 018; Oren Salzman; T. K. Satish Kumar; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (ICAPS, 2022)

Multi-Agent Path Finding for Precedence-Constrained Goal Sequences. - Han Zhang 018; Jingkai Chen; Jiaoyang Li 001; Brian C. Williams; Sven Koenig (AAMAS, 2022)

Bounded-Cost Bi-Objective Heuristic Search. - Shawn Skyler; Dor Atzmon; Ariel Felner; Oren Salzman; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2022)

Mutex Propagation in Multi-Agent Path Finding for Large Agents. - Han Zhang 018; Yutong Li; Jiaoyang Li 001; T. K. Satish Kumar; Sven Koenig (SOCS, 2022)

Anytime Approximate Bi-Objective Search. - Han Zhang 018; Oren Salzman; T. K. Satish Kumar; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2022)

Multi-agent path finding with mutex propagation. - Han Zhang 018; Jiaoyang Li 001; Pavel Surynek; T. K. Satish Kumar; Sven Koenig (Artif. Intell., 2022)

Cost Splitting for Multi-Objective Conflict-Based Search. - Cheng Ge; Han Zhang 018; Jiaoyang Li 001; Sven Koenig (ICAPS, 2023)

Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding. - Zhongqiang Ren; Jiaoyang Li 001; Han Zhang 018; Sven Koenig; Sivakumar Rathinam; Howie Choset (ICAPS, 2023)

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Carlos Hernández Ulloa; Sven Koenig (ICAPS, 2023)

FastMapSVM for Predicting CSP Satisfiability. - Kexin Zheng; Ang Li; Han Zhang 018; T. K. Satish Kumar (CP, 2023)

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. - Oren Salzman; Ariel Felner; Carlos Hernández 003; Han Zhang 018; Shao-Hung Chan; Sven Koenig (IJCAI, 2023)

Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2023)

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Shawn Skyler; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2023)

Simple and efficient bi-objective search algorithms via fast dominance checks. - Carlos Hernández 003; William Yeoh 001; Jorge A. Baier; Han Zhang 018; Luis Suazo; Sven Koenig; Oren Salzman (Artif. Intell., 2023)

An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives. - Fandel Lin; Han Zhang 018; T. K. Satish Kumar; Craig A. Knoblock (SIGSPATIAL/GIS, 2024)

Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Sven Koenig (ICAPS, 2024)

Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding. - Fangji Wang; Han Zhang 018; Sven Koenig; Jiaoyang Li 001 (ICAPS, 2024)

Theoretical Study on Multi-objective Heuristic Search. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (IJCAI, 2024)

Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. - Han Zhang 018; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2024)

A-A*pex: Efficient Anytime Approximate Multi-Objective Search. - Han Zhang 018; Oren Salzman; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig (SOCS, 2024)

Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. - Carlos Hernández Ulloa; Han Zhang 018; Sven Koenig; Ariel Felner; Oren Salzman (SOCS, 2024)