Discrete-Time Trials for Tuning without a Model
(2017) 20th IFAC World Congress, 2017 In IFAC-PapersOnLine 50(1). p.1539-1544- Abstract
Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, we consider the problem of tuning the output (i.e., driving the output to a desired value), by suitably choosing the input. To this aim, we assume to have at our disposal a discrete sequence of trials only, as it happens, for instance, when we iteratively run a software, with new input data at each iteration, in order to achieve the desired output value. In this paper we prove that, if the polytope is robustly non-singular (or has full row rank, in the general non-square case), then a suitable discrete-time tuning law drives the output to the desired point. The... (More)
Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, we consider the problem of tuning the output (i.e., driving the output to a desired value), by suitably choosing the input. To this aim, we assume to have at our disposal a discrete sequence of trials only, as it happens, for instance, when we iteratively run a software, with new input data at each iteration, in order to achieve the desired output value. In this paper we prove that, if the polytope is robustly non-singular (or has full row rank, in the general non-square case), then a suitable discrete-time tuning law drives the output to the desired point. The computation of the tuning law is based on a convex-optimisation problem to be solved on-line. An application example is proposed to show the effectiveness of the approach.
(Less)
- author
- Blanchini, Franco ; Fenu, Gianfranco ; Giordano, Giulia LU and Pellegrino, Felice Andrea
- organization
- publishing date
- 2017-06
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- discrete-time, model-free, plant-tuning, Tuning
- in
- IFAC-PapersOnLine
- volume
- 50
- issue
- 1
- pages
- 6 pages
- publisher
- IFAC Secretariat
- conference name
- 20th IFAC World Congress, 2017
- conference location
- Toulouse, France
- conference dates
- 2017-07-09 - 2017-07-14
- external identifiers
-
- scopus:85031778735
- scopus:85031778735
- ISSN
- 2405-8963
- DOI
- 10.1016/j.ifacol.2017.08.306
- language
- English
- LU publication?
- yes
- id
- 8c4b7043-f596-451f-91b3-05602a02d316
- date added to LUP
- 2017-05-25 11:05:57
- date last changed
- 2024-03-19 01:21:16
@article{8c4b7043-f596-451f-91b3-05602a02d316,
abstract = {{<p>Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, we consider the problem of tuning the output (i.e., driving the output to a desired value), by suitably choosing the input. To this aim, we assume to have at our disposal a discrete sequence of trials only, as it happens, for instance, when we iteratively run a software, with new input data at each iteration, in order to achieve the desired output value. In this paper we prove that, if the polytope is robustly non-singular (or has full row rank, in the general non-square case), then a suitable discrete-time tuning law drives the output to the desired point. The computation of the tuning law is based on a convex-optimisation problem to be solved on-line. An application example is proposed to show the effectiveness of the approach.</p>}},
author = {{Blanchini, Franco and Fenu, Gianfranco and Giordano, Giulia and Pellegrino, Felice Andrea}},
issn = {{2405-8963}},
keywords = {{discrete-time; model-free; plant-tuning; Tuning}},
language = {{eng}},
number = {{1}},
pages = {{1539--1544}},
publisher = {{IFAC Secretariat}},
series = {{IFAC-PapersOnLine}},
title = {{Discrete-Time Trials for Tuning without a Model}},
url = {{http://dx.doi.org/10.1016/j.ifacol.2017.08.306}},
doi = {{10.1016/j.ifacol.2017.08.306}},
volume = {{50}},
year = {{2017}},
}