default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhe Chen 0016
Person information
- affiliation: Monash University, VIC, Australia
Other persons with the same name
- Zhe Chen — disambiguation page
- Zhe Chen 0001
![[0000-0002-6483-6056]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6483-6056")
(aka: Zhe S. Chen 0001, Zhe (Sage) Chen, Zhe Sage Chen) — New York University School of Medicine, Department of Psychiatry / Neuroscience and Physiology, NY, USA (and 1 more) - Zhe Chen 0002 — Technical University of Munich, Institute for Electrical Drive Systems and Power Electronics, Germany
- Zhe Chen 0003 — Massachusetts Institute of Technology, Department of Brain and Cognitive Sciences / Picower Institute for Learning and Memory, Cambridge, MA, USA
- Zhe Chen 0004 — Hohai University, College of Computer and Information, Nanjing, China (and 1 more)
- Zhe Chen 0005 — Dalian University of Technology, Faculty of Electronic Information and Electrical Engineering, School of Information and Communication Engineering, China
- Zhe Chen 0006 — Huawei Technologies, Beijing, China (and 1 more)
- Zhe Chen 0007 — Aalborg University, Institute of Energy Technology, Denmark
- Zhe Chen 0008 — Tsinghua University, State Key Laboratory of Automotive Safety and Energy, Beijing, China
- Zhe Chen 0009 — University of Edinburgh, Institute for Digital Communications School of Engineering, Li-Fi R&D Centre, UK
- Zhe Chen 0010 — Chinese University of Hong Kong, Department of Electronic Engineering, Hong Kong
- Zhe Chen 0011 — Nanjing University of Aeronautics and Astronautics, China (and 1 more)
- Zhe Chen 0012 — Yale University, Department of Diagnostic Radiology, New Haven, CT, USA
- Zhe Chen 0013 — University of Sydney, School of Computer ScienceNSW, Australia (and 1 more)
- Zhe Chen 0014 — University of Michigan, USA
- Zhe Chen 0015 — China-Singapore International Joint Research Institute, Nanyang Technological University, Singapore (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j1]Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai, Daniel Damir Harabor, Peter J. Stuckey:
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. IEEE Robotics Autom. Lett. 6(3): 5816-5823 (2021)
Conference and Workshop Papers
- 2024
- [c16]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. AAAI 2024: 20674-20682 - [c15]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Sven Koenig, Tsung-Wei Huang, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. AAMAS 2024: 2183-2185 - [c14]Ying Feng, Adittyo Paul, Zhe Chen, Jiaoyang Li:
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution. ICAPS 2024: 201-209 - [c13]Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. ICAPS 2024: 707-715 - [c12]Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern:
Prioritised Planning with Guarantees. SOCS 2024: 82-90 - [c11]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 265-266 - [c10]Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). SOCS 2024: 303-304 - 2023
- [c9]Bojie Shen, Zhe Chen, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Beyond Pairwise Reasoning in Multi-Agent Path Finding. ICAPS 2023: 384-392 - 2022
- [c8]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. AAAI 2022: 10256-10265 - [c7]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. SOCS 2022: 38-46 - 2021
- [c6]Zhe Chen, Daniel Damir Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. AAAI 2021: 12267-12274 - [c5]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. ICAPS 2021: 477-485 - [c4]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS 2021: 1581-1583 - [c3]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI 2021: 4127-4135 - [c2]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS 2021: 179-181 - 2020
- [c1]Florian Laurent, Manuel Schneider, Christian Scheller, Jeremy D. Watson, Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Konstantin Makhnev, Oleg Svidchenko, Vladimir Egorov, Dmitry Ivanov, Aleksei Shpilman, Evgenija Spirovska, Oliver Tanevski, Aleksandar Nikov, Ramon Grunder, David Galevski, Jakov Mitrovski, Guillaume Sartoretti, Zhiyao Luo, Mehul Damani, Nilabha Bhattacharya, Shivam Agarwal, Adrian Egli, Erik Nygren, Sharada P. Mohanty:
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World. NeurIPS (Competition and Demos) 2020: 275-301
Informal and Other Publications
- 2024
- [i8]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Tsung-Wei Huang, Sven Koenig, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. CoRR abs/2402.01961 (2024) - [i7]Ying Feng, Adittyo Paul, Zhe Chen, Jiaoyang Li:
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution. CoRR abs/2403.18145 (2024) - 2023
- [i6]Bojie Shen, Zhe Chen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Tracking Progress in Multi-Agent Path Finding. CoRR abs/2305.08446 (2023) - [i5]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey:
Scalable Rail Planning and Replanning with Soft Deadlines. CoRR abs/2306.06455 (2023) - [i4]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. CoRR abs/2308.11234 (2023) - 2021
- [i3]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. CoRR abs/2102.08689 (2021) - [i2]Florian Laurent, Manuel Schneider, Christian Scheller, Jeremy D. Watson, Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Konstantin Makhnev, Oleg Svidchenko, Vladimir Egorov, Dmitry Ivanov, Aleksei Shpilman, Evgenija Spirovska, Oliver Tanevski, Aleksandar Nikov, Ramon Grunder, David Galevski, Jakov Mitrovski, Guillaume Sartoretti, Zhiyao Luo, Mehul Damani, Nilabha Bhattacharya, Shivam Agarwal, Adrian Egli, Erik Nygren, Sharada P. Mohanty:
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World. CoRR abs/2103.16511 (2021) - [i1]Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai, Daniel Damir Harabor, Peter J. Stuckey:
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. CoRR abs/2110.14891 (2021)
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 2024-09-28 02:24 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:
