This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:ia [2011/03/23 16:51] mdorigo 1 project added |
teaching:mfe:ia [2015/04/11 17:47] stuetzle [Stochastic Local Search heuristics for solving NP-complete puzzles.] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2011-2012 : Intelligence Artificielle ====== | + | ====== MFE 2013-2014 : Intelligence Artificielle ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 7: | Line 7: | ||
| Ces sujets sont prêt à être encadrer, mais il va s'en dire qu'ils ne sont pas uniques. Les étudiants sont vivement encouragés à prendre contact avec Hugues Bersini (bersini AT ulb.ac.be) ou Marco Dorigo (mdorigo AT ulb.ac.be) afin de discuter de l'une ou l'autre initiative inspirée pouvant faire l'objet dun autre sujet de MFE ou de préciser le cadres, le contenu et les attentes relatives au sujets présentés. | Ces sujets sont prêt à être encadrer, mais il va s'en dire qu'ils ne sont pas uniques. Les étudiants sont vivement encouragés à prendre contact avec Hugues Bersini (bersini AT ulb.ac.be) ou Marco Dorigo (mdorigo AT ulb.ac.be) afin de discuter de l'une ou l'autre initiative inspirée pouvant faire l'objet dun autre sujet de MFE ou de préciser le cadres, le contenu et les attentes relatives au sujets présentés. | ||
| - | ===== Exploration, exploitation and evaluation of the .Net Linq library for the problem of object permanence. ===== | ||
| - | The MFE will consist in a deep exploration of the | + | ===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== |
| - | very new microsoft Linq library which aims at resolving | + | |
| - | the classical problem of mapping between the OO and the relational | + | |
| - | and the XML world. The different additions of .Net necessary | + | |
| - | to the implementation of this library will be studied. The | + | |
| - | library will also be tested in terms of robustness and performance | + | |
| - | as compared with the previous existing solutions coming from other technological platforms (Java, PHP, ...). This memoire will be a follow up of a previous memoire. | + | |
| + | Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. Les données sont actuellement stockées dans dans une base de données SPSS. Le mémoire consistera pour l'essentiel au traitement de ces données par des approches "Machine Learning" et "Data Mining" dans une perspective de Quality Management. | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| Line 22: | Line 16: | ||
| ===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== | ===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== | ||
| - | Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. | + | Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. Les données sont actuellement stockées dans dans une base de données SPSS. Le mémoire consistera pour l'essentiel au traitement de ces données par des approches "Machine Learning" et "Data Mining" dans une perspective de Quality Management. |
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | ===== Contribution au développement de la plateforme Big Data d'IRIDIA ===== | ||
| + | Dans de nombreux projets d'enseignement et d'industrie dans lesquels IRIDIA se trouvent impliqués, des demandes pressantes nous sont faites de formation et d'utilisation des outils Big Data (Map-Reduce, Cloudera, Hue, Hive, Pig, Elastic Search, HBase). Nous répondons tant bien que mal à ces demandes et tentons d'équiper notre cluster avec les logiciels demandés. Le mémoire consisterait en une étude comparative de l'existant en terme surtout logiciel et la mise en place d'un cours mettant en évidence les avantages de l'une ou l'autre solution en ce compris par rapport à des solutions plus conventionnels de type BD relationnelle. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Contribution à l'amélioration de la plateforme génomique In Silico DB ===== | ||
| + | |||
| + | Une nouvelle spin-off a vu le jour depuis un an à IRIDIA: In Silico DB (https://insilicodb.org/) mettant à disposition sous une forme aisément exploitable des centaines de milliers d'échantillons de données génomiques permettant un meilleur diagnostic des maladies d'origine génétique et une meilleure compréhension de la biologie moléculaire. L'équipe qui s'en occupe a un besoin pressant de développeurs informatiques permettant d'en améliorer l'interface. Des connaissances en programmation Web sont souhaitées. La migration du système de stockage sur un serveur Big Data est aussi un des objectifs actuellement poursuivis par l'équipe en place et permettra au mémorant de se familiariser avec ces nouvelles technologies. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | |||
| + | ===== Etude pratique et expérimentale du langage de programmation F# ===== | ||
| + | |||
| + | Depuis quelques années, Microsoft met en avant un nouveau langage de programmation F# créé dans le sillage des langages dits déclaratifs ou fonctionnels. Il semblerait que ce langage soit idéal pour le traitement des données. Le MFE consistera en une étude expérimentale de ce langage et un comparatif avec les langages de programmation aujourd'hui les plus usités. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Etude de l'algorithme du Deep Learning ===== | ||
| + | |||
| + | Les réseaux de neurones multicouches sont redevenus très à la mode depuis que Google les utilise massivement pour le traitement automatique d'images et de vidéos. Nous avons à IRIDIA étudié et réalisé plusieurs algorithmes d'apprentissage de ces réseaux multicouches. Le mémoire consistera en une comparaison des algorithmes de deep learning tels ceux utilisés chez Google et les alternatives que nous proposons ici à IRIDIA depuis plusieurs années. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| ===== Etude et réalisation orientée objet d'une cellule minimale ===== | ===== Etude et réalisation orientée objet d'une cellule minimale ===== | ||
| Line 34: | Line 51: | ||
| élémentaire et sa membrane. L'idée est de réaliser le logiciel minimal capable de simuler un organisme vivant. Cette cellule devra être capable | élémentaire et sa membrane. L'idée est de réaliser le logiciel minimal capable de simuler un organisme vivant. Cette cellule devra être capable | ||
| de croître et de spontanément se dupliquer. Il fera suite | de croître et de spontanément se dupliquer. Il fera suite | ||
| - | à une succession de MFE déjà réalisés ces dernières années. | + | à une succession de MFE déjà réalisés ces dernières années. Parmi les amélirations possibles sont en cours la parallélisation du programme suivant une technologie Big Data ou le recours aux processeurs GPU. |
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | ===== Réorganisation sous forme OO et UML d’un code de simulation climatique ===== | ||
| + | Ce mémoire se déroulera en collaboration avec le professeur Jean-Pascal van Ypersele de l’UCL, vice président du GIEC, groupe de recherche sur l’évolution climatique. La plupart des codes de simulation climatique sont rédigés en Fortran en exploitant peu les principes de la programmation OO. Ce mémoire consistera en la sélection d’un logiciel de simulation climatique assez simple, plutôt à vocation didactique, et sa réécriture sous forme OO, en faisant un recours intensif aux diagrammes UML et aux Design Patterns. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Réorganisation sous forme OO et UML d’un code de contagion systémique d'un réseau de crédits interbancaire ===== | ||
| + | |||
| + | La crise financière actuelle a permis de mettre en lumière les risques de contagion systémique liés à la faillite de certaines banques. En effet, la plupart du temps, les banques forment entre elles un réseau de crédit interbancaire qui, à la fois les rend plus solides, mais aussi plus vulnérables à la défection de l’une ou l’autre. De nombreux logiciels ont été écrits afin d’étudier plus en détail ce risque. Le mémoire consistera en la sélection d’un de ces logiciels déjà clairement identifiés et sa réécriture sous forme OO, en faisant un recours intensif aux diagrammes UML et aux Design Patterns. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| ===== Data/text mining - Traitement automatique de documents sur base de leur contenu ===== | ===== Data/text mining - Traitement automatique de documents sur base de leur contenu ===== | ||
| Line 66: | Line 94: | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | ===== Etude de la topologie de réseaux d'acteurs extraits à partir de romans célèbres ===== | ||
| + | |||
| + | De plus en plus de scientifiques sont convaincus qu’une même topologie de réseaux (c'est-à-dire la manière dont les nœuds en sont connectés) se retrouve dans de nombreux réseaux, pourtant extraits de réalités très diverses (Web, Internet, réseaux sociaux, biologiques, épidémiques). Cette topologie leur conférerait des propriétés intéressantes comme une plus grande robustesse ou une communication réduite entre les nœuds. Il est possible de construire des réseaux lexicaux à partir d’un document quelconque, par exemple, en connectant deux mots qui apparaissent dans une même phrase. Le MFE consistera en un développement logiciel ayant pour but la réalisation automatique d'un réseau de personnages de romans (Harry Potter, les Misérables et autres) à partir des dialogues présents dans ces romans. Les liens seront également pondérés comme résultat d'une analyse de sentiments faite à partir de ces mêmes dialogues. On procédera ensuite à l’étude automatisée de leur topologie : distance inter-nœuds, degré de clustering, etc … | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| ===== Expérimentation des designs patterns pour la modélisation de systèmes biologiques complexes ===== | ===== Expérimentation des designs patterns pour la modélisation de systèmes biologiques complexes ===== | ||
| - | Tout bon informaticien se doit aujourd’hui de maîtriser ces recettes de conception OO que sont les designs patterns. Au-delà des langages de programmation ou de modélisation (UML), ils sont devenus le sujet d’étude et de développement le plus prisé de la communauté informatique. Leur maîtrise permet à ces mêmes informaticiens d’attaquer la simulation de procédés complexes avec plus de facilité. Le MFE consistera en la mise en pratique de ces designs patterns pour la modélisation de systèmes biologiques complexes comme le système immunitaire ou les mécanismes de régulations génétiques. Le travail devrait déboucher sur une adaptation de ces mêmes designs patterns au monde et aux problèmes de la biologie. | + | Tout bon informaticien se doit aujourd’hui de maîtriser ces recettes de conception OO que sont les designs patterns. Au-delà des langages de programmation ou de modélisation (UML), ils sont devenus le sujet d’étude et de développement le plus prisé de la communauté informatique. Leur maîtrise permet à ces mêmes informaticiens d’attaquer la simulation de procédés complexes avec plus de facilité. Le MFE consistera en la mise en pratique de ces designs patterns pour la modélisation de systèmes biologiques complexes comme le système immunitaire ou les mécanismes de régulations génétiques. Le travail devrait déboucher sur une adaptation de ces mêmes designs patterns au monde et aux problèmes de la biologie. Ce mémoire se fera en collaboration avec l'institut de recherche de Microsoft à Cambridge qui a déjà supervisé les mémorants précédents. |
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| Line 87: | Line 120: | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| Line 94: | Line 128: | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Mise en place de solutions Big Data et Elastic Search pour les réseaux bibliométriques ===== | ||
| + | |||
| + | Les publications scientifiques doivent se citer entres elles. Elles constituent donc un immense réseau de citations. Nous étudions à IRIDIA la nature de ce réseau et l'impact que peut avoit une publication scientifique en suivant dans le temps le nombre de nouvelles publications qui citent cette dernière. Comme ces réseaux sont de taille gigantesque (des millions de publications), des solutions technologiques harwarde et software de type Big Data et Elastic Search sont mises en place et expérimentées ici à IRIDIA. Le mémoire consistera en un développement et une expérimentation des ces possibles solutions. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | |||
| ===== Mise au point d’un langage de modélisation de systèmes biologiques inspiré des diagrammes de classe et d'état/transition UML ===== | ===== Mise au point d’un langage de modélisation de systèmes biologiques inspiré des diagrammes de classe et d'état/transition UML ===== | ||
| Line 99: | Line 141: | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| ===== Comparaison via la simulation informatique d'une économie de marché de nature concurrentielle et une autre plus redistributive===== | ===== Comparaison via la simulation informatique d'une économie de marché de nature concurrentielle et une autre plus redistributive===== | ||
| Les économistes nous assènent à l'envi que l'économie se doit d'être compétitive et parfaitement concurrentielle. Est-ce si vrai ? L'économie de marché ne peut-elle exister que sur un mode concurrentiel pour assurer au mieux le bonheur du plus grand nombre d'agents économiques ? Nous adresserons cette question par l'entremise de modèles économiques multi-agents mettant en présence des producteurs,acheteurs, consommateurs et vendeurs, et les faisant se comporter d'abord sur un monde compétitif (économie de marché de type enchère) et ensuite aléatoire. Nous étudierons la manière dont le bien-être cumulé par les agents consommateur est distribué parmi eux. Ce mémoire fait suite à un mémoire réalisé par un étudiant de Solvay l'année passée et donc il pourra repartir d'un logiciel existant. | Les économistes nous assènent à l'envi que l'économie se doit d'être compétitive et parfaitement concurrentielle. Est-ce si vrai ? L'économie de marché ne peut-elle exister que sur un mode concurrentiel pour assurer au mieux le bonheur du plus grand nombre d'agents économiques ? Nous adresserons cette question par l'entremise de modèles économiques multi-agents mettant en présence des producteurs,acheteurs, consommateurs et vendeurs, et les faisant se comporter d'abord sur un monde compétitif (économie de marché de type enchère) et ensuite aléatoire. Nous étudierons la manière dont le bien-être cumulé par les agents consommateur est distribué parmi eux. Ce mémoire fait suite à un mémoire réalisé par un étudiant de Solvay l'année passée et donc il pourra repartir d'un logiciel existant. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Etude des instabilités dynamiques des marchés boursiers ===== | ||
| + | |||
| + | Malgré la théorie économique voyant dans le marché un processus auto-régulé et stable, le fonctionnement de la bourse et de la finance se caractérisent par d'incessantes instabilités dynamiques: bulles spéculatives et autres... Ce MFE aura pour objet une modélisation d'un marché boursier très simplifié dans lesquels seront pris en compte les mimétismes des "traders" souvent responsables de phénomènes de feedbacks positifs menant à ces instabilités. | ||
| * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| Line 127: | Line 176: | ||
| * Contacts : | * Contacts : | ||
| * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | + | |
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | + | |
| Line 142: | Line 189: | ||
| * Contacts : | * Contacts : | ||
| * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | + | |
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | + | |
| - | ===== Graphical Tools for analysing Multi-Objective Data. ===== | ||
| - | In multi-objective problems, not only one objective function must be minimised but several, often conflicting, objectives must be taken into account. The result is often a set of solutions modelling the trade-off between the objectives of the problem. | + | ===== Design of a graphical interface for an automatic configuration tool. ===== |
| - | The goal of this project is to develop graphical tools to interactively examine and compare the results of algorithms for multi-objective problems. | + | Optimization algorithms have a number of parameters that strongly |
| - | + | affect their efficiency. For many years the setting of these | |
| - | Required skills: The candidate should be well acquainted with programming in object oriented languages. | + | parameters was done by hand; a tedious task that requires a lot of |
| + | human involvement. Nowadays, some tools are available to automatize this task by considering the setting of the parameters as a "meta"-optimization problem. One of these tools for automatic configuration (the irace package: http://iridia.ulb.ac.be/irace) has been developed at IRIDIA, and has been already applied successfully to many algorithms. The goal of this project is to design a graphical interface on top of the existing software, to help the user to set-up his particular tuning problem, to visualize information about the tuning process while it is on-going and when it has completed, and to integrate statistical tools for the analysis of the tuner results. | ||
| + | The student will have to implement a Graphical front-end on top of the | ||
| + | existing software implemented in R, using a cross-platform library | ||
| + | such as Qt (http://qtinterfaces.r-forge.r-project.org/). Some | ||
| + | additions to the original software may be required, and the student | ||
| + | will have to work in collaboration with the team of developers of | ||
| + | irace at IRIDIA. | ||
| * Contacts : | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] |
| + | * [[http://iridia.ulb.ac.be/~lperez|Leslie Perez (IRIDIA)]] | ||
| - | ===== Stochastic local search algorithms for weighted maximum clique problems. ====== | ||
| - | The Maximum Clique Problem is an NP-hard combinatorial optimisation problem that asks to find the biggest completely | ||
| - | connected component of a graph. It has relevant applications in information retrieval, computer vision, social network | ||
| - | analysis, computational biochemistry, bioinformatics and genomics. | ||
| - | Among the possible generalisations of the problem there is the Vertex Weighted and Edge Weighted Maximum Clique which asks to find the clique of maximum weight. Being generalisations they are also NP-hard. The goal of the project is to devise heuristic algorithms or adapt existing algorithms of the Maximum Clique for weighted version. | + | ===== Feature Extraction and Automatic Algorithm Selection. ====== |
| - | Required skills: good knowledge of C or C++ programming. | + | The performance of (Stochastic Local Search) algorithms for a given problem depends on the algorithm design and on the setting of the algorithm's parameter. Given a heterogeneous set of instances for a given problem a good algorithm design (or parameter configuration) for one instance is not necessary the best design for all instances. On the contrary a tuning of an algorithm on a specific family of similar instances may affect negatively its performance on other families of instances. |
| + | |||
| + | The thesis will focus on devising automatic methods for extracting features from the instances, select the relevant features, and learning (in the framework of multi-class classification) the | ||
| + | relationship, if there is one, between the instances features and the best algorithm for the instance. The results will be instrumental for algorithm selection or the creation of portfolios of complementary algorithms suitable for large sets of diverse instances for a given problem. | ||
| + | |||
| + | |||
| + | Required skills: good knowledge of C or C++ programming and of a scripting language (e.g., python); good knowledge of machine learning methods would also be helpful. | ||
| * Contacts : | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | + | |
| - | ===== Stochastic Local Search heuristics for solving NP-complete puzzles. ====== | + | ===== Formal verification of a swarm robotics behavior through statistical model checking ===== |
| - | This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems. | + | The goal of this thesis is to apply statistical model |
| - | Example puzzles are: <a href="http://en.wikipedia.org/wiki/Light_Up">Light Up</a>, <a href="http://en.wikipedia.org/wiki/Mastermind_(board_game)">Mastermind</a>, <a href="http://en.wikipedia.org/wiki/Minesweeper_(video_game)">Minesweeper</a>, etc. | + | checking to formally verify properties of a collective behavior of a |
| + | robot swarm. Verifying that a system behaves as desired in all | ||
| + | possible situations is necessary when autonomous robots are involved. | ||
| + | This is particularly true in swarm robotics systems, where the | ||
| + | interactions of large number of individuals can result in behaviors | ||
| + | difficult to predict. Model checking is a common technique to formally | ||
| + | prove properties of a system. However, its results are limited to | ||
| + | small systems, because medium-sized or large systems are | ||
| + | computationally impossible to analyze. | ||
| - | The student will learn how to design and implement a Stochastic Local Search algorithm to solve NP-complete puzzles. The student will also learn how to analyse the performaces of the algorithm and perform statistically sound comparisons with the other algorithms available in literature. | + | This thesis is will explore the application of a novel model checking technique, called statistical model checking, to formally verify a swarm robotics system. A collective behavior will be firstly implemented in |
| + | simulation and then analyzed through statistical model checking. | ||
| - | Required skills: good knowledge of C or C++ programming. | + | Required skills: the candidates should be acquainted with C/C++ |
| + | programming and have a working knowledge of the English language. | ||
| + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA) | ||
| - | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | ||
| + | ===== ROBO-POINTER -- A New Device for Human-Robot Interaction ===== | ||
| - | /* | + | In this project, the student will design and implement a novel human-robots interaction system. |
| + | The human uses a special laser pointer (called robo-pointer), and by simply pointing to a specific robot he can select it, check its status on a dedicated monitor and send to the robot instructions. | ||
| - | ===== Swarm robotics using the e-puck platform ===== | + | Now, our arena is equipped with a multi-camera tracking system that allows to detect the 3D position of the robots. |
| + | The student will design a radio sensor network to detect the 3D position of the robo-pointer. | ||
| + | The two pieces of information will be combined to trigger the selection of the pointed robot. | ||
| + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Andreagiovanni Reina (IRIDIA) | ||
| - | The e-Puck is a robot developed by the Ecole Polytechnique Fédérale de Lausanne, Switzerland. It is equipped with a dsPIC micro-controller, it has an RS232 and a bluetooth interface, 8 infrared proximity sensors, a 3 axis accelerometer, 3 microphones and a speaker, a color camera with a resolution of 640x480 pixels and 8 red leds for displaying patterns. | ||
| - | In the last years, a number of projects carried out at IRIDIA developed a set of tools and a fully functional platform to work efficiently with e-puck robots. In particular, a precise description of the properties of the robots, software libraries and an accurate simulator are now available. A number of controllers were developed and successfully tested on the robots. | + | ===== Let a robot swarm get around home! ===== |
| - | The goal of the project ``Swarm robotics using the e-puck platform'' is to design and carry out experiments of swarm robotics that are typically bio-inspired and involve several robots. Possible experiments include p2p communication networks for path finding, flocking for exploration, transport of objects and aggregation of robots. 12 e-Puck will be available for the project. | + | Robot swarms have very limited knowledge of their environment and therefore, moving around a complex environment (i.e., room with obstacles, building, ...) is a complex task. The idea of this project is to allow an overhead multi-camera tracking system -- that has a complete vision and knowledge of the environment -- to interact with a robot swarm in order to help the swarm move to a specific goal in the environment (for instance, moving from the kitchen to a bedroom of a house). |
| + | The multi-camera tracking system's software is already developed. The student will be supposed to (i) develop a GUI that allows a human operator to specify a goal in the environment, (ii) design and implement a communication protocol (between the tracking system and the robot swarm) that guarantees efficiency and scalability and finally, (iii) test the interaction system in a simulated environment. | ||
| - | The project is tightly connected to the research in swarm robotics carried out at IRIDIA and in particular to the EU funded //Swarmanoid// project, the aim of which is to study new approaches to the design and implementation of self-organizing and self-assembling artifacts. See [[http://www.swarmanoid.org]] for more details. | + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Gaëtan Podevijn, and Andreagiovanni Reina (IRIDIA) |
| - | Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| - | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | ||
| - | |||
| - | */ | ||
| - | ===== Experiments with the e-puck robot and the IRIDIA TAM ===== | ||
| - | At IRIDIA, we are conducting many experiments with the e-puck | + | ===== Collective Decision Making with Heterogeneous Agents ===== |
| - | robot and a task abstraction device, the IRIDIA TAM. The topic of the | + | |
| - | master thesis would be integrate the TAM with the e-puck robot and our | + | |
| - | simulation environment, ARGoS. The final goal is to have the TAM tested | + | |
| - | in real-robot experiments. | + | |
| - | The subject is practical and requires a dedicated student that is able | + | Swarm robotics is an interesting approach to the coordination of hundreds of robots as it promotes the realization of systems which are scalable, robust and flexible. |
| - | to program in C++. A possible candidate should be willing to work with | + | The master thesis will study how to provide a swarm system with the cognitive capability of collective decision making. |
| - | hardware and real robots. Additionally, the candidate must be very | + | Each agent has partial knowledge of the available alternatives and of their quality estimate, however the swarm, as a whole, is able to decide for the best option. Recently, numerous works have studied strategies and algorithms to implement this process in distributed systems (often taking inspiration from biology, e.g., bees or cockroaches behaviour). One of the common characteristic of these works is that all the agents of the swarm has the same behaviour. In the Master Thesis project, the student will study how heterogeneity influences the global outcome. We will consider heterogeneity both in the individual behaviour (for instance, robots can estimate different option characteristics) and in the interaction network. |
| - | motivated and creative. The working language is English. | + | |
| - | * Contacts: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Arne Brutschy, Giovanni Pini (IRIDIA) | + | In practice, the student is supposed to (i) model the collective decision making problem |
| + | (ii) design and implement multi-agents simulations, and (iii) analyse and discuss the obtained | ||
| + | results. Depending on the student skills and preferences, the work can focus more on theoretical | ||
| + | aspects, thus favouring the modelling and analysis of the problem, or can be more practical, | ||
| + | thus centring the thesis on the multi-agent implementation part. Possibly, a more practical | ||
| + | thesis could result (depending on the student skills) in the implementation of a real world | ||
| + | demonstrator with a swarm of up to 100 robots. | ||
| - | ===== Collaboration between flying robots and ground-based robots ===== | + | * Contacts : [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] and Andreagiovanni Reina (IRIDIA) |
| - | Current research in self-assembling robots mainly focuses on systems composed of identical (i.e., homogeneous) robots. In this thesis, however, we consider a system composed of robots with varying capabilities and different sensors. In particular, we consider a heterogeneous self-assembling system composed of both ground-based robots and flying robots. The ground-based robots can respond to various task contingencies by autonomously connecting to each other and forming collective structures. The flying robots can use their large field of view (from their elevated positions) to assist the ground-based robots in their tasks. | ||
| - | In this thesis, the student will focus on the flying robots in the system. The student will explore how the flying robots can i) run internal simulations on possible connections between the ground-based robots to determine the response structure to a task and ii) apply machine learning techniques to let the flying robot use previous, successful experiences to learn about tasks and their possible response structures. The results of the study can be tested on real flying and ground-based robots. | + | ===== Online Framework to Compose Robotic Solutions ===== |
| - | Concrete ideas will be developed together with the student. A candidate student must be very motivated, independent, have a good knowledge of machine learning techniques, and have a good grasp of C++. The working language is English. | + | The design of swarm robotics systems is a challenging task due to difficulties to predict and model swarm systems. |
| + | The most common approach is a trial-and-error process where the developer tries solutions, tests them in simulation and corrects the code to eventually achieve the desired global outcome. | ||
| - | * Contacts: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Nithin Mathews (IRIDIA) | + | The project aims to ease this design process: the developer have access to the code of already solved problems (called code-modules), and he can graphically combine the code-modules through a graphical interface to create his own solution. |
| - | ===== Recruitment strategies for collective decision making in swarm robotics ===== | + | The student is supposed to design this novel online framework that offers two main functionalities: (1) to compose new solutions combining the existing code-models to solve new open problems, and (2) to code new code-modules and submit them to the online system. |
| - | Studies of ants and bees have led to different models of collective | + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Andreagiovanni Reina, and Gianpiero Francesca (IRIDIA) |
| - | decision making methods in social insects. Swarms of cooperating | + | |
| - | robots also have to find consensus decisions and thus face similar | + | |
| - | problems as social insects. It is an interesting research question if | + | |
| - | the biological models can be applied to create decentralized and | + | |
| - | robust decision making methods for swarms of robots. More precisely, | + | |
| - | we assume that robots are able to estimate their confidence | + | |
| - | about their own decision. Thus, if a group of robots is unsure about a | + | |
| - | decision they shall recruit more robots into the decision process to | + | |
| - | assure a certain quality in the overall decision. | + | |
| - | The goal of this master thesis project is to study different | + | |
| - | recruitment strategies for decision making in swarms of robots. The | + | ===== UML for Swarm robotics: formal specification of a collective behavior ===== |
| - | following application scenario will be implemented. A group | + | |
| - | of robots need to classify an object in order to operate on it. | + | Swarm robotics is an interesting approach to the |
| - | Through its sensors the single robots can classify an object with a | + | coordination of hundreds of robots as it promotes the realization of |
| - | certain accuracy. This opinion can then be shared in a group to reach | + | systems which are scalable, robust and flexible. However, up to now, |
| - | consensus. If the individual robot's opinions differ strongly from the | + | swarm robotics application has been quite limited, also due to the |
| - | one of other | + | lack of an engineering approach to its development. |
| - | robots or the robots do not have the necessary skills/sensors they | + | In particular, formal specification has not been applied yet to swarm |
| - | might not be able to reach a final decision. In this case they can | + | robotics systems. |
| - | recruit other robots and involve them in the decision making process. | + | |
| + | In this thesis, we will explore possible ways to formally specify | ||
| + | swarm robotics systems. As a starting point we will consider UML and | ||
| + | UML extensions like AUML and UML for multi-agent systems. If | ||
| + | necessary, we will develop a specific extension for swarm robotics | ||
| + | systems. Once the preliminary work is done we will consider an | ||
| + | example, perform formal specification of a task and then implement the | ||
| + | system in simulation. | ||
| Required skills: the candidates should be acquainted with C/C++ | Required skills: the candidates should be acquainted with C/C++ | ||
| - | programming and have a working knowledge of the English language. | + | programming, have a good knowledge of formal specification and UML, |
| + | and have a working knowledge of the English language. | ||
| + | |||
| + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA) | ||
| + | |||
| + | |||
| + | ===== A GUI for debugging the behavior of a robot swarm ===== | ||
| + | |||
| + | Debugging a robot swarm is a complex and difficult task. | ||
| + | The desired behavior of the swarm is the result of the complex | ||
| + | non-linear interactions of tens or hundreds of robots. When | ||
| + | implementing a swarm robotics system, very often it is necessary to | ||
| + | analyze individually the output of the execution of each robot, a very | ||
| + | long and boring process. Since the goal of the developer is to obtain | ||
| + | a specific collective behavior, it would be better to debug the system | ||
| + | at the collective level and, only if necessary, at the individual | ||
| + | level. | ||
| + | |||
| + | In this thesis we will analyze a possible way to debug the collective | ||
| + | behavior of a swarm of robots, using macroscopic and microscopic | ||
| + | modeling. The goal is to develop a GUI that shows the state of the | ||
| + | collective behavior of the system, and if the user requires it, the | ||
| + | state of a single robot. We will start with a version of the debugging | ||
| + | GUI that interface with the ARGoS simulator and eventually one that | ||
| + | interfaces with the real robots. | ||
| + | |||
| + | Required skills: the candidates should be acquainted with C/C++ | ||
| + | programming, GUI programming (QT/C++ or QT/Python or Java) and have a | ||
| + | working knowledge of the English language. | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Manuele Brambilla, Alexander Scheidler (IRIDIA) | ||
| - | ===== Scalable aggregation in swarm robotics without global information or environmental clues ===== | + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA) |
| - | Several studies in biology have shown that group of social insects are able to gather to a particular spot. This process is usually driven by environmental clues such as shadows projected by a shelter (cockroaches) or temperature gradients (bees). These studies have been a source of inspiration for several algorithms in swarm robotics. Is it possible to achieve the same result without an environmental clue? Do we need global information in order to let a group of robot gather in one place? | ||
| - | The goal of this project is to study how to solve an aggregation task without relying on environmental clues or global signaling. The problem can be seen as an exploration-exploitation trade-off tackled by a single robot. The robot has to select between keeping exploring, that is, finding the the largest aggregate, or exploiting, that is join a previously created aggregate. The study will be conducted only in simulation and will concern comparing different approaches for decision making or different communication strategies. | ||
| - | Required skills: The candidates should be acquainted with C++ programming and have a working knowledge of the English language. | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Eliseo Ferrante, Ali Emre Turgut (IRIDIA) | + | ===== A virtual machine for mobile code in a swarm of robots ===== |
| - | ===== A comparison of decision-making strategies for adaptive foraging in swarm robotics ===== | + | Mobile code is a technology whereby nodes in a network of |
| + | computing nodes exchange code. In other words, code migrates from | ||
| + | machine to machine like an agent navigating an environment. Mobile | ||
| + | code is a promising technology for swarm robotics because it would | ||
| + | enable a new, novel type of robot-to-robot interaction. The aim of this | ||
| + | project is produce a simple, yet high-performance virtual machine to | ||
| + | support code exchange in a swarm of robots. A simple experiment with | ||
| + | the robots demonstrating the capabilities of the VM will be performed. | ||
| - | Group of social insects are able to efficiently find the (shortest) path to the a food source and even to differentiate between the quality of two food sources. Studies with ants showed that this mechanism is driven by the perception of stimuli from chemical substances like pheromone. Moreover ants are able to collectively modify their choices if there are changes in the environment, that is, if a source becomes better than another. These ideas have been a source of inspiration for several algorithms in swarm robotics which solves a similar problem (retrieval of objects) by using different types of stimuli such as the encounter rate of objects. | + | Required Skills: Good knowledge of C |
| - | The goal of this project is to perform a study on how to solve a foraging task in which robots have to choose between staying at the nest or go foraging for different energy sources. The optimal strategy might change over time. What happens if all the robots go to the best source? Will these "traffic jams" slow the process? Is it possible to avoid this problem? What if source quality changes over time? The study will be conducted only in simulation and will concern comparing different approaches and different metrics to measure stimuli. | ||
| - | Required skills: The candidates should be acquainted with C++ programming and have a working knowledge of the English language. | + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA) |
| - | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Eliseo Ferrante, Manuele Brambilla (IRIDIA) | ||
| - | ===== Kaleidoscope: Creating temporal motion patterns in a swarm of robots ===== | ||
| - | In swarm robotics, agents are programmed in such a way that local actions and simple interactions among agents result in complex, swarm-level dynamics. At present, the design of swarm robotic control systems is more of a craft than a science, mainly because significant design patterns are still to be identified and studied. This project aims to discover and study temporal patterns in robot motion, and subsequently to encode them into reusable design patterns. Each robot is assumed to possess a limited set of capabilities, such as the ability to change body color and to perceive other robots and their | + | ===== Swarmscope ===== |
| - | colors in a short range. Individual controllers are derived from a very simple but powerful mathematical model. The work of the student will be to code and analyze robot controllers, both with simulated and real robots. The most important required skills are a good knowledge of C and C++ and no fear of mathematics. The working language is English. | + | |
| + | One the main problems in the development of swarm robotics | ||
| + | systems is the difficulty of producing, analyzing and debugging code for | ||
| + | large distributed systems. The aim of this project is to produce a set of | ||
| + | innovative tools to aid the development of complex swarm robotics | ||
| + | systems. The produced tools will involve new, creative visualization | ||
| + | methods and media, novel human-robot swarm interaction and effective | ||
| + | debugging tools. | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Carlo Pinciroli (IRIDIA) | + | Required Skills: Good knowledge of C++ and Qt4 |
| + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA) | ||
| Line 314: | Line 407: | ||
| * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Vito Trianni (IRIDIA) | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Vito Trianni (IRIDIA) | ||
| - | ===== Simulation et optimisation de trafic routier ===== | ||
| - | Mentis, spin-off du laboratoire IRIDIA, est une société de consultance | + | ===== Evolution of Modular Controllers for Simulated and Real Robots ===== |
| - | spécialisée en Data Mining et en Text Mining. Mentis cherche | + | |
| - | actuellement des mémorants pour lancer diverses études d’optimisation | + | |
| - | dans le domaine de la simulation de trafic routier. | + | |
| - | Dans le cadre d’un projet pour un de ses clients, Mentis travaille | + | The goal of this master thesis is investigating how modularity in a robot controller can influence the quality of the behaviours obtained through artificial evolution. |
| - | actuellement dans le domaine de la simulation de trafic routier. | + | Similarly to the nervous system that can be divided in central and peripheral, the project will study a modular architecture for neural network controllers. The peripheral modules encode the information coming from the sensory subsytems or going to the motor apparatus. The central system encodes the behavioural rules that map sensations to actions. The project will study methods to develop the peripheral modules by maximising the information transfer from the sensory input and to the motor output, on the basis of measures derived from Information Theory. |
| - | L’objectif du mémoire proposé consiste à lancer plusieurs études | + | The project will involve experimental activities with both simulated and real robots, and will investigate both individual and collective behaviours. |
| - | d’optimisation pour évaluer l’impact de différentes politiques | + | |
| - | routières sur le trafic. Il sera demandé à l’étudiant de mettre en | + | |
| - | œuvre diverses techniques d’optimisation afin de déterminer les | + | |
| - | politiques routières optimales. Une grande partie du mémoire sera | + | |
| - | faite dans les bureaux de Mentis ainsi qu’en interaction directe avec | + | |
| - | le client. | + | |
| + | Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| - | * Contacts: | + | * Contact: [[http://iridia.ulb.ac.be/~vtrianni|Vito Trianni]], Marco Dorigo (IRIDIA) |
| - | * [[psener@mentis-consulting.be|Pierre Sener (Mentis)]] | + | |
| - | * [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | + | |
| - | * [[http://iridia.ulb.ac.be/~stuetzle/|Thomas Stützle (IRIDIA)]] | + | ===== Localisation and tracking of components in self-assembling systems ===== |
| + | |||
| + | The goal of this project is to apply computer vision techniques to track the growth of structures in self-assembling systems. The ability to track the growth of structures will shed light on the dynamics of self-assembly; an aspect of self-assembly that has not been well researched in the macroscopic context. | ||
| + | |||
| + | As part of the project, the student will have to: (a) find suitable hardware (combination of camera, lens, lighting, etc.), (b) localise multiple components in an environment, (c) track the components in the environment, and (d) track the assembly of components in the environment. | ||
| + | |||
| + | Required skills: the candidates should be able to program in C++ and have a working knowledge of the English language. | ||
| + | |||
| + | * Contacts : [[http://iridia.ulb.ac.be/~mdorigo/HomePageDorigo/ | Marco Dorigo]] and Dhananjay Ipparthi (IRIDIA) | ||
| Line 416: | Line 508: | ||
| - | ===== Comparison of fast heuristics for the longest common subsequence problem ===== | ||
| - | The [[http://en.wikipedia.org/wiki/Longest_common_subsequence|longest common subsequence (LCS) problem]] has important applications in Computational Biology. Several heuristic methods have been proposed to obtain approximate solutions. These methods require different computation time and obtain solutions of varied quality. In this project, the student will learn several methods that have been proposed in the literature to tackle a difficult optimization problem, and compare them in terms of computation time and quality of the resulting solutions. The final goal is to propose appropriate combinations of existing methods that solve diverse instances of the LCS problem. | + | ===== Applications of a hybrid SLS algorithm framework ===== |
| - | * Contacts : | + | We have recently developed a software framework from which hybrid stochastic local search algorithms can be designed automatically. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems and compare its results with the methods proposed in the literature. The student will learn to solve combinatorial optimization problems with SLS algorithms, automatic configuration of optimization algorithms, and analysis and comparison of optimization algorithms. |
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | + | |
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | |
| - | + | ||
| - | + | ||
| - | ===== Applications of the Multi-objective ACO framework ===== | + | |
| - | + | ||
| - | We have recently developed a software framework of Ant Colony Optimization algorithms for multi-objective optimization problems. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems and compare its results with the methods proposed in the literature. The student will learn to solve multi-objective optimization problems with ACO algorithms, automatic configuration of optimization algorithms, and analysis and comparison of optimization algorithms for multi-objective problems. | + | |
| * Contacts : | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | + | * [[http://code.ulb.ac.be/iridia.people.php?id=1388|Federico Pagnozzi (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | + | |
| - | ===== A graphical interface for the optimisation of Water Distribution Networks ===== | ||
| - | The [[http://iridia.ulb.ac.be/~manuel/doc/cec2005-presentation.pdf|optimization of the operations of Water Distribution Networks]] may save important amounts of energy and its associated costs, and, therefore, it is an important problem in practice. There are [[http://www.epa.gov/nrmrl/wswrd/dw/epanet.html|graphical tools and simulators]] available. In addition, several optimization methods based on [[http://iridia.ulb.ac.be/~manuel/doc/cec2005.pdf|evolutionary algorithms]] and [[http://dx.doi.org/10.1061/(ASCE)0733-9496(2008)134:4(337)|ant colony optimization]] have been proposed in the literature. The goal of this project is to integrate the optimization algorithms into a graphical environment that can be used by water engineers and operators. No knowledge about water distribution networks is necessary. The optimisation algorithms and toolkit libraries for handling water distribution networks will be available to the student. | ||
| - | |||
| - | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| - | |||
| - | |||
| - | ===== Automatic fine-tuning of an evolutionary multi-objective framework ===== | ||
| - | |||
| - | The goal of this project is to explore the possibilities of using automatic configuration tools for fine-tuning an existing [[http://paradiseo.gforge.inria.fr/index.php?n=Paradiseo.MOEO|evolutionary multi-objective framework]]. The student will learn about automatic configuration tools, evolutionary algorithms for multi-objective optimization problems and analysis and comparison of multi-objective algorithms. | ||
| - | |||
| - | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| - | |||
| - | |||