An adjustable force field for multiple robot mission and path planning

Mission and path planning for multiple robots in dynamic environments is required when multiple mobile robots or unmanned vehicles are used for geographically distributed tasks. Assigning tasks and paths for robots for cooperatively accomplishing a mission of reaching to number of target points are addressed in this paper. The methodology that is proposed is based on using an adjustable force field which is suitable for dynamic environment. From the force field analysis, the decisions to assign tasks for each robot are then made. The force field is also used to plan a collision free path for each robot. Adjustable weights for the force field model are proposed to satisfy the constraints of the motion. In this research, the constraints are the cooperation of the robots, the precedence between the targets and between robots, and the discrimination between different obstacles. Two simulations for mission and path planning in 2D and 3D dynamic spaces with multiple robots are presented based on the proposed adjustable force filed. The result of the mission and path planning for three robots cooperatively doing eight target points are shown.

Market-based sensor relocation by robot team inwireless sensor networks

Randomly scattered sensors may cause sensing holes and redundant sensors. In carrier-based sensor relocation, mobile robots (with limited capacity to carry sensors) pick up additional or redundant sensors and relocate them at sensing holes. In the only known localized algorithm, robots randomly traverse field and act based on identified pair of spare sensor and coverage hole. We propose a Market-based Sensor Relocation (MSR) algorithm, which optimizes sensor deployment location, and introduces bidding and coordinating among neighboring robots. Sensors along the boundary of each hole elect one of them as the representative, which bids to neighboring robots for hole filling service. Each robot randomly explores by applying Least Recently Visited policy. It chooses the best bid according to Cost over Progress ratio and fetches a spare sensor nearby to cover the corresponding sensing hole. Robots within communication range share their tasks to search for better possible solutions. Simulation shows that MSR outperforms the existing competing algorithm G-R3S2 significantly on total robot traversed path and energy, and time to cover holes, slightly on number of sensors needed to cover the hole and number of sensor messages for bidding and deployment location sharing.

Node localization using mobile robots in delay-tolerant sensor networks

We present a novel scheme for node localization in a Delay-Tolerant Sensor Network (DTN). In a DTN, sensor devices are often organized in network clusters that may be mutually disconnected. Some mobile robots may be used to collect data from the network clusters. The key idea in our scheme is to use this robot to perform location estimation for the sensor nodes it passes based on the signal strength of the radio messages received from them. Thus, we eliminate the processing constraints of static sensor nodes and the need for static reference beacons. Our mathematical contribution is the use of a Robust Extended Kalman Filter (REKF)-based state estimator to solve the localization. Compared to the standard extended Kalman filter, REKF is computationally efficient and also more robust. Finally, we have implemented our localization scheme on a hybrid sensor network test bed and show that it can achieve node localization accuracy within 1m in a large indoor setting.

Using autonomous mobile agents for efficient data collection in sensor networks

Sensor networks are emerging as the new frontier in sensing technology, however there are still issues that need to be addressed. Two such issues are data collection and energy conservation. We consider a mobile robot, or a mobile agent, traveling the network collecting information from the sensors themselves before their onboard memory storage buffers are full. A novel algorithm is presented that is an adaptation of a local search algorithm for a special case of the Asymmetric Traveling Salesman Problem with Time-windows (ATSPTW) for solving the dynamic scheduling problem of what nodes are to be visited so that the information collected is not lost. Our algorithms are given and compared to other work.

Multi-robot hunting in dynamic environments

This paper is concerned with multi-robot hunting in dynamic environments. A BCSLA approach is proposed to allow mobile robots to capture an intelligent evader. During the process of hunting, four states including dispersion-random-search, surrounding, catch and prediction are employed. In order to ensure each robot appropriate movement in each state, a series of strategies are developed in this paper. The dispersion-search strategy enables the robots to find the evader effectively. The leader-adjusting strategy aims to improve the hunting robots’ response to environmental changes and the outflank strategy is proposed for the hunting robots to force the evader to enter a besieging circle. The catch strategy is designed for shrinking the besieging circle to catch the evader. The predict strategy allows the robots to predict the evader’s position when they lose the tracking information about the evader. A novel collision-free motion strategy is also presented in this paper, which is called the direction-optimization strategy. To test the effect of cooperative hunting, the target to be captured owns a safety-motion strategy, which helps it to escape being captured. The computer simulations support the rationality of the approach.

OzTug mobile robot for manufacturing transportation

Firstly, this paper introduces the OzTug mobile robot developed to autonomously manoeuvre large loads within a manufacturing environment. The mobile robot utilizes differential drive and necessary design criteria includes low-cost, mechanical robustness, and the ability to manoeuvre loads ranging up to 2000kg. The robot is configured to follow a predefined trajectory while maintaining the forward velocity of a user-specified velocity profile. A vision-based fuzzy logic line following controller enables the robot to track the paths on the floor of the manufacturing environment. Secondly, in order to tow large loads along predefined paths three different robot-load configurations are proposed. Simulation within the Webots environment was performed in order to empirically evaluate the three different robot-load configurations. The simulation results demonstrate the cost-performance trade-off of two of the approaches.

Stair climber smart mobile robot (MSRox)

MSRox is a wheeled mobile robot with two actuated degrees of freedom which enables it to have smooth motion on flat surfaces. It has the capability of climbing stairs and traversing obstacles, and adaptability toward uphill, downhill and slope surfaces. MSRox with 82 cm in length, 54 cm in width and 29 cm in height has been designed to climb stairs of 10 cm in height and 15 cm in width; nevertheless, it has the capability of climbing stairs up to about 17 cm in height and unlimited widt. In this paper, the motion systems and the capabilities of MSRox are described. Furthermore, experimental results of stair climbing and a comparison of the results with others are presented.