By Topic

An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments

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

3 Author(s)
Fierro, R. ; Electr. & Comput. Eng. Dept., Univ. of New Mexico, Albuquerque, NM, USA ; Ferrari, S. ; Chenghui Cai

A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. The sensing-pursuit problem is motivated by the Marco polo game, in which the pursuer Marco must capture multiple mobile targets that are sensed intermittently, and with very limited information. In this paper we extend the results in [1] by providing (i) a complexity analysis of the proposed cell decomposition planning algorithm, and (ii) a testbed that allows to experimentally verify the applicability of the proposed pursuit methodology.

Published in:

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Date of Conference:

9-11 Dec. 2008