Wenchao Li

Dr. Wenchao Li

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 January 2013 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
WLWenchao Li
Wenchao Li
XWXuezhi Wang
Xuezhi Wang
XWXinmin Wang
Xinmin Wang
BMBill Moran
Bill Moran
Measuring a distance using phase measurements is a common practice in many areas of engineering. Almost inevitably these measurements are accompanied by noise, and are always subject to ambiguity resulting from the phase of modulo $2\pi$. In the presence of phase ambiguity, where for instance the unknown distance is far longer than the wavelength of the signal carrying the phase measurement, the distance cannot be uniquely determined. One way to resolve this phase ambiguity is to measure the signal phase at multiple frequencies, converting the phase ambiguity problem into one of solving a family of Diophantine equations. Typically, under some reasonable assumptions, the Diophantine problems can be solved using the Chinese Reminder Theorem as documented in the literature. However, the existing algorithms can experience significant computational overhead for a given application because an exhaustive search is required. In this paper, a novel method addressing the phase ambiguity issue using lattice theoretic ideas is proposed and a closed-form algorithm is presented for the estimation of the number of wavelengths in the unknown distance using the phase measurements taken at multiple wavelengths. The algorithm is extremely efficient as the Diophantine equations are solved without searching. The unknown distance can then be estimated via a maximum likelihood method using the unwrapped phase measurement. A statistical bound of the measurement noise which ensures that the number of whole wavelengths in the unknown distance can be found with a probability close to unity is derived. The robustness, efficiency and estimation accuracy of the proposed method are demonstrated by the simulated results presented.


1 August 2017 in Industrial Crops and Products
Verified
Journal Article
Closed access
LQLei Qin
Lei Qin
XLXia Li
Xia Li
JZJia-Qing Zhu
Jia-Qing Zhu
WLWenchao Li
Wenchao Li
HXHui Xu
Hui Xu
YYYing-Jin Yuan
Ying-Jin Yuan

8 November 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YWYixuan Wang
Yixuan Wang
WZWeichao Zhou
Weichao Zhou
JFJiameng Fan
Jiameng Fan
ZWZhilu Wang
Zhilu Wang
JLJiajun Li
Jiajun Li
QZQi Zhu
Qi Zhu
Neural networks (NNs) playing the role of controllers have demonstrated impressive empirical performance on challenging control problems. However, the potential adoption of NN controllers in real-life applications has been significantly impeded by the growing concerns over the safety of these NN-controlled systems (NNCSs). In this work, we present POLAR-Express, an efficient and precise formal reachability analysis tool for verifying the safety of NNCSs. POLAR-Express uses Taylor model (TM) arithmetic to propagate TMs layer-by-layer across an NN to compute an overapproximation of the NN. It can be applied to analyze any feedforward NNs with continuous activation functions, such as ReLU, Sigmoid, and Tanh activation functions that cover the common benchmarks for NNCS reachability analysis. Compared with its earlier prototype POLAR, we develop a novel approach in POLAR-Express to propagate TMs more efficiently and precisely across ReLU activation functions, and provide parallel computation support for TM propagation, thus significantly improving the efficiency and scalability. Across the comparison with six other state-of-the-art tools on a diverse set of common benchmarks, POLAR-Express achieves the best verification efficiency and tightness in the reachable set analysis. POLAR-Express is publicly available at https://github.com/ChaoHuang2018/POLAR_Tool .

1 October 2010 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
HRHai-Peng Ren
Hai-Peng Ren
WLWenchao Li
Wenchao Li

18 July 2018
Verified
Book Chapter
Open access
PDF file
WZWeichao Zhou
Weichao Zhou
WLWenchao Li
Wenchao Li
Apprenticeship learning (AL) is a kind of Learning from Demonstration techniques where the reward function of a Markov Decision Process (MDP) is unknown to the learning agent and the agent has to derive a good policy by observing an expert’s demonstrations. In this paper, we study the problem of how to make AL algorithms inherently safe while still meeting its learning objective. We consider a setting where the unknown reward function is assumed to be a linear combination of a set of state features, and the safety property is specified in Probabilistic Computation Tree Logic (PCTL). By embedding probabilistic model checking inside AL, we propose a novel counterexample-guided approach that can ensure safety while retaining performance of the learnt policy. We demonstrate the effectiveness of our approach on several challenging AL scenarios where safety is essential.