Apostolos I. Rikos

Apostolos I. Rikos

Auto-generated profile, based on publicly available information

Apostolos I. Rikos

Division of Decision and Control Systems, KTH Royal Institute of Technology, Stockholm, Sweden

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
14 May 2014 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
ARApostolos I. Rikos
Apostolos I. Rikos
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a number of applications, including cooperative control, distributed optimization, and distributed averaging. We propose distributed algorithms that operate over static topologies, for solving the weight-balancing problem when the weights are either non-negative real numbers or when they are restricted to be non-negative integers. For the case of real weights, the proposed algorithm is shown to admit a geometric convergence rate. For the case of integer weights, the proposed algorithm is shown to converge after a finite number of iterations that we explicitly bound. We also provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithms.

28 September 2022 in IEEE Open Journal of Control Systems
Verified
Journal Article
Open access
MDMohammadreza Doostmohammadian
Mohammadreza Doostmohammadian
AAAlireza Aghasi
Alireza Aghasi
ARApostolos I. Rikos
Apostolos I. Rikos
AGAndreas Grammenos
Andreas Grammenos
EKEvangelia Kalyvianaki
Evangelia Kalyvianaki
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
This paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays. We propose a double time-scale scenario for unknown delays and a faster single time-scale scenario for known delays. Further, the links among the nodes are considered subject to certain nonlinearities (e.g, quantization and saturation/clipping). We discuss different models for nonlinearities and how they may affect the convergence, sum-preserving feasibility constraint, and solution optimality over general weight-balanced uniformly strongly connected networks and, further, time-delayed undirected networks. Our proposed scheme works in a variety of applications with general non-quadratic strongly-convex smooth objective functions. The non-quadratic part, for example, can be due to additive convex penalty or barrier functions to address the local box constraints. The network can change over time, is not necessarily connected at all times, but is only assumed to be uniformly-connected. The novelty of this work is to address all-time feasible Laplacian gradient solutions in presence of nonlinearities, switching digraph topology (not necessarily all-time connected), and heterogeneous time-varying delays.

23 June 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Open access
ARApostolos I. Rikos
Apostolos I. Rikos
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
KJKarl Henrik Johansson
Karl Henrik Johansson
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
In this paper, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where nodes in the network can be curious, while certain nodes in the network want to ensure that their initial states cannot be inferred exactly by these curious nodes. Curious nodes are not malicious, i.e., they try to identify the initial states of other nodes based on the data they receive during their operation (and some of them might even collude) but do not interfere in the computation in any other way. Each node in the network (including curious nodes) can opt to execute a privacy-preserving algorithm (so as not to reveal the initial state it contributes to the average calculation) or its underlying (plain) average consensus algorithm (if privacy is not a concern). We propose two privacy-preserving event-triggered quantized average consensus algorithms. Under certain topological conditions, both proposed algorithms allow the nodes who adopt privacy-preserving protocols to preserve their privacy and at the same time to obtain, after a finite number of steps, the exact average of the initial states while processing and transmitting quantized information. We also present illustrative examples and comparisons of our algorithms against other algorithms in the existing literature, and discuss a motivating application in which smart meters in a smart grid collect real-time demands in a privacy-preserving manner.

1 July 2012
Verified
Conference Paper
Closed access
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
ARApostolos Rikos
Apostolos Rikos
A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a number of applications, including cooperative control, distributed optimization, and distributed averaging problems. We address the weight-balance problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). We develop two iterative algorithms, a centralized one and a distributed one, both of which can be used to reach weight-balance, as long as the underlying communication topology forms a strongly connected digraph (or is a collection of strongly connected digraphs). The centralized algorithm is shown to reach weight-balance after a finite number of iterations (bounded by the number of nodes in the graph). The distributed algorithm operates by having each node adapt the weights on its outgoing edges and is shown to asymptotically lead to weight-balance. We also analyze the rate of convergence of the proposed distributed algorithm and obtain a (graph-dependent) worst-case bound for it. Finally, we provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithms.

9 May 2017 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
ARApostolos I. Rikos
Apostolos I. Rikos
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, event-triggered coordination, distributed averaging, and optimization. Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multicomponent system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a distributed algorithm which solves the integer weight balancing problem in the presence of arbitrary (time-varying and inhomogeneous) time delays that might affect the transmission at a particular link at a particular time. The algorithm converges after a finite number of steps (that we explicitly bound) in the presence of bounded delays and converges in finite time (with probability one) in the case of unbounded delays (packet drops). Furthermore, we show that the resulting weight balanced digraph is unique regardless of how time delays or packet drops manifest themselves. We also analyze the computational and communication complexity of the proposed algorithm, and provide examples to illustrate its operation and performance.

19 July 2024 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Open access
ARApostolos I. Rikos
Apostolos I. Rikos
AGAndreas Grammenos
Andreas Grammenos
EKEvangelia Kalyvianaki
Evangelia Kalyvianaki
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
KJKarl H. Johansson
Karl H. Johansson
We propose two distributed iterative algorithms that can be used to solve the distributed optimization problem for quadratic local cost functions over large-scale networks in finite time. The first algorithm exhibits synchronous operation whereas the second one exhibits asynchronous operation. Both algorithms operate exclusively with quantized values. This means that the information stored, processed and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to (i) optimal task scheduling for data centers, and (ii) global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. Additionally, it is shown that our proposed algorithms compare favorably to algorithms in the current literature.