The multi-robot system that combines flexibility and autonomy has unique advantages in many scenarios. In unknown environment, the threat posed by the environmental uncertainty to the path planning process cannot be ignored. The robots not only need to avoid obstacles, but also need to maintain communication with other robots to ensure timely negotiation. Inspired by the division of labor in biological community, this paper proposes robot behavior scheduling algorithm for multi-robot path planning in unknown environment with communication constraints. First, to avoid the occurrence of oscillation caused by a single force determining the robot behavior, the constituent elements of robot behavior are described in the form of multiple forces. Then, various robot behaviors are instantiated through a diverse combination of these elements and parameters. Finally, two complementary robot behavior scheduling methods are designed. The experiential potential field jointly constructed by robots is proposed to guide the robots to juggle avoidance, communication and planning task for the first time. The effectiveness of these behavior scheduling methods is verified in theory. The simulation experiment results based on real sensor parameters show that a small amount of robot detours can make the multi-robot system fully connected for 70% of the entire path planning process. Note to Practitioners—The motivation of this article is to avoid communication interruptions among robots when planning paths in unknown environment. When the robots perform the complex tasks, communication interruptions will lead to the inability of sharing environmental maps and allocation plans. The lack of such information may delay the task progress and even cause greater loss. This article focuses on the path planning demands in unknown environment and considers the automatic maintenance and reconstruction of the communication links among robots. Based on the analyses of the motivation in reaching the target point, avoiding obstacles, and maintaining communication and etc., we first model the constituent elements of robot behavior. Based on the designed robot behavior, the robot behavior scheduling algorithm is proposed. The experiment results demonstrate that the effectiveness of the proposed algorithm is not affected by the changes in task scenarios, signal loss conditions and the number of robots. The experiments on Turtlebot3 burger robots further validates the practicality of the proposed algorithm. Additionally, the robot behavior scheduling algorithm has scalability and can enable the robots to complete more complex tasks by enriching the types of robot behaviors and scheduling mechanisms.
1 January 2014 in Mathematical Problems in Engineering
Test task scheduling problem (TTSP) is a complex optimization problem and has many local optima. In this paper, a hybrid chaotic multiobjective evolutionary algorithm based on decomposition (CMOEA/D) is presented to avoid becoming trapped in local optima and to obtain high quality solutions. First, we propose an improving integrated encoding scheme (IES) to increase the efficiency. Then ten chaotic maps are applied into the multiobjective evolutionary algorithm based on decomposition (MOEA/D) in three phases, that is, initial population and crossover and mutation operators. To identify a good approach for hybrid MOEA/D and chaos and indicate the effectiveness of the improving IES several experiments are performed. The Pareto front and the statistical results demonstrate that different chaotic maps in different phases have different effects for solving the TTSP especially the circle map and ICMIC map. The similarity degree of distribution between chaotic maps and the problem is a very essential factor for the application of chaotic maps. In addition, the experiments of comparisons of CMOEA/D and variable neighborhood MOEA/D (VNM) indicate that our algorithm has the best performance in solving the TTSP.
Automatic modulation classification of digital signals plays an important role in civilian and military applications. The challenge focuses on the efficiency under low signal noise ratio (SNR) and compatibility with new types of digital modulations. In this paper, we propose a high-efficiency classification system for both the classical digital modulations and the binary offset carrier (BOC) and its derivative modulations. In detail, the classical digital modulations are ASK, PSK and FSK, and the new kind of signals are BOC, composite binary offset carrier (CBOC) and alternative binary offset carrier (AltBOC). Our system consists of two parts: feature extraction and classification algorithm. For feature extraction, we extract a suitable combination of signal statistical characteristics and instantaneous characteristics to provide better ability to distinguish different modulation signals. First, we preprocess the signal using the Hilbert transform to get the analytic expression. Then, four instantaneous parameters and four statistical parameters are used to represent the features of signal based on the expression. For classification algorithm, we investigate a genetic backpropagation neural network (BPNN). Genetic algorithm (GA) is used to design the architecture of BPNN to find the best value for the number of hidden layers and the number of neurons in each layer. This approach eliminates the human factor and improves the efficiency and accuracy of network. The simulation results demonstrate that our system shows high classification accuracy and high speed for the researched digital modulation signals at low SNR of 3dB.
2 June 2016 in Journal of Electrical and Computer Engineering
Wireless Health Monitoring Systems (WHMS) have potential to change the way of health care and bring numbers of benefits to patients, physicians, hospitals, and society. However, there are crucial barriers not only to transmit the biometric information but also to protect the privacy and security of the patients’ information. The key agreement between two entities is an essential cryptography operation to clear the barriers. In particular, the noninteractive hierarchical key agreement scheme becomes an attractive direction in WHMS because each sensor node or gateway has limited resources and power. Recently, a noninteractive hierarchical key agreement scheme has been proposed by Kim for WHMS. However, we show that Kim’s cryptographic scheme is vulnerable to the collusion attack if the physicians can be corrupted. Obviously, it is a more practical security condition. Therefore, we proposed an improved key agreement scheme against the attack. Security proof, security analysis, and experimental results demonstrate that our proposed scheme gains enhanced security and more efficiency than Kim’s previous scheme while inheriting its qualities of one-round communication and security properties.