Dimitris Boskos

Dimitris Boskos

Auto-generated profile, based on publicly available information

Dimitris Boskos

Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
DBDimitris Boskos
Dimitris Boskos
JCJorge Cortes
Jorge Cortes
SMSonia Martinez
Sonia Martinez
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
Verified
Journal Article
Closed access
DBDimitris Boskos
Dimitris Boskos
JCJorge Cortés
Jorge Cortés
SMSonia Martínez
Sonia Martínez
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.

1 December 2015
Verified
Conference Paper
Open access
DBDimitris Boskos
Dimitris Boskos
DDDimos V. Dimarogonas
Dimos V. Dimarogonas
The purpose of this paper is to define abstractions for multi-agent systems under coupled constraints. In the proposed decentralized framework, we specify a finite or countable transition system for each agent which only takes into account the discrete positions of its neighbors. The dynamics of the considered systems consist of two components. An appropriate feedback law which guarantees that certain performance requirements (e.g., connectivity) are preserved and induces the coupled constraints, and additional free inputs which are exploited for the accomplishment of high level tasks. In this work we provide sufficient conditions on the space and time discretization for the abstraction of the system's behaviour which ensure that we can extract a well posed and hence meaningful transition system.

27 November 2024 in IEEE Access
Verified
Journal Article
Open access
GBGianpietro Battocletti
Gianpietro Battocletti
DBDimitris Boskos
Dimitris Boskos
DTDomagoj Tolić
Domagoj Tolić
IPIvana Palunko
Ivana Palunko
BSBart de Schutter
Bart de Schutter
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.

9 May 2023
Verified
Conference Paper
Open access
IGIbón Gracia
Ibón Gracia
DBDimitris Boskos
Dimitris Boskos
LLLuca Laurenti
Luca Laurenti
MEManuel Mazo Espinosa
Manuel Mazo Espinosa
We present a novel framework for formal control of uncertain discrete-time switched stochastic systems against probabilistic reach-avoid specifications. In particular, we consider stochastic systems with additive noise, whose distribution lies in an ambiguity set of distributions that are ε − close to a nominal one according to the Wasserstein distance. For this class of systems we derive control synthesis algorithms that are robust against all these distributions and maximize the probability of satisfying a reach-avoid specification, defined as the probability of reaching a goal region while being safe. The framework we present first learns an abstraction of a switched stochastic system as a robust Markov decision process (robust MDP) by accounting for both the stochasticity of the system and the uncertainty in the noise distribution. Then, it synthesizes a strategy on the resulting robust MDP that maximizes the probability of satisfying the property and is robust to all uncertainty in the system. This strategy is then refined into a switching strategy for the original stochastic system. By exploiting tools from optimal transport and stochastic programming, we show that synthesizing such a strategy reduces to solving a set of linear programs, thus guaranteeing efficiency. We experimentally validate the efficacy of our framework on various case studies, including both linear and non-linear switched stochastic systems. Our results represent the first formal approach for control synthesis of stochastic systems with uncertain noise distribution.

1 January 2019 in European Journal of Control
Verified
Journal Article
Closed access
DBDimitris Boskos
Dimitris Boskos
DDDimos V. Dimarogonas
Dimos V. Dimarogonas