In this paper, we proposed a novel method to solve the coverage control problem of sensor networks in the Internet of Things (IoT). The coverage control is an important index to evaluate the performance of network ser...
详细信息
In this paper, we proposed a novel method to solve the coverage control problem of sensor networks in the Internet of Things (IoT). The coverage control is an important index to evaluate the performance of network services. Ensuring the quality of network services, it is mainly to maximize the coverage of the network and minimize the energy consumption at the same time for the purpose of extending the network life cycle effect. Because of the overlay redundancy, it adopts the sleeping scheduling mechanism of nodes. The optimal solution is obtained after utilizing the coverage rate and the node sleep rate as the optimization objective function. Particle swarm optimization (PSO) is a group intelligent optimization algorithm. In practical applications, PSO often convergence in the local optimal solution prematurely. In order to balance the global search ability and convergence speed of PSO, We have improved the PSO based on the resampling technique, named resampled PSO (RPSO). The RPSO can not only maintain the diversity of the population, which can avoid premature convergence of the algorithm to some extent, but also ensure that each particle is active, reducing the calculation of redundancy, thereby improving the efficiency of the algorithm. The experimental results show that the RPSO can deal with complex multipeak optimization problem efficiently and reliably. Then the RPSO is used to solve the coverage control problem of sensor networks in IoT and has a great performance.
Distributed network systems can be utilized to measure environmental conditions such as temperature, sound, pollution levels, humidity, wind, and so on. Multiple autonomously moving mobile sensors are used to construc...
详细信息
Distributed network systems can be utilized to measure environmental conditions such as temperature, sound, pollution levels, humidity, wind, and so on. Multiple autonomously moving mobile sensors are used to construct distributed sensor networks in an unknown cluttered 3-D workspace. The proposed strategy is to deploy mobile sensors (robots) sequentially and individually to extend the network until the network fully covers the entire open space. This strategy results in 3-D sensor networks without sensing holes and does not require global localization of a robot except for a single robot called the Communication Navigation Aid. The authors believe this article is unique in constructing sensor networks in 3-D workspaces cluttered with many obstacles. Moreover, this article presents an innovative recovery algorithm to handle sensor failures in the constructed network. Network connectivity is maintained while robots move in unknown 3-D cluttered environments. Once a robot is deployed at its designated location, it becomes localized in global coordinate systems. Utilizing MATLAB, the effectiveness of the proposed deployment methods is demonstrated.
A multiple unmanned aerial vehicle (MUAV) system is a group of vehicles that are designed with the aim to perform some collective behavior. coverage control is one of the most active research fields in MUAVs. As MUAVs...
详细信息
A multiple unmanned aerial vehicle (MUAV) system is a group of vehicles that are designed with the aim to perform some collective behavior. coverage control is one of the most active research fields in MUAVs. As MUAVs are nowadays widely used in many application areas, the research in the coverage control problem has become a hot point. Although several coverage control methods have been reported, there is a lack of work highlighting the features of these methods. In this paper, we present a survey of the most relevant works in this area, classifying the types of these works and describing the main contributions in their works.
This paper investigates the coverage problem for mobile sensor networks on a circle. The goal is to minimize the largest distance from any point on the circle to its nearest sensor while preserving the mobile sensors&...
详细信息
This paper investigates the coverage problem for mobile sensor networks on a circle. The goal is to minimize the largest distance from any point on the circle to its nearest sensor while preserving the mobile sensors' order. The coverage problem is translated into a multi-agent consensus problem by showing that the largest distance from any point to its nearest sensor is minimized if the counterclockwise distance between each sensor and its right neighbor reaches a consensus. Distributed control laws are also developed to drive the mobile agents to the optimal configuration with order preservation. Simulation results illustrate the effectiveness of the proposed control laws.
In this paper, we study a multi-vehicle coverage control problem in constant flow environments while taking into account both energy consumption and traveling time. More specifically, the metric (called the mixed ener...
详细信息
In this paper, we study a multi-vehicle coverage control problem in constant flow environments while taking into account both energy consumption and traveling time. More specifically, the metric (called the mixed energy-time metric) is a weighted sum of the energy consumption and the traveling time for a vehicle to travel from one point to another in constant flows when using the minimum energy control, and the objective is to find vehicle locations that can minimize the expected mixed energy-time required for the set of vehicles to cover a region. We propose a gradient based control law which is calculated based on refined approximated Voronoi cells (induced by the mixed energy-time metric) and of which the convergence is proved via Hybrid Systems Theory. Simulations show that the refined gradient based control can achieve similar performance as the exact gradient based control. (C) 2013 Elsevier Ltd. All rights reserved.
This paper addresses the coverage control problem for a network of mobile sensors with first-order discrete-time dynamics, where the goal is to minimize a coverage cost function which is defined as the largest distanc...
详细信息
This paper addresses the coverage control problem for a network of mobile sensors with first-order discrete-time dynamics, where the goal is to minimize a coverage cost function which is defined as the largest distance between any point on a circle and its nearest sensor. Since in practice sensors' moving speed is always upper bounded, there exist saturation constraints on the control inputs of the mobile sensors. In this paper, distributed coverage control laws with input saturation are developed to drive the sensors to the final configuration such that the coverage cost function is minimized. It is also shown that the spatial order of the mobile sensors is preserved throughout the network's evolution. As a result, collision avoidance between mobile sensors is always guaranteed.
This paper studies the problem of optimal coverage control over a convex bounded region by a group of unicycle-type mobile agents with constant speeds. We further assume that the constant speeds for different agents m...
详细信息
A coverage control algorithm in unknown environment is proposed for the multi-vehicle systems in this paper. The measurement white-noise is taken into consideration while learning the interest information online. The ...
详细信息
ISBN:
(纸本)9781479936465
A coverage control algorithm in unknown environment is proposed for the multi-vehicle systems in this paper. The measurement white-noise is taken into consideration while learning the interest information online. The Kalman Filter (KF) is introduced to eliminate the noise disturbance and provide us a set of accurately sampled-data. Then, we describe an adaptive algorithm to approximate the sensory function by using the sampled-data from KF. A decentralized adaptive control architecture is proposed to drive the vehicles converge to the optimal coverage configuration with the estimated Voronoi Centroids. Finally, simulations are carried out to demonstrate the adaptive estimation algorithm and show us that the multi-vehicle systems will converge to the optimal coverage configuration.
There are many applications have emerged in recent years using Multiple Autonomous Vehicles (MAVs). One of the problem in the domain of MAVs is search through an domain of interest which is commonly a dynamic terrain....
详细信息
ISBN:
(纸本)9781479967438
There are many applications have emerged in recent years using Multiple Autonomous Vehicles (MAVs). One of the problem in the domain of MAVs is search through an domain of interest which is commonly a dynamic terrain. Most researchers address this challenge considering some assumptions as small-scale terrain and infinite sensing range of the sensors. In this paper a search and coverage control algorithm for a large scale domain of interest will be developed which guarantees to achieve the desired amount data from each point in the domain. Also this research tries to prepare the proposed algorithm to cover the interesting domain by faulty robots. Finally simulations prove the ability of proposed algorithm to satisfy desired expectations. The novelty of this paper is to cover a domain by using sector-based sensors. The stability of the proposed algorithm is presented using Lyapunov stability theorem.
In the context of oil spill cleaning by autonomous vehicles in dynamic and uncertain environments, this paper presents a multi-resolution algorithm that seamlessly integrates the concepts of local navigation and globa...
详细信息
ISBN:
(纸本)9781479901784
In the context of oil spill cleaning by autonomous vehicles in dynamic and uncertain environments, this paper presents a multi-resolution algorithm that seamlessly integrates the concepts of local navigation and global navigation based on the sensory information;the objective here is to enable adaptive decision-making and online replanning of paths. The proposed algorithm provides a complete coverage of the search area for cleanup of the oil spills and does not suffer from the problem of having local minima, which is commonly encountered in potential-field-based methods. The efficacy of the algorithm is tested on a high-fidelity Player/Stage simulator for oil spill cleaning in a harbor, where the underlying oil weathering process is modeled as 2D random-walk particle tracking.
暂无评论