Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Turtles, termites, and traffic jams: explorations in massively parallel microworlds
Turtles, termites, and traffic jams: explorations in massively parallel microworlds
Diversity and adaptation in populations of clustering ants
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Collective sorting and segregation in robots with minimal sensing
Proceedings of the fifth international conference on simulation of adaptive behavior on From animals to animats 5
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
ACM Computing Surveys (CSUR)
Dynamics of complex systems
Applied system simulation: a review study
Information Sciences—Informatics and Computer Science: An International Journal
Self-Organization in Biological Systems
Self-Organization in Biological Systems
Coordination for Internet Application Development
Autonomous Agents and Multi-Agent Systems
Multiple Tuple Spaces in Linda
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A new approach to scalable Linda-systems based on swarms
Proceedings of the 2003 ACM symposium on Applied computing
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Programming stigmergic coordination with the TOTA middleware
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A self-organising solution to the collective sort problem in distributed tuple spaces
Proceedings of the 2007 ACM symposium on Applied computing
Data Management in the Worldwide Sensor Web
IEEE Pervasive Computing
Simulating Emergent Properties of Coordination in Maude: the Collective Sort Case
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated global-to-local programming in 1-D spatial multi-agent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Efficient routing from multiple sources to multiple sinks in wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Biochemical Tuple Spaces for Self-organising Coordination
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Chemical-inspired self-composition of competing services
Proceedings of the 2010 ACM Symposium on Applied Computing
Probabilistic embedding: experiments with tuple-based probabilistic languages
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
In systems coordinated with a distributed set of tuple spaces, it is crucial to assist agents in retrieving the tuples they are interested in. This can be achieved by sorting techniques that group similar tuples together in the same tuple space, so that the position of a tuple can be inferred by similarity. Accordingly, we formulate the collective sort problem for distributed tuple spaces, where a set of agents is in charge of moving tuples up to a complete sort has been reached, namely, each of the N tuple spaces aggregate tuples belonging to one of the N kinds available. After pointing out the requirements for effectively tackling this problem, we propose a self-organizing solution resembling brood sorting performed by ants. This is based on simple agents that perform partial observations and accordingly take decisions on tuple movement. Convergence is addressed by a fully adaptive method for simulated annealing, based on noise tuples inserted and removed by agents on a need basis so as to avoid sub-optimal sorting. Emergence of sorting properties and scalability are evaluated through stochastic simulations.