2,620 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
Cooperative area surveillance strategies using multiple unmanned systems
Recently, the U.S. Department of Defense placed the technological development of intelligence, surveillance, and reconnaissance (ISR) tools at the top of its priority list. Area surveillance that takes place in an urban setting is an ISR tool of special interest. Unmanned aerial vehicles (UAVs) are ideal candidates to perform area surveillance because they are inexpensive and they do not require a human pilot to be aboard. Multiple unmanned systems increase the rate of information flow from the target region and maintain up to date information.
The purpose of the research described in this dissertation is to develop and test a system that coordinates multiple UAVs on a wide area coverage surveillance mission. The research presented in this document implements a waypoint generator for multiple aerial vehicles that is especially suited for large area surveillance. The system chooses initial locations for the vehicles and generates a set of balanced sub-trees which cover the region of interest (ROI) for the vehicles. The sub-trees are then optimally combined to form a single minimal tree that spans the entire region. The system transforms the tree path into a series of waypoints suitable for the aerial vehicles. The output of the system is a set of waypoints for each vehicle assigned to the coverage task. Results from computer simulation and flight testing are presented.Ph.D.Committee Chair: Dr. George Vachtsevanos; Committee Member: Ayanna Howard; Committee Member: Dr. Thomas Michaels; Committee Member: Eric Johnson; Committee Member: Linda Will
Behavior Mixing with Minimum Global and Subgroup Connectivity Maintenance for Large-Scale Multi-Robot Systems
In many cases the multi-robot systems are desired to execute simultaneously
multiple behaviors with different controllers, and sequences of behaviors in
real time, which we call \textit{behavior mixing}. Behavior mixing is
accomplished when different subgroups of the overall robot team change their
controllers to collectively achieve given tasks while maintaining connectivity
within and across subgroups in one connected communication graph. In this
paper, we present a provably minimum connectivity maintenance framework to
ensure the subgroups and overall robot team stay connected at all times while
providing the highest freedom for behavior mixing. In particular, we propose a
real-time distributed Minimum Connectivity Constraint Spanning Tree (MCCST)
algorithm to select the minimum inter-robot connectivity constraints preserving
subgroup and global connectivity that are \textit{least likely to be violated}
by the original controllers. With the employed safety and connectivity barrier
certificates for the activated connectivity constraints and collision
avoidance, the behavior mixing controllers are thus minimally modified from the
original controllers. We demonstrate the effectiveness and scalability of our
approach via simulations of up to 100 robots with multiple behaviors.Comment: To appear in Proceedings of IEEE International Conference on Robotics
and Automation (ICRA) 202
DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
This paper deals with the path planning problem of a team of mobile robots, in order to cover an area of interest, with prior-defined obstacles. For the single robot case, also known as single robot coverage path planning (CPP), an (n) optimal methodology has already been proposed and evaluated in the literature, where n is the grid size. The majority of existing algorithms for the multi-robot case (mCPP), utilize the aforementioned algorithm. Due to the complexity, however, of the mCPP, the best the existing mCPP algorithms can perform is at most 16 times the optimal solution, in terms of time needed for the robot team to accomplish the coverage task, while the time required for calculating the solution is polynomial. In the present paper, we propose a new algorithm which converges to the optimal solution, at least in cases where one exists. The proposed technique transforms the original integer programming problem (mCPP) into several single-robot problems (CPP), the solutions of which constitute the optimal mCPP solution, alleviating the original mCPP explosive combinatorial complexity. Although it is not possible to analytically derive bounds regarding the complexity of the proposed algorithm, extensive numerical analysis indicates that the complexity is bounded by polynomial curves for practically sized inputs. In the heart of the proposed approach lies the DARP algorithm, which divides the terrain into a number of equal areas each corresponding to a specific robot, so as to guarantee complete coverage, non-backtracking solution, minimum coverage path, while at the same time does not need any preparatory stage (video demonstration and standalone application are available on-line http://tinyurl.com/DARP-app)
Multi-criteria Evolution of Neural Network Topologies: Balancing Experience and Performance in Autonomous Systems
Majority of Artificial Neural Network (ANN) implementations in autonomous
systems use a fixed/user-prescribed network topology, leading to sub-optimal
performance and low portability. The existing neuro-evolution of augmenting
topology or NEAT paradigm offers a powerful alternative by allowing the network
topology and the connection weights to be simultaneously optimized through an
evolutionary process. However, most NEAT implementations allow the
consideration of only a single objective. There also persists the question of
how to tractably introduce topological diversification that mitigates
overfitting to training scenarios. To address these gaps, this paper develops a
multi-objective neuro-evolution algorithm. While adopting the basic elements of
NEAT, important modifications are made to the selection, speciation, and
mutation processes. With the backdrop of small-robot path-planning
applications, an experience-gain criterion is derived to encapsulate the amount
of diverse local environment encountered by the system. This criterion
facilitates the evolution of genes that support exploration, thereby seeking to
generalize from a smaller set of mission scenarios than possible with
performance maximization alone. The effectiveness of the single-objective
(optimizing performance) and the multi-objective (optimizing performance and
experience-gain) neuro-evolution approaches are evaluated on two different
small-robot cases, with ANNs obtained by the multi-objective optimization
observed to provide superior performance in unseen scenarios
- …