Obstacle avoidance for swarm robot based on self-organizing migrating algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10244219" target="_blank" >RIV/61989100:27240/19:10244219 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/19:10244219

Výsledek na webu

<a href="https://www.researchgate.net/profile/Diep_Quoc_Bao/publication/332305742_Obstacle_Avoidance_for_Swarm_Robot_Based_on_Self-Organizing_Migrating_Algorithm/links/5cb474664585156cd7998356/Obstacle-Avoidance-for-Swarm-Robot-Based-on-Self-Organizing-Migrating-Algorithm.pdf" target="_blank" >https://www.researchgate.net/profile/Diep_Quoc_Bao/publication/332305742_Obstacle_Avoidance_for_Swarm_Robot_Based_on_Self-Organizing_Migrating_Algorithm/links/5cb474664585156cd7998356/Obstacle-Avoidance-for-Swarm-Robot-Based-on-Self-Organizing-Migrating-Algorithm.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.procs.2019.02.073" target="_blank" >10.1016/j.procs.2019.02.073</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Obstacle avoidance for swarm robot based on self-organizing migrating algorithm

Popis výsledku v původním jazyce

This paper presents an obstacle avoidance algorithm for swarm robot in unknown environment based on self-organizing migrating algorithm in which the trajectory is divided into a set of points created by the SOMA that robot must pass through. During the move, obstacles will be detected by sensors on the robot, it only knows the target position without knowing the obstacles location until detecting them. The fitness function is based on the principle of attraction from the target and the repulsion of the obstacles, which helps robot find the trajectory for moving, and the ways leaving it to move safety away from the trapped area. Simulation results are also presented to show the feasibility of the algorithm. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the scientific committee of the 13th International Symposium &quot;Intelligent Systems&quot; (INTELS&apos;18).

Název v anglickém jazyce

Obstacle avoidance for swarm robot based on self-organizing migrating algorithm

Popis výsledku anglicky

This paper presents an obstacle avoidance algorithm for swarm robot in unknown environment based on self-organizing migrating algorithm in which the trajectory is divided into a set of points created by the SOMA that robot must pass through. During the move, obstacles will be detected by sensors on the robot, it only knows the target position without knowing the obstacles location until detecting them. The fitness function is based on the principle of attraction from the target and the repulsion of the obstacles, which helps robot find the trajectory for moving, and the ways leaving it to move safety away from the trapped area. Simulation results are also presented to show the feasibility of the algorithm. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the scientific committee of the 13th International Symposium &quot;Intelligent Systems&quot; (INTELS&apos;18).

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Procedia Computer Science. Volume 150

ISBN

—

ISSN

1877-0509

e-ISSN

—

Počet stran výsledku

8

Strana od-do

425-432

Název nakladatele

Elsevier

Místo vydání

Amsterdam

Místo konání akce

Petrohrad

Datum konání akce

22. 10. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—