![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Han Zhang 0018
Person information
- affiliation: University of Southern California, Department of Computer Science, Los Angeles, CA, USA
Other persons with the same name
- Han Zhang — disambiguation page
- Han Zhang 0001
— Georgia Institute of Technology, College of Management, Atlanta, GA, USA (and 1 more)
- Han Zhang 0002
— ShanghaiTech University, School of Biomedical Engineering, Shanghai, China (and 1 more)
- Han Zhang 0003
— National Cancer Institute, Bethesda, MD, USA
- Han Zhang 0004
— Northwest University, Xi'an, China
- Han Zhang 0005
— Northwest Institute of Nuclear Technology, Xi'an, China
- Han Zhang 0006
— University of California at Davis, Department of Electrical and Computer Engineering, CA, USA
- Han Zhang 0007
— Nanjing University of Aeronautics and Astronautics, Department of Vehicle Engineering, China
- Han Zhang 0008
— Central South University, School of Information Science and Engineering, Changsha, China
- Han Zhang 0009
— Beihang University, School of Cyber Science and Technology, Beijing, China (and 1 more)
- Han Zhang 0010
— Google Brain, Mountain View, CA, USA (and 2 more)
- Han Zhang 0011
— South China Normal University, Department of Physics and Telecommunication Engineering, Guangzhou, China (and 1 more)
- Han Zhang 0012
— Northwestern Polytechnical University, OPTIMAL, Xi'an, China
- Han Zhang 0013
— State Grid Shanghai Shinan Electric Power Supply Company, Operation and Maintenance Department, China
- Han Zhang 0014
— Texas A&M University, College Station, TX, USA (and 1 more)
- Han Zhang 0015
— Information Engineering University, Zhengzhou, China
- Han Zhang 0016
— Second Institute of Oceanography, Hangzhou, China (and 1 more)
- Han Zhang 0017
— Nankai University, College of Artificial Intelligence, Tianjin, China (and 1 more)
- Han Zhang 0019
— Air Force Engineering University, College of Equipment Management and UAV Engineering, Xi'an, China
- Han Zhang 0020
— Hefei University of Technology, School of Management, Hefei, China (and 1 more)
- Han Zhang 0021
— Wuzhou University, College of Management, Wuzhou, China
- Han Zhang 0022
— Michigan State University, East Lansing, MI, USA
- Han Zhang 0023
— Chinese Academy of Sciences, Institutes of Science and Development, Beijing, China
- Han Zhang 0024
— Lanzhou University of Technology, School of Computer and Communication, Lanzhou, China
- Han Zhang 0025
— Harbin Institute of Technology (Shenzhen), School of Computer Science and Technology, Peng Cheng Laboratory, Shenzhen, China
- Han Zhang 0026
— Chongqing University, State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing, China
- Han Zhang 0027
— University of Nottingham, Ningbo, China
- Han Zhang 0028
— Lehigh University, Departments of Biological Sciences, Chemistry, Bioengineering, and Computer Science and Engineering, Bethlehem, PA, USA (and 1 more)
- Han Zhang 0029
— Durham University, Institute for Computational Cosmology, Durham, UK
- Han Zhang 0030
— Shanghai Jiao Tong University, Department of Electronic Engineering, Institute of Image Communication and Network Engineering, Shanghai, China
- Han Zhang 0031
— Tsinghua University, Institute of Nuclear and New Energy Technology, Beijing, China (and 1 more)
- Han Zhang 0032
— National University of Singapore, Department of Biomedical Engineering, Singapore (and 2 more)
- Han Zhang 0033
— East China Normal University, School of Geographic Sciences, Key Lab of Geographic Information Science, Shanghai, China
- Han Zhang 0034
— Shenzhen University, College of Physics and Optoelectronic Engineering, Institute of Microscale Optoelectronics, Shenzhen, China (and 1 more)
- Han Zhang 0035
— Tianjin University, School of Electrical and Information Engineering, Tianjin, China
- Han Zhang 0036
— Chang'an University, School of Construction Machinery, Department of Mechanical and Electronic Engineering, Xi'an, China (and 1 more)
- Han Zhang 0037
— Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (and 1 more)
- Han Zhang 0038
— Chinese Academy of Sciences, Key Laboratory of Noise and Vibration, Institute of Acoustics, Beijing, China
- Han Zhang 0039
— Shandong Hi-Speed Construction Management Company Ltd., Jinan, China
- Han Zhang 0040
— Xinjiang University, School of Software, Ürümqi, China
- Han Zhang 0041
— Fudan University, Institute of Science and Technology for Brain-Inspired Intelligence, Shanghai, China
- Han Zhang 0042
— Nanjing University of Aeronautics and Astronautics, College of Automation Engineering, Nanjing, China
- Han Zhang 0043
— Southern University of Science and Technology, Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation, Shenzhen, China
- Han Zhang 0044
— Peking University, College of Engineering, State Key Laboratory for Turbulence and Complex Systems, Beijing, China
- Han Zhang 0045
— Purdue University, Department of Aeronautics and Astronautics, West Lafayette, IN, USA
- Han Zhang 0046
— Hong Kong University of Science and Technology, Division of Social Science, Hong Kong (and 1 more)
- Han Zhang 0047
— JD.com, Beijing, China
- Han Zhang 0048 — Carnegie Mellon University, Biometrics Center, Cylab, Pittsburgh, PA, USA
- Han Zhang 0049 — Hong Kong University of Science and Technology, Department of Computer Science and Engineering, Hong Kong
- Han Zhang 0050 — Colorado State University, Department of Computer Science, Fort Collins, CO, USA
- Han Zhang 0051
— Yanshan University, College of Electrical Engineering, Qinhuangdao, China
- Han Zhang 0052 — Wuhan University, School of Remote Sensing and Information Engineering, Wuhan, China
- Han Zhang 0053 — East China University of Science and Technology, School of Information Science and Engineering, Shanghai, China
- Han Zhang 0054 — University of Pittsburgh, PA, USA (and 1 more)
- Han Zhang 0055
— University of Ottawa, School of Electrical Engineering and Computer Science, Ottawa, Canada
- Han Zhang 0056
— Shanghai Jiaotong University, Department of Automation, Shanghai, China (and 2 more)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li:
Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding. ICAPS 2024: 613-622 - [c23]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS 2024: 680-688 - [c22]Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS 2024: 179-187 - [c21]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. SOCS 2024: 208-212 - [c20]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. SOCS 2024: 228-232 - 2023
- [j2]Carlos Hernández
, William Yeoh
, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig
, Oren Salzman
:
Simple and efficient bi-objective search algorithms via fast dominance checks. Artif. Intell. 314: 103807 (2023) - [c19]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. ICAPS 2023: 128-137 - [c18]Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam, Howie Choset:
Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2023: 361-369 - [c17]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. ICAPS 2023: 452-461 - [c16]Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar:
FastMapSVM for Predicting CSP Satisfiability. CP 2023: 40:1-40:17 - [c15]Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven Koenig:
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. IJCAI 2023: 6759-6768 - [c14]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig:
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS 2023: 101-109 - [c13]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - 2022
- [j1]Han Zhang
, Jiaoyang Li
, Pavel Surynek
, T. K. Satish Kumar, Sven Koenig
:
Multi-agent path finding with mutex propagation. Artif. Intell. 311: 103766 (2022) - [c12]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS 2022: 394-403 - [c11]Han Zhang, Jingkai Chen, Jiaoyang Li, Brian C. Williams, Sven Koenig:
Multi-Agent Path Finding for Precedence-Constrained Goal Sequences. AAMAS 2022: 1464-1472 - [c10]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. SOCS 2022: 199-207 - [c9]Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Bounded-Cost Bi-Objective Heuristic Search. SOCS 2022: 239-243 - [c8]Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation in Multi-Agent Path Finding for Large Agents. SOCS 2022: 249-253 - [i1]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. CoRR abs/2211.12885 (2022) - 2021
- [c7]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. ICAPS 2021: 385-395 - [c6]Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar:
Temporal Reasoning with Kinodynamic Networks. ICAPS 2021: 415-425 - [c5]Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig:
A Hierarchical Approach to Multi-Agent Path Finding. SOCS 2021: 209-211 - 2020
- [c4]Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. ICAPS 2020: 143-151 - [c3]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c2]Pavel Surynek
, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA 2020: 248-258 - [c1]Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. SOCS 2020: 125-126
Coauthor Index
aka: Carlos Hernández Ulloa
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint