Arbitrary pattern formation by asynchronous, anonymous, oblivious robots

TL;DR: This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past), and introduces the computational model with its nuances, focusing on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking.

TL;DR: This paper considers the setting without assumptions, that is, when the entities are oblivious, disoriented, and fully asynchronous, which means no assumptions exist on timing of cycles and activities within a cycle.

TL;DR: It is proved that, for luminous robots, to have O ( 1 ) colors and a single snapshot renders them more powerful than to have an unlimited amount of persistent memory (including snapshots) but no lights, and it is still open whether or not asynchronous luminous Robots with O (1 ) colors are morepowerful than fully-synchronous robots without lights.

TL;DR: In this paper, a starfish-like soft robot with flexible rays and the implementation of multi-gait locomotion using Shape Memory Alloy (SMA) actuators is presented.

TL;DR: In a recent Physical Review Letters article, Vicsek et al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves.

TL;DR: Social phenomena simulation in the area of agent-based modeling and simulation concerns the emulation of the individual behavior of a group of social entities, typically including their cognition, cognition, and behavior.