Related papers: Non-linear Barrier Coverage using Mobile Wireless …

Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers…

In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity,…

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of…

In this paper we study the dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors. As sensors move around, initially uncovered locations are likely to be covered at a later time. A larger…

Sensor networks are particularly applicable to the tracking of objects in motion. For such applications, it may not necessary that the whole region be covered by sensors as long as the uncovered region is not too large. This notion has been…

This paper Various studies cited in the literature deal with the classic problem of obstacle coverage, where the deployment environment, sensor nodes, and base stations have characteristics that are considered perfect but suffer from…

Wireless sensor networks consisting of great number of cheap and tiny sensor nodes which are used for military environment controlling, natural events recording, traffic monitoring, robot navigation, and etc. Such a networks encounter with…

This paper deals with random sensors initially randomly deployed on the line according to general random process and on the plane according to two independent general random processes. The mobile robot with carrying capacity $k$ placed at…

In this work, it is presented the development of a novel distributed algorithm performing robotic coverage, clustering and dispatch around an event in static-obstacle structured environments without relying on metric information.…

Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem. This problem arises in the context…

This paper proposes a new algorithm for collision-free coverage control of multiple non-cooperating swarms in the presence of bounded disturbances. A new methodology is introduced that accounts for uncertainties in disturbance measurements.…

This paper studies a graph-based sensor deployment approach in wireless sensor networks (WSNs). Specifically, in today's world, where sensors are everywhere, detecting various attributes like temperature and movement, their deteriorating…

This paper develops an algorithm that guides a multi-robot system in an unknown environment in search of fixed targets. The area to be scanned contains an unknown number of convex obstacles of unknown size and shape. The algorithm covers…

This paper presents a novel control algorithm for robotic manipulators in unstructured environments using proximity sensors partially distributed on the platform. The proposed approach exploits arrays of multi zone Time-of-Flight (ToF)…

A reactive obstacle avoidance method for mobile manipulators is presented. The objectives of the developed algorithm are twofold. The first one is to find a trajectory in the configuration space of a mobile manipulator so as to follow a…

In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or…

This paper proposes a novel swarm-based control algorithm for exploration and coverage of unknown environments, while maintaining a formation that permits short-range communication. The algorithm combines two elements: swarm rules for…

Shared autonomy blends operator intent with autonomous assistance. In cluttered environments, linear blending can produce unsafe commands even when each source is individually collision-free. Many existing approaches model obstacle…

This paper presents a solution to the problem of monitoring a region of interest (RoI) using a set of nodes that is not sufficient to achieve the required degree of monitoring coverage. In particular, sensing coverage of wireless sensor…

Wireless rechargeable sensor networks, consisting of sensor nodes with rechargeable batteries and mobile chargers to replenish their batteries, have gradually become a promising solution to the bottleneck of energy limitation that hinders…