default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShizhe Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[i6]Haitong He, Xuemian Wu, Shizhe Zhao, Zhongqiang Ren:
Conflict-Based Search for Multi-Agent Path Finding with Elevators. CoRR abs/2602.20512 (2026)- 2025
- [j2]Shizhe Zhao, Anushtup Nandy
, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren:
Heuristic Search for Path Finding With Refuelling. IEEE Robotics Autom. Lett. 10(4): 3230-3237 (2025) - [j1]Zhongqiang Ren, Allen George Philip, Shizhe Zhao, Sivakumar Rathinam, Howie Choset:
CP-MILP: Mixed Integer Linear Programming for Multi-Agent Motion Planning With Linear Dynamics. IEEE Robotics Autom. Lett. 10(12): 12573-12579 (2025) - [c9]Shuai Zhou, Shizhe Zhao, Zhongqiang Ren:
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions. AAAI 2025: 14763-14770 - [c8]Shizhe Zhao, Allen George Philip, Sivakumar Rathinam, Howie Choset, Zhongqiang Ren:
CB-GCS: Conflict-Based Search on the Graph of Convex Sets for Multi-Agent Motion Planning. CASE 2025: 2208-2214 - [c7]Shizhe Zhao, Yongce Liu, Howie Choset, Zhongqiang Ren:
Mixed Integer Conic Programming for Multi-Agent Motion Planning in Continuous Space. IROS 2025: 10540-10547 - [i5]Shaoli Hu, Shizhe Zhao, Zhongqiang Ren:
Conflict-Based Search and Prioritized Planning for Multi-Agent Path Finding Among Movable Obstacles. CoRR abs/2509.26050 (2025) - [i4]Longrui Yang, Yiyu Wang, Jingfan Tang, Yunpeng Lv, Shizhe Zhao, Chao Cao, Zhongqiang Ren:
HEHA: Hierarchical Planning for Heterogeneous Multi-Robot Exploration of Unknown Environments. CoRR abs/2510.04161 (2025) - 2024
- [i3]Shuai Zhou, Shizhe Zhao, Zhongqiang Ren:
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions. CoRR abs/2412.11678 (2024) - 2023
- [c6]Jinchun Du, Bojie Shen, Shizhe Zhao, Muhammad Aamir Cheema, Adel Nadjaran Toosi:
Efficient Object Search in Game Maps. IJCAI 2023: 5567-5576 - [c5]Shizhe Zhao, Daniel Harabor, Peter J. Stuckey:
Reducing Redundant Work in Jump Point Search. SOCS 2023: 128-136 - [i2]Shizhe Zhao, Daniel Harabor, Peter J. Stuckey:
Reducing Redundant Work in Jump Point Search. CoRR abs/2306.15928 (2023) - 2021
- [c4]Arthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace:
Customised Shortest Paths Using a Distributed Reverse Oracle. SOCS 2021: 79-87 - 2020
- [c3]Shizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey:
Bounded Suboptimal Path Planning with Compressed Path Databases. ICAPS 2020: 333-342
2010 – 2019
- 2019
- [c2]Mattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey:
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. ICAPS 2019: 106-113 - 2018
- [c1]Shizhe Zhao, David Taniar, Daniel Damir Harabor:
Fast k-Nearest Neighbor on a Navigation Mesh. SOCS 2018: 124-131 - [i1]Shizhe Zhao, Daniel Damir Harabor, David Taniar:
Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour. CoRR abs/1808.04043 (2018)
Coauthor Index
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 2026-03-31 00: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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
