Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Artificial Intelligence
The complexity of pursuit on a graph
Theoretical Computer Science
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Terrain coverage with ant robots: a simulation study
Proceedings of the fifth international conference on Autonomous agents
Efficiently searching a graph by a smell-oriented vertex process
Annals of Mathematics and Artificial Intelligence
Efficient and inefficient ant coverage methods
Annals of Mathematics and Artificial Intelligence
From Ants to A(ge)nts: A Special Issue on Ant-Robotics
Annals of Mathematics and Artificial Intelligence
Multiagent Mission Specification and Execution
Autonomous Robots
Coalition formation with uncertain heterogeneous information
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Efficient Exploration In Reinforcement Learning
Efficient Exploration In Reinforcement Learning
Interaction and intelligent behavior
Interaction and intelligent behavior
Discrete Bee Dance Algorithms for Pattern Formation on a Grid
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
A framework and analysis for cooperative search using UAV swarms
Proceedings of the 2004 ACM symposium on Applied computing
Building Terrain-Covering Ant Robots: A Feasibility Study
Autonomous Robots
Randomized Pursuit-Evasion with Local Visibility
SIAM Journal on Discrete Mathematics
Cooperative Cleaners: A Study in Ant Robotics
International Journal of Robotics Research
International Journal of Robotics Research
Speeding up moving-target search
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Intelligence Integration in Distributed Knowledge Management
Intelligence Integration in Distributed Knowledge Management
Regulating air traffic flow with coupled agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Reaction functions for task allocation to cooperative agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
The impact of adversarial knowledge on adversarial planning in perimeter patrol
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Sequential decision making in repeated coalition formation under uncertainty
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Multi-agent approach to network intrusion detection
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
On reduced time fault tolerant paths for multiple UAVs covering a hostile terrain
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Robust team-play in highly uncertain environments
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Understanding how people design trading agents over time
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Physical parameter optimization in swarms of ultra-low complexity agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Robot team coordination for target tracking using fuzzy logic controller in game theoretic framework
Robotics and Autonomous Systems
Formation optimization for a fleet of wheeled mobile robots - A geometric approach
Robotics and Autonomous Systems
Efficient Multi-robot Search for a Moving Target
International Journal of Robotics Research
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Distributed algorithms for partitioning a swarm of autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Hi-index | 5.23 |
In this paper we study the strengths and limitations of collaborative teams of simple agents. In particular, we discuss the efficient use of ''ant robots'' for covering a connected region on the Z^2 grid, whose area is unknown in advance, and which expands at a given rate, where n is the initial size of the connected region. We show that regardless of the algorithm used, and the robots' hardware and software specifications, the minimal number of robots required in order for such a coverage to be possible is @W(n). In addition, we show that when the region expands at a sufficiently slow rate, a team of @Q(n) robots could cover it in at most O(n^2lnn) time. This completion time can even be achieved by myopic robots, with no ability to directly communicate with each other, and where each robot is equipped with a memory of size O(1) bits w.r.t. the size of the region (therefore, the robots cannot maintain maps of the terrain, nor plan complete paths). Regarding the coverage of non-expanding regions in the grid, we improve the current best known result of O(n^2) by demonstrating an algorithm that guarantees such a coverage with completion time of O(1kn^1^.^5+n) in the worst case, and faster for shapes of perimeter length which is shorter than O(n).