ACM Home Page
Please provide us with feedback. Feedback
Differential games in large-scale sensor-actuator networks
Full text PdfPdf (271 KB)
Source Information Processing In Sensor Networks archive
Proceedings of the 5th international conference on Information processing in sensor networks table of contents
Nashville, Tennessee, USA
SESSION: Main track--mobile agents and routing table of contents
Pages: 77 - 84  
Year of Publication: 2006
ISBN:1-59593-334-4
Authors
Hui Cao  The Ohio State University
Emre Ertin  The Ohio State University
Vinodkrishnan Kulathumani  The Ohio State University
Mukundan Sridharan  The Ohio State University
Anish Arora  The Ohio State University
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 53,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1127777.1127792
What is a DOI?

ABSTRACT

Surveillance systems based on sensor network technology have been shown to successfully detect, classify and track targets of interest over a large area. State information collected via the sensor network also enables these systems to actuate mobile agents so as to achieve surveillance goals such as target capture and asset protection. But satisfying these goals is complicated by the fact that track information in a sensor network is routed to mobile agents through multi-hop communication links and is thus subject to delays and losses. In addition, as the sensor network is scaled in size, high throughput rates for all pursuers cannot be sustained at all times, which necessitates a network communication strategy that adapts to pursuer information requirements.In this paper, we concentrate on the formulation of optimal pursuit control strategies in the presence of network effects, assuming that target track information has been established locally in the sensor network. We adapt ideas from the theory of differential games to networked games --including ones involving non-periodic track updates, message losses and message delays-- to derive optimal strategies, bounds on the information requirements, and scaling properties of these bounds. Moreover, we present a specific network communication protocol which has the required scalable information characteristics and conclude with the results of experimental studies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
L. Schenato, S. Oh, and S. Sastry, "Swarm Coordination for Pursuit Evasion Games using Sensor Networks," in Proc. of the International Conference on Robotics and Automation, Barcelona, Spain, April 2005.
 
4
S. Oh, S. Russell, and S. Sastry, "Markov Chain Monte Carlo Data Association for General Multiple-Target Tracking Problems," in Proc. of the IEEE International Conference on Decision and Control, Paradise Island, Bahamas, Dec. 2004.
 
5
T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. SIAM, 2nd edition, 1999.
 
6
R. Isaacs, "Differential Games," Kruger Publishing Company, Huntington, NY, 1975.
 
7
H. Cao, E. Ertin and A. Arora "PEG game on a sensor network", OSU Technical Report, 2005.
 
8
J. Nash, "Noncooperative games," Annals of Mathematics, vol. 54, pp. 286--295, 1951.


Collaborative Colleagues:
Hui Cao: colleagues
Emre Ertin: colleagues
Vinodkrishnan Kulathumani: colleagues
Mukundan Sridharan: colleagues
Anish Arora: colleagues