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 [2014/04/23 21:52] mdorigo 3 new projects |
teaching:mfe:ia [2014/10/14 13:59] stuetzle [Comparison of fast heuristics for the longest common subsequence problem] |
||
|---|---|---|---|
| Line 298: | Line 298: | ||
| * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Andreagiovanni Reina (IRIDIA) | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Andreagiovanni Reina (IRIDIA) | ||
| + | |||
| + | |||
| + | ===== Let a robot swarm get around home! ===== | ||
| + | |||
| + | 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. | ||
| + | |||
| + | * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Gaëtan Podevijn, and Andreagiovanni Reina (IRIDIA) | ||
| + | |||
| + | |||
| Line 443: | Line 453: | ||
| - | ===== Simulation et optimisation de trafic routier ===== | + | ===== Localisation and tracking of components in self-assembling systems ===== |
| - | Mentis, spin-off du laboratoire IRIDIA, est une société de consultance | + | 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. |
| - | 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 | + | 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. |
| - | actuellement dans le domaine de la simulation de trafic routier. | + | |
| - | L’objectif du mémoire proposé consiste à lancer plusieurs études | + | |
| - | 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 able to program in C++ and have a working knowledge of the English language. | ||
| - | * Contacts: | + | * Contacts : [[http://iridia.ulb.ac.be/~mdorigo/HomePageDorigo/ | Marco Dorigo]] and Dhananjay Ipparthi (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)]] | + | |
| Line 544: | Line 541: | ||
| * [[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 Stützle (IRIDIA)]] | ||