101 citations · 466 across the 65 of their papers we have counts for
10 papers · 2 filters
A Finite-Time Cutting Plane Algorithm for Distributed Mixed Integer Linear Programming
Andrea Testa, Alessandro Rucco, Giuseppe Notarstefano
Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this p…
Newton-Raphson Consensus under asynchronous and lossy communications for peer-to-peer networks
Nicoletta Bof, Ruggero Carli, Giuseppe Notarstefano +2
In this work we study the problem of unconstrained convex-optimization in a fully distributed multi-agent setting which includes asynchronous computation and lossy communication. I…
Minimum-time trajectory generation for quadrotors in constrained environments
Sara Spedicato, Giuseppe Notarstefano
In this paper, we present a novel strategy to compute minimum-time trajectories for quadrotors in constrained environments. In particular, we consider the motion in a given flying…
Interaction-Based Distributed Learning in Cyber-Physical and Social Networks
Francesco Sasso, Angelo Coluccia, Giuseppe Notarstefano
In this paper we consider a network scenario in which agents can evaluate each other according to a score graph that models some physical or social interaction. The goal is to desi…
Randomized Constraints Consensus for Distributed Robust Linear Programming
Mohammadreza Chamanbaz, Giuseppe Notarstefano, Roland Bouffanais
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function an…
Analysis of Newton-Raphson Consensus for multi-agent convex optimization under asynchronous and lossy communications
Ruggero Carli, Giuseppe Notarstefano, Luca Schenato +1
We extend a multi-agent convex-optimization algorithm named Newton-Raphson consensus to a network scenario that involves directed, asynchronous and lossy communications. We theoret…