default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Granzotto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Mathieu Granzotto
, Olivier Lindamulage De Silva, Romain Postoyan, Dragan Nesic, Zhong-Ping Jiang:
Robust Stability and Near-Optimality for Policy Iteration: For Want of Recursive Feasibility, All is Not Lost. IEEE Trans. Autom. Control. 69(12): 8247-8262 (2024)- [c7]Jonathan De Brusse, Mathieu Granzotto, Romain Postoyan, Dragan Nesic:
Policy iteration for discrete-time systems with discounted costs: stability and near-optimality guarantees. CDC 2024: 2511-2516 - 2023
- [j3]Sifeddine Benahmed, Romain Postoyan, Mathieu Granzotto, Lucian Busoniu, Jamal Daafouz, Dragan Nesic:
Stability analysis of optimal control problems with time-dependent costs. Autom. 157: 111272 (2023) - 2022
- [j2]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Stable Near-Optimal Control of Nonlinear Switched Discrete-Time Systems: An Optimistic Planning-Based Approach. IEEE Trans. Autom. Control. 67(5): 2298-2313 (2022) - [c6]Mathieu Granzotto, Olivier Lindamulage De Silva, Romain Postoyan, Dragan Nesic, Zhong-Ping Jiang:
Regularizing policy iteration for recursive feasibility and stability. CDC 2022: 6818-6823 - [i3]Sifeddine Benahmed, Romain Postoyan, Mathieu Granzotto, Lucian Busoniu, Jamal Daafouz, Dragan Nesic:
Stability analysis of optimal control problems with time-dependent costs. CoRR abs/2210.07142 (2022) - [i2]Mathieu Granzotto, Olivier Lindamulage De Silva, Romain Postoyan, Dragan Nesic, Zhong-Ping Jiang:
Policy iteration: for want of recursive feasibility, all is not lost. CoRR abs/2210.14459 (2022) - 2021
- [j1]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Finite-Horizon Discounted Optimal Control: Stability and Performance. IEEE Trans. Autom. Control. 66(2): 550-565 (2021) - [c5]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Exploiting homogeneity for the optimal control of discrete-time systems: application to value iteration. CDC 2021: 6006-6011 - [c4]Mathieu Granzotto, Romain Postoyan, Dragan Nesic, Lucian Busoniu, Jamal Daafouz:
When to stop value iteration: stability and near-optimality versus computation. L4DC 2021: 412-424
2010 – 2019
- 2019
- [c3]Romain Postoyan, Mathieu Granzotto, Lucian Busoniu, Bruno Scherrer, Dragan Nesic, Jamal Daafouz:
Stability guarantees for nonlinear discrete-time systems controlled by approximate value iteration. CDC 2019: 487-492 - [c2]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Optimistic planning for the near-optimal control of nonlinear switched discrete-time systems with stability guarantees. CDC 2019: 3405-3410 - [i1]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Optimistic planning for the near-optimal control of nonlinear switched discrete-time systems with stability guarantees. CoRR abs/1908.01404 (2019) - 2018
- [c1]Mathieu Granzotto, Romain Postoyan, Lucian Busoniu, Dragan Nesic, Jamal Daafouz:
Stability analysis of discrete-time finite-horizon discounted optimal control. CDC 2018: 2322-2327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-05 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
