Ali Bouland
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ali Bouland has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Andrew J. Kurdila
Department of Mechanical Engineering, Virginia Tech, Blacksburg, VA, USA
2 shared publications - Sai Tej Paruchuri
Lehigh University
2 shared publications - Andrea L'Afflitto
Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA
1 shared publication - Eugenio Schuster
Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA
1 shared publication - Filippos Fotiadis
Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX, USA
1 shared publication - Haoran Wang
Department of Mechanical Engineering, Virginia Tech, Blacksburg, VA, USA
1 shared publication
Latest Publications
- 20 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2145-2150
Convergence Rates of Online Critic Value Function Approximation in Native Spaces
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.
- 20 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2145-2150
Convergence Rates of Online Critic Value Function Approximation in Native Spaces
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.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 55-60
Rates of Convergence in a Class of Native Spaces for Reinforcement Learning and Control
This paper studies convergence rates for some value function approximations that arise in a collection of reproducing kernel Hilbert spaces (RKHS) H(Ω). By casting an optimal control problem in a specific class of native spaces, strong rates of convergence are derived for the operator equation that enables offline approximations that appear in policy iteration. Explicit upper bounds on error in value function and control law approximations are derived in terms of power function PH,N for the space of finite dimensional approximants HN in the native space H(Ω). These bounds exhibit a distinctive geometric nature and refine and build upon some well-known, now classical results concerning the convergence of approximations of value functions.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 55-60
Rates of Convergence in a Class of Native Spaces for Reinforcement Learning and Control
This paper studies convergence rates for some value function approximations that arise in a collection of reproducing kernel Hilbert spaces (RKHS) H(Ω). By casting an optimal control problem in a specific class of native spaces, strong rates of convergence are derived for the operator equation that enables offline approximations that appear in policy iteration. Explicit upper bounds on error in value function and control law approximations are derived in terms of power function PH,N for the space of finite dimensional approximants HN in the native space H(Ω). These bounds exhibit a distinctive geometric nature and refine and build upon some well-known, now classical results concerning the convergence of approximations of value functions.