Goals and Contents

This project group aims at designing and implementing algorithms for a specific model of programmable matter called Amoebots. The project group consists of two parts, covering the theoretical aspects (first phase) and the practical aspects (second phase).

• Goal
  • Design, analyze, and simulate algorithms
• First phase: Seminar
  • Read papers about the amoebot model and the circuit extension
• Second phase: Implementation/Design/Analysis
  • Implement and test existing algorithms
  • Design new algorithms
• Prerequirements
  • Ability to understand scientific papers
  • Basic programming skills
  • Ideally, also analytical skills
  • High motivation (programmable matter is a cool topic!)

Resources

• Slides of the Project Group presentation
• Classical Amoebot Model
  • Videos of algorithms in the (classical) amoebot model
  • Book chapter and slides on the first four years of research on the (classical) amoebot model
• Reconfigurable Circuits
  • Video of Shortest Path Tree Algorithm
  • Coordinating Amoebots via Reconfigurable Circuits
  • The structural power of reconfigurable circuits in the amoebot model
  • Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
• Joint Movements
  • Video of Millipede Algorithm
  • Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
  • Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them

Contact

Daniel Warner

Matthias Artmann

Andreas Padalkin