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 [2018/05/02 14:45] bersini |
teaching:mfe:ia [2019/05/07 11:56] bersini |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2017-2018 : Intelligence Artificielle ====== | + | ====== MFE 2018-2019 : Intelligence Artificielle ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 8: | Line 8: | ||
| - | ===== Swarm construction: Development of remote monitoring software for intelligent structures ===== | + | --- |
| + | ===== A WebGL Visualization for a Swarm Robotics Simulator ===== | ||
| - | S-blocks are dynamically reconfigurable blocks used for autonomous construction applications. When two or more S-blocks are assembled they are capable of communicating with each other over a near field communication (NFC) wireless interface. The goal of this master thesis is to develop software to monitor (and control) the blocks in an intelligent structure remotely over the auxiliary Zigbee-based wireless interface. As only one block in the structure is fitted with this wireless interface, it is required that the other blocks communicate with the PC, via routing messages through the block-to-block NFC interfaces. This will require the software on the S-Blocks to be enhanced to use preemptive task swapping, to allow multiple blocks to communicate with each other simultaneously. | + | ARGoS is a multi-robot simulator that has been designed to simulate swarms of 1000s of robots in real time. The simulator is modular and allows developers to easy add new plugins such as physics engines, visualizations, and new sensors and actuators. The goal of this master’s thesis is to develop a WebGL-based visualization for the ARGoS simulator. This interface will allow a user to monitor and to interact with the simulation from a web browser. |
| - | Required skills: The candidates should understand low level computer concepts such as: interrupts, timers, and registers, have some experience with C/C++ programming, and have a working knowledge of the English language. | + | Required skills: The candidates should have some experience with programming in C++ and Javascript and to have some experience with HTML5 and CSS. A working knowledge of the English language is required. |
| - | + | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] (IRIDIA) | + | |
| - | + | * Contact: Marco Dorigo | |
| - | + | ||
| - | ===== Design of a holonomic drive system for autonomous robots in a swarm ===== | + | |
| - | + | ||
| - | Unlike a differential drive system, a holonomic drive system has the advantage of being able to move in any direction at a given instant. The goal of this master thesis is to design and evaluate the performance of a holonomic drive system. The drive system will be assembled from a combination of off-the-shelf components and 3D printed parts. In order to evaluate the drive system, close loop controllers need to be designed and evaluated in C/C++. | + | |
| - | + | ||
| - | Required skills: The candidates should have some experience with programming in C/C++, and some experience with 3D modelling (preferably Solidworks). The candidates should be able to use basic kinematics to solve simple physics problems, and have a working knowledge of the English language. | + | |
| - | + | ||
| - | * Contact: [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] (IRIDIA) | + | |
| Line 60: | Line 51: | ||
| * 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. ===== | ===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== | ||
| Line 66: | Line 58: | ||
| * 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 des solutions de text mining pour la société Procter & Gamble ===== | ===== Développer des solutions de text mining pour la société Procter & Gamble ===== | ||
| Line 72: | Line 65: | ||
| * 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)]] | ||
| + | |||
| + | ===== Le data mining en tant qu’outil d’aide à la gestion active d’actifs cotés ===== | ||
| + | |||
| + | L’idée de ce mémoire serait d’avoir un travail en plusieurs parties dont notamment : | ||
| + | • une partie théorique qui reprendrait les fondamentaux du data mining, | ||
| + | • un screening, une présentation et comparaison des outils existants utilisés dans le cadre de la gestion d’actifs cotés, | ||
| + | • une partie pratique destinée à construire un data set et à le modéliser. | ||
| + | |||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | |||
| + | ===== Speed-up Techniques for Shortest Path Problems ===== | ||
| + | |||
| + | |||
| + | The shortest path problem is one of the most important in combinatorial optimization and has multiple real-world applications. | ||
| + | The well-known Dijkstra algorithm solves the shortest path problem in any weighted graph with non-negative weights. However, with the recent increase of the amount of data, we feel the need to drastically increase the execution time of the algorithm. | ||
| + | In the latest years, we observe the emergence of a lot of new speed-up techniques; among them there are: heuristic search, bidirectional search, landmarks, reaches, short-cuts and contractions. The efficiency of these techniques heavily depends on the topology of the graph. Moreover, graphs with more complex structures (as user-adapted graphs) do not support some of these techniques, at least as they are currently presented. | ||
| + | From these observations, several questions arise, among them we propose: | ||
| + | Which optimization methods are the most efficient depending on the graph topology? | ||
| + | How can we adapt these techniques to more complex graph structures? | ||
| + | Other research questions in this topic can be proposed and discussed. | ||
| + | These questions can be studied from both theoretical and empirical approach. | ||
| + | |||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| + | ===== Développer des solutions de data mining pour la société BMW Group Belux ===== | ||
| + | |||
| + | Ce mémoire se fera en collaboration avec des responsables marketing et techniques de cette société. | ||
| + | Les sujets pourraient couvrir tout ce qui concerne les data, tant les data dites de campagne, communication, que celles liées à la production ou aux véhicules connectés. | ||
| + | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
| + | |||
| ===== Transposition en logique floue des réseaux de neurones récurrents de type GRU ===== | ===== Transposition en logique floue des réseaux de neurones récurrents de type GRU ===== | ||