Forschung

Zukünftige IT-Systeme werden noch in weit stärkerem Maße als heute aus vielen unterschiedlichen Komponenten bestehen. Solche Systeme sind häufig zu groß und zu dynamisch, um zentral verwaltet werden zu können. Daher stehen bei uns algorithmische Probleme im Vordergrund, die sich mit dezentralen Methoden zur Kontrolle und Optimierung derartiger Systeme befassen.

Moderne verteilte IT-Systeme wie z. B. das Internet, Peer-to-Peer-Systeme oder drahtlose Kommunikationssysteme, aber auch Schwärme von Sensoren oder mobilen Robotern stellen neuartige Herausforderungen an die Algorithmenentwicklung. Da wegen der Größe und Dynamik solcher Systeme die einzelnen Komponenten (Peers, Roboter ...) nur sehr eingeschränkte lokale Information über den aktuellen Zustand des Gesamtsystems haben, müssen neue lokale algorithmische Methoden zur Nutzung und Kontrolle solcher Systeme entwickelt werden. Unsere Forschung befasst sich auf vielfältige Weise mit derartigen lokalen Algorithmen.

Ressourcenmanagement und Scheduling

In modernen heterogenen Datenzentren gewinnt Ressourcenmanagement mehr und mehr an Bedeutung. Rechenzeit, Energie oder Datenrate sind nur einige Beispiele für eingeschränkte Ressourcen. In unserer Fachgruppe entwickeln wir Ansätze, um Scheduling-Algorithmen effizienter zu machen und dabei der steigenden Größe von Rechenzentren gerecht zu werden. Ein besonderer Fokus liegt dabei auf ressourcenbeschränktem Scheduling und der Platzierung von Ressourcen in Netzwerken.

Dynamik in Netzwerken

Dynamische Netzwerke, d. h. Netzwerke, deren Topologie sich über die Zeit verändert, spielen in vielen Bereichen eine wichtige Rolle. Sie tauchen z. B. als sogenannte Overlay- Netzwerke zur Unterstützung von Peer-to-Peer-Systemen auf, deren Topologie sich ständig durch neue Peers oder Ausscheiden vorhandener Peers verändert. Wegen der Größe und Dynamik derartiger Netzwerke ist es häufig nicht möglich, sie durch eine zentrale Kontrolle zu steuern oder zu optimieren. Wir befassen uns in diesem Umfeld insbesondere mit lokalen Strategien, die das Netzwerk ständig an sich ändernde Anwenderanforderungen anpassen.

Lokale Strategien für selbstorganisierende Roboterschwärme

Bei Roboterschwärmen beliebiger Größe und fehlender Infrastruktur, wie beispielsweise auf fremden Planeten, können Roboter ihre Aktionen lediglich auf Grundlage lokaler Informationen berechnen. Wir entwickeln daher Formationsbildungsstrategien, die keinerlei globale Information benötigen, d. h. Sichtweite nur bis zu einer konstanten Entfernung, nur lokale Kommunikation und keinen Kompass. Derzeit wird von uns das Versammeln von Robotern auf einem a priori unbestimmten Punkt (Gathering) untersucht. Hierbei liegt der Schwerpunkt unserer Forschung auf der Optimalität der Laufzeit und der Kollisionsvermeidung. Wir beweisen formal die Korrektheit und Komplexität unserer Strategien in diskreten sowie kontinuierlichen synchronen Zeitmodellen auf dem Gitter bzw. in der euklidischen Ebene.

Schwarmintelligenz und Evolutionäre Robotik

Technische Systeme werden immer komplexer. Wir entwickeln biologisch inspirierte Ansätze, die aus Prinzip auf einfachen Algorithmen aufgebaut sind, aber dennoch komplexe Aufgaben lösen können, indem viele dieser einfachen Einheiten miteinander kooperieren. Unsere Ansätze werden durch mathematische Modellierung unterstützt und wir testen sie in Anwendungen verteilter Robotersysteme. Im Bereich der Evolutionären Robotik entwickeln wir Methoden zur automatischen Erzeugung von Robotersteuerungen. In einem Projekt, das dieses Jahr gestartet wurde, wenden wir unsere Methoden auf verteilte Robotersysteme an, die mit Pflanzen interagieren.

Algorithmische Spieltheorie

Bei vielen aktuellen Problemen – beispielsweise bei großen dezentralen Netzwerken – steht nicht mehr die Frage der Lösung durch eine zentrale Autorität im Mittelpunkt, sondern die verteilte Lösung durch eine Vielzahl von Akteuren. Hierbei wählen Akteure ihre Strategien nach ihren eigennützigen Interessen, was zu Lösungen führen kann, die schlechter sind als die einer zentralen Autorität. Wir untersuchen hierbei einerseits, wie stark der Einfluss des strategischen Handelns der Akteure auf die Qualität der Lösungen ist. Andererseits interessiert uns die Berechnung von Vorhersagen, zu welchen Ergebnissen das strategische Verhalten führen kann.



Unsere Aktivitäten 2016

Publikationen

Abshoff, Sebastian; Cord-Landwehr, Andreas;
Fischer, Matthias; Jung, Daniel; Meyer auf der
Heide, Friedhelm: Gathering a Closed Chain
of Robots on a Grid. In: Proceedings of the
30th International Parallel and Distributed
Processing Symposium (IPDPS), S. 689 – 699,
Mai 2016, IEEE


Abshoff, Sebastian; Kling, Peter; Markarian,
Christine; Meyer auf der Heide, Friedhelm; Pietrzyk,
Peter: Towards the price of leasing online.
Journal of Combinatorial Optimization, 32: S.
1197 – 1216 2016


Abu-Khzam, Faisal N. ; Li, Shouwei; Markarian,
Christine; Meyer auf der Heide, Friedhelm;
Podlipyan, Pavel: On the Parameterized Parallel
Complexity and the Vertex Cover Problem. In:
Proceedings of the 10th Annual International
Conference on Combinatorial Optimization
and Applications (COCOA) (accepted), LNCS,
Band 10043 , 16. – 18. Dez. 2016, Springer,
Heidelberg


Abu-Khzam, Faisal N. ; Li, Shouwei; Markarian,
Christine; Meyer auf der Heide, Friedhelm;
Podlipyan, Pavel: The Monotone Circuit Value
Problem with Bounded Genus Is in NC. In: Dinh,
Thang N. ; Thai, My T. (Hrsg.) Computing and
Combinatorics, The 22nd International Computing
and Combinatorics Conference, Band 9797,
S. 92 – 102, Aug. 2016, Springer Verlag LNCS


Cord-Landwehr, Andreas; Fischer, Matthias;
Jung, Daniel; Meyer auf der Heide, Friedhelm:
Asymptotically Optimal Gathering on a Grid.
In: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures
(SPAA), S. 301 – 312, Jul. 2016, ACM


Divband Soorati, Mohammad; Hamann, Heiko:
Robot Self-Assembly as Adaptive Growth Process:
Collective Selection of Seed Position and
Self-Organizing Tree-Structures. In: IEEE/RSJ
International Conference on Intelligent Robots
and Systems (IROS 2016) (accepted), 2016


Drees, Maximilian; Feldkord, Björn; Skopalik,
Alexander: Strategic Online Facility Location. In:
Proceedings of the 10th Annual International
Conference on Combinatorial Optimization
and Applications (COCOA) (accepted), LNCS,
Band 10043 , 16. – 18. Dez. 2016, Springer,
Heidelberg


Drees, Maximilian; Gmyr, Robert; Scheideler,
Christian: Churn- and DoS-resistant Overlay
Networks Based on Network Reconfi guration.
In: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures
(SPAA), S. 417 – 427, Jul. 2016, ACM


Feldotto, Matthias; Graffi , Kalman: Systematic
evaluation of peer-to-peer systems using PeerfactSim.
KOM. Concurrency and Computation:
Practice and Experience, 28: S. 1655 – 1677,
Apr. 2016


Feldotto, Matthias; Leder, Lennart; Skopalik,
Alexander: Congestion Games with Mixed
Objectives. In: Proceedings of the 10th Annual
International Conference on Combinatorial
Optimization and Applications (COCOA) (accepted),
LNCS, Band 10043 , 16. – 18. Dez. 2016,
Springer, Heidelberg


Fischer, Matthias; Jähn, Claudius; Meyer auf
der Heide, Friedhelm; Petring, Ralf: Algorithm
Engineering Aspects of Real-Time Rendering
Algorithms. In: Algorithm Engineering (accepted),
LNCS, Band 9220, Dez. 2016, Springer,
Heidelberg


Hamann, Heiko; Khaluf, Yara; Botev, Jean;
Divband Soorati, Mohammad; Ferrante,
Eliseo; Kosak, Oliver; Montanier, Jean-Marc;
Mostaghim, Sanaz; Redpath, Richard; Timmis,
Jon; Veenstra, Frank; Wahby, Mostafa; Zamuda,
Ales: Hybrid Societies: Challenges and Perspectives
in the Design of Collective Behavior in
Self-organizing Systems. Frontiers in Robotics
and AI, 3. Apr. 2016


Hamann, Heiko; Valentini, Gabriele; Dorigo,
Marco: Population Coding: A New Design
Paradigm for Embodied Distributed Systems.
In: 10th Int. Conf. on Swarm Intelligence, ANTS
2016, LNCS, S. 173 – 184, 2016, Springer


Harks, Tobias; Hoefer, Martin; Schewior, Kevin;
Skopalik, Alexander: Routing Games With
Progressive Filling. IEEE/ACM Transactions on
Networking, 24: S. 2553 – 2562, Sep. 2016

Heider, Michael; Von Mammen, Sebastian;
Hamann, Heiko: Robot Gardens: An Augmented
Reality Prototype for Plant-Robot Biohybrid
Systems. In: ACM Symposium on Virtual Reality
Software and Technology (VRST), S. 139 – 142,
2016, ACM


Heinrich, Mary Katherine; Wahby, Mostafa; Divband
Soorati, Mohammad; Hofstadler, Daniel;
Zahadat, Payam; Ayres, Phil; Stoy, Kasper; Hamann,
Heiko: Self-Organized Construction with
Continuous Building Material: Higher Flexibility
based on Braided Structures. In: Proc. of the
1st International Workshop on Self-Organising
Construction (SOCO) (accepted), 2016


Khaluf, Yara; Hamann, Heiko: On the Defi nition
of Self-organizing Systems: Relevance of
Positive/Negative Feedback and Fluctuations.
In: ANTS 2016, LNCS, Band 9882 , S. 298, 2016,
Springer


König, Jürgen; Mäcker, Alexander; Meyer
auf der Heide, Friedhelm; Riechers, Sören:
Scheduling with Interjob Communication on
Parallel Processors. In: Proceedings of the 10th
Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
(accepted), LNCS, Band 10043 , 16. – 18. Dez.
2016, Springer, Heidelberg


Kühne, Thomas; Hamann, Heiko; Arifulina,
Svetlana; Engels, Gregor: Patterns for Constructing
Mutation Operators: Limiting the Search
Space in a Software Engineering Application.
In: Proceedings of the 19th European Conference
on Genetic Programming (EuroGP 2016),
LNCS, volume 9594 , S. 278 – 293,
Mar 30 – Apr 1, 2016, Springer,


Li, Shouwei; Meyer auf der Heide, Friedhelm;
Podlipyan, Pavel: The impact of the Gabriel subgraph
of the visibility graph on the gathering
of mobile autonomous robots. In: Algorithms
for Sensor Systems, Proceedings of the 12th
International Symposium on Algorithms and
Experiments for Wireless Sensor Networks (ALGOSENSORS
2016) (accepted), LNCS, 25. – 26.
Aug. 2016, Springer-Verlag


Mäcker, Alexander; Malatyali, Manuel; Meyer
auf der Heide, Friedhelm; Riechers, Sören:
Cost-efficient Scheduling on Machines from the Cloud.
In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA) (accepted),
LNCS, Band 10043, 16. – 18. Dez. 2016, Springer,
Heidelberg


Mäcker, Alexander; Malatyali, Manuel; Meyer
auf der Heide, Friedhelm: On Competitive
Algorithms for Approximations of Top-k-Position
Monitoring of Distributed Streams. In: Proceedings
of the 30th International Parallel and
Distributed Processing Symposium (IPDPS), S.
700 – 709, Mai 2016, IEEE


Meyer auf der Heide, Friedhelm; Sanders,
Peter; Sitchinava, Nodari: Introduction to the
Special Issue on SPAA 2014. ACM Transactions
on Parallel Computing, 3: S. 1 – 2, Aug. 2016


Rybar, Milan; Hamann, Heiko: Inspiration-Triggered
Search: Towards Higher Complexities by
Mimicking Creative Processes. In: Proceedings
of the Genetic and Evolutionary Computation
Conference (GECCO 2016), S. 165 – 172, 2016


Valentini, Gabriele; Brambilla, Davide;
Hamann, Heiko; Dorigo, Marco: Collective
Perception of Environmental Features in a Robot
Swarm. In: 10th Int. Conf. on Swarm Intelligence,
ANTS 2016, LNCS, Band 9882 , S. 65 – 76,
2016, Springer


Valentini, Gabriele; Ferrante, Eliseo; Hamann,
Heiko; Dorigo, Marco: Collective Decision with
100 Kilobots: Speed vs Accuracy in Binary
Discrimination Problems. Journal of Autonomous
Agents and Multi-Agent Systems, 30: S.
553 – 580, 2016


Wahby, Mostafa; Hofstadler, Daniel; Heinrich,
Mary Katherine; Zahadat, Payam; Hamann,
Heiko: An Evolutionary Robotics Approach
to the Control of Plant Growth and Motion:
Modeling Plants and Crossing the Reality Gap.
In: Proc. of the 10th International Conference
on Self-Adaptive and Self-Organizing Systems
(accepted), 2016, IEEE


Promotionen

Max Drees
Existence and Properties of Pure Nash Equilibria
in Budget Games

We introduce the game-theoretical model of budget games and analyze the existence of pure Nash equilibria. In a budget game, players compete over resources with a limited budget. As his strategy, each player decides between afinite number of demand vectors. Each demand vector contains one non-negative demand forevery resource. Provided the total demand by all players on a single resource does not exceed its budget, the utility each player receives from that resource equals his demand. Otherwise, the budget is split proportionally to the demands. For any combination of player and resource, the corresponding demand is directly tied to the players strategy and can change during the best-response dynamic. Aftershowing that pure Nash equilibria generally do not exist in budget games, we consider several alternative concepts.

(1) Ordered budget games are a variation which emphasizes the order in which the players choose their strategies. They are exact potential games for which even the existence of super-strong pure Nash equilibriacan be guaranteed and strong pure Nashequilibria can be computed efficiently.

(2) In an alpha-approximate pure Nash equilibrium, nounilateral strategy change increases the utility of the corresponding player by more than some constant factor alpha. We give upper and lower bound on alpha such that approximate pureNash equilibria are guaranteed. In addition,we look at an approximate version of the best response dynamic which converges quickly and can also be used to compute a strategy profile which approximates the maximal social welfare.

(3) By restricting the structure of the strategy spaces, we restore pure Nash equilibria to budget games. We focus on singleton and matroid budget games. We also argue that computing the socially optimal solution is equivalent for both budget games and ordered budget games and NP-hard in both cases.

Andreas Cord-Landwehr
Selfish Network Creation – On Variants of Network
Creation Games

This thesis studies networks that are created by selfish agents. The focus is on the overall efficiency of the individual selfish actions of the network agents, who optimize an overlay network in a distributed way. The central measure for efficiency of the selfish acting is the socalled price of anarchy. This value describes the worst-case ratio of the overall cost of any stable network state, i. e., a network state in which no agent can unilaterally reduce her cost, and a socially optimal solution.

My thesis suggests and studies several specializations of the “network creation game” model by Fabrikant et al. (PODC 2003). Part one covers the impact of non-uniform communication interests, which is that not every agent is interested in communication with every other agent.

In Part two, I introduce quality-of-service decisions into the framework of network creation games by allowing agents to choose not only where to create an edge to but also of which quality and for which price.

Part three considers the infl uence of having only local network information available to the agents, specifi cally limiting their actions.

Finally, in Part four, I introduce a new model for studying the interaction between different network layers.


Weitere Funktionen

Prof. Meyer auf der Heide

  • Member of the “Hochschulrat” of the Paderborn University
  • Director of the Collaborative Research Center (SFB 901) “On-The-Fly Computing”
  • Member of the German Academy of Sciences “Leopoldina”
  • Member of the NRW Academy of Sciences, Humanities and the Arts
  • DFG Special Advisor (Vertrauensdozent) of the Paderborn University
  • Assistant Chairman of the Paderborn Institute for Scientific Computation (PaSCo)
  • Managing Editor of “Journal of Interconnection Networks (JOIN)”, World Scientific Publishing
  • Chairman of the Scientifi c Advisory Board of the Leibniz-Zentrum für Informatik, Schloss Dagstuhl
  • Member of the Evaluation Committee of the Bundeswettbewerb “Jugend Forscht”, Coordinator of the section on Computer Science and Mathematics
  • Member of the Milner Award Committee, The Royal Society
  • Member of the program committee of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016)
  • Member of the program committee of the workshop Parallele Algorithmen, Rechnerstrukturen und Systemsoftware (PARS 2016)
  • Vice Chairman of the organisation committee of the 17th International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2016)
  • Chairman of the organisation committee of the 10th International Heinz Nixdorf Symposium “On-the-Fly Computing”, 2016

Jun.-Prof. Hamann

  • Young fellow of the North Rhine-Westphalian Academy of Sciences, Humanities and the Arts
  • Associate editor of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2016
  • Co-organizer of the 2nd International Workshop “Methods for Self-Organizing Distributed Systems” (MeSoDiSy) 2016
  • Editorial board member of “Swarm Intelligence” (Springer), "Natural Computing" (Springer), “Frontiers in Robotics and AI” (Frontiers Media)
  • Member of the program committee of the International Conference on Artifi cial Life (Alife) 2016
  • Member of the program committee of the IEEE Congress on Evolutionary Computation (CEC) 2016
  • Member of the program committee of the Evolutionary Computation in Robotics (EvoROBOT, EvoStar) 2016
  • Member of the program committee of the Genetic and Evolutionary Computation Conference (GECCO) 2016
  • Member of the program committee of the Towards Autonomous Robotics Systems (TAROS) 2016
  • Member of the program committee of the International Conference on Bio-inspired Information and Communications Technologies (BICT) 2016
  • Member of the program committee of the Guided Self-Organization Workshop (GSO 2016)
  • Member of the program committee of the Int. Workshop on Machine Learning, Optimization and Big Data (MOD) 2016
  • Member of the program committee of the International Symposium on Distributed Autonomous Robotics Systems (DARS) 2016

Jun.-Prof. Skopalik

  • Member of the program committee of the 9th International Symposium, on Algorithmic Game Theory (SAGT)
  • Member of the program committee of the 25th International Joint Conference on Artificial Intelligence (IJCAI)

Graduiertenprogramme

  • DFG Research Training Centre „Research Training Group Automatisms – Emerging structures in information technology, media, and culture“

Aktuelle Forschungsprojekte

DFG Collaborative Research Center 901
The objective of CRC 901 – On-The-Fly Computing (OTF Computing) – is to develop techniques and processes for automatic on-the-fly configuration and provision of individual IT services out of base services that are available on world-wide markets. In addition to the configuration by special OTF service providers and the provision by what are called OTF Compute Centers, this involves developing methods for quality assurance and the protection of participating clients and providers, methods for the target-oriented further development of markets, and methods to support the interaction of the participants in dynamically changing markets. Friedhelm Meyer auf der Heide is coordinator of this collaborative research centre scince 2011.

Laufzeit: 2011 – 2019

DFG Collaborative Research Centre 901 “On-The-Fly Computing”, subproject A1 “Capabilities and limitations of local strategies in dynamic networks ”
This subproject started in 2011 with the objective to explore the capabilities and limits of local methods for control and optimization of big dynamic networks. Our focus lies on overlay networks, which allow the interaction between actors of the OTF market (the clients) and service providers to support services and provide infrastructure. “Local” in this context means that the control and optimization is not performed by a central instance but distributed by the actors, based on their local information. In the first funding period, we focused our research on developing and analyzing algorithms, which e. g. allow the effi cient search for services, the distributed organization of actors in groups, or to adapt the positioning of resources in an overlay to better serve the requirements of the clients. This subproject is coordinated by Friedhelm Meyer auf der Heide and Christian Scheideler.

Laufzeit: 2015 – 2019


DFG Collaborative Research Centre 901 “On-The-Fly Computing”, subproject A3 “The market for services: Incentives, algorithms,
implementation”

In subproject A3 we model and analyze the market for composed IT-services. The main challenges in the economic considerations are the composition aspect, automatization of transactions, and the dynamics of composed services. For the analysis we use and develop methods from the fi elds of non-cooperative, cooperative, and algorithmic game theory. Furthermore, the study of bounded rational behavior rests on methods from evolutionary game theory, behavioral economics and the theory of learning. This subproject is coordinated by Claus-Jochen Haake, Burkhard Hehenkamp, and Alexander Skopalik.

Laufzeit: 2015 – 2019


DFG Collaborative Research Centre 901 “On-The-Fly Computing”, subproject B1 “Parameterized Service Specifications”
In subproject B1 we deal with requirements specifications of software services. They are important for a successful search, composition, and analysis of services. In particular, we investigate means of (semi-)automatically synthesizing requirements specifications based
on examples, which were prepared by a domain expert. This subproject is coordinated by Gregor Engels, Michaela Geierhos, and Heiko Hamann.

Laufzeit: 2015 – 2019


DFG Collaborative Research Centre 901 “On-The-Fly Computing”, subproject C4 “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers”
In this subproject we are concerned with efficiently utilizing resources within a highly configurable compute center. First, we build on the scheduling results that were achieved in the first phase of subproject C2. Secondly, we incorporate the results of the complete subproject A2, especially the work on software-defined networking (SDN). This subproject emphasizes the collaboration between theoretical and practical computer science on closely related issues. We will examine these issues by using different methods (theoretical analysis, simulation, emulation and prototyping) on different levels of abstraction. OTF Compute Centers are particularly characterized by their ability to profi tably exploit the properties of OTF services. They are therefore heterogeneous, in that they have various types of calculation units and persistent storage units. They also have one or more networks that connect these resources with each other. OTF services can be provided by a single or several interacting geographically or organizationally distributed
OTF Compute Centers and, if necessary, they are supplemented by temporarily rented resources from the cloud. We will therefore develop and analyze scheduling processes, that consider the characteristics of OTF services on the one hand, and OTF Compute Centers on the other. This subproject is coordinated by Holger Karl and Friedhelm Meyer auf der Heide.

Laufzeit: 2015 – 2019


EU project (IP) Foundational Research on MULTIlevel comPLEX networks and systems (MULTIPLEX)
MULTIPLEX is a large-scale integrating project (IP) with 17 participating research institutes from all over Europe, funded by the European Commission. It addresses the objective “Dynamics of Multi-Level Complex Systems” of the FP7-ICT work program. The project started in November 2012 and will last for 48 month. The goal of the project is to understand how multilevel complex systems evolve, and how they can be controlled and optimized. Indeed, multilevel dependencies may amplify cascading failures that might result in a sudden collapse of the entire system. Recent large-scale blackouts resulting from cascades in the power-grid coupled to the control communication system witness this point very clearly. A better understanding of multi-level systems is essential for future ICTs and for improving life quality and security in an increasingly interconnected and interdependent world. In this respect, complex networks science is particularly suitable for the many challenges that we face today, from critical infrastructures and communication systems to techno-social and socio-economic networks. In Paderborn, Friedhelm Meyer auf der Heide, Christian Scheideler and Alexander Skopalik contribute to this project.

Laufzeit: 2012 – 2016


DFG project: Distributed Data Streams in Dynamic Environments (DISDAS) in the DFG-Priority Programme 1736 Algorithms for Big Data
In this project we lay the foundations for the design and analysis of distributed algorithm that continuously compute aggregated information of streams of data which are observed by a multitude of devices. These devices may be mobile, i. e. capable of moving in the plane or in space, and contain both (wireless) communication devices and sensors for observing their environment. The major challenge is to cope with the huge amount of data generated by the devices. Typically, the data streams are too big and arrive too fast to be completely stored, or sent to a central server through a network, or processed in real time. Thus we have to find ways to extract useful information from the streams using restricted resources like memory, communication volume and computation time. In this project, we are developing continuous algorithms in distributed environments, taking both the dynamics of the devices and of the observed events into account. This reflects the scenario of moving people with smartphones who observe their environment. Friedhelm Meyer auf der Heide coordinates this project.

Laufzeit: 2014 – 2017


“it's OWL” Cross-sectional project Human-Machine Interaction (BMBF)
The objective of the subproject is to develop a systematics for the application of VR based design review in the development processes of small and medium-sized enterprises. Here we develop an interactive walkthrough system (PADrend: Platform for Algorithm Development and Rendering) for the rendering of complex CAD data. New interface design and interaction technology provide an effi cient usability and configuration of the system. This project is funded by the Federal Ministry of Education and Research.

Laufzeit: 2012 – 2017


EU H2020 FET project “flora robotica: Societies of Symbiotic Robot-Plant Bio-Hybrids as Social Architectural Artifacts”
The objective is to develop tightly coupled, symbiotic relationships between robots and natural plants, in particular we investigate the potential in plant-robot societies to create architectural artifacts and living spaces. Heiko Hamann is coordinator of this European project.

Laufzeit: 2015 – 2019


Wissenschaftliche Kooperationen

  • University of Liverpool, Martin Gairing, Ph.D., United Kingdom
  • University of Maastricht, Tobias Harks, Ph.D., The Netherlands
  • Universität Wien, Prof. Dr. Monika Henzinger, Austria
  • Sapienza University of Rome, Prof. Stefano Leonardi, Ph.D., Italy
  • IMT Alti Studi Lucca, Prof. Guido Caldarelli Ph.D., Italy
  • University of Patras, CTI, Greece, and University of Liverpool, United Kingdom, Prof. Paul Spirakis
  • Universite Libre de Bruxelles, Prof. Marco Dorigo, Ph.D., Belgium
  • Otto von Guericke Universität Magdeburg, Prof. Dr. Sanaz Mostaghim, Germany