Hendrik Richter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hendrik Richter has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Rick Voßwinkel
Westsächsische Hochschule Zwickau
5 shared publications Franz Dietel
HTWK Leipzig, University of Applied Sciences, Faculty of Electrical Engineering and Information Technology, Leipzig, Germany
4 shared publicationsRico Schulze
4 shared publications- Shengxiang Yang
De Montfort University
4 shared publications - Klaus Röbenack
TUD Dresden University of Technology
3 shared publications Dirk Abel
Institute of Automatic Control, RWTH Aachen University, 52074 Aachen, Germany
2 shared publications
Latest Publications
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 654-662
Evolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 654-662
Open AccessEvolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra
- Open Access
- 28 March 2024
- Published by Elsevier in Franklin Open
- Vol. 7
Model-based MIN/MAX override control of centrifugal compressor systems
- 28 March 2024
- Published by Elsevier in Franklin Open
- Vol. 7
Open AccessModel-based MIN/MAX override control of centrifugal compressor systems
- Open Access
Information flow and Laplacian dynamics on local optima networks
We propose a new way of looking at local optima networks (LONs). LONs represent fitness landscapes; the nodes are local optima, and the edges are search transitions between them. Many metrics computed on LONs have been proposed and shown to be linked to metaheuristic search difficulty. These have typically considered LONs as describing static structures. In contrast to this, Laplacian dynamics (LD) is an approach to consider the information flow across a network as a dynamical process. We adapt and apply LD to the context of LONs. As a testbed, we consider instances from the quadratic assignment problem (QAP) library. Metrics related to LD are proposed and these are compared with existing LON metrics. The results show that certain LD metrics are strong predictors of metaheuristic performance for iterated local search and tabu search.
Open AccessInformation flow and Laplacian dynamics on local optima networks
We propose a new way of looking at local optima networks (LONs). LONs represent fitness landscapes; the nodes are local optima, and the edges are search transitions between them. Many metrics computed on LONs have been proposed and shown to be linked to metaheuristic search difficulty. These have typically considered LONs as describing static structures. In contrast to this, Laplacian dynamics (LD) is an approach to consider the information flow across a network as a dynamical process. We adapt and apply LD to the context of LONs. As a testbed, we consider instances from the quadratic assignment problem (QAP) library. Metrics related to LD are proposed and these are compared with existing LON metrics. The results show that certain LD metrics are strong predictors of metaheuristic performance for iterated local search and tabu search.
- Open Access
Do Random and Chaotic Sequences Really Cause Different PSO Performance? Further Results
Empirical results show that PSO performance may be different if using either chaotic or random sequences to drive the algorithm's search dynamics. We analyze the phenomenon by evaluating the performance based on a benchmark of test functions and comparing random and chaotic sequences according to equality or difference in underlying distribution or density. Our results show that the underlying distribution is the main influential factor in performance and thus the assumption of general and systematic performance differences between chaos and random appears not plausible.
Open AccessDo Random and Chaotic Sequences Really Cause Different PSO Performance? Further Results
Empirical results show that PSO performance may be different if using either chaotic or random sequences to drive the algorithm's search dynamics. We analyze the phenomenon by evaluating the performance based on a benchmark of test functions and comparing random and chaotic sequences according to equality or difference in underlying distribution or density. Our results show that the underlying distribution is the main influential factor in performance and thus the assumption of general and systematic performance differences between chaos and random appears not plausible.
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 99-102
Do Random and Chaotic Sequences Really Cause Different PSO Performance?
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO). We take random sequences with different probability distributions and compare them to chaotic sequences with different but also with same density functions. This enables us to differentiate between differences in the origin of the sequences (random number generator or chaotic nonlinear system) and statistical differences expressed by the underlying distributions. Our findings (obtained by evaluating the PSO performance for various benchmark problems using statistical hypothesis testing) cast considerable doubt on previous results which compared random to chaos and suggested that the choice leads to intrinsic differences in performance.
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 99-102
Open AccessDo Random and Chaotic Sequences Really Cause Different PSO Performance?
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO). We take random sequences with different probability distributions and compare them to chaotic sequences with different but also with same density functions. This enables us to differentiate between differences in the origin of the sequences (random number generator or chaotic nonlinear system) and statistical differences expressed by the underlying distributions. Our findings (obtained by evaluating the PSO performance for various benchmark problems using statistical hypothesis testing) cast considerable doubt on previous results which compared random to chaos and suggested that the choice leads to intrinsic differences in performance.
- Open Access
- 7 June 2023
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 87 (1) , 1-39
Spectral dynamics of guided edge removals and identifying transient amplifiers for death–Birth updating
The paper deals with two interrelated topics: (1) identifying transient amplifiers in an iterative process, and (2) analyzing the process by its spectral dynamics, which is the change in the graph spectra by edge manipulation. Transient amplifiers are networks representing population structures which shift the balance between natural selection and random drift. Thus, amplifiers are highly relevant for understanding the relationships between spatial structures and evolutionary dynamics. We study an iterative procedure to identify transient amplifiers for death–Birth updating. The algorithm starts with a regular input graph and iteratively removes edges until desired structures are achieved. Thus, a sequence of candidate graphs is obtained. The edge removals are guided by quantities derived from the sequence of candidate graphs. Moreover, we are interested in the Laplacian spectra of the candidate graphs and analyze the iterative process by its spectral dynamics. The results show that although transient amplifiers for death–Birth updating are generally rare, a substantial number of them can be obtained by the proposed procedure. The graphs identified share structural properties and have some similarity to dumbbell and barbell graphs. We analyze amplification properties of these graphs and also two more families of bell-like graphs and show that further transient amplifiers for death–Birth updating can be found. Finally, it is demonstrated that the spectral dynamics possesses characteristic features useful for deducing links between structural and spectral properties. These feature can also be taken for distinguishing transient amplifiers among evolutionary graphs in general.
- 7 June 2023
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 87 (1) , 1-39
Open AccessSpectral dynamics of guided edge removals and identifying transient amplifiers for death–Birth updating
The paper deals with two interrelated topics: (1) identifying transient amplifiers in an iterative process, and (2) analyzing the process by its spectral dynamics, which is the change in the graph spectra by edge manipulation. Transient amplifiers are networks representing population structures which shift the balance between natural selection and random drift. Thus, amplifiers are highly relevant for understanding the relationships between spatial structures and evolutionary dynamics. We study an iterative procedure to identify transient amplifiers for death–Birth updating. The algorithm starts with a regular input graph and iteratively removes edges until desired structures are achieved. Thus, a sequence of candidate graphs is obtained. The edge removals are guided by quantities derived from the sequence of candidate graphs. Moreover, we are interested in the Laplacian spectra of the candidate graphs and analyze the iterative process by its spectral dynamics. The results show that although transient amplifiers for death–Birth updating are generally rare, a substantial number of them can be obtained by the proposed procedure. The graphs identified share structural properties and have some similarity to dumbbell and barbell graphs. We analyze amplification properties of these graphs and also two more families of bell-like graphs and show that further transient amplifiers for death–Birth updating can be found. Finally, it is demonstrated that the spectral dynamics possesses characteristic features useful for deducing links between structural and spectral properties. These feature can also be taken for distinguishing transient amplifiers among evolutionary graphs in general.
- Open Access
Do Random and Chaotic Sequences Really Cause Different PSO Performance?
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO). We take random sequences with different probability distributions and compare them to chaotic sequences with different but also with same density functions. This enables us to differentiate between differences in the origin of the sequences (random number generator or chaotic nonlinear system) and statistical differences expressed by the underlying distributions. Our findings (obtained by evaluating the PSO performance for various benchmark problems using statistical hypothesis testing) cast considerable doubt on previous results which compared random to chaos and suggested that the choice leads to intrinsic differences in performance.
Open AccessDo Random and Chaotic Sequences Really Cause Different PSO Performance?
Our topic is performance differences between using random and chaos for particle swarm optimization (PSO). We take random sequences with different probability distributions and compare them to chaotic sequences with different but also with same density functions. This enables us to differentiate between differences in the origin of the sequences (random number generator or chaotic nonlinear system) and statistical differences expressed by the underlying distributions. Our findings (obtained by evaluating the PSO performance for various benchmark problems using statistical hypothesis testing) cast considerable doubt on previous results which compared random to chaos and suggested that the choice leads to intrinsic differences in performance.
- Open Access
- 15 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 465
What Is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?
Model predictive control (MPC) is a promising approach to the lateral and longitudinal control of autonomous vehicles. However, the parameterization of the MPC with respect to high-level requirements such as passenger comfort, as well as lateral and longitudinal tracking, is challenging. Numerous tuning parameters and conflicting requirements need to be considered. In this paper, we formulate the MPC tuning task as a multi-objective optimization problem. Its solution is demanding for two reasons: First, MPC-parameterizations are evaluated in a computationally expensive simulation environment. As a result, the optimization algorithm needs to be as sample-efficient as possible. Second, for some poor parameterizations, the simulation cannot be completed; therefore, useful objective function values are not available (for instance, learning with crash constraints). In this work, we compare the sample efficiency of multi-objective particle swarm optimization (MOPSO), a genetic algorithm (NSGA-II), and multiple versions of Bayesian optimization (BO). We extend BO by introducing an adaptive batch size to limit the computational overhead. In addition, we devise a method to deal with crash constraints. The results show that BO works best for a small budget, NSGA-II is best for medium budgets, and none of the evaluated optimizers are superior to random search for large budgets. Both proposed BO extensions are, therefore, shown to be beneficial.
- 15 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 465
Open AccessWhat Is the Best Way to Optimally Parameterize the MPC Cost Function for Vehicle Guidance?
Model predictive control (MPC) is a promising approach to the lateral and longitudinal control of autonomous vehicles. However, the parameterization of the MPC with respect to high-level requirements such as passenger comfort, as well as lateral and longitudinal tracking, is challenging. Numerous tuning parameters and conflicting requirements need to be considered. In this paper, we formulate the MPC tuning task as a multi-objective optimization problem. Its solution is demanding for two reasons: First, MPC-parameterizations are evaluated in a computationally expensive simulation environment. As a result, the optimization algorithm needs to be as sample-efficient as possible. Second, for some poor parameterizations, the simulation cannot be completed; therefore, useful objective function values are not available (for instance, learning with crash constraints). In this work, we compare the sample efficiency of multi-objective particle swarm optimization (MOPSO), a genetic algorithm (NSGA-II), and multiple versions of Bayesian optimization (BO). We extend BO by introducing an adaptive batch size to limit the computational overhead. In addition, we devise a method to deal with crash constraints. The results show that BO works best for a small budget, NSGA-II is best for medium budgets, and none of the evaluated optimizers are superior to random search for large budgets. Both proposed BO extensions are, therefore, shown to be beneficial.
- Open Access
- 7 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1882
Designing Color Symmetry in Stigmergic Art
Color symmetry is an extension of the symmetry imposed by isometric transformations and indicates that the colors of geometrical objects are assigned according to the symmetry properties of these objects. A color symmetry permutes the coloring of the objects consistently with their symmetry group. We apply this concept to bio-inspired generative art. Therefore, the geometrical objects are interpreted as motifs that may repeat themselves with a symmetry-consistent coloring. The motifs are obtained by design principles from stigmergy. We discuss the design procedure and present visual results.
- 7 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1882
Open AccessDesigning Color Symmetry in Stigmergic Art
Color symmetry is an extension of the symmetry imposed by isometric transformations and indicates that the colors of geometrical objects are assigned according to the symmetry properties of these objects. A color symmetry permutes the coloring of the objects consistently with their symmetry group. We apply this concept to bio-inspired generative art. Therefore, the geometrical objects are interpreted as motifs that may repeat themselves with a symmetry-consistent coloring. The motifs are obtained by design principles from stigmergy. We discuss the design procedure and present visual results.
- Open Access
- 16 May 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 82 (7) , 1-33
Spectral analysis of transient amplifiers for death–birth updating constructed from regular graphs
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or becomes extinct. The outcome naturally depends on the fitness of the mutant and the rules by which mutants and residents may propagate on the network, but arguably the most determining factor is the network structure. Some structured networks are transient amplifiers. They increase for a certain fitness range the fixation probability of beneficial mutations as compared to a well-mixed population. We study a perturbation method for identifying transient amplifiers for death–birth updating. The method involves calculating the coalescence times of random walks on graphs and finding the vertex with the largest remeeting time. If the graph is perturbed by removing an edge from this vertex, there is a certain likelihood that the resulting perturbed graph is a transient amplifier. We test all pairwise nonisomorphic regular graphs up to a certain order and thus cover the whole structural range expressible by these graphs. For cubic and quartic regular graphs we find a sufficiently large number of transient amplifiers. For these networks we carry out a spectral analysis and show that the graphs from which transient amplifiers can be constructed share certain structural properties. Identifying spectral and structural properties may promote finding and designing such networks.
- 16 May 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 82 (7) , 1-33
Open AccessSpectral analysis of transient amplifiers for death–birth updating constructed from regular graphs
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or becomes extinct. The outcome naturally depends on the fitness of the mutant and the rules by which mutants and residents may propagate on the network, but arguably the most determining factor is the network structure. Some structured networks are transient amplifiers. They increase for a certain fitness range the fixation probability of beneficial mutations as compared to a well-mixed population. We study a perturbation method for identifying transient amplifiers for death–birth updating. The method involves calculating the coalescence times of random walks on graphs and finding the vertex with the largest remeeting time. If the graph is perturbed by removing an edge from this vertex, there is a certain likelihood that the resulting perturbed graph is a transient amplifier. We test all pairwise nonisomorphic regular graphs up to a certain order and thus cover the whole structural range expressible by these graphs. For cubic and quartic regular graphs we find a sufficiently large number of transient amplifiers. For these networks we carry out a spectral analysis and show that the graphs from which transient amplifiers can be constructed share certain structural properties. Identifying spectral and structural properties may promote finding and designing such networks.