Stochastic event capture using mobile sensors subject to a quality metric

被引:41
作者
Bisnik, Nabhendra [1 ]
Abouzeid, Alhussein A.
Isler, Volkan
机构
[1] Rensselaer Polytech Inst, Dept Elect Comp & Syst Engn, Troy, NY 12180 USA
[2] Rensselaer Polytech Inst, Dept Comp Sci, Troy, NY 12180 USA
基金
美国国家科学基金会;
关键词
algorithms; mobile robot motion planning; mobile sensor networks; robot sensing systems;
D O I
10.1109/TRO.2007.900628
中图分类号
TP24 [机器人技术];
学科分类号
080202 [机械电子工程]; 1405 [智能科学与技术];
摘要
Mobile sensors cover more area over a fixed period of time than do the same number of stationary sensors. However, the quality of coverage (QoC) achieved by mobile sensors depends on,the velocity, mobility pattern, number of mobile sensors deployed, and the dynamics of the phenomenon being sensed. The gains attained by mobile sensors over static sensors and the opti- mal motion strategies for mobile sensors are not well understood. In this paper, we consider the following event capture problem: the events of interest arrive at certain points in the sensor field and disappear according to known arrival and departure time distributions. An event is said to be captured if it is sensed by one of the mobile sensors before it fades away. We analyze how the QoC scales with velocity, path, and number of mobile sensors. We characterize cases where the deployment of mobile sensors has no advantage over static sensors, and find the optimal velocity pattern that a mobile sensor should adopt. We also present algorithms for two motion planning problems: 1) for a single sensor, what is the sensor trajectory and the minimum speed required to satisfy a bound on the event loss probability and 2) for sensors with fixed speed, what is the minimum number of sensors required to satisfy a bound on the event loss probability. When the robots are restricted to move along a line or a closed curve, our algorithms return the optimal velocity for the minimum velocity problem. For the minimum sensor problem, the number of sensors used is within a factor of 2 of the optimal solution. For the case where the events occur at arbitrary points on a plane, we present heuristic algorithms for the aforementioned motion planning problems and bound their performance with respect to the optimal.
引用
收藏
页码:676 / 692
页数:17
相关论文
共 40 条
[1]
[Anonymous], 2003, Proc. of the 23nd Int'l Conf. on Distributed Computing Systems, DOI DOI 10.1109/ICDCS.2003.1203449
[2]
ARSIE A, IN PREE INT J ROBUST
[3]
BATALIN MA, P 2 INT C EMB NETW S, P25
[4]
Bergbreiter S, 2003, IROS 2003: PROCEEDINGS OF THE 2003 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, P1632
[5]
Coordinated multi-robot exploration [J].
Burgard, W ;
Moors, M ;
Stachniss, C ;
Schneider, FE .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (03) :376-386
[6]
Coverage for robotics - A survey of recent results [J].
Choset, H .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 31 (1-4) :113-126
[7]
Clouqueur T., 2002, P 1 ACM INT WORKSH W, P42, DOI DOI 10.1145/570738.570745
[8]
Coverage control for mobile sensing networks [J].
Cortés, J ;
Martínez, S ;
Karatas, T ;
Bullo, F .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2004, 20 (02) :243-255
[9]
Dantu K, 2005, 2005 FOURTH INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS, P404
[10]
Dumitrescu A, 2001, SIAM PROC S, P38