Decentralized Coalition Formation with Agent-based Combinatorial Heuristics

A steadily growing pervasion of the energy distribution grid with communication technology is widely seen as an enabler for new computational coordination techniques for renewable, distributed generation as well as for bundling with controllable consumers. Smart markets will foster a decentralized grid management. One important task as prerequisite to decentralized management is the ability to group together in order to jointly gain enough suitable flexibility and capacity to assume responsibility for a specific control task in the grid. In self-organized smart grid scenarios, grouping or coalition formation has to be achieved in a decentralized and situation aware way based on individual capabilities. We present a fully decentralized coalition formation approach based on an established agent-based heuristics for predictive scheduling with the additional advantage of keeping all information about local decision base and local operational constraints private. Two closely interlocked optimization processes orchestrate an overall procedure that adapts a coalition structure to best suit a given set of energy products. The approach is evaluated in several simulation scenarios with different type of established models for integrating distributed energy resources and is also extended to the induced use case of surplus distribution using basically the same algorithm

Heuristic Methods for Optimization - Cornell University

Heuristic optimization algorithms are artificial intelligence search methods that can be used to find the optimal decisions for designing or managing a wide range of complex systems. This course describes a variety of (meta) heuristic search methods including simulated annealing, tabu search, genetic algorithms, genetic programming, dynamically dimensioned search, and multiobjective methods. Algorithms will be used to find values of discrete and/or continuous variables that optimize system performance or improve system reliability. Students can select application projects from a range of application areas. The advantages and disadvantages of heuristic search methods for both serial and parallel computation are discussed in comparison to other optimization algorithms. Course taught at Cornell University

The role of Artificial Intelligence and distributed computing in IoT applications

[EN]The exchange of ideas between scientists and technicians, from both academic and business areas, is essential in order to ease the development of systems which can meet the demands of today’s society. Technology transfer in this field is still a challenge and, for that reason, this type of contributions are notably considered in this compilation. This book brings in discussions and publications concerning the development of innovative techniques of IoT complex problems. The technical program focuses both on high quality and diversity, with contributions in well-established and evolving areas of research. Specifically, 10 chapters were submitted to this book. The editors particularly encouraged and welcomed contributions on AI and distributed computing in IoT applications.Financed by regional government of Castilla y León and FEDER funds

CRH*: A Deadlock Free Framework for Scalable Prioritised Path Planning in Multi-Robot Systems

Multi-robot system is an ever growing tool which is able to be applied to a wide range of industries to improve productivity and robustness, especially when tasks are distributed in space, time and functionality. Recent works have shown the benefits of multi-robot systems in fields such as warehouse automation, entertainment and agriculture. The work presented in this paper tackles the deadlock problem in multi-robot navigation, in which robots within a common work-space, are caught in situations where they are unable to navigate to their targets, being blocked by one another. This problem can be mitigated by efficient multi-robot path planning. Our work focused around the development of a scalable rescheduling algorithm named Conflict Resolution Heuristic A* (CRH*) for decoupled prioritised planning. Extensive experimental evaluation of CRH* was carried out in discrete event simulations of a fleet of autonomous agricultural robots. The results from these experiments proved that the algorithm was both scalable and deadlock-free. Additionally, novel customisation options were included to test further optimisations in system performance. Continuous Assignment and Dynamic Scoring showed to reduce the make-span of the routing whilst Combinatorial Heuristics showed to reduce the impact of outliers on priority orderings

Windy Rural Collaborative Postmen Problem using ROS as Multi-agent System Architecture

[EN]In the last decades the urban areas have grown and as a result the transportation has become an important problem. We are exploring a potential solution for the last mile delivery problem in urban areas in a similar way that internet solves the delivery of information proble

A Recommendation-based Proposal for Improving Energy Efficiency in Housing

[EN]75% of buildings in the EU are not designed according to any energy efficiency code and around 45%of the world’s energy is used in the residential sector. This is why one of Europe’s biggest energy challenges is to include consumers at the heart of the energy system. The aim of this work is to develop a solution to a problem of such magnitude: to create a system of personalised recommendations to each consumer that contributes to improving the energy efficiency of their home. The data will be obtained from sensorized homes in Salamanca. Some examples of possible recommendations are reducing the temperature of the thermostat, change the time at which the house is ventilated and raise the blinds at a certain time. The system developed is capable of providing these recommendations correctly an-d efficiently