2000 character limit reached
Multi-Agent Team Access Monitoring: Environments that Benefit from Target Information Sharing
Published 28 Mar 2024 in cs.RO and cs.MA | (2403.19375v1)
Abstract: Robotic access monitoring of multiple target areas has applications including checkpoint enforcement, surveillance and containment of fire and flood hazards. Monitoring access for a single target region has been successfully modeled as a minimum-cut problem. We generalize this model to support multiple target areas using two approaches: iterating on individual targets and examining the collections of targets holistically. Through simulation we measure the performance of each approach on different scenarios.
- D. Galula, Counterinsurgency Warfare: Theory and Practice. Praeger Security International, 2006.
- M. W. Otte, “An emergent group mind across a swarm of robots: Collective cognition and distributed sensing via a shared wireless neural network,” The International Journal of Robotics Research, vol. 37, pp. 1017 – 1061, 2018.
- SwarmTex, “Teams demonstrate swarm tactics in fourth major offset field experiment,” 2018.
- M. Gupta, M. C. Lin, D. Manocha, H. Xu, and M. Otte, “Monitoring access to user defined areas with multi-agent team in urban environments,” in 2019 International Symposium on Multi-Robot and Multi-Agent Systems (MRS), (New Brunswick, NJ, USA), pp. 56–62, IEEE, Aug 2019.
- O. Goldschmidt and D. Hochbaum, “Polynomial algorithm for the k-cut problem,” in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp. 444–451, 1988.
- F. Katsilieris, M. Lindhe, and D. V. Dimarogonas, “Demonstration of multi-robot search and secure,” (Anchorage, AK, USA), IEEE, 2010.
- G. Kazazakis and A. Argyros, “Fast positioning of limited-visibility guards for the inspection of 2D workspaces,” in IEEE/RSJ International Conference on Intelligent Robots and System, vol. 3, (Lausanne, Switzerland), p. 2843–2848, IEEE, 2002.
- V. Isler, S. Kannan, and S. Khanna, “Randomized pursuit-evasion in a polygonal environment,” IEEE Transactions on Robotics, vol. 21, p. 875–884, Oct 2005.
- C. Cachin, R. Guerraoui, and L. Rodrigues, “Introduction to reliable and secure distributed programming,” pp. 44–47, Springer Publishing Company, Incorporated, 2011.
- S. Gilbert and N. Lynch, “Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services,” SIGACT News, vol. 33, p. 51–59, jun 2002.
- S. James, R. Raheb, and A. Hudak, “UAV swarm path planning,” in 2020 Integrated Communications Navigation and Surveillance Conference (ICNS), (Herndon, VA, USA), pp. 2G3–1–2G3–12, IEEE, Sep 2020.
- L. S. Marcolino and L. Chaimowicz, “Traffic control for a swarm of robots: Avoiding group conflicts,” in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, (St. Louis, MO, USA), pp. 1949–1954, IEEE, Oct 2009.
- Cham: Springer International Publishing, 2018.
- A. Bajcsy, S. Herbert, D. Fridovich-Keil, J. Fisac, S. Deglurkar, A. Dragan, and C. Tomlin, “A scalable framework for real-time multi-robot, multi-human collision avoidance,” in 2019 International Conference on Robotics and Automation, ICRA 2019, Proceedings - IEEE International Conference on Robotics and Automation, (United States), pp. 936–943, Institute of Electrical and Electronics Engineers Inc., May 2019.
- A. Desai, I. Saha, J. Yang, S. Qadeer, and S. Seshia, “Drona: A framework for safe distributed mobile robotics,” in Proceedings of the 8th International Conference on Cyber-Physical Systems, ACM, 2017.
- A. Kolling and S. Carpin, “The graph-clear problem: definition, theoretical properties and its connections to multirobot aided surveillance,” in 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, (San Diego, CA, USA), p. 1003–1008, IEEE, Oct 2007.
- A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring network structure, dynamics, and function using networkx,” in Proceedings of the 7th Python in Science Conference (G. Varoquaux, T. Vaught, and J. Millman, eds.), (Pasadena, CA USA), pp. 11–15, 2008.
Paper Prompts
Sign up for free to create and run prompts on this paper.
