default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZheng Chen 0009
Person information
- affiliation: University of Paris-Sud, CNRS, Orsay, France
Other persons with the same name
- Zheng Chen — disambiguation page
- Zheng Chen 0001
![[0009-0000-8342-9504]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0000-8342-9504")
— Microsoft Research Asia, Beijing, China (and 1 more) - Zheng Chen 0002 — Linköping University, Department of Electrical Engineering, Sweden (and 1 more)
- Zheng Chen 0003 — University of Science and Technology of China, Key Laboratory of Wireless-Optical Communications, Hefei, China
- Zheng Chen 0004 — Zhejiang University, State Key Laboratory of Fluid Power and Mechatronic Systems, Hangzhou, China
- Zheng Chen 0005 — University of Massachusetts Dartmouth, Department of Mathematics, Dartmouth, MA, USA (and 2 more)
- Zheng Chen 0006 — University of Houston, Department of Mechanical Engineering, TX, USA (and 2 more)
- Zheng Chen 0007 — Beijing Normal University, Faculty of Geographical Science, China
- Zheng Chen 0008 — Kunming University of Science and Technology, Faculty of Transportation Engineering, China (and 2 more)
- Zheng Chen 0010 — Drexel University, College of Computing and Informatics, Philadelphia, PA, USA
- Zheng Chen 0011 — University of Southampton, UK
- Zheng Chen 0012 — Osaka University, Japan
- Zheng Chen 0013 — Ningbo University of Technology, Faculty of Science, China (and 2 more)
- Zheng Chen 0014 — Shanghai Jiao Tong University, Shanghai, China
- Zheng Chen 0015 — Rensselaer Polytechnic Institute, Computer Science Department, NY, USA (and 1 more)
- Zheng Chen 0016 — Indiana University, Luddy School of Informatics, Computing, and Engineering, Bloomington, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j8]Bhargav Jha, Zheng Chen, Tal Shima:
Time-optimal Dubins trajectory for moving obstacle avoidance. Autom. 146: 110637 (2022)- 2021
- [j7]Yuan Zheng, Zheng Chen, Xueming Shao, Wenjie Zhao:
Time-optimal guidance for intercepting moving targets by Dubins vehicles. Autom. 128: 109557 (2021) - [j6]Zheng Chen, Chen-hao Sun, Xueming Shao, Wenjie Zhao:
A descent method for the Dubins traveling salesman problem with neighborhoods. Frontiers Inf. Technol. Electron. Eng. 22(5): 732-740 (2021) - 2020
- [j5]Zheng Chen:
On Dubins paths to a circle. Autom. 117: 108996 (2020) - [j4]Bhargav Jha, Zheng Chen, Tal Shima:
On shortest Dubins path via a circular boundary. Autom. 121: 109192 (2020) - [j3]Jérôme Bolte, Zheng Chen, Edouard Pauwels:
The multiproximal linearization method for convex composite problems. Math. Program. 182(1): 1-36 (2020) - 2019
- [j2]Zheng Chen, Tal Shima:
Shortest Dubins paths through three points. Autom. 105: 368-375 (2019) - 2016
- [j1]Zheng Chen, Jean-Baptiste Caillau, Yacine Chitour:
L1-Minimization for Mechanical Systems. SIAM J. Control. Optim. 54(3): 1245-1265 (2016)
Conference and Workshop Papers
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-11-14 22:02 CET 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:
