Now showing 1 - 6 of 6
  • Publication
    On the design of cyber-physical control system for a smart pedelec (Ebike)
    We present a cyber-physical control system for deployment on a smart pedelec (Ebike). The goal of the control is to manage the interaction between a human and a motor intervention, for applications in which we wish to control physical aspects of the cycling behaviour (e.g. heart rate and breathing rate). The basis of the control is a pitchfork bifurcation system, augmented using ideas from gain-scheduling. Experiments have been conducted, showing the validity of the proposed control strategy. A use case dealing with the regulation of human ventilation characteristics in response to exogenous pollution measurements is presented.
      247Scopus© Citations 8
  • Publication
    On a probabilistic approach to synthesize control policies from example datasets
    This paper is concerned with the design of control policies from example datasets. The case considered is when just a black box description of the system to be controlled is available and the system is affected by actuation constraints. These constraints are not necessarily fulfilled by the (possibly, noisy) example data and the system under control is not necessarily the same as the one from which these data are collected. In this context, we introduce a number of methodological results to compute a control policy from example datasets that: (i) makes the behavior of the closed-loop system similar to the one illustrated in the data; (ii) guarantees compliance with the constraints. We recast the control problem as a finite-horizon optimal control problem and give an explicit expression for its optimal solution. Moreover, we turn our findings into an algorithmic procedure. The procedure gives a systematic tool to compute the policy. The effectiveness of our approach is illustrated via a numerical example, where we use real data collected from test drives to synthesize a control policy for the merging of a car on a highway.
      41Scopus© Citations 7
  • Publication
    On distributed coordination in networks of cyber-physical systems
    (AIP Publishing, 2019-05) ;
    This paper is concerned with the study of the global emerging behavior in complex networks where each node can be modeled as a cyber-physical system. We recast the problem of characterizing the behavior of such systems as a stability problem and give two technical results to assess this property. We then illustrate the effectiveness of our approach by considering two testbed examples arising in applications where networks, arising from Internet of Things applications, need to be designed so as to fulfill a given task.
      204Scopus© Citations 3
  • Publication
    Resilient consensus for multi-agent systems subject to differential privacy requirements
    (Elsevier, 2019-08) ;
    We consider multi-agent systems interacting over directed network topologies where a subset of agents is adversary/faulty and where the non-faulty agents have the goal of reaching consensus, while fulfilling a differential privacy requirement on their initial conditions. To address this problem, we develop an update law for the non-faulty agents. Specifically, we propose a modification of the so-called Mean-Subsequence-Reduced (MSR) algorithm, the Differentially Private MSR (DP-MSR) algorithm, and characterize three important properties of the algorithm: correctness, accuracy and differential privacy. We show that if the network topology is -robust, then the algorithm allows the non-faulty agents to reach consensus despite the presence of up to faulty agents and we characterize the accuracy of the algorithm. Furthermore, we also show in two important cases that our distributed algorithm can be tuned to guarantee differential privacy of the initial conditions and the differential privacy requirement is related to the maximum network degree. The results are illustrated via simulations.
      195Scopus© Citations 71
  • Publication
    Resilient consensus for multi-agent systems subject to differential privacy requirements
    (IEEE, 2019-06-28) ;
    We consider multi-agent systems interacting over directed network topologies where a subset of agents is adversary/faulty and where the non-faulty agents have the goal of reaching consensus, while fulfilling a differential privacy requirement on their initial conditions. To address this problem, we develop an update law for the non-faulty agents. Specifically, we propose a modification of the so-called Mean-Subsequence-Reduced (MSR) algorithm, the Differentially Private MSR (DP-MSR) algorithm, and characterize three important properties of the algorithm: correctness, accuracy and differential privacy. We show that if the network topology is (2f +1)-robust, then the algorithm allows the non-faulty agents to reach consensus despite the presence of up to f faulty agents and we characterize the accuracy of the algorithm. Furthermore, we also show in two important cases that our distributed algorithm can be tuned to guarantees differential privacy of the initial conditions and the differential privacy requirement is related to the maximum network degree. The results are illustrated via simulations.
      260Scopus© Citations 2
  • Publication
    On robust stability of fully probabilistic control with respect to data-driven model uncertainties
    We investigate robust stability of the fully probabilistic control with respect to data-driven model uncertainties. This scheme attempts to control a system modeled via a probability density function (pdf) and does so by computing a probabilistic control policy that is optimal in the Kullback-Leibler sense. The results are illustrated via simulations.
      189Scopus© Citations 3