Go to:
Logótipo
Você está em: Start > Publications > View > Reachability analysis of dynamic programming based controlled systems: an extended algorithm
Map of Premises
Principal
Publication

Reachability analysis of dynamic programming based controlled systems: an extended algorithm

Title
Reachability analysis of dynamic programming based controlled systems: an extended algorithm
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Da Silva, JE
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
De Sousa, JB
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 1249-1254
2014 IEEE Conference on Control Applications, CCA 2014
8 October 2014 through 10 October 2014
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-00A-4CX
Abstract (EN): This paper extends the algorithm proposed in [1]. In [1], the numerical approximation of the solution of dynamic programming problems is used as a candidate Lyapunov function V-L (x), in order to prove convergence of the closed loop system to a given target. That is done in the framework of sampled data systems. The described algorithm provides only a sufficient condition, which in many cases is not verified due to the deviations introduced by the approximations. In this paper, the previous algorithm is extended in order to compute the decrease in the candidate Lyapunov over multiple sampling periods, i. e., V-L (x (k + n)) - V-L (x (k)), with n is an element of N. Thus, it is expected that the verification procedure becomes more robust with respect to the deviations introduced by the numerical approximation of the control law and candidate Lyapunov function. The core of the algorithm is based on linear programming with polytopic convex constraints.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 6
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Reachability analysis of dynamic programming based controlled systems (2013)
Article in International Conference Proceedings Book
Da Silva, JE; De Sousa, JB; Pereira, FL
Experimental results with value function based control of an AUV (2012)
Article in International Conference Proceedings Book
Da Silva, JE; De Sousa, JB; Pereira, FL
Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-24 at 15:10:39 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book