Sledovat
Han Zhang
Han Zhang
E-mailová adresa ověřena na: usc.edu
Název
Citace
Citace
Rok
A simple and fast bi-objective search algorithm
CH Ulloa, W Yeoh, JA Baier, H Zhang, L Suazo, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2020
432020
Multi-agent path finding with mutex propagation
H Zhang, J Li, P Surynek, TKS Kumar, S Koenig
Artificial Intelligence 311, 103766, 2022
422022
Departure scheduling and taxiway path planning under uncertainty
J Li, M Gong, Z Liang, W Liu, Z Tong, L Yi, R Morris, C Pasearanu, ...
AIAA Aviation 2019 Forum, 2930, 2019
212019
Simple and efficient bi-objective search algorithms via fast dominance checks
C Hernández, W Yeoh, JA Baier, H Zhang, L Suazo, S Koenig, O Salzman
Artificial intelligence 314, 103807, 2023
152023
Multi-agent path finding for precedence-constrained goal sequences
H Zhang, J Chen, J Li, B Williams, S Koenig
International Joint Conference on Autonomous Agents and Multiagent Systems …, 2022
142022
A* pex: Efficient approximate multi-objective search on graphs
H Zhang, O Salzman, TKS Kumar, A Felner, CH Ulloa, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2022
132022
A hierarchical approach to multi-agent path finding
H Zhang, M Yao, Z Liu, J Li, L Terr, SH Chan, TKS Kumar, S Koenig
Proceedings of the International symposium on Combinatorial search 12 (1 …, 2021
102021
Conflict-based increasing cost search
TT Walker, NR Sturtevant, A Felner, H Zhang, J Li, TKS Kumar
Proceedings of the International Conference on Automated Planning and …, 2021
102021
Anytime approximate bi-objective search
H Zhang, O Salzman, TKS Kumar, A Felner, CH Ulloa, S Koenig
Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022
82022
Heuristic-search approaches for the multi-objective shortest-path problem: progress and research opportunities
O Salzman, A Felner, C Hernandez, H Zhang, SH Chan, S Koenig
Proceedings of the Thirty-Second International Joint Conference on …, 2023
42023
Temporal reasoning with kinodynamic networks
H Zhang, N Tiruviluamala, S Koenig, TKS Kumar
Proceedings of the International Conference on Automated Planning and …, 2021
42021
Mutex propagation for SAT-based multi-agent path finding
P Surynek, J Li, H Zhang, TK Satish Kumar, S Koenig
PRIMA 2020: Principles and Practice of Multi-Agent Systems: 23rd …, 2021
42021
Multi-objective search via lazy and efficient dominance checks
C Hernández, W Yeoh, JA Baier, A Felner, O Salzman, H Zhang, ...
Proceedings of the Thirty-Second International Joint Conference on …, 2023
32023
Bounded-cost bi-objective heuristic search
S Skyler, D Atzmon, A Felner, O Salzman, H Zhang, S Koenig, W Yeoh, ...
Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022
32022
Binary branching multi-objective conflict-based search for multi-agent path finding
Z Ren, J Li, H Zhang, S Koenig, S Rathinam, H Choset
Proceedings of the International Conference on Automated Planning and …, 2023
22023
Mutex Propagation in Multi-Agent Path Finding for Large Agents
H Zhang, Y Li, J Li, TKS Kumar, S Koenig
Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022
22022
Towards effective multi-valued heuristics for bi-objective shortest-path algorithms via differential heuristics
H Zhang, O Salzman, A Felner, TKS Kumar, S Skyler, CH Ulloa, S Koenig
Proceedings of the International Symposium on Combinatorial Search 16 (1 …, 2023
12023
Efficient multi-query bi-objective search via contraction hierarchies
H Zhang, O Salzman, A Felner, TKS Kumar, CH Ulloa, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2023
12023
Must-Expand Nodes in Multi-Objective Search
S Skyler, S Shperberg, D Atzmon, A Felner, O Salzman, SH Chan, ...
Proceedings of the International Symposium on Combinatorial Search 16 (1 …, 2023
2023
Cost splitting for multi-objective conflict-based search
C Ge, H Zhang, J Li, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2023
2023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20