A Distributed Algorithm for Un-balanced Partitioning of a Swarm of Autonomous Mobile Robots and Its Performance Analysis

2012 ◽  
Vol 2 (1) ◽  
pp. 17-28 ◽  
Author(s):  
Deepanwita Das
Keyword(s):  
Performance Analysis ◽  
Mobile Robots ◽  
Distributed Algorithm ◽  
Autonomous Mobile Robots

Performance analysis of fast marching-based motion planning for autonomous mobile robots in ITER scenarios

2015 ◽  
Vol 63 ◽  
pp. 36-49 ◽  
Author(s):  
Javier V. Gómez ◽  
Alberto Vale ◽  
Santiago Garrido ◽  
Luis Moreno
Keyword(s):  
Performance Analysis ◽  
Motion Planning ◽  
Mobile Robots ◽  
Autonomous Mobile Robots ◽  
Fast Marching

A PSO-Inspired Multi-Robot Map Exploration Algorithm Using Frontier-Based Strategy

2013 ◽  
Vol 2 (2) ◽  
pp. 1-13 ◽  
Author(s):  
Yi Zhou ◽  
Kai Xiao ◽  
Yiheng Wang ◽  
Alei Liang ◽  
Aboul Ella Hassanien
Keyword(s):  
Mobile Robots ◽  
Distributed Algorithm ◽  
Fundamental Problem ◽  
Local Area ◽  
Autonomous Mobile Robots ◽  
Swarm Optimization ◽  
Exploration Time ◽  
Real Robot ◽  
Exploration Task ◽  
Unknown Region

Map exploration is a fundamental problem in mobile robots. This paper presents a distributed algorithm that coordinates a team of autonomous mobile robots to explore an unknown environment. The proposed strategy is based on frontiers which are the regions on the boundary between open and unexplored space. With this strategy, robots are guided to move constantly to the nearest frontier to reduce the size of unknown region. Based on the Particle Swarm Optimization (PSO) model incorporated in the algorithm, robots are navigated towards remote frontier after exploring the local area. The exploration completes when there is no frontier cell in the environment. The experiments implemented on both simulated and real robot scenarios show that the proposed algorithm is capable of completing the exploration task. Compared to the conventional method of randomly selecting frontier, the proposed algorithm proves its efficiency by the decreased 60% exploration time at least. Additional experimental results show the decreased coverage time when the number of robots increases, which further suggests the validity, efficiency and scalability.

Surrounding Robots – A Discrete Localized Solution for the Intruder Problem –

2014 ◽  
Vol 18 (3) ◽  
pp. 315-319 ◽  
Author(s):  
László Blázovics ◽  
◽  
Tamás Lukovszki ◽  
Bertalan Forstner ◽  
Keyword(s):  
Mobile Robots ◽  
Finite Time ◽  
Distributed Algorithm ◽  
Autonomous Mobile Robots ◽  
Cooperative Robotics ◽  
The Past ◽  
Decentralized Algorithms

Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time.

Sign in / Sign up

Export Citation Format

Share Document