Paulo Santos

Abstract

Abstract
A non-parametric identification algorithm is proposed to identify Linear Time Periodic (LTP) systems. The period is unknown and can be any real positive number. The system is modelled as an ARX Linear Parameter Varying (LPV) system with a virtual scheduling signal consisting of two orthogonal sinusoids (a sine and a cosine) with a period equal to the system period. Hence, the system parameters are polynomial functions of the scheduling vector. As these polynomials may have infinite degree, a non-parametric model is adopted to describe the LPV system. This model is identified by a Gaussian Process Regression (GPR) algorithm where the system period is a hyperparameter. The performance of the proposed identification algorithm is illustrated through the identification of a simulated LTP continuous system described by a state-space model. The ARX-LTP discrete-time model estimated in the noiseless case was taken as the true model. Copyright (C) 2021 The Authors.

Abstract
System identification approaches have been used to design an experiment, generate data, and estimate dynamical system models for Just Walk, a behavioral intervention intended to increase physical activity in sedentary adults. The estimated models serve a number of important purposes, such as understanding the factors that influence behavior and as the basis for using control systems as decision algorithms in optimized interventions. A class of identification algorithms known as matchable-observable linear identification has been reformulated and adapted to estimate linear time-invariant models from data obtained from this intervention. The experimental design, estimation algorithms, and validation procedures are described, with the best models estimated from data corresponding to an individual intervention participant. The results provide insights into the individual and the intervention, which can be used to improve the design of future studies. IEEE

Abstract

Abstract
In view to the decentralised problem of gas network optimisation, we model the problem as differential game where the players are the network controllable elements that communicate through nearest-neighbour network components. The controllable elements are sources and compressors. But since these do not have the same relevance within the network, it will be interesting to use a game hierarchical framework, i.e., to model the network operation as a Stackelberg game. Also, the disturbed version of the same problem suits the problem better because is is assumed that the network works with nominated operational levels. The variations of the real operation can then be viewed as disturbances to these system operational levels.