| 1. |
- Barni, Andrea, et al.
(författare)
-
Fostering the creation of a Digital Ecosystem by a distributed IEC-61499 based automation platform
- 2019
-
Ingår i: 2019 IEEE 17th International Conference on Industrial Informatics (INDIN). - : IEEE. ; , s. 635-640
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Daedalus is conceived to enable the full exploitation of the CPS' virtualized intelligence concept, through the adoption of a completely distributed automation platform based on IEC-61499 standard, fostering the creation of a Digital Ecosystem that could go beyond the current limits of manufacturing control systems and propose an ever-growing market of innovative solutions for the design, engineering, production and maintenance of plants' automation.
|
|
| 2. |
- Gupta, Ankit, 1988, et al.
(författare)
-
Computation of Parameter Dependent Robust Invariant Sets for LPV Models with Guaranteed Performance
- 2023
-
Ingår i: Automatica. - : Elsevier BV. - 0005-1098. ; 151
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents an iterative algorithm to compute a Robust Control Invariant (RCI) set, along with an invariance-inducing control law, for Linear Parameter-Varying (LPV) systems. As the real-time measurements of the scheduling parameters are typically available, in the presented formulation, we allow the RCI set description along with the invariance-inducing controller to be scheduling parameter dependent. The considered formulation thus leads to parameter-dependent conditions for the set invariance, which are replaced by sufficient Linear Matrix Inequality (LMI) conditions via Polya's relaxation. These LMI conditions are then combined with a novel volume maximization approach in a Semidefinite Programming (SDP) problem, which aims at computing the desirably large RCI set. In addition to ensuring invariance, it is also possible to guarantee performance within the RCI set by imposing a chosen quadratic performance level as an additional constraint in the SDP problem. The reported numerical example shows that the presented iterative algorithm can generate invariant sets which are larger than the maximal RCI sets computed without exploiting scheduling parameter information.
|
|
