By Topic

Multi-objective multi-robot surveillance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Delle Fave, F.M. ; D. I. S. Sapienza Univ. of Rome, Rome ; Canu, S. ; Iocchi, L. ; Nardi, D.
more authors

In many surveillance applications, there are different properties of the environment to check. For example, in the case of robots surveilling an industrial depot, one could be interested in verifying for fire alarms, intrusion alarms or bio-hazards. It is very hard to characterize the solution of this problem in terms of a unique utility function. Indeed, this would require to define a measure of the tradeoff among objectives, which are, by definition, incommensurable quantities. These tradeoffs should be tuned according to contingencies which is, in general, a very difficult task. We present in this paper, an approach to address such issues. We define a multi-robot multi-objective surveillance problem and show how this can be solved by a particular type of heuristic graph search used in the field of multi-objective optimization. The approach has been experimented based on an off-line planner including simulated and real robot plan execution results.

Published in:

Autonomous Robots and Agents, 2009. ICARA 2009. 4th International Conference on

Date of Conference:

10-12 Feb. 2009