Hans-Bernd Dürr

Learn More
We consider problems in multi-agent systems where a network of autonomous vehicles needs to self-organize such that some global objective function is maximized. To deal with the agents' lack of global information we define the problem as a potential game where the agents/players are only able to access local measurements of their individual utility(More)
In this paper we consider two examples of synchronization problems, i.e., a network of oscillators and a network of rigid bodies. We propose a controller that requires only the knowledge of the relative distances among the neighboring systems in the network. The controller is based on an extremum seeking controller, that steers the overall system to the(More)
Extremum seeking is a powerful control method to steer a dynamical system to an extremum of a partially unknown function. In this paper, we introduce extremum seeking systems on submanifolds in the Euclidian space. Using a trajectory approximation technique based on Lie brackets, we prove that uniform asymptotic stability of the so-called Lie bracket system(More)
In this paper, we consider convex optimization problems with constraints. By combining the idea of a Lie bracket approximation for extremum seeking systems and saddle point algorithms, we propose a feedback which steers a single-integrator system to the set of saddle points of the Lagrangian associated to the convex optimization problem. We prove practical(More)
— The problem of autonomously steering a vehicle to a destination point, while avoiding obstacles, is considered. The vehicle is modeled as a single-integrator in the plane and it is assumed that the obstacles are unknown a priori. The control law is an extremum seeking algorithm, which steers the vehicle to the minimum of a navigation function. In this(More)