Adrian Redder

Adrian Redder

Auto-generated profile, based on publicly available information

Adrian Redder

Automatic Control Group (RAT), Department of Electrical Engineering and Information Technology, Paderborn University, Paderborn, Germany

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
4 December 2017 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
MDMoritz Schulze Darup
Moritz Schulze Darup
ARAdrian Redder
Adrian Redder
ISIman Shames
Iman Shames
Farhad FarokhiFarhad Farokhi
Farhad Farokhi
DQDaniel Quevedo
Daniel Quevedo
We present an encrypted model predictive control (MPC) scheme for linear constrained systems. More precisely, we show that homomorphic encryption can be used to realize a secure and private cloud-based evaluation of an MPC if the corresponding piecewise affine control law is explicitly given.

27 June 2018 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
MDMoritz Schulze Darup
Moritz Schulze Darup
ARAdrian Redder
Adrian Redder
DQDaniel E. Quevedo
Daniel E. Quevedo
Cooperative control for multi-agent systems usually requires some communication between the various subsystems. In the resulting networked control system, sensitive data is transmitted and shared between the agents. We propose a novel encrypted control scheme that ensures privacy of the individual agents' data not only during transmission but also during controller evaluations at neighboring agents. Our control scheme efficiently combines the design of structured feedback laws for multi-agent systems with encrypted controllers for conventional linear systems. The underlying key technology is partial homomorphic encryption, which allows simple computations to be carried out on encrypted data.

3 April 2024 in IEEE Access
Verified
Journal Article
Open access
HAHaitham Afifi
Haitham Afifi
SPSabrina Pochaba
Sabrina Pochaba
ABAndreas Boltres
Andreas Boltres
DLDominic Laniewski
Dominic Laniewski
JHJanek Haberer
Janek Haberer
MSMichael Seufert
Michael Seufert
Machine learning has found many applications in network contexts. These include solving optimisation problems and managing network operations. Conversely, networks are essential for facilitating machine learning training and inference, whether performed centrally or in a distributed fashion. To conduct rigorous research in this area, researchers must have a comprehensive understanding of fundamental techniques, specific frameworks, and access to relevant datasets. Additionally, access to training data can serve as a benchmark or a springboard for further investigation. All these techniques are summarized in this article; serving as a primer paper and hopefully providing an efficient start for anybody doing research regarding machine learning for networks or using networks for machine learning.

30 August 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ARArunselvan Ramaswamy
Arunselvan Ramaswamy
ARAdrian Redder
Adrian Redder
DQDaniel E. Quevedo
Daniel E. Quevedo
Solving optimization problems in multiagent systems involves information exchange between agents. The obtained solutions should be robust to information delays and errors that arise from an unreliable wireless network, which typically connects the multiagent system. In today’s large-scale dynamic Internet of Things style multiagent scenarios, the network topology changes and evolves over time. In this article, we present a simple distributed gradient-based optimization framework and an associated algorithm. Convergence to a minimum of a given objective is shown under mild conditions on the network topology and objective. A key feature of our approach is that we merely assume that the messages sent reach the intended receiver, possibly delayed, with some positive probability. To the best of authors’ knowledge, ours is the first analysis under such weak general network conditions. We also discuss in detail the verifiability of the assumptions involved. This article also makes a technical contribution in terms of the allowed class of objective functions. Specifically, we present an analysis wherein the objective function is such that its sample-gradient is merely locally Lipschitz continuous. The theory developed herein is supported by empirical results.

5 September 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
VDVan Huyen Dang
Van Huyen Dang
ARAdrian Redder
Adrian Redder
HPHuy Xuan Pham
Huy Xuan Pham
ASAndriy Sarabakha
Andriy Sarabakha
EKErdal Kayacan
Erdal Kayacan
End-to-end navigation via deep reinforcement learning has become a key approach for vision-based tasks. However, the sim-to-real gap remains a challenge, especially for aerial robots, where policies trained in simulation often fail in real-world environments. In this work, we propose a novel navigation paradigm – volumetric depth-based safe navigation (VDS-Nav), which trains a policy to infer linear velocities and yaw rate directly from a sequence of depth images, bypassing the need for a pre-trained latent space encoder. We enhance safety with a depth-based reward design, enabling the seamless incorporation of system constraints via logarithmic barrier function methods. Most importantly, using explicit sensor information in our reward design leads to seamless sim-to-real transfer by strengthening the correlation between state-action pairs and received rewards. To evaluate the effectiveness of VDS-Nav, we compare it to a baseline that first trains a variational autoencoder to encode depth images into a latent space for policy training. The simulation results show that VDS-Nav outperforms the baseline in terms of success rate. Furthermore, real-world experiments validate the policy, with real-time performance closely matching simulation results, suggesting an effective sim-to-real transfer.

27 January 2022 in arXiv
Verified
Preprint
Open access
PDF file
ARAdrian Redder
Adrian Redder
ARArunselvan Ramaswamy
Arunselvan Ramaswamy
HKHolger Karl
Holger Karl
Iterative distributed optimization algorithms involve multiple agents that communicate with each other, over time, in order to minimize/maximize a global objective. In the presence of unreliable communication networks, the Age-of-Information (AoI), which measures the freshness of data received, may be large and hence hinder algorithmic convergence. In this paper, we study the convergence of general distributed gradient-based optimization algorithms in the presence of communication that neither happens periodically nor at stochastically independent points in time. We show that convergence is guaranteed provided the random variables associated with the AoI processes are stochastically dominated by a random variable with finite first moment. This improves on previous requirements of boundedness of more than the first moment. We then introduce stochastically strongly connected (SSC) networks, a new stochastic form of strong connectedness for time-varying networks. We show: If for any $p \ge0$ the processes that describe the success of communication between agents in a SSC network are $\alpha$-mixing with $n^{p-1}\alpha(n)$ summable, then the associated AoI processes are stochastically dominated by a random variable with finite $p$-th moment. In combination with our first contribution, this implies that distributed stochastic gradient descend converges in the presence of AoI, if $\alpha(n)$ is summable.