Abstract
Coordination languages and models are recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organisation are exploited in order to tackle typical features of systems to coordinate, such as openness, dynamism and unpredictability. In this paper we focus on a paradigmatic problem we call collective sort, where autonomous agents are assigned the task of moving tuples across different tuple spaces with the goal of reaching perfect clustering: tuples of the same kind are to be collected in the same, unique tuple space. We describe a self-organising solution to this problem, where each agent moves tuples according to partial observations, still making complete sorting emerge from any initial tuple configuration.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.