Haoran Wang

Haoran Wang

Auto-generated profile, based on publicly available information

Haoran Wang

Department of Mechanical Engineering, Virginia Tech, Blacksburg, VA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 December 2023 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
HWHaoran Wang
Haoran Wang
BSBrian Scurlock
Brian Scurlock
NPNathan R Powell
Nathan R Powell
ALAndrea L'afflitto
Andrea L'afflitto
AKAndrew J. Kurdila
Andrew J. Kurdila
This paper presents three novel model reference adaptive control (MRAC) systems for nonlinear plants in which the matched, nonparametric uncertainty is only known to reside in a vector-valued reproducing kernel Hilbert space (RKHS). The first MRAC system is based on an extension of the classical projection operator for robust MRAC systems and assures ultimate boundedness of the trajectory tracking error. This MRAC system allows the user to design part of the control input, known as the compensator. The second MRAC method modifies the previous one and, based on an estimate of the largest admissible uncertainty in the RKHS norm, employs a particular choice of the compensator to assure asymptotic convergence of the tracking error to zero. The last MRAC method uses the previous one and, leveraging the error bounding method framework, employs an additional learning law to assure asymptotic convergence of the tracking error without any information on the largest admissible uncertainty. While the conventional approaches to adaptive error bounding methods usually leave it to an analyst to derive the required error bounds on a case-by-case basis, the proposed approaches work for any functional uncertainty that is contained in any native space of vector-valued functions defined in terms of an operator kernel.

20 June 2024 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
SNShengyuan Niu
Shengyuan Niu
ABAli Bouland
Ali Bouland
HWHaoran Wang
Haoran Wang
FFFilippos Fotiadis
Filippos Fotiadis
AKAndrew Kurdila
Andrew Kurdila
KVKyriakos G. Vamvoudakis
Kyriakos G. Vamvoudakis
This paper derives rates of convergence of online critic methods for the estimation of the value function for a class of nonlinear optimal control problems. Assuming that the underlying value function lies in reproducing kernel Hilbert space (RKHS), we derive explicit bounds on the performance of the critic in terms of the kernel functions, the number of basis functions, and the scattered location of centers used to define the RKHS. The performance of the critic is precisely measured in terms of the power function of the scattered bases, and it can be used either in an a priori evaluation of potential bases or in an a posteriori assessments of the value function error for basis enrichment or pruning. The most concise bounds in the paper describe explicitly how the critic performance depends on the placement of centers, as measured by their fill distance in a subset that contains the trajectory of the critic. To the authors’ knowledge, precise error bounds of this form are the first of their kind for online critic formulations used in optimal control problems. In addition to their general and immediate applicability to a wide range of applications, they have the potential to constitute the groundwork for more advanced “basis-adaptive” methods for nonlinear optimal control strategies, ones that address limitations due to the dimensionality of approximations.