Abstract — We study the problem of using a small number of mobile sensors to monitor various threats in a geographical area. Using some recent results on stochastic sensor scheduling, we propose a stochastic sensor movement strategy. We present simple conditions under which it is not possible to maintain a bounded estimate error covariance for all the threats. We also study a simple sub-optimal algorithm to generate stochastic trajectories. Simulations are presented to illustrate the results. I
International audienceBarrier coverage problem in emerging mobile sensor networks has been an intere...
We investigate the problem of monitoring multiple targets using a single mobile sensor, with the goa...
In this work, without exploiting any location and distance information, distributed and randomized a...
We study the problem of using a small number of mobile sensors to monitor various threats in a geogr...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estima...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estima...
Mobile sensors cover more area over a period of time than same number of stationary sensors. However...
Many practical applications, such as search and rescue operations and environmental monitoring, invo...
Abstract — In robot deployment problems, the funda-mental issue is to optimize a steady state perfor...
We present an on-line decentralised algorithm for coordinating mobile sensors for a broad class of i...
We present an on-line decentralised algorithm for coordinating mobile sensors for a broad class of i...
Sensor movement is a basic feature of mobile wireless sensor networks. It has been the driving force...
Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors ...
Abstract. In this paper we propose an algorithm for the autonomous deployment of mobile sensors over...
Abstract—Barrier coverage problem in emerging mobile sensor networks has been an interesting researc...
International audienceBarrier coverage problem in emerging mobile sensor networks has been an intere...
We investigate the problem of monitoring multiple targets using a single mobile sensor, with the goa...
In this work, without exploiting any location and distance information, distributed and randomized a...
We study the problem of using a small number of mobile sensors to monitor various threats in a geogr...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estima...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estima...
Mobile sensors cover more area over a period of time than same number of stationary sensors. However...
Many practical applications, such as search and rescue operations and environmental monitoring, invo...
Abstract — In robot deployment problems, the funda-mental issue is to optimize a steady state perfor...
We present an on-line decentralised algorithm for coordinating mobile sensors for a broad class of i...
We present an on-line decentralised algorithm for coordinating mobile sensors for a broad class of i...
Sensor movement is a basic feature of mobile wireless sensor networks. It has been the driving force...
Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors ...
Abstract. In this paper we propose an algorithm for the autonomous deployment of mobile sensors over...
Abstract—Barrier coverage problem in emerging mobile sensor networks has been an interesting researc...
International audienceBarrier coverage problem in emerging mobile sensor networks has been an intere...
We investigate the problem of monitoring multiple targets using a single mobile sensor, with the goa...
In this work, without exploiting any location and distance information, distributed and randomized a...