Synchronizing a database to improve freshness
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Effects of interaction topology and activation regime in several mutli-agent systems
MABS 2000 Proceedings of the second international workshop on Multi-agent based simulation
Efficient and inefficient ant coverage methods
Annals of Mathematics and Artificial Intelligence
Efficient Exploration In Reinforcement Learning
Efficient Exploration In Reinforcement Learning
Swarm Approaches for the Patrolling Problem, Information Propagation vs. Pheromone Evaporation
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Self-Organization of Patrolling-Ant Algorithms
SASO '09 Proceedings of the 2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Multi-agent patrolling: an empirical analysis of alternative architectures
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Proceedings of the Second Symposium on Information and Communication Technology
A multi-robot coverage approach based on stigmergic communication
MATES'12 Proceedings of the 10th German conference on Multiagent System Technologies
| Hi-index | 0.00 |
Generally, swarm models and algorithms consider synchronous agents, i.e., they act simultaneously. This hypothesis does not fit multi-agent simulators nor robotic systems. In this paper, we consider such issues on a patrolling ant algorithm. We examine how different execution hypotheses influence self-organization capabilities and patrolling performances of this algorithm. We consider the mono and multiagent cases, the synchronism and determinism hypotheses, and the execution of the model with real robots.