Zobrazeno 1 - 10
of 339
pro vyhledávání: '"Charalambous, Themistoklis"'
Autor:
Makridis, Evagoras, Grammenos, Andreas, Oliva, Gabriele, Kalyvianaki, Evangelia, Hadjicostis, Christoforos N., Charalambous, Themistoklis
In this paper, we address the distributed average consensus problem over directed networks in open multi-agent systems (OMAS), where the stability of the network is disrupted by frequent agent arrivals and departures, leading to a time-varying averag
Externí odkaz:
http://arxiv.org/abs/2409.08634
In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we
Externí odkaz:
http://arxiv.org/abs/2409.05418
In this paper, we present a novel distributed algorithm (herein called MaxCUCL) designed to guarantee that max-consensus is reached in networks characterized by unreliable communication links (i.e., links suffering from packet drops). Our proposed al
Externí odkaz:
http://arxiv.org/abs/2402.18719
Autor:
Fioravanti, Camilla, Makridis, Evagoras, Oliva, Gabriele, Vrakopoulou, Maria, Charalambous, Themistoklis
This paper considers a strongly connected network of agents, each capable of partially observing and controlling a discrete-time linear time-invariant (LTI) system that is jointly observable and controllable. Additionally, agents collaborate to achie
Externí odkaz:
http://arxiv.org/abs/2402.17466
In this paper, we study unconstrained distributed optimization strongly convex problems, in which the exchange of information in the network is captured by a directed graph topology over digital channels that have limited capacity (and hence informat
Externí odkaz:
http://arxiv.org/abs/2309.04588
In this paper, we focus on an asynchronous distributed optimization problem. In our problem, each node is endowed with a convex local cost function, and is able to communicate with its neighbors over a directed communication network. Furthermore, we
Externí odkaz:
http://arxiv.org/abs/2309.04585
This paper addresses the problem of distributed optimization, where a network of agents represented as a directed graph (digraph) aims to collaboratively minimize the sum of their individual cost functions. Existing approaches for distributed optimiz
Externí odkaz:
http://arxiv.org/abs/2305.15202
Autor:
Rikos, Apostolos I., Grammenos, Andreas, Kalyvianaki, Evangelia, Hadjicostis, Christoforos N., Charalambous, Themistoklis, Johansson, Karl H.
We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation whereas th
Externí odkaz:
http://arxiv.org/abs/2304.00596
Autor:
Hadjiloizou, Loizos, Makridis, Evagoras, Charalambous, Themistoklis, Deliparaschos, Kyriakos M.
We present a multisensor fusion framework for the onboard real-time navigation of a quadrotor in an indoor environment. The framework integrates sensor readings from an Inertial Measurement Unit (IMU), a camera-based object detection algorithm, and a
Externí odkaz:
http://arxiv.org/abs/2303.09561
Autor:
Hadjiloizou, Loizos, Deliparaschos, Kyriakos M., Makridis, Evagoras, Charalambous, Themistoklis
We propose a multisensor fusion framework for onboard real-time navigation of a quadrotor in an indoor environment, by integrating sensor readings from an Inertial Measurement Unit (IMU), a camera-based object detection algorithm, and an Ultra-WideBa
Externí odkaz:
http://arxiv.org/abs/2212.01599