Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Multi-agent autonomous surveillance: a framework based on stochastic reachability and hierarchical task allocation

Author(s):

N. Kariotoglou, D. M. Raimondo, S. Summers, J. Lygeros
Conference/Journal:

ASME J. Dynamic Systems, Measurement & Control, Special Issue on Stochastic Models, Control, and Algorithms in Robotics
Abstract:

We develop and implement a framework to address autonomous surveillance problems with a collection of pantilt (PT) cameras. Using tools from stochastic reachability with random sets we formulate the problems of target acquisition, target tracking and acquisition while tracking as reach-avoid dynamic programs for Markov decision processes (MDPs). It is well known that solution methods for MDP problems based on dynamic programming, implemented by state space gridding, suffer from the curse of dimensionality. This becomes a major limitation when one considers a network of PT cameras. To deal with larger problems we propose a hierarchical task allocation mechanism that allows cameras to calculate reach-avoid objectives independently while achieving tasks collectively. We evaluate the proposed algorithms experimentally on a setup involving industrial PT cameras and mobile robots as targets.

Year:

2014
Type of Publication:

(01)Article
Supervisor:

J. Lygeros

File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { KarEtal:2014:IFA_4753,
    author={N. Kariotoglou and D. M. Raimondo and S. Summers and J. Lygeros},
    title={{Multi-agent autonomous surveillance: a framework based on
	  stochastic reachability and hierarchical task allocation}},
    journal={ASME J. Dynamic Systems, Measurement \& Control},
    year={2014},
    volume={},
    number={},
    pages={},
    month=mar,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=4753}
}
Permanent link