11 research outputs found
Social-aware robot navigation in urban environments
In this paper we present a novel robot navigation approach based on the so-called Social Force Model (SFM). First, we construct a graph map with a set of destinations that completely describe the navigation environment. Second, we propose a robot navigation algorithm, called social-aware navigation, which is mainly driven by the social-forces centered at the robot. Third, we use a MCMC Metropolis-Hastings algorithm in order to learn the parameters values of the method. Finally, the validation of the model is accomplished throughout an extensive set of simulations and real-life experiments.Peer ReviewedPostprint (author’s final draft
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
Sensor Network Based Collision-Free Navigation and Map Building for Mobile Robots
Safe robot navigation is a fundamental research field for autonomous robots
including ground mobile robots and flying robots. The primary objective of a
safe robot navigation algorithm is to guide an autonomous robot from its
initial position to a target or along a desired path with obstacle avoidance.
With the development of information technology and sensor technology, the
implementations combining robotics with sensor network are focused on in the
recent researches. One of the relevant implementations is the sensor network
based robot navigation. Moreover, another important navigation problem of
robotics is safe area search and map building. In this report, a global
collision-free path planning algorithm for ground mobile robots in dynamic
environments is presented firstly. Considering the advantages of sensor
network, the presented path planning algorithm is developed to a sensor network
based navigation algorithm for ground mobile robots. The 2D range finder sensor
network is used in the presented method to detect static and dynamic obstacles.
The sensor network can guide each ground mobile robot in the detected safe area
to the target. Furthermore, the presented navigation algorithm is extended into
3D environments. With the measurements of the sensor network, any flying robot
in the workspace is navigated by the presented algorithm from the initial
position to the target. Moreover, in this report, another navigation problem,
safe area search and map building for ground mobile robot, is studied and two
algorithms are presented. In the first presented method, we consider a ground
mobile robot equipped with a 2D range finder sensor searching a bounded 2D area
without any collision and building a complete 2D map of the area. Furthermore,
the first presented map building algorithm is extended to another algorithm for
3D map building
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