Moving targets tracking and observing in a distributed mobile sensor network

Abstract

Tracking and observing multiple dynamic targets is an important task in mobile sensor networks. This paper presents a novel approach to the problem of sensor splitting/merging for a mobile sensor network to track and observe multiple targets in a dynamic fashion. In this approach, a seed growing graph partition (SGGP) algorithm is proposed to solve the splitting/merging problem. Furthermore, during the process of tracking, collision avoidance and velocity matching among mobile sensors are guaranteed. To demonstrate the benefit of the SGGP algorithm in term of the total energy and time consumption when sensors split, we compare the SGGP with a random selection (RS) algorithm. Numerical experimental tests validate our theoretical results.

Distributed motion control algorithm for fission behavior of flocks

“…It is relevant to numerous applications such as multiple targets tracking, multiple sites surveillance and monitoring [9]. In these applications, it often requires some agents to split from the existing group to execute new tasks located at different places.…”

“…La et. al [9] used the seed growing graph partition algorithm to solve the splitting problem for a mobile sensor network in a dynamic fashion. Recently, Chen et.…”

Swarm splitting and multiple targets seeking in multi-agent dynamic systems

“…For a robot team, it is a natural idea to split the team into groups for avoidance of obstacles or searching tasks. Also, in the problem of multiple targets tracking in mobile sensor network, it often requires some sensors to split from the existing formation to track new targets [15], [16]. In addition, other factors like the need of distinction or segregation of agents of different types, and the presence of adversarial agents, may lead to splitting in MASs as well.…”

“…For a swarm of heterogeneous agents, it is shown in [20] that flocking and segregation can be realized by adjusting magnitudes of interaction potentials between different types of agents. Besides, the seed growing graph partition (SGGP) algorithm is given as a splitting/merging strategy in [15] to solve the multiple targets tracking problem in mobile sensor network. In this paper, we consider the problem of dynamically splitting/rejoining control of an MAS consisting of a large number of identical agents with limited sensing range.…”

Information fusion and cooperative control for target search and localization in multi-agent sensor networks

“…Compared with the stationary sensor networks, robotic sensor networks have more advantages such as the adaptation to environmental changes and reconfigurability for better sensing performance. Extensive studies have been carried out on robotic sensor networks [19][20][21]. In the near future, large number of robots will coordinate their actions through ad-hoc communication networks and perform challenging tasks including manipulation in hazardous environments, exploration, environmental monitoring for intruder detection and interception.…”