Distributed Gaussian Process Hyperparameter Optimization for Multi-Agent Systems

Gaussian Process (GP) is a flexible non-parametric method which has a wide variety of applications e.g., field estimation using multi-agent systems. However, the training of the hyperparameters suffers from high computational complexity. Recently, distributed hyperparameter optimization with proximal gradients has been proposed to reduce...

Update Scheduling for ADMM-based Energy Sharing in Virtual Power Plants Considering Massive Prosumer Access

With the proliferation of distributed energy resources (DERs), electricity consumers in virtual power plants (VPPs) are transitioning into prosumers and are encouraged to share surplus energy with peers. Nevertheless, large-scale energy sharing among thousands of prosumers may encounter communication-related challenges. Communication network...

Optimal Charging Strategies for Electric Vehicle Fleets

Electric vehicles are a fast-growing market in the automotive sector. In addition, the widespread use of renewable energy to power electric vehicles makes them sustainable, with considerably low greenhouse gas emissions. As a result, service providers are switching to fleets of electric vehicles to promote environmental sustainability. However,...

Communication efficient privacy-preserving distributed optimization using adaptive differential quantization

Privacy issues and communication cost are both major concerns in distributed optimization in networks. There is often a trade-off between them because the encryption methods used for privacy-preservation often require expensive communication overhead. To address these issues, we, in this paper, propose a quantization-based approach to achieve...

Two for the price of one: communication efficient and privacy-preserving distributed average consensus using quantization

Both communication overhead and privacy are main concerns in designing distributed computing algorithms. It is very challenging to address them simultaneously as encryption methods required for privacy-preservation often incur high communication costs. In this paper, we argue that there is a fundamental link between communication efficiency...

Nesterov Accelerated ADMM for Distributed Pose Graph Optimization in SLAM problems

A common problem in robotics is the simultaneous localization and mapping (SLAM) problem. Here, a robot needs to create a map of its surroundings while simultaneously localizing itself in this map. An unknown environment is assumed. Traditionally, it has been approached through filtering solutions. This paradigm has shifted to pose graph...

Super-resolution Algorithms for Target Localization using Multiple FMCW MIMOs

In this thesis, the joint DOA-range estimation of stationary targets is investigated using multiple FMCW MIMOs with super-resolution capability. To address the low azimuth resolution problem of single small MIMO, a novel topology of array is used, which consists of multiple MIMOs arranged along the azimuth to increase azimuth resolution by...

Distributed Splitting-Over-Features Sparse Bayesian Learning with Alternating Direction Method of Multipliers

In processing spatially distributed data, multi-agent robotic platforms equipped with sensors and computing capabilities are gaining interest for applications in inhospitable environments. In this work an algorithm for a distributed realization of sparse bayesian learning (SBL) is discussed for learning a static spatial process with the...

Recursive nuclear norm based subspace identification

Nuclear norm based subspace identification methods have recently gained importance due to their ability to find low rank solutions while maintaining accuracy through convex optimization. However, their heavy computational burden typically precludes the use in an online, recursive manner, such as may be required for adaptive control. This...

On Simplifying the Primal-Dual Method of Multipliers

Recently, the primal-dual method of multipliers (PDMM) has been proposed to solve a convex optimization problem defined over a general graph. In this paper, we consider simplifying PDMM for a subclass of the convex optimization problems. This subclass includes the consensus problem as a special form. By using algebra, we show that the update...

Distributed Convex Optimization: A Study on the Primal-Dual Method of Multipliers

The Primal-Dual Method of Multipliers (PDMM) is a new algorithm that solves convex optimization problems in a distributed manner. This study focuses on the convergence behavior of the PDMM. For a deeper understanding, the PDMM algorithm was applied to distributed averaging and distributed dictionary learning problems. The results were compared...