Molecular Oblivious Robots: a new model for robots with assembling capabilities
Research in theoretical swarm robotics focuses on models that assign to robots a minimal set of capabilities. One of the models well investigated is certainly OBLOT , addressing the case of distributed robots that are, anonymous, without means of communication, and oblivious . Here we propose MOBLOT...
Gespeichert in:
Veröffentlicht in: | IEEE access 2023-01, Vol.11, p.1-1 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Research in theoretical swarm robotics focuses on models that assign to robots a minimal set of capabilities. One of the models well investigated is certainly OBLOT , addressing the case of distributed robots that are, anonymous, without means of communication, and oblivious . Here we propose MOBLOT , an extension of OBLOT that allows to resolve a larger spectrum of cases. MOBLOT stands for molecular oblivious robots : like atoms combine themselves to form molecules, in MOBLOT simple robots can bond with each other in order to create possibly bigger computational units with more intrinsic capabilities with respect to robots (called molecules also in the model); like in nature, molecules can further bond to create more complex structures (e.g., the matter), the MOBLOT version of molecules can exploit their own capabilities to accomplish new tasks or simply to arrange themselves to form any shape defined according to some compositional properties. In order to better understand the potentials of MOBLOT , we introduce a new problem called matter formation (MF). We do provide a necessary condition for the solvability of MF, in general. This relies on the 'amount of symmetries' arising by the disposal of the robots. In practice, we show how molecules can break certain symmetries that cannot be broken in OBLOT . Finally, as a case study of MOBLOT , we consider a representative problem derived from the general MF problem along with a distributed resolution algorithm and show its correctness. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2023.3244844 |