
|
anglais seulement |
|
|
BIRG INDEX BIRG Home
People Postdoc openings PhD Openings Publications Research Movies Student Projects Teaching Links News Archive Miscellaneous Travel Info Internal
PROJECT LIST P. Amstutz
R. Arco L. Benda M. Biehl S. Blanchoud Y. Bourquin G. Brambilla J. Braure S. Capern S. Catherinet G. Certo P. Cominoli A. Constantinescu N. Delieutraz E. Dittrich A. Dysli E. Dysli B. Fankhauser J.-P. Egger C. Favre J.-C. Fillion-Robin J. Gagnet M. Ganguin N. P. Garg S. Gay M. Gerber M. de Giacomi J. Guerra P.-A. Guyot R. Haberer-Proust A. Hitz L. Hohl C. Jaquier & K. Dr... J. Jesse B. Jiménez I. Kviatkevitch D. Lachat P. Laprade C. Lathion S. Lépine P. Lopez Estepa J. Lotfi A. Maddalena D. Marbach S. Marthe L. Matthey J. Maye M. Mayer M. Mehmedinovic J. Meinen F. Menzer B. Mesot R. Möckel S. Mojon J. Nicolas M.A. Nüssli E. Palme A. Pasquier F. Patuzzo B. Petreska M. Petter S. Poskriakov B. Rat C. Richon M. Riess L. Righetti S. Ruffieux J. Ruffin M. Rumo S. Rutishauser M. Salzmann S. Singh L. Théodon V. Trifa A. Tripathi A. Truchet A. Tuleu J. van den Kieboom B. von Haller S. Wieser M. Yerly P. Zotos |
Master project : Toward Emancipation of Furniture. A Kinematics-Dependent Reconfiguration Algorithm for Chain-Type Modular Robots
Tree representations
The main goal of our project is to build the tree of all possible connections and disconnections (ie : each node of the tree is obtained from its parent by making one connection or one disconnection). But in order to connect two modules one have to first move them in contact to one another, which is not always possible or sometimes involves making very complex movements.To be able to compute only the valid connections we built the tree of all possible servo movements, detecting and avoiding the internal collisions of the structure. The picture on the left represents an example of this tree. The tree on the left is the Servo Movement Tree and the one on the right is a part of the Moves Tree which represents every possible connections and disconnections. The problem here is that the number of nodes in this tree (thus the size of the search space) grows exponentially with the number of modules. Its size is proven to be . Thus, we need ways to guide the searching process in this huge space.HeuristicsThe first heuristic that we designed was based on the following observation: the probability to be able to make new connections is inversely proportional to the mean distance between the modules. For each servo, we have the choice to place it in three positions: -90°, 0° or +90°. Our heuristics automatically selects the position for which the moving modules get the nearest to the rest of the structure. This enables us to decrease the complexity by 2n.We further simplified the searching process by removing the duplicates of the search space. This is done by storing a unique key for each successful sequence of servo movements in a hash table. Our algorithm verifies that a node is not already present in this hash table before adding it to the tree. We get a final complexity of O(2n), which is still exponential but of a much less order of magnitude than before. To give an example, one of our test samples would take about 22 hours to complete by explicitly searching the tree while it would take about 5 seconds by using our complexity reduction techniques. FilesEngineer Diploma Project : IMOROD : Interface for MOdular RObots Design. Conception and Development of a 3D Robotic Interface for the Roombots project.
The interface that we designed is very simple and intuitive, usable almost only with the mouse and contains a few common controls to help the user. We named it IMOROD for Interface for MOdular RObots Design. We used C++ as coding language, OpenGL as graphics library and GLOW as widgets library and C++ wrapper for GLUT and OpenGL. We wrote a user interface which is a easy to understand, well illustrated, step by step tutorial to master all the functionalities of IMOROD. We also wrote a developer interface containing all the guidelines for further development of the solution as well as a simplified class reference. These documents are available below as well as some screenshots of the application. Screenshots ![]() Files |
|
|
Site map © 2010 EPFL , 1015 Lausanne, tel. 021 693 26 58 |
||