arXiv subjects

Sarah Hojjatinia

Publications and source records attributed to Sarah Hojjatinia.

6 recordsLinked to original sources

arXiv2021

Model Predictive Control approach to adaptive messaging intervention for physical activity

In this work, we have developed a framework for synthesizing data driven controllers for a class of uncertain switched systems arising in an application to physical activity interventions. In particular, we present an application of probabilistic model predictive control to design an efficient, tractable, and adaptive intervention using behavioral data sets i.e. physical activity behavior. The models of physical activity for each individual are provided for the design of controllers that maximize the probability of achieving a desired physical activity goal subject to intervention specifications. We have tailored the mixed-integer programming-based approach for evaluating the Model Predictive Control decision at each time step.

eess.SY↗

arXiv2019

Identification of Switched Autoregressive and Switched Autoregressive Exogenous Systems from Large Noisy Data Sets

The paper introduces novel methodologies for the identification of coefficients of switched autoregressive and switched autoregressive exogenous linear models. We consider cases which system's outputs are contaminated by possibly large values of noise for the both case of measurement noise in switched autoregressive models and process noise in switched autoregressive exogenous models. It is assumed that only partial information on the probability distribution of the noise is available. Given input-output data, we aim at identifying switched system coefficients and parameters of the distribution of the noise, which are compatible with the collected data. We demonstrate the efficiency of the proposed approach with several academic examples. The method is shown to be extremely effective in the situations where a large number of measurements is available; cases in which previous approaches based on polynomial or mixed-integer optimization cannot be applied due to very large computational burden.

eess.SY↗

arXiv2019

Identification of Switched Autoregressive Systems from Large Noisy Data Sets

The paper introduces a novel methodology for the identification of coefficients of switched autoregressive linear models. We consider the case when the system's outputs are contaminated by possibly large values of measurement noise. It is assumed that only partial information on the probability distribution of the noise is available. Given input-output data, we aim at identifying switched system coefficients and parameters of the distribution of the noise which are compatible with the collected data. System dynamics are estimated through expected values computation and by exploiting the strong law of large numbers. We demonstrate the efficiency of the proposed approach with several academic examples. The method is shown to be extremely effective in the situations where a large number of measurements is available; cases in which previous approaches based on polynomial or mixed-integer optimization cannot be applied due to very large computational burden.

eess.SY↗

arXiv2019

Identification of Markov Jump Autoregressive Processes from Large Noisy Data Sets

This paper introduces a novel methodology for the identification of switching dynamics for switched autoregressive linear models. Switching behavior is assumed to follow a Markov model. The system's outputs are contaminated by possibly large values of measurement noise. Although the procedure provided can handle other noise distributions, for simplicity, it is assumed that the distribution is Normal with unknown variance. Given noisy input-output data, we aim at identifying switched system coefficients, parameters of the noise distribution, dynamics of switching and probability transition matrix of Markovian model. System dynamics are estimated using previous results which exploit algebraic constraints that system trajectories have to satisfy. Switching dynamics are computed with solving a maximum likelihood estimation problem. The efficiency of proposed approach is shown with several academic examples. Although the noise to output ratio can be high, the method is shown to be extremely effective in the situations where a large number of measurements is available.

eess.SP↗

arXiv2018

Randomized opinion dynamics over networks: influence estimation from partial observations

In this paper, we propose a technique for the estimation of the influence matrix in a sparse social network, in which $n$ individual communicate in a gossip way. At each step, a random subset of the social actors is active and interacts with randomly chosen neighbors. The opinions evolve according to a Friedkin and Johnsen mechanism, in which the individuals updates their belief to a convex combination of their current belief, the belief of the agents they interact with, and their initial belief, or prejudice. Leveraging recent results of estimation of vector autoregressive processes, we reconstruct the social network topology and the strength of the interconnections starting from \textit{partial observations} of the interactions, thus removing one of the main drawbacks of finite horizon techniques. The effectiveness of the proposed method is shown on randomly generation networks.

eess.SY↗

arXiv2018

Parsimonious Volterra System Identification

In this short paper, we aim at developing algorithms for sparse Volterra system identification when the system to be identified has infinite impulse response. Assuming that the impulse response is represented as a sum of exponentials and given input-output data, the problem of interest is to find the "simplest" nonlinear Volterra model which is compatible with the a priori information and the collected data. By simplest, we mean the model whose impulse response has the least number of exponentials. The algorithms provided are able to handle both fragmented data and measurement noise. Academic examples at the end of paper show the efficacy of proposed approach.

eess.SY↗