4 August 2020 in IEEE Transactions on Automatic Control
Distributional ambiguity sets provide quantifiable ways to characterize the uncertainty about the true probability distribution of random variables of interest. This makes them a key element in data-driven robust optimization by exploiting high-confidence guarantees to hedge against uncertainty. This article explores the construction of Wasserstein ambiguity sets in dynamic scenarios, where data are collected progressively and may only reveal partial information about the unknown random variable. For random variables evolving according to known dynamics, we leverage assimilated samples to make inferences about their unknown distribution at the end of the sampling horizon. Under exact knowledge of the flow map, we provide sufficient conditions that relate the growth of the trajectories with the sampling rate to establish a reduction of the ambiguity set size as the horizon increases. Furthermore, we characterize the exploitable sample history that results in a guaranteed reduction of ambiguity sets under errors in the computation of the flow and when the dynamics is subject to bounded unknown disturbances. Our treatment deals with both full- and partial-state measurements and, in the latter case, exploits the sampled-data observability properties of linear time-varying systems under irregular sampling. Simulations on an unmanned aerial vehicle detection application show the superior performance resulting from the proposed dynamic ambiguity sets.
8 May 2023 in IEEE Transactions on Automatic Control
This article builds Wasserstein ambiguity sets for the unknown probability distribution of dynamic random variables leveraging noisy partial-state observations. The constructed ambiguity sets contain the true distribution of the data with quantifiable probability and can be exploited to formulate robust stochastic optimization problems with out-of-sample guarantees. We assume the random variable evolves in discrete time under uncertain initial conditions and dynamics, and that noisy partial measurements are available. All random elements have unknown probability distributions and we make inferences about the distribution of the state vector using several output samples from multiple realizations of the process. To this end, we leverage an observer to estimate the state of each independent realization and exploit the outcome to construct the ambiguity sets. We illustrate our results in an economic dispatch problem involving distributed energy resources over which the scheduler has no direct control.
27 November 2024 in IEEE Access
In this article we consider the problem of tether entanglement for tethered mobile robots. One of the main risks of using a tethered connection between a mobile robot and an anchor point is that the tether may get entangled with the obstacles present in the environment or with itself. To avoid these situations, a non-entanglement constraint can be considered in the motion planning problem for tethered robots. This constraint is typically expressed as a set of specific tether configurations that must be avoided. However, the literature lacks a generally accepted definition of entanglement, with existing definitions being limited and partial in the sense that they only focus on specific instances of entanglement. In practice, this means that the existing definitions do not effectively cover all instances of tether entanglement. Our goal in this article is to bridge this gap and to provide new definitions of entanglement, which, together with the existing ones, can be effectively used to qualify the entanglement state of a tethered robot in diverse situations. The new definitions find application in motion planning for tethered robots, where they can be used to obtain more safe and robust entanglement-free trajectories.
1 January 2019 in European Journal of Control