Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1994)
A case study of autonomous household vacuum cleaner
D. Gage (1992)
Command Control for Many-Robot Systems
Noam Agmon, Noam Hazon, G. Kaminka (2006)
Constructing spanning trees for efficient multi-robot coverageProceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
V. Yanovski, I. Wagner, A. Bruckstein (2003)
A Distributed Ant Algorithm for\protect Efficiently Patrolling a NetworkAlgorithmica, 37
Noam Hazon, G. Kaminka (2005)
Redundancy, Efficiency and Robustness in Multi-Robot CoverageProceedings of the 2005 IEEE International Conference on Robotics and Automation
H. Choset (2001)
Coverage for robotics – A survey of recent resultsAnnals of Mathematics and Artificial Intelligence, 31
(1996)
Abate.The Oxford Dictionary and Thesaurus: The Ultimate Language Reference for American Readers
D. Carroll, Chinh Nguyen, H. Everett, B. Frederick (2005)
Development and testing for physical security robots, 5804
I. Wagner, M. Lindenbaum, A. Bruckstein (1998)
Efficiently searching a graph by a smell-oriented vertex processAnnals of Mathematics and Artificial Intelligence, 24
M. Dias, A. Stentz (2000)
A Free Market Architecture for Distributed Control of a Multirobot System
Y. Chevaleyre, François Sempé, Geber Ramalho (2004)
A theoretical analysis of multi-agent patrolling strategiesProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004.
Santosh Kumar, T. Lai, A. Arora (2005)
Barrier coverage with wireless sensorsWireless Networks, 13
Aydano Machado, Geber Ramalho, Jean-Daniel Zucker, A. Drogoul (2002)
Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures
P. Paruchuri, J. Pearce, Milind Tambe, F. Ordóñez, Sarit Kraus (2007)
An efficient heuristic approach for security against multiple adversaries
(1995)
Robots cleaning up hazardous waste
M. Golfarelli, D. Maio, S. Rizzi (2000)
A Task-Swap Negotiation Protocol Based on the Contract Net Paradigm
Yehuda Elmaliach, Asaf Shiloni, G. Kaminka (2008)
A realistic model of frequency-based multi-robot polyline patrolling
Noam Agmon, V. Sadov, G. Kaminka, Sarit Kraus (2008)
The impact of adversarial knowledge on adversarial planning in perimeter patrol
Y. Gabriely, E. Rimon (2003)
Competitive on-line coverage of grid environments by a mobile robotComput. Geom., 24
I. Wagner, M. Lindenbaum, A. Bruckstein (1999)
Distributed covering by ant-robots using evaporating tracesIEEE Trans. Robotics Autom., 15
M. Dias, R. Zlot, N. Kalra, A. Stentz (2006)
Market-Based Multirobot Coordination: A Survey and AnalysisProceedings of the IEEE, 94
A Almeida, GL Ramalho, HP Santana, P Tedesco, TR Menezes, V Corruble, Y Chevaleyre (2004)
Advances in Artificial Intelligence SBIA 2004: 17th Brazilian Symposium on Artificial Intelligence
Y. Chevaleyre (2004)
Theoretical analysis of the multi-agent patrolling problemProceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).
R. Shyamasundar (1996)
Introduction to algorithmsResonance, 1
Noam Hazon, G. Kaminka (2008)
On redundancy, efficiency, and robustness in coverage for multiple robotsRobotics Auton. Syst., 56
Kjerstin Williams, J. Burdick (2006)
Multi-robot boundary coverage with plan revisionProceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
I. Wagner, M. Lindenbaum, A. Bruckstein (2000)
MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown DomainsThe International Journal of Robotics Research, 19
Noam Agmon, Sarit Kraus, G. Kaminka (2008)
Multi-robot perimeter patrol in adversarial settings2008 IEEE International Conference on Robotics and Automation
Y. Cheva (2004)
Theoretical analysis of the multi-agent patrolling problem
Yi Guo, Z. Qu (2004)
Coverage control for a mobile robot patrolling a dynamic and uncertain environmentFifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788), 6
Boyoon Jung, G. Sukhatme (2002)
Tracking Targets Using Multiple Robots: The Effect of Environment OcclusionAutonomous Robots, 13
Mazda Ahmadi, P. Stone (2006)
A multi-robot system for continuous area sweeping tasksProceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
A. Almeida, Geber Ramalho, Hugo Santana, Patrícia Tedesco, T. Menezes, V. Corruble, Y. Chevaleyre (2004)
Recent Advances on Multi-agent Patrolling
Yi Guo, L. Parker (2003)
Towards Collaborative Robots for Infrastructure Security Applications
Noam Agmon, Noam Hazon, G. Kaminka (2008)
The giving tree: constructing trees for efficient offline and online multi-robot coverageAnnals of Mathematics and Artificial Intelligence, 52
Reid Smith (1980)
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem SolverIEEE Transactions on Computers, C-29
and as an in
Y. Gabriely, E. Rimon (2001)
Spanning-tree based coverage of continuous areas by a mobile robotAnnals of Mathematics and Artificial Intelligence, 31
Yehuda Elmaliach, Asaf Shiloni, G. Kaminka (2008)
Frequency-Based Multi-Robot Fence Patrolling
VM Yanovski, IA Wagner, AM Bruckstein (2003)
A distributed ant algorithm for efficiently patrolling a networkAlgorithmica, 37
Patrolling involves generating patrol paths for mobile robots such that every point on the paths is repeatedly covered. This paper focuses on patrolling in closed areas, where every point in the area is to be visited repeatedly by one or more robots. Previous work has often examined paths that allow for repeated coverage, but ignored the frequency in which points in the area are visited. In contrast, we first present formal frequency-based optimization criteria used for evaluation of patrol algorithms. Then, we present a patrol algorithm that guarantees maximal uniform frequency, i.e., each point in the target area is covered at the same optimal frequency. This solution is based on finding a circular path that visits all points in the area, while taking into account terrain directionality and velocity constraints. Robots are positioned uniformly along this path in minimal time, using a second algorithm. Moreover, the solution is guaranteed to be robust in the sense that uniform frequency of the patrol is achieved as long as at least one robot works properly. We then present a set of algorithms for handling events along the patrol path. The algorithms differ in the way they handle the event, as a function of the time constraints for handling them. However, all the algorithms handle events while maintaining the patrol path, and minimizing the disturbance to the system.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jul 2, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.