On the computational geometry of pocket machining
On the computational geometry of pocket machining
Learning to coordinate without sharing information
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On social laws for artificial agent societies: off-line design
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Parallel searching in the plane
Computational Geometry: Theory and Applications
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
From Ants to A(ge)nts: A Special Issue on Ant-Robotics
Annals of Mathematics and Artificial Intelligence
Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs
Annals of Mathematics and Artificial Intelligence
Efficient Exploration In Reinforcement Learning
Efficient Exploration In Reinforcement Learning
Distributed coverage of rectilinear environments
Distributed coverage of rectilinear environments
Indra: A peer-to-peer approach to network intrusion detection and prevention
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
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
MINERVA: collaborative P2P search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Multi-agent Physical A* with Large Pheromones
Autonomous Agents and Multi-Agent Systems
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
A Prey Catching and Predator Avoidance Neural-Schema Architecture for Single and Multiple Robots
Journal of Intelligent and Robotic Systems
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
Demonstration of multi-agent potential fields in real-time strategy games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
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
Evolutionary dynamics for designing multi-period auctions
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
On isoperimetrically optimal polyforms
Theoretical Computer Science
RoboCup 2007: Robot Soccer World Cup XI
RoboCup 2007: Robot Soccer World Cup XI
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
Handbook of Research on Agent-Based Societies: Social and Cultural Interactions
Handbook of Research on Agent-Based Societies: Social and Cultural Interactions
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Robotics and Autonomous Systems
Distributed algorithms for partitioning a swarm of autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On minimal perimeter polyminoes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
The complexity of grid coverage by swarm robotics
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Proceedings of the twenty-seventh annual symposium on Computational geometry
Hi-index | 0.00 |
Several recent works considered multi-a(ge)nt robotics in static environments. In this work we examine ways of operating in dynamic environments, where changes take place independently of the agents芒聙聶 activity. The work focuses on a dynamic variant of the cooperative cleaners problem, a problem that requires several simple agents to clean a connected region of 芒聙聹dirty芒聙聺 pixels in Z2. A number of simple agents move in this dirty region, each having the ability to 芒聙聹clean芒聙聺 the place it is located in. Their goal is to jointly clean the given dirty region. The dynamic variant of the problem involves a deterministic expansion of dirt in the environment, simulating spreading of contamination or fire. Theoretical lower bounds for the problem are presented, as well as various impossibility results. A cleaning protocol for the problem is presented, and a wealth of experimental results testing its performance in comparison to the lower bounds. Several analytic upper bounds for the proposed protocol are also presented, accompanied with appropriate experimental results.