Numerical Schemes of Higher Order for a Class of Nonlinear Control Systems
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Approximate Gradient Projection Method with Runge-Kutta Schemes for Optimal Control Problems
Computational Optimization and Applications
Discretization methods for optimal control problems with state constraints
Journal of Computational and Applied Mathematics
Convexity of reachable sets of nonlinear ordinary differential equations
Automation and Remote Control
Automatica (Journal of IFAC)
Computational Optimization and Applications
HIV Model Described by Differential Inclusions
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Discretization methods for optimal control problems with state constraints
Journal of Computational and Applied Mathematics
Inexact Restoration for Runge-Kutta Discretization of Optimal Control Problems
SIAM Journal on Numerical Analysis
Discretization-optimization methods for optimal control problems
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Dengue model described by differential inclusions
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Volterra series and numerical approximations of ODEs
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Hi-index | 0.00 |
This paper develops an approach for obtaining discrete approximations to nonlinear (affine) control systems that are of higher than first order of accuracy with respect to the discretization step h. The approach consists of two parts: first the set ${\cal U}$ of measurable admissible controls is replaced by an appropriate finite-dimensional subset ${\cal U}_N$; then the differential equations corresponding to controls from ${\cal U}_N$ (which are in a reasonable sense "regular") are discretized by single step discretization methods. The main result estimates the accuracy in the first part, measured in terms of a prescribed collection of performance indexes. The result can be interpreted both in the context of approximation of optimal control problems and in the context of approximation of the reachable set. In the first case, accuracy O(h2) is proven for appropriate Runge--Kutta-type discretization methods, without explicitly or implicitly requiring any regularity of the optimal solutions. In the case of a convex reachable set we obtain O(h2) approximation with respect to the Hausdorff distance and O(h1.5) accuracy in the nonconvex case. An application to the time-aggregation of discrete-time control systems is also presented.