413 research outputs found
Decentralized Collision-Free Control of Multiple Robots in 2D and 3D Spaces
Decentralized control of robots has attracted huge research interests.
However, some of the research used unrealistic assumptions without collision
avoidance. This report focuses on the collision-free control for multiple
robots in both complete coverage and search tasks in 2D and 3D areas which are
arbitrary unknown. All algorithms are decentralized as robots have limited
abilities and they are mathematically proved.
The report starts with the grid selection in the two tasks. Grid patterns
simplify the representation of the area and robots only need to move straightly
between neighbor vertices. For the 100% complete 2D coverage, the equilateral
triangular grid is proposed. For the complete coverage ignoring the boundary
effect, the grid with the fewest vertices is calculated in every situation for
both 2D and 3D areas.
The second part is for the complete coverage in 2D and 3D areas. A
decentralized collision-free algorithm with the above selected grid is
presented driving robots to sections which are furthest from the reference
point. The area can be static or expanding, and the algorithm is simulated in
MATLAB.
Thirdly, three grid-based decentralized random algorithms with collision
avoidance are provided to search targets in 2D or 3D areas. The number of
targets can be known or unknown. In the first algorithm, robots choose vacant
neighbors randomly with priorities on unvisited ones while the second one adds
the repulsive force to disperse robots if they are close. In the third
algorithm, if surrounded by visited vertices, the robot will use the
breadth-first search algorithm to go to one of the nearest unvisited vertices
via the grid. The second search algorithm is verified on Pioneer 3-DX robots.
The general way to generate the formula to estimate the search time is
demonstrated. Algorithms are compared with five other algorithms in MATLAB to
show their effectiveness
Distributed navigation of multi-robot systems for sensing coverage
A team of coordinating mobile robots equipped with operation specific sensors can
perform different coverage tasks. If the required number of robots in the team is
very large then a centralized control system becomes a complex strategy. There
are also some areas where centralized communication turns into an issue. So, a
team of mobile robots for coverage tasks should have the ability of decentralized or
distributed decision making. This thesis investigates decentralized control of mobile
robots specifically for coverage problems. A decentralized control strategy is ideally
based on local information and it can offer flexibility in case there is an increment
or decrement in the number of mobile robots. We perform a broad survey of the
existing literature for coverage control problems. There are different approaches
associated with decentralized control strategy for coverage control problems. We
perform a comparative review of these approaches and use the approach based on
simple local coordination rules. These locally computed nearest neighbour rules are
used to develop decentralized control algorithms for coverage control problems.
We investigate this extensively used nearest neighbour rule-based approach for
developing coverage control algorithms. In this approach, a mobile robot gives an
equal importance to every neighbour robot coming under its communication range.
We develop our control approach by making some of the mobile robots playing
a more influential role than other members of the team. We develop the control
algorithm based on nearest neighbour rules with weighted average functions. The
approach based on this control strategy becomes efficient in terms of achieving a
consensus on control inputs, say heading angle, velocity, etc.
The decentralized control of mobile robots can also exhibit a cyclic behaviour
under some physical constraints like a quantized orientation of the mobile robot.
We further investigate the cyclic behaviour appearing due to the quantized control
of mobile robots under some conditions. Our nearest neighbour rule-based approach
offers a biased strategy in case of cyclic behaviour appearing in the team of mobile
robots.
We consider a clustering technique inside the team of mobile robots. Our decentralized
control strategy calculates the similarity measure among the neighbours
of a mobile robot. The team of mobile robots with the similarity measure based
approach becomes efficient in achieving a fast consensus like on heading angle or
velocity. We perform a rigorous mathematical analysis of our developed approach.
We also develop a condition based on relaxed criteria for achieving consensus on
velocity or heading angle of the mobile robots. Our validation approach is based on
mathematical arguments and extensive computer simulations
Collision Free Navigation of a Multi-Robot Team for Intruder Interception
In this report, we propose a decentralised motion control algorithm for the
mobile robots to intercept an intruder entering (k-intercepting) or escaping
(e-intercepting) a protected region. In continuation, we propose a
decentralized navigation strategy (dynamic-intercepting) for a multi-robot team
known as predators to intercept the intruders or in the other words, preys,
from escaping a siege ring which is created by the predators. A necessary and
sufficient condition for the existence of a solution of this problem is
obtained. Furthermore, we propose an intelligent game-based decision-making
algorithm (IGD) for a fleet of mobile robots to maximize the probability of
detection in a bounded region. We prove that the proposed decentralised
cooperative and non-cooperative game-based decision-making algorithm enables
each robot to make the best decision to choose the shortest path with minimum
local information. Then we propose a leader-follower based collision-free
navigation control method for a fleet of mobile robots to traverse an unknown
cluttered environment where is occupied by multiple obstacles to trap a target.
We prove that each individual team member is able to traverse safely in the
region, which is cluttered by many obstacles with any shapes to trap the target
while using the sensors in some indefinite switching points and not
continuously, which leads to saving energy consumption and increasing the
battery life of the robots consequently. And finally, we propose a novel
navigation strategy for a unicycle mobile robot in a cluttered area with moving
obstacles based on virtual field force algorithm. The mathematical proof of the
navigation laws and the computer simulations are provided to confirm the
validity, robustness, and reliability of the proposed methods
Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue
In this report, we try to improve the performance of existing approaches for
search operations in multi-robot context. We propose three novel algorithms
that are using a triangular grid pattern, i.e., robots certainly go through the
vertices of a triangular grid during the search procedure. The main advantage
of using a triangular grid pattern is that it is asymptotically optimal in
terms of the minimum number of robots required for the complete coverage of an
arbitrary bounded area. We use a new topological map which is made and shared
by robots during the search operation. We consider an area that is unknown to
the robots a priori with an arbitrary shape, containing some obstacles. Unlike
many current heuristic algorithms, we give mathematically proofs of convergence
of the algorithms. The computer simulation results for the proposed algorithms
are presented using a simulator of real robots and environment. We evaluate the
performance of the algorithms via experiments with real robots. We compare the
performance of our own algorithms with three existing algorithms from other
researchers. The results demonstrate the merits of our proposed solution. A
further study on formation building with obstacle avoidance for a team of
mobile robots is presented in this report. We propose a decentralized formation
building with obstacle avoidance algorithm for a group of mobile robots to move
in a defined geometric configuration. Furthermore, we consider a more
complicated formation problem with a group of anonymous robots; these robots
are not aware of their position in the final configuration and need to reach a
consensus during the formation process. We propose a randomized algorithm for
the anonymous robots that achieves the convergence to a desired configuration
with probability 1. We also propose a novel obstacle avoidance rule, used in
the formation building algorithm.Comment: arXiv admin note: substantial text overlap with arXiv:1402.5188 by
other author
Safe navigation and motion coordination control strategies for unmanned aerial vehicles
Unmanned aerial vehicles (UAVs) have become very popular for many military and civilian applications including in agriculture, construction, mining, environmental monitoring, etc. A desirable feature for UAVs is the ability to navigate and perform tasks autonomously with least human interaction. This is a very challenging problem due to several factors such as the high complexity of UAV applications, operation in harsh environments, limited payload and onboard computing power and highly nonlinear dynamics. Therefore, more research is still needed towards developing advanced reliable control strategies for UAVs to enable safe navigation in unknown and dynamic environments. This problem is even more challenging for multi-UAV systems where it is more efficient to utilize information shared among the networked vehicles. Therefore, the work presented in this thesis contributes towards the state-of-the-art in UAV control for safe autonomous navigation and motion coordination of multi-UAV systems. The first part of this thesis deals with single-UAV systems. Initially, a hybrid navigation framework is developed for autonomous mobile robots using a general 2D nonholonomic unicycle model that can be applied to different types of UAVs, ground vehicles and underwater vehicles considering only lateral motion. Then, the more complex problem of three-dimensional (3D) collision-free navigation in unknown/dynamic environments is addressed. To that end, advanced 3D reactive control strategies are developed adopting the sense-and-avoid paradigm to produce quick reactions around obstacles. A special case of navigation in 3D unknown confined environments (i.e. tunnel-like) is also addressed. General 3D kinematic models are considered in the design which makes these methods applicable to different UAV types in addition to underwater vehicles. Moreover, different implementation methods for these strategies with quadrotor-type UAVs are also investigated considering UAV dynamics in the control design. Practical experiments and simulations were carried out to analyze the performance of the developed methods. The second part of this thesis addresses safe navigation for multi-UAV systems. Distributed motion coordination methods of multi-UAV systems for flocking and 3D area coverage are developed. These methods offer good computational cost for large-scale systems. Simulations were performed to verify the performance of these methods considering systems with different sizes
Design and Performance Analysis of Genetic Algorithms for Topology Control Problems
In this dissertation, we present a bio-inspired decentralized topology control mechanism, called force-based genetic algorithm (FGA), where a genetic algorithm (GA) is run by each autonomous mobile node to achieve a uniform spread of mobile nodes and to provide a fully connected network over an unknown area. We present a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem.
This dissertation emphasizes the use of mobile nodes to achieve a uniform distribution over an unknown terrain without a priori information and a central control unit. In contrast, each mobile node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge.
We have implemented simulation software in Java and developed four different testbeds to study the effectiveness of different GA-based topology control frameworks for network performance metrics including node density, speed, and the number of generations that GAs run.
The stochastic behavior of FGA, like all GA-based approaches, makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for homogeneous and inhomogeneous Markov chain models of our FGA. Furthermore, convergence characteristic analysis helps us to choose the nearoptimal values for communication range, the number of mobile nodes, and the mean node degree before sending autonomous mobile nodes to any mission.
Our analytical and experimental results show that our FGA delivers promising results for uniform mobile node distribution over unknown terrains. Since our FGA adapts to local environment rapidly and does not require global network knowledge, it can be used as a real-time topology controller for commercial and military applications
Optimal Route Planning with Mobile Nodes in Wireless Sensor Networks
Wireless Sensor Networks (WSN) are a collection of sensor nodes that sense their surroundings and relay their proximal information for further analysis. They utilize wireless communication technology to allow monitoring areas remotely. A major problem with WSNs is that the sensor nodes have a set sensing radius, which may not cover the entire field space. This issue would lead to an unreliable WSN that sometimes would not discover or report about events taking place in the field space. Researchers have focused on developing techniques for improving area coverage. These include allowing mobile sensor nodes to dynamically move towards coverage holes through the use of a path planning approach to solve issues such as maximizing area coverage. An approach is proposed in this thesis to maximize the area of network coverage by the WSN through a Mixed Integer Linear Programming (MILP) formulation which utilizes both static and mobile nodes. The mobile nodes are capable of travelling across the area of interest, to cover empty ‘holes’ (i.e. regions not covered by any of the static nodes) in a WSN. The goal is to find successive positions of the mobile node through the network, in order to maximize the network area coverage, or achieve a specified level of coverage while minimizing the number of iterations taken. Simulations of the formulation on small WSNs show promising results in terms of both objectives
The MRS UAV System: Pushing the Frontiers of Reproducible Research, Real-world Deployment, and Education with Autonomous Unmanned Aerial Vehicles
We present a multirotor Unmanned Aerial Vehicle control (UAV) and estimation
system for supporting replicable research through realistic simulations and
real-world experiments. We propose a unique multi-frame localization paradigm
for estimating the states of a UAV in various frames of reference using
multiple sensors simultaneously. The system enables complex missions in GNSS
and GNSS-denied environments, including outdoor-indoor transitions and the
execution of redundant estimators for backing up unreliable localization
sources. Two feedback control designs are presented: one for precise and
aggressive maneuvers, and the other for stable and smooth flight with a noisy
state estimate. The proposed control and estimation pipeline are constructed
without using the Euler/Tait-Bryan angle representation of orientation in 3D.
Instead, we rely on rotation matrices and a novel heading-based convention to
represent the one free rotational degree-of-freedom in 3D of a standard
multirotor helicopter. We provide an actively maintained and well-documented
open-source implementation, including realistic simulation of UAV, sensors, and
localization systems. The proposed system is the product of years of applied
research on multi-robot systems, aerial swarms, aerial manipulation, motion
planning, and remote sensing. All our results have been supported by real-world
system deployment that shaped the system into the form presented here. In
addition, the system was utilized during the participation of our team from the
CTU in Prague in the prestigious MBZIRC 2017 and 2020 robotics competitions,
and also in the DARPA SubT challenge. Each time, our team was able to secure
top places among the best competitors from all over the world. On each
occasion, the challenges has motivated the team to improve the system and to
gain a great amount of high-quality experience within tight deadlines.Comment: 28 pages, 20 figures, submitted to Journal of Intelligent & Robotic
Systems (JINT), for the provided open-source software see
http://github.com/ctu-mr
- …