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 [2010/03/19 16:33] mbiro |
teaching:mfe:ia [2012/03/21 16:07] mdorigo [Formal verification of a swarm robotics behavior through statistical model checking] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2010-2011 : Intelligence Artificielle ====== | + | ====== MFE 2011-2012 : Intelligence Artificielle ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 15: | Line 15: | ||
| to the implementation of this library will be studied. The | to the implementation of this library will be studied. The | ||
| library will also be tested in terms of robustness and performance | library will also be tested in terms of robustness and performance | ||
| - | as compared with the previous existing solutions. | + | 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. |
| * 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)]] | ||
| + | |||
| + | ===== 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. | ||
| + | |||
| + | * 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 24: | Line 32: | ||
| Le MFE consistera en un développement orienté objet d'une | Le MFE consistera en un développement orienté objet d'une | ||
| cellule biologique minimale avec son métabolisme chimique interne, un génome | cellule biologique minimale avec son métabolisme chimique interne, un génome | ||
| - | élémentaire et sa membrane. 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 | ||
| - | à un MFE déjà réalisé il y a deux ans. | + | à une succession de MFE déjà réalisés ces dernières années. |
| Line 68: | Line 76: | ||
| ===== Etude de la topologie de réseaux de musiciens de Jazz ===== | ===== Etude de la topologie de réseaux de musiciens de Jazz ===== | ||
| - | 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 un réseau de musiciens de Jazz connectant deux musiciens dès lors qu’ils ont joué sur un même disque. Le MFE consistera en un développement logiciel ayant pour but la réalisation automatique de ces réseaux de musiciens à partir de documentations sur les disques téléchargés automatiquement de sites de vente en ligne. | + | 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 un réseau de musiciens de Jazz connectant deux musiciens dès lors qu’ils ont joué sur un même disque ou participé à un même concert. Le MFE consistera en un développement logiciel ayant pour but la réalisation automatique de ces réseaux de musiciens à partir de documentations sur les disques ou les concerts téléchargés automatiquement de sites de vente en ligne. Le mémorant devra réaliser un logiciel capable d'extraire ces informations sur le Web et ensuite exploitera un ensemble d'outils existant lui permettant d'étudier la topologie du réseau ainsi obtenue. |
| * 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 83: | Line 91: | ||
| ===== Mise au point d’un système automatique de génération de code à partir d’un diagramme d’état-transition ===== | ===== Mise au point d’un système automatique de génération de code à partir d’un diagramme d’état-transition ===== | ||
| - | Le diagramme d’état-transition représente le cycle de vie d’un objet, de sa naissance à sa disparition, en suivant les différents états par lesquels cet objet transite. Il est par exemple très largement mis à l’œuvre dans la modélisation des procédures parlementaires (l’évolution des décrets de loi). C’est le cas dans plusieurs parlements belges avec lesquels IRIDIA collabore. Le MFE étudiera la possibilité d’une génération automatique de code fidèle à ces diagrammes et tout ce qui les compose. | + | Le diagramme d’état-transition représente le cycle de vie d’un objet, de sa naissance à sa disparition, en suivant les différents états par lesquels cet objet transite. Il est par exemple très largement mis à l’œuvre dans la modélisation des procédures parlementaires (l’évolution des décrets de loi). C’est le cas dans plusieurs parlements belges avec lesquels IRIDIA collabore. Le MFE étudiera la possibilité d’une génération automatique de code fidèle à ces diagrammes et tout ce qui les compose. Le code généré respectera le design pattern d'état associant une classe à chaque état possible. Des problèmes tels les états compositionnels ou les transitions s'effectuant simultanément seront étudié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)]] | ||
| ===== 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 ===== | ||
| - | En général, les biologistes par manque de formation recourent très difficilement à la programmation des systèmes qu'ils étudient. Nous souhaitons les assister en mettant à leur disposition un langage qualitatif de modélisation sur base des diagrammes de classe et d'état/transition UML. Ce langage pourrait finalement aboutir à une forme exécutable, par une génération de code Java appropriée et son exécution. Le système sera mis au point en collaboration avec des immunologistes avec lesquels IRIDIA entretient des collaborations suivies depuis très longtemps. | + | En général, les biologistes par manque de formation recourent très difficilement à la programmation des systèmes qu'ils étudient. Nous souhaitons les assister en mettant à leur disposition un langage qualitatif de modélisation sur base des diagrammes de classe et d'état/transition UML. Ce langage pourrait finalement aboutir à une forme exécutable, par une génération de code Java appropriée et son exécution. Le système sera mis au point en collaboration avec des immunologistes internationnaux avec lesquels IRIDIA entretient des collaborations suivies depuis très longtemps. Ainsi l'idée est de créer un langage de simulation de systèmes biologique qualitatif et graphique qui soit bien plus facile d'utilisation pour les biologistes que les langages de programmation actuels. |
| * 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. | + | 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)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| Line 121: | Line 129: | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | ||
| - | * Manuel López-Ibáñez (IRIDIA) | + | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] |
| Line 136: | Line 144: | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | ||
| - | * Manuel López-Ibáñez (IRIDIA) | + | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] |
| Line 151: | Line 159: | ||
| * Contacts : | * Contacts : | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| - | * Manuel López-Ibáñez (IRIDIA) | + | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] |
| - | /* | ||
| - | ===== Swarm robotics using the e-puck platform ===== | + | ===== 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. | ||
| - | 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. | + | 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. |
| - | 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. | + | Required skills: good knowledge of C or C++ programming. |
| - | 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. | ||
| - | 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/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| + | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | ||
| + | |||
| + | |||
| + | |||
| + | ===== Stochastic Local Search heuristics for solving NP-complete puzzles. ====== | ||
| + | |||
| + | This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems. | ||
| + | Example puzzles are: [[http://en.wikipedia.org/wiki/Light_Up|Light Up]], [[http://en.wikipedia.org/wiki/Mastermind_(board_game)|Mastermind]], [[http://en.wikipedia.org/wiki/Minesweeper_(video_game)|Minesweeper]], etc. | ||
| + | |||
| + | 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. | ||
| + | |||
| + | 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 : | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] |
| - | * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]] | + | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] |
| - | + | ||
| - | */ | + | |
| - | ===== Self-organized task allocation in swarm robotics ===== | ||
| - | Swarm robotics is an innovative branch of collective robotics that aims at designing robot behaviors by taking inspiration from social animals, such as ants and bees. "Task allocation" in such robotic swarms is the problem of "who is doing what job and when?" Obviously, this problem of assigning jobs to a whole swarm robots can be very difficult, especially when using many robots that cannot communicate with each other on a global level. | ||
| - | The goal of the project is to implement new algorithms for solving this problem on the e-Puck robot and run extensive experiments with this robot in various environments. The project will involve experimentation with about 30 real e-Pucks. The project is tightly connected to the research in swarm robotics carried out at IRIDIA. | + | ===== Formal verification of a swarm robotics behavior through statistical model checking ===== |
| + | The goal of this thesis is to apply statistical model | ||
| + | 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. | ||
| - | ===== Kaleidoscope: Creating temporal motion patterns in a swarm of robots ===== | + | 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. | ||
| - | 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 | + | Required skills: the candidates should be acquainted with C/C++ |
| - | 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. | + | programming and have a working knowledge of the English language. |
| + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA) | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Carlo Pinciroli (IRIDIA) | ||
| + | ===== UML for Swarm robotics: formal specification of a collective behavior ===== | ||
| + | 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. However, up to now, | ||
| + | swarm robotics application has been quite limited, also due to the | ||
| + | lack of an engineering approach to its development. | ||
| + | In particular, formal specification has not been applied yet to swarm | ||
| + | robotics systems. | ||
| - | + | 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. | ||
| - | ===== Evolution of Cooperation ===== | + | Required skills: the candidates should be acquainted with C/C++ |
| + | programming, have a good knowledge of formal specification and UML, | ||
| + | and have a working knowledge of the English language. | ||
| - | Often the selfish and strong are believed to be favored by natural selection, even though cooperative and fair interactions thrive at all levels of organization in living systems. This project tackles this paradox in the context of Evolutionary Game Theory (EGT), having kin-selection, direct and indirect reciprocity as conceptual starting points. Contrary to what is usual, models will also take into account the intricate ties of modern social networks and its topological evolution. | + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA) |
| - | In spite of its relevance, understanding the evolution of cooperation remains one of the most fundamental challenges to date, tackled by scientists from fields as diverse as anthropology, biology, sociology, ecology, economics, psychology, political science, mathematics, physics, etc., who often adopt EGT as a common mathematical framework. Hence, students who choose this proposal should be strongly interested in interdisciplinary research. | ||
| - | Required skills: The candidates should have good mathematical skills, be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| - | * Contact : [[http://iridia.ulb.ac.be/~fsantos|Francisco C. Santos (IRIDIA)]] | ||
| + | ===== A virtual machine for mobile code in a swarm of robots ===== | ||
| + | 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. | ||
| + | |||
| + | Required Skills: Good knowledge of C | ||
| + | |||
| + | |||
| + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA) | ||
| + | |||
| + | |||
| + | |||
| + | ===== Swarmscope ===== | ||
| + | |||
| + | 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. | ||
| + | |||
| + | Required Skills: Good knowledge of C++ and Qt4 | ||
| + | |||
| + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA) | ||
| + | |||
| + | |||
| + | ===== Self-organized visual coverage in a swarm of robots ===== | ||
| + | |||
| + | Systems composed of several inter-connected cameras are already a reality in | ||
| + | our everyday lives. The prime application of such systems is video-surveillance, | ||
| + | but the possibilities o ered from multiple-camera systems can extend to other | ||
| + | interesting objectives, such as environment mapping, 3D shape-reconstruction | ||
| + | and object recognition. In all these scenarios, the problem of nding the right | ||
| + | position of a set of cameras in order to maximize the visual eld, or the amount | ||
| + | of information available, is not always a simple one. Furthermore, systems | ||
| + | consisting of cameras in a xed position present obvious issues of robustness | ||
| + | and exibility. | ||
| + | Multi-robots systems can provide an interesting mean to overcome this is- | ||
| + | sues. Robots navigating in the enviroment can change their position as a result | ||
| + | of changes in the enviroment or in the overall system's objective. A centralized | ||
| + | control solution for these systems is still not a desirable one, as it introduces a | ||
| + | single point of failure and it can su er from performance issues. | ||
| + | The Swarm Robotics paradigm o ers a valid approach to the design of a mul- | ||
| + | tiple camera system. In this project, we want to study the possibility to develop | ||
| + | a control strategy that enables a swarm of robots to position themselves into an | ||
| + | unknown environment, maximizing the area covered by their visual elds, while | ||
| + | relying only on their image processing system and on local communication. | ||
| + | |||
| + | Requirements: The candidates should be acquainted with C/C++ programming and have a | ||
| + | working knowledge of the English language. | ||
| + | |||
| + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Alessandro Stranieri (IRIDIA) | ||
| + | |||
| + | ===== Automatic fitness function definition in evolutionary robotics ===== | ||
| + | |||
| + | Evolutionary robotics is a fascinating approach to the design of robot controllers that takes inspiration from natural evolution. | ||
| + | |||
| + | In order to obtain a robot that is able to perform a desired task, the evolutionary robotics approach considers a population of robots that evolves in time. Each robot is characterized by a genotype that defines somehow its behavior. Each robot is evaluated according to a fitness function that measures the ability of the robot to perform the desired task. Robots with a low fitness are eliminated. Robots with a high fitness remain in the population and generate offsprings -- e.g., robots with a similar genotype obtained via mutation and/or cross-over. Through this process, generation by generation, the evolutionary robotics approach is able to obtain robots that present higher and higher fitness and that are therefore able to perform the desired task more and more effectively. | ||
| + | |||
| + | One of the main open problems in evolutionary robotics is that the definition of an appropriate fitness function is a very complex, labor-intensive, and time-consuming activity that requires the attention of an expert researcher. | ||
| + | |||
| + | The goal of this master thesis is to devise an automatic method to define a fitness function in order to obtain a robot that is able to perform a desired task. This automatic method will be based on machine learning and metaheuristic algorithms. In particular, it will draw ideas from the fields of reinforcement learning and of on-line adaptation of parameters in optimization algorithms. | ||
| + | |||
| + | Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| + | |||
| + | * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Vito Trianni (IRIDIA) | ||
| + | |||
| + | |||
| + | ===== Evolution of Modular Controllers for Simulated and Real Robots ===== | ||
| + | |||
| + | 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. | ||
| + | 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. | ||
| + | The project will involve experimental activities with both simulated and real robots, and will investigate both individual and collective behaviours. | ||
| + | |||
| + | Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| - | \\ | + | * Contact: [[http://iridia.ulb.ac.be/~vtrianni|Vito Trianni]], Marco Dorigo (IRIDIA) |
| - | \\ | + | |
| - | The project is in collaboration with [[http://www.ciul.ul.pt/~pacheco/|Jorge M. Pacheco (University of Lisbon)]], [[http://como.vub.ac.be/doku.php?id=members:sven_van_segbroeck|Sven Van Segbroeck (IRIDIA and COMO, VUB)]] and [[http://switch.vub.ac.be/~tlenaert/|Tom Lenaerts (SWITCH, VUB)]]. | + | |
| Line 310: | Line 430: | ||
| * [[frank@business-insight.com|Frank Vanden Berghen (Business-Insight) ]] | * [[frank@business-insight.com|Frank Vanden Berghen (Business-Insight) ]] | ||
| * [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | |||
| + | ===== 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. | ||
| + | |||
| + | * Contacts : | ||
| + | * [[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 : | ||
| + | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | ||
| + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (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)]] | ||
| + | |||
| + | |||