Optimal Control of Mobile Agents for Monitoring of Points on a Network

Open access


This paper concerns the problems of finding optimal trajectories between nodes on a network, which must be periodically surveyed, and probably serviced. It is shown, that such trajectories may be generated if optimal Hamiltonian cycles are used between the separate network nodes under inspection. It is known that the Hamiltonian path problem is NP-complete, but an edge decomposition of the network is proposed. This is performed by reducing in a particular way to network flow circulations. The requirements and the equations for describing such circulation are pointed out. Defining of the optimal circulations of the mobile agents is reduced to network flow programming problems. A numerical example is presented for solving a similar class of monitoring problems by mobile agents.


  • 1. Pennsylvania Bracing for Possible Fight to Protect Military Bases. State Sen. Richard Alloway and U.S. Rep. Bill Shuster Prepare to Defend Letterkenny Army Depot. http://articles.herald-mail.com/2012-02-08/news/31040178_1_mili-tary-bases-brac-process-closure-process.

  • 2. Tooele Army Depot. http://en.wikipedia.org/wiki/Tooele_Army_Depot.

  • 3. Risk Management in Warehouses. Subba Rao. http://www.cholarisk.com/uploads/ risk%20management%20in%20warehouse.pdf.

  • 4. Christofides, N. Graph Theory: an Algorithmic Approach. Academic Press Inc. (London) Ltd., 1975. http://mayerle.deps.prof.ufsc.br/private/eps6405/Cap%2001.pdf.

  • 5. Sgurev, V. Network Flows with General Constraints. Sofia, Publishing House of the Bulgarian Academy of Sciences, 1991.

  • 6. Genova, K., L. Kirilov, V. Guliashki, B. Staykov, D. Vatov. A Prototype of a Web-based Decision Support System for Building Models and Solving Optimization and Decision Making Problems. Proceedings of XII International Conference on Computer Systems and Technologies – CompSysTech'11 (Eds. B. Rachev, A. Smrikarov), Wien, Austria, 16-17 June 2011, ACM ISBN 978-1-4503-0917-2, ACM ICPS, 578, 2011, 167-172. http://weboptim.iinf.bas.bg/.

  • 7. Real Time Scheduling Theory: A Historical Perspective. Lui Sha (Editor), University of Illinois at Urbana Champaign, Tarek Abdelzaher, University of Virgina et al. http://www.cs.uiuc.edu/class/sp08/cs598tar/Papers/Sha04-RTSJ.pdf.

  • 8. Chen, Xu. Fast Patrol Route Planning in Dynamic Environments. Systems, Man and Cybernetics, Part A: Systems and Humans. – IEEE Transactions on, 42, 4. http://ieeexplore.ieee.org/xpl/ login.jsp?tp=&arn umber=6153388&url =http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F3468 %2F4359265 %2F06153388.pdf%3Farnumber%3D6153388.

  • 9. The Patrol Route Monitor: a Modern Approach to Threshold Analysis. By Christopher W. Bruce, President, International Association of Crime Analysts. 31 May 2008. http://www.iaca.net/Resources/Articles/PRM.pdf.

  • 10. http://www.infoteksoftware.com/guard-patrolling-avi.htm.

Information Technologies and Control

The Journal of Institute of Information and Communication Technologies of Bulgarian Academy of Sciences

Journal Information


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 27 27 21
PDF Downloads 3 3 2