Skip to main content

Advertisement

Springer Nature Link
Log in

Stochastic Multi-Robot Patrolling with Limited Visibility

  • Published:
Journal of Intelligent & Robotic Systems Aims and scope Submit manuscript

Abstract

Patrolling an environment with multiple robots is a problem with applicability to both military activities and other areas requiring security. In an adversarial environment, wireless communication between the robots may be jammed, and their sensor ranges may be limited to visibility. This increases the difficulty of the problem, but solutions will be widely applicable regardless of the environment. Robot paths that are deterministic can be observed and predicted by an adversary, permitting exploitation of known gaps in coverage. We also wish to avoid requirements for synchronization or a particular form of the environment. We, therefore, propose a method of finding patrolling policies for multiple robots that monitor any polygonal environment using limited visibility regions and non-deterministic patrolling paths. First, visibility regions are calculated for a subset of locations that cover the whole environment or a part of the environment. Then, we find distributed patrolling policies in the form of Markov chains, using convex optimization to minimize the average expected commute time for the subset of the locations permitting each robot to cover the whole environment independently. We also find centralized and Markov chain based patrolling policies that minimize the average expected commute time for the subset of locations permitting each robot to cover a part of the environment while communicating with a central base station. Finally, we evaluate the vulnerability of our patrolling policies by finding the probability of capturing an adversary and the maximum unguarded time for a location in our proposed patrolling scenarios. We present multiple simulation results and a physical implementation to show the effectiveness of our visibility-based non-deterministic patrolling method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Agmon, N., Fok, C.L., Emaliah, Y., Stone, P., Julien, C., Vishwanath, S.: On coordination in practical multi-robot patrol. In: Proc. IEEE International Conference on Robotics and Automation, pp 650–656 (2012)

  2. Agmon, N., Kaminka, G.A., Kraus, S.: Multi-robot adversarial patrolling: facing a full-knowledge opponent. J. Artif. Intell. Res. 42, 887–916 (2011)

    MathSciNet  MATH  Google Scholar 

  3. Alam, T.: Decentralized and nondeterministic multi-robot area patrolling in adversarial environments. Int. J. Comput. Appl. 156(2), 1–8 (2016)

    Google Scholar 

  4. Alam, T., Edwards, M., Bobadilla, L., Shell, D.: Distributed multi-robot area patrolling in adversarial environments. In: International Workshop on Robotic Sensor Networks (2015)

  5. Alam, T., Rahman, M.M., Bobadilla, L., Rapp, B.: Multi-vehicle patrolling with limited visibility and communication constraints. In: Proc. IEEE Conference on Military Communications, pp. 465–470 (2017)

  6. Asghar, A.B., Smith, S.L.: Stochastic patrolling in adversarial settings. In: Proc. American Control Conference, pp. 6435–6440 (2016)

  7. Bai, C., Greenhalgh, S., Zhou, B.: 3D ray tracing using a modified shortest-path method. Geophysics 72(4), T27–T36 (2007)

    Article  Google Scholar 

  8. Basilico, N., Chung, T.H., Carpin, S.: Distributed online patrolling with multi-agent teams of sentinels and searchers. In: Proc. International Symposium on Distributed Autonomous Robotic Systems, pp 3–16. Springer (2016)

  9. Basilico, N., Gatti, N., Amigoni, F.: Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In: Proc. International Conference on Autonomous Agents and Multiagent Systems. Foundation for autonomous agents and multiagent systems, pp 57–64 (2009)

  10. Basilico, N., Gatti, N., Villa, F.: Asynchronous multi-robot patrolling against intrusions in arbitrary topologies. In: Proc. Twenty-Fourth AAAI Conference on Artificial Intelligence, pp 1224–1229 (2010)

  11. Bhadauria, D., Tekdas, O., Isler, V.: Robotic data mules for collecting data over sparse sensor fields. J. Field Rob. 28(3), 388–404 (2011)

    Article  Google Scholar 

  12. Bof, N., Carli, R., Cenedese, A., Schenato, L.: Asynchronous distributed camera network patrolling under unreliable communication. IEEE Trans. Autom. Control 62(11), 5982–5989 (2017)

    Article  MathSciNet  Google Scholar 

  13. Boyd, S.: Convex optimization of graph Laplacian eigenvalues. In: Proc. International Congress of Mathematicians, pp. 1311–1319 (2006)

  14. Căilean, A.M., Dimian, M.: Current challenges for visible light communications usage in vehicle applications: a survey. IEEE Commun. Surv. Tutorials 19(4), 2681–2703 (2017)

    Article  Google Scholar 

  15. Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. Discrete Comput. Geom. 22(3), 377–402 (1999)

    Article  MathSciNet  Google Scholar 

  16. Chevaleyre, Y., Sempe, F., Ramalho, G.: A theoretical analysis of multi-agent patrolling strategies. In: Proc. IEEE International Conference on Autonomous Agents and Multiagent Systems, pp. 1524–1525 (2004)

  17. Chin, W., Ntafos, S.: Optimum watchman routes. Inf. Process. Lett. 28(1), 39–44 (1988)

    Article  MathSciNet  Google Scholar 

  18. Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979)

    Article  MathSciNet  Google Scholar 

  19. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  20. Du, J., Zheng, P., Xie, Z., Yang, Y., Chu, H., Yu, G.: Research on path planning algorithm based on security patrol robot. In: Proc. IEEE International Conference on Mechatronics and Automation, pp. 1030–1035 (2016)

  21. Durand, F., Drettakis, G., Puech, C.: The 3D visibility complex. ACM Trans. Graph. 21(2), 176–206 (2002)

    Article  Google Scholar 

  22. El Gindy, H., Avis, D.: A linear algorithm for computing the visibility polygon from a point. Journal of Algorithms 2(2), 186–197 (1981)

    Article  MathSciNet  Google Scholar 

  23. Farinelli, A., Iocchi, L., Nardi, D.: Distributed on-line dynamic task assignment for multi-robot patrolling. Auton. Robot. 41(6), 1321–1345 (2017)

    Article  Google Scholar 

  24. Fazli, P., Davoodi, A., Pasquier, P., Mackworth, A.K.: Complete and robust cooperative robot area coverage with limited range. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5577–5582 (2010)

  25. Freimer, M., Kollia, G., Mudholkar, G.S., Lin, C.T.: A study of the generalized Tukey lambda family. Communications in Statistics-Theory and Methods 17(10), 3547–3567 (1988)

    Article  MathSciNet  Google Scholar 

  26. Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. SIAM Rev. 50(1), 37–66 (2008)

    Article  MathSciNet  Google Scholar 

  27. Grant, M., Boyd, S., Ye, Y.: CVX: Matlab software for disciplined convex programming. Available at http://cvxr.com/cvx/examples/ (2008)

  28. Iocchi, L., Marchetti, L., Nardi, D.: Multi-robot patrolling with coordinated behaviours in realistic environments. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2796–2801 (2011)

  29. Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion in a polygonal environment. IEEE Trans. Robot. 21(5), 875–884 (2005)

    Article  Google Scholar 

  30. Juarez, J.C., Dwivedi, A., Hammons, A.R., Jones, S.D., Weerackody, V., Nichols, R.A.: Free-space optical communications for next-generation military networks. IEEE Commun. Mag. 44(11), 46–51 (2006)

    Article  Google Scholar 

  31. Kartal, B., Godoy, J., Karamouzas, I., Guy, S.J.: Stochastic tree search with useful cycles for patrolling problems. In: Proc. IEEE International Conference on Robotics and Automation, pp. 1289–1294 (2015)

  32. King, R., Dean, B., Klinke, S.: gld: Estimation and use of the generalised Tukey lambda distribution. R package version 2(4). Available at https://cran.r-project.org/web/packages/gld/ (2016)

  33. Lauri, F., Koukam, A.: Hybrid ACO/EA algorithms applied to the multi-agent patrolling problem. In: Proc. IEEE Congress on Evolutionary Computation, pp. 250–257 (2014)

  34. Lee, C.Y.: An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10(3), 346–365 (1961)

    Article  MathSciNet  Google Scholar 

  35. Lien, J.M., Amato, N.M.: Approximate convex decomposition of polygons. Comput. Geom. 35(1-2), 100–123 (2006)

    Article  MathSciNet  Google Scholar 

  36. Marino, A., Parker, L.E., Antonelli, G., Caccavale, F.: A decentralized architecture for multi-robot systems based on the null-space-behavioral control with application to multi-robot border patrolling. J. Intell. Robot. Syst. 71(3-4), 423–444 (2013)

    Article  Google Scholar 

  37. Muaafa, M., Ramirez-Marquez, J.E.: Bi-objective evolutionary approach to the design of patrolling schemes for improved border security. Comput. Ind. Eng. 107, 74–84 (2017)

    Article  Google Scholar 

  38. Obermeyer, K.J.: Contributors: the visibility library. Available at http://www.visilibity.org/ (2008)

  39. Paruchuri, P., Pearce, J.P., Marecki, J., Tambe, M., Ordonez, F., Kraus, S.: Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. In: Proc. International Conference on Autonomous Agents and Multiagent Systems, pp. 895–902 (2008)

  40. Pasqualetti, F., Durham, J.W., Bullo, F.: Cooperative patrolling via weighted tours: Performance analysis and distributed algorithms. IEEE Trans. Robot. 28(5), 1181–1188 (2012)

    Article  Google Scholar 

  41. Pippin, C., Christensen, H., Weiss, L.: Performance based task assignment in multi-robot patrolling. In: Proc. ACM Symposium on Applied Computing, pp. 70–76 (2013)

  42. Portugal, D., Couceiro, M.S., Rocha, R.P.: Applying Bayesian learning to multi-robot patrol. In: Proc. IEEE International Symposium on Safety, Security, and Rescue Robotics, pp. 1–6 (2013)

  43. Portugal, D., Pippin, C., Rocha, R.P., Christensen, H.: Finding optimal routes for multi-robot patrolling in generic graphs. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 363–369 (2014)

  44. Portugal, D., Rocha, R.: Msp Algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning. In: Proc. ACM Symposium on Applied Computing, pp. 1271–1276 (2010)

  45. Portugal, D., Rocha, R.: A survey on multi-robot patrolling algorithms. Technological Innovation for Sustainability, pp. 139–146 (2011)

  46. Portugal, D., Rocha, R.P.: Distributed multi-robot patrol: a scalable and fault-tolerant framework. Robot. Auton. Syst. 61(12), 1572–1587 (2013)

    Article  Google Scholar 

  47. Portugal, D., Rocha, R.P.: Multi-robot patrolling algorithms: examining performance and scalability. Adv. Robot. 27(5), 325–336 (2013)

    Article  Google Scholar 

  48. Portugal, D., Rocha, R.P.: Scalable, fault-tolerant and distributed multi-robot patrol in real world environments. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4759–4764 (2013)

  49. Portugal, D., Rocha, R.P.: Cooperative multi-robot patrol with Bayesian learning. Auton. Robot. 40(5), 929–953 (2016)

    Article  Google Scholar 

  50. Portugal, D., Rocha, R.P.: Performance estimation and dimensioning of team size for multirobot patrol. IEEE Intell. Syst. 32(6), 30–38 (2017)

    Article  Google Scholar 

  51. Romeo, M., Banfi, J., Basilico, N., Amigoni, F.: Multirobot persistent patrolling in communication-restricted environments. In: Proc. International Symposium on Distributed Autonomous Robotic Systems, pp. 59–71 (2018)

    Chapter  Google Scholar 

  52. Sless, E., Agmon, N., Kraus, S.: Multi-robot adversarial patrolling: facing coordinated attacks. In: Proc. International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1093–1100 (2014)

  53. Stiffler, N.M., Kolling, A., O’Kane, J.M.: Persistent pursuit-evasion: the case of the preoccupied pursuer. In: Proc. IEEE International Conference on Robotics and Automation, pp. 5027–5034 (2017)

  54. Stiffler, N.M., O’Kane, J.M.: Shortest paths for visibility-based pursuit-evasion. In: Proc. IEEE International Conference on Robotics and Automation, pp. 3997–4002 (2012)

  55. Stiffler, N.M., O’Kane, J.M.: A complete algorithm for visibility-based pursuit-evasion with multiple pursuers. In: Proc. IEEE International Conference on Robotics and Automation, pp. 1660–1667 (2014)

  56. Stranders, R., De Cote, E.M., Rogers, A., Jennings, N.R.: Near-optimal continuous patrolling with teams of mobile information gathering agents. Artif. Intell. 195, 63–105 (2013)

    Article  MathSciNet  Google Scholar 

  57. Su, S.: Numerical maximum log likelihood estimation for generalized lambda distributions. Comput. Stat. Data Anal. 51(8), 3983–3998 (2007)

    Article  MathSciNet  Google Scholar 

  58. Tokekar, P., Kumar, V.: Visibility-based persistent monitoring with robot teams. In: Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3387–3394 (2015)

Download references

Acknowledgements

The author would like to acknowledge the financial support of a Florida International University Graduate School Dissertation Year Fellowship. This material is based in part upon work supported by the U.S. Department of Homeland Security under Grant Award Number 2017–ST–062–000002. This work was also supported in part by ARO grant 67736CSII.

Author information

Authors and Affiliations

  1. Department of Computer Science, Louisiana State University, Shreveport, LA, USA

    Tauhidul Alam

  2. School of Computing and Information Sciences, Florida International University, Miami, FL, USA

    Md. Mahbubur Rahman, Pedro Carrillo & Leonardo Bobadilla

  3. Army Research Lab, Adelphi, MD, USA

    Brian Rapp

Authors
  1. Tauhidul Alam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Md. Mahbubur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro Carrillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leonardo Bobadilla
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Brian Rapp
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tauhidul Alam.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alam, T., Rahman, M.M., Carrillo, P. et al. Stochastic Multi-Robot Patrolling with Limited Visibility. J Intell Robot Syst 97, 411–429 (2020). https://doi.org/10.1007/s10846-019-01039-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10846-019-01039-5

Keywords