All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An Algorithm for Swarm Robot to Avoid Multiple Dynamic Obstacles and to Catch the Moving Target

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-030-20915-5_59" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-20915-5_59</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-20915-5_59" target="_blank" >10.1007/978-3-030-20915-5_59</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Algorithm for Swarm Robot to Avoid Multiple Dynamic Obstacles and to Catch the Moving Target

  • Original language description

    This paper presents a method for swarm robot to catch the moving target and to avoid multiple dynamic obstacles in the unknown environment. An imaginary map is built, including the highest mountain, some small hills, and a lowest lying land, respectively corresponding to the starting position of the robot, the detected obstacles, and the target. The robot is considered as a flow of water flowing from high to low. The flow of water is the robot trajectory that is divided into a set of points created by an algorithm called Self-organizing migrating algorithm. Simulation results are also presented to show that the obstacle avoidance and catching target task can be reached using this method.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2019

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2019, PT II

  • ISBN

    978-3-030-20915-5

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    10

  • Pages from-to

    666-675

  • Publisher name

    SPRINGER INTERNATIONAL PUBLISHING AG

  • Place of publication

    CHAM

  • Event location

    Zakopane

  • Event date

    Jun 16, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000501606900059