| Lectures |
|
|
|
|
 |
| Laboratories |
|
Setup & manuals |
|
|
|
|
|
|
| Assessment |
|
|
|
| Resources |
|
|
|
|
|
Description |
|
|
|
|
|
|
-
This page is a tribute to the 2011 class in Concurrent and Distributed Systems.
-
The problem at hand is to recharge all vehicles in a variable size swarm at an uncontrollably roaming fuelling globe in a fully distributed manner, i.e. each vehcile runs its own process (set) and can only communicate with nearby vehicles. To see how local the communication ranges are, have a look at his video. The energy globe itself can also not be sensed from a distance but only be detected in close proximity. The full assignment text is here.
- This can only be a somewhat random example set of the many original and interesting designs - literally every student submitted a unique design. For privacy reasons the names of the students who designed the examples below are not on this page, but you can contact them via the links provided, e.g. if you want the sources or a binary to run some of those swarms on your own machine in full screen mode and cristal clear rendering (runs on all platforms).
-
-
|
© The Australian National University
ANU CRICOS Provider Code - 00120C
Sunday, 16 October 2011 – Uwe R. Zimmer
|
|
Contact author