Journal
IEEE CONTROL SYSTEMS LETTERS
Volume 7, Issue -, Pages 2527-2532Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCSYS.2023.3288492
Keywords
Distributed optimization; hitting times; Markov chains; robotic surveillance
Categories
Ask authors/readers for more resources
Markov chains are increasingly being used for persistent robotic surveillance. The motivations for this choice are easy implementation, unpredictable surveillance patterns, and well-studied mathematics. However, applying previous results to scenarios with multiple agents can lead to intractable algorithms due to increased dimensionality.
Markov chains have been increasingly used to define persistent robotic surveillance schemes. Motivations for this design choice include their easy implementation, unpredictable surveillance patterns, and their well-studied mathematical background. However, applying previous results to scenarios with multiple agents can significantly increase the dimension of the problem, leading to intractable algorithms. In this letter we analyze the hitting time minimization problem for multiple agents moving over a finite graph. We exploit the structure of this problem to propose a tractable algorithm to design Markov chains to cover the graph with multiple interacting agents. Using mathematical analysis, we provide guarantees for the convergence of our proposed solution. Also, through numerical simulations, we show the performance of our approach compared to the current state of art in multi-agent scenarios.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available