skip to main content
10.1145/2480362.2480378acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Performance based task assignment in multi-robot patrolling

Authors Info & Claims
Published:18 March 2013Publication History

ABSTRACT

This article applies a performance metric to the multi-robot patrolling task to more efficiently distribute patrol areas among robot team members. The multi-robot patrolling task employs multiple robots to perform frequent visits to known areas in an environment, while minimizing the time between node visits. Conventional strategies for performing this task assume that the robots will perform as expected and do not address situations in which some team members patrol inefficiently. However, reliable performance of team members may not always be a valid assumption. This paper considers an approach for monitoring robot performance in a patrolling task and dynamically reassigning tasks from those team members that perform poorly. Experimental results from simulation and on a team of indoor robots demonstrate that in using this approach, tasks can be dynamically and more efficiently distributed in a multi-robot patrolling application.

References

  1. R. C. Arkin. Behavior-Based Robotics, chapter 9. Cambridge, Mass., MIT Press, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Beeson, N. Jong, and B. Kuipers. Towards autonomous topological place detection using the extended voronoi graph. In Robotics and Automation (ICRA), pages 4373--4379, April 2005.Google ScholarGoogle ScholarCross RefCross Ref
  3. D. P. Bertsekas. The auction algorithm for assignment and other network flow problems: A tutorial. Interfaces, 20(4):133--149, 1990.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Y. Chevaleyre. Theoretical analysis of the multi-agent patrolling problem. In Intelligent Agent Technology, 2004. (IAT 2004). Proceedings. IEEE/WIC/ACM International Conference on, pages 302--308, Sept. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Y. Elmaliach, N. Agmon, and G. Kaminka. Multi-robot area patrol under frequency constraints. In Robotics and Automation, 2007 IEEE International Conference on, pages 385--390, April 2007.Google ScholarGoogle ScholarCross RefCross Ref
  6. K.-S. Hwang, J.-L. Lin, and H.-L. Huang. Cooperative patrol planning of multi-robot systems by a competitive auction system. In ICCAS-SICE, 2009, pages 4359--4363, aug. 2009.Google ScholarGoogle ScholarCross RefCross Ref
  7. L. Iocchi, L. Marchetti, and D. Nardi. Multi-robot patrolling with coordinated behaviours in realistic environments. In Intelligent Robots and Systems (IROS), 2011 IEEE/RSJ International Conference on, pages 2796--2801, Sept. 2011.Google ScholarGoogle ScholarCross RefCross Ref
  8. A. S. Lewis and L. G. Weiss. Intelligent autonomy and performance metrics for multiple, coordinated UAVs. Integrated Computer-Aided Eng., 12(3):251--262, July 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Menezes, P. Tedesco, and G. Ramalho. Negotiator agents for the patrolling task. In J. Sichman, H. Coelho, and S. Rezende, editors, Advances in Artificial Intelligence - IBERAMIA-SBIA 2006, volume 4140 of Lecture Notes in Computer Science, pages 48--57. Springer Berlin/Heidelberg, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. T. Michael. How to Guard an Art Gallery and Other Discrete Mathematical Adventures. Baltimore: The Johns Hopkins University Press, 2009.Google ScholarGoogle Scholar
  11. L. E. Parker. ALLIANCE: An architecture for fault tolerant multi-robot cooperation. In IEEE Transactions on Robotics and Automation, volume 14, pages 220--240, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  12. F. Pasqualetti, A. Franchi, and F. Bullo. On optimal cooperative patrolling. In Decision and Control (CDC), 2010 49th IEEE Conference on, pages 7153--7158, Dec. 2010.Google ScholarGoogle ScholarCross RefCross Ref
  13. F. Pasqualetti, A. Franchi, and F. Bullo. On cooperative patrolling: Optimal trajectories, complexity analysis, and approximation algorithms. Robotics, IEEE Transactions on, 28(3):592--606, June 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Pippin and H. Christensen. Performance based monitoring using statistical control charts on multi-robot teams. In Information Fusion (FUSION), 2012 15th International Conference on, pages 390--395, July 2012.Google ScholarGoogle Scholar
  15. D. Portugal and R. Rocha. MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning. In Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10, pages 1271--1276, New York, NY, USA, 2010. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Portugal and R. Rocha. On the performance and scalability of multi-robot patrolling algorithms. In Safety, Security, and Rescue Robotics (SSRR), 2011 IEEE International Symposium on, pages 50--55, Nov. 2011.Google ScholarGoogle Scholar
  17. M. Quigley, B. Gerkey, K. Conley, J. Faust, T. Foote, J. Leibs, E. Berger, R. Wheeler, and A. Y. Ng. ROS: an open-source robot operating system. In Proceedings of the Open-Source Software workshop at the International Conference on Robotics and Automation (ICRA), 2009.Google ScholarGoogle Scholar
  18. E. Stump and N. Michael. Multi-robot persistent surveillance planning as a vehicle routing problem. In Automation Science and Engineering (CASE), 2011 IEEE Conference on, pages 569--575, Aug. 2011.Google ScholarGoogle ScholarCross RefCross Ref
  19. R. Vaughan. Massively multi-robot simulation in Stage. Swarm Intelligence, pages 189--208, 2008.Google ScholarGoogle Scholar

Index Terms

  1. Performance based task assignment in multi-robot patrolling

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
            March 2013
            2124 pages
            ISBN:9781450316569
            DOI:10.1145/2480362

            Copyright © 2013 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 18 March 2013

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader