Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
teaching:mfe:ia [2016/03/14 16:19]
mdorigo [Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique.]
teaching:mfe:ia [2017/04/20 18:32]
stuetzle [Software framework for Ant Colony Optimization]
Line 25: Line 25:
    
 * Contact: [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo]] (IRIDIA) ​ * Contact: [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo]] (IRIDIA) ​
 +
 +
 +
 +===== Automatic design of communication protocols in swarm robotics =====
 +
 +Automatic design methods are a promising approach to the development of control software of robot swarms. In previous research, we have developed AutoMoDe, a method that automatically generate a finite state machine to control each individual robot of the swarm. AutoMoDe automatically assembles the finite state machine starting from pre-defined behavioral modules and transition criteria. ​ In this project, the goal is to extend AutoMoDe so as to enable the automatic generation of communication protocols.
 +
 +Required skills: The candidate should have good programming skills and previous experience with C++ programming under UNIX.
 +
 +* Contact: [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari]],​ Lorenzo Garattoni, Gianpiero Francesca (IRIDIA)
 +
 +
 +
 +===== Intelligent interactive console for swarm of robots =====
 +
 +The goal of this project is to design and implement an interactive tool for monitoring, debugging and controlling experiments in swarm robotics. Through the interface of this tool, the user can pause the experiment, monitor the state of the robots, select a robot to check the values of sensors and actuators, and modify them if needed. The tool will be integrated in ARGoS (the simulator for robot swarms developed at IRIDIA) and will feature the existing debug facilities featured by ARGoS, which currently work only in simulation. The tool will also use the IRIDIA arena'​s tracking system, which is equipped with 16 ceiling-mounted cameras. Finally, the tool will integrate an existing console software to monitor and control the state of the robots.
 +
 +* Contact: [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari]],​ Lorenzo Garattoni (IRIDIA)
 +
 +
 +
 +
 +===== Efficient chain formation in a robot swarm =====
 +
 +The goal of this project is to study and design techniques to efficiently create and maintain robust chains of robots. Chain formation is a known collective behavior in swarm robotics. In chain formation, robots place themselves in the environment to create a chain that connects two locations. The chain can be used by other robots as navigation support. Chain formation behaviors are often inspired by ants, which form chains of individuals that connect their nest to foraging sites. Although chain formation has been implemented in several different configurations (e.g., chains of moving robots, chains of aerial robots that aid the navigation of ground robots, directional chains, etc.), the definition of efficient methods to build, use, and maintain chains of robots is still missing. The ultimate goal of the project is therefore the definition of a efficient and robust chain formation behaviour.
 +
 +* Contact: [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari]],​ Lorenzo Garattoni (IRIDIA)
  
  
Line 184: Line 211:
  
  
-===== Software framework for Ant Colony Optimization ​=====+===== Software framework for ant colony optimization ​=====
  
 Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications,​ and engineering. While ACO has a very wide applicability,​ the development times for effective ACO algorithms can be relatively high. This is due to the fact that each time a new problem is to be tackled by an ACO algorithm, a researcher needs to implement the algorithms almost from scratch. ​ Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications,​ and engineering. While ACO has a very wide applicability,​ the development times for effective ACO algorithms can be relatively high. This is due to the fact that each time a new problem is to be tackled by an ACO algorithm, a researcher needs to implement the algorithms almost from scratch. ​
Line 191: Line 218:
 The application of this software framework will be tested on a number of optimization problems. The application of this software framework will be tested on a number of optimization problems.
  
-Required skills: The candidate should be well acquainted with   ​programming in object oriented languages.+Required skills: The candidate should be well acquainted with programming in object oriented languages.
  
  
Line 321: Line 348:
  
  
-===== Applications ​of hybrid ​SLS algorithm framework ​=====+===== Automated configuration ​of hybrid ​algorithms ​=====
  
-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.+We have recently developed a software framework from which hybrid 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, in particular, vehicle routing ​problems and to compare ​the results ​that can be obtained ​with the methods proposed in the literature. The student will learn to solve combinatorial optimization problems with heuristic ​algorithms, automatic configuration of optimization algorithms, and the analysis and comparison of optimization algorithms.
  
   * Contacts :    * Contacts : 
     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​
     * [[http://​code.ulb.ac.be/​iridia.people.php?​id=1388|Federico Pagnozzi (IRIDIA)]]     * [[http://​code.ulb.ac.be/​iridia.people.php?​id=1388|Federico Pagnozzi (IRIDIA)]]
- 
  
  
 
teaching/mfe/ia.txt · Last modified: 2024/06/12 11:11 by stuetzle