Han Zhang

Orcid: 0000-0002-5265-7659

Affiliations:

University of Southern California, Department of Computer Science, Los Angeles, CA, USA

According to our database¹, Han Zhang authored at least 17 papers between 2020 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Simple and efficient bi-objective search algorithms via fast dominance checks.

[BibT_eX]

[DOI]

Artif. Intell., 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Sven Koenig

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Cost Splitting for Multi-Objective Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Multi-agent path finding with mutex propagation.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Anytime Approximate Bi-Objective Search.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Sven Koenig

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Mutex Propagation in Multi-Agent Path Finding for Large Agents.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Bounded-Cost Bi-Objective Heuristic Search.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Multi-Agent Path Finding for Precedence-Constrained Goal Sequences.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Sven Koenig

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

A Hierarchical Approach to Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Temporal Reasoning with Kinodynamic Networks.

[BibT_eX]

[DOI]

Han Zhang

Neelesh Tiruviluamala

Sven Koenig

T. K. Satish Kumar

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Conflict-Based Increasing Cost Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Mutex Propagation for SAT-based Multi-agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2020: Principles and Practice of Multi-Agent Systems, 2020

A Simple and Fast Bi-Objective Search Algorithm.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Han Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...