Stochastic Distributed Algorithms for Target Surveillance

In this paper we investigate problems of target surveillance with the aim of building a general framework for the evaluation of the performance of a system of autonomous agents. To this purpose we propose a class of semi-distributed stochastic navigation algorithms, that drive swarms of autonomous scouts to the surveillance of grounded targets, and we provide a novel approach to performance estimation based on analysing sequential observations of the system’s state with information theoretical techniques. Our goal is to achieve a deeper understanding of the interrelations between randomness, resource consumption and ergodicity of a decentralized control system in which the decision-making process is stochastic.

[1]  John T. Wen,et al.  Real-time robot motion control with circulatory fields , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[2]  Didier Keymeulen,et al.  The fluid dynamics applied to mobile robot motion: the stream field method , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[3]  John N. Tsitsiklis,et al.  Gradient Convergence in Gradient methods with Errors , 1999, SIAM J. Optim..

[4]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[7]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract) , 1990, ICALP.

[8]  D. Bertsekas Gradient convergence in gradient methods , 1997 .