37,142 research outputs found
Efficient Multi-Robot Coverage of a Known Environment
This paper addresses the complete area coverage problem of a known
environment by multiple-robots. Complete area coverage is the problem of moving
an end-effector over all available space while avoiding existing obstacles. In
such tasks, using multiple robots can increase the efficiency of the area
coverage in terms of minimizing the operational time and increase the
robustness in the face of robot attrition. Unfortunately, the problem of
finding an optimal solution for such an area coverage problem with multiple
robots is known to be NP-complete. In this paper we present two approximation
heuristics for solving the multi-robot coverage problem. The first solution
presented is a direct extension of an efficient single robot area coverage
algorithm, based on an exact cellular decomposition. The second algorithm is a
greedy approach that divides the area into equal regions and applies an
efficient single-robot coverage algorithm to each region. We present
experimental results for two algorithms. Results indicate that our approaches
provide good coverage distribution between robots and minimize the workload per
robot, meanwhile ensuring complete coverage of the area.Comment: In proceedings of IEEE/RSJ International Conference on Intelligent
Robots and Systems (IROS), 201
MULTI-ROBOT COVERAGE WITH DYNAMIC COVERAGE INFORMATION COMPRESSION
This work considers the problem of coverage of an initially unknown environment by a set of autonomous robots. A crucial aspect in multi-robot coverage involves robots sharing information about the regions they have already covered at certain intervals, so that multiple robots can avoid repeated coverage of the same area. However, sharing the coverage information between robots imposes considerable communication and computation overhead on each robot, which increases the robots’ battery usage and overall coverage time. To address this problem, we explore a novel coverage technique where robots use an information compression algorithm before sharing their coverage maps with each other. Specifically, we use a polygonal approximation algorithm to represent any arbitrary region covered by a robot as a polygon with a fixed, small number of vertices. At certain intervals, each robot then sends this small set of vertices to other robots in its communication range as its covered area, and each receiving robot records this information in a local map of covered regions so that it can avoid repeat coverage. The coverage information in the map is then utilized by a technique called spanning tree coverage (STC) by each robot to perform area coverage. We have verified the performance of our algorithm on simulated Coroware Corobot robots within the Webots robot simulator with different sizes of environments and different types of obstacles in the environments, while modelling sensor noise from the robots’ sensors. Our results show that using the polygonal compression technique is an effective way to considerably reduce data transfer between robots in a multi-robot team without sacrificing the performance and efficiency gains that communication provides to such a system
Multi-Robot Coalition Formation for Distributed Area Coverage
The problem of distributed area coverage using multiple mobile robots is an important problem in distributed multi-robot sytems. Multi-robot coverage is encountered in many real world applications, including unmanned search & rescue, aerial reconnaissance, robotic demining, inspection of engineering structures, and automatic lawn mowing. To achieve optimal coverage, robots should move in an efficient manner and reduce repeated coverage of the same region that optimizes a certain performance metric such as the amount of time or energy expended by the robots. This dissertation especially focuses on using mini-robots with limited capabilities, such as low speed of the CPU and limited storage of the memory, to fulfill the efficient area coverage task. Previous research on distributed area coverage use offline or online path planning algorithms to address this problem. Some of the existing approaches use behavior-based algorithms where each robot implements simple rules and the interaction between robots manifests in the global objective of overall coverage of the environment. Our work extends this line of research using an emergent, swarming based technique where robots use partial coverage histories from themselves as well as other robots in their vicinity to make local decisions that attempt to ensure overall efficient area coverage. We have then extended this technique in two directions. First, we have integreated the individual-robot, swarming-based technique for area coverage to teams of robots that move in formation to perform area coverage more efficiently than robots that move individually. Then we have used a team formation technique from coalition game theory, called Weighted Voting Game (WVG) to handle situations where a team moving in formation while performing area coverage has to dynamically reconfigure into sub-teams or merge with other teams, to continue the area coverage efficiently. We have validated our techniques by testing them on accurate models of e-puck robots in the Webots robot simulation platform, as well as on physical e-puck robots
Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system
Coverage and connectivity are the two main functionalities of wireless sensor network. Stochastic node deployment or random deployment almost always cause hole in sensing coverage and cause redundant nodes in area. In the other hand precise deployment of nodes in large area is very time consuming and even impossible in hazardous environment. One of solution for this problem is using mobile robots with concern on exploration algorithm for mobile robot. In this work an autonomous deployment method for wireless sensor nodes is proposed via multi-robot system which robots are considered as node carrier. Developing an exploration algorithm based on spanning tree is the main contribution and this exploration algorithm is performing fast localization of sensor nodes in energy efficient manner. Employing multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor nodes deployment. A novel improvement of this technique in deployment of nodes is having obstacle avoidance mechanism without concern on shape and size of obstacle. The results show using spanning tree exploration along with multi-robot system helps to have fast deployment behind efficiency in energy
A Multi-robot Coverage Path Planning Algorithm Based on Improved DARP Algorithm
The research on multi-robot coverage path planning (CPP) has been attracting
more and more attention. In order to achieve efficient coverage, this paper
proposes an improved DARP coverage algorithm. The improved DARP algorithm based
on A* algorithm is used to assign tasks to robots and then combined with STC
algorithm based on Up-First algorithm to achieve full coverage of the task
area. Compared with the initial DARP algorithm, this algorithm has higher
efficiency and higher coverage rate
Multi-Agent Reinforcement Learning for Dynamic Ocean Monitoring by a Swarm of Buoys
Autonomous marine environmental monitoring problem traditionally encompasses
an area coverage problem which can only be effectively carried out by a
multi-robot system. In this paper, we focus on robotic swarms that are
typically operated and controlled by means of simple swarming behaviors
obtained from a subtle, yet ad hoc combination of bio-inspired strategies. We
propose a novel and structured approach for area coverage using multi-agent
reinforcement learning (MARL) which effectively deals with the non-stationarity
of environmental features. Specifically, we propose two dynamic area coverage
approaches: (1) swarm-based MARL, and (2) coverage-range-based MARL. The former
is trained using the multi-agent deep deterministic policy gradient (MADDPG)
approach whereas, a modified version of MADDPG is introduced for the latter
with a reward function that intrinsically leads to a collective behavior. Both
methods are tested and validated with different geometric shaped regions with
equal surface area (square vs. rectangle) yielding acceptable area coverage,
and benefiting from the structured learning in non-stationary environments.
Both approaches are advantageous compared to a na\"{i}ve swarming method.
However, coverage-range-based MARL outperforms the swarm-based MARL with
stronger convergence features in learning criteria and higher spreading of
agents for area coverage.Comment: Accepted for Publication at IEEE/MTS OCEANS 202
Coverage Technology of Autonomous Mobile Mapping Robots
The coverage technique is one of the essential applications of autonomous mobile mapping robots. There are various approaches for coverage depending on the model (model/non-model), robot systems (single/multi), and its purpose (patrol/cleaning). Coverage components include viewpoint generation and path planning approaches, which are described as CPP research work. Particularly, in surveillance systems, coverage techniques, such as spanning tree, cyclic coverage, and area-based coverage, are reviewed specifically, which can be expanded for multi-robot systems. In addition, required coverage techniques according to conditions for intelligent surveillance systems are summarized. Lastly, several issues on coverage, specifically cyclic coverage, are described and considered
DECENTRALIZED MULTI-ROBOT PLANNING TO EXPLORE AND PERCEIVE
In a recent French robotic contest, the objective was to develop a multi-robot system able to autonomously map and explore an unknown area while also detecting and localizing objects. As a participant in this challenge, we proposed a new decentralized Markov decision process (Dec-MDP) resolution based on distributed value functions (DVF) to compute multi-robot exploration strategies. The idea is to take advantage of sparse interactions by allowing each robot to calculate locally a strategy that maximizes the explored space while minimizing robots interactions. In this paper, we propose an adaptation of this method to improve also object recognition by integrating into the DVF the interest in covering explored areas with photos. The robots will then act to maximize the explored space and the photo coverage, ensuring better perception and object recognition
- …