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”

A collection of robotics problems for benchmarking evolutionary computation methods

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F23%3APU148221" target="_blank" >RIV/00216305:26210/23:PU148221 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-031-30229-9_24" target="_blank" >http://dx.doi.org/10.1007/978-3-031-30229-9_24</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-30229-9_24" target="_blank" >10.1007/978-3-031-30229-9_24</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A collection of robotics problems for benchmarking evolutionary computation methods

  • Original language description

    The utilization of benchmarking techniques has a crucial role in the development of novel optimization algorithms, and also in performing comparisons between already existing methods. This is especially true in the field of evolutionary computation, where the theoretical performance of the method is difficult to analyze. For these benchmarking purposes, artificial (or synthetic) functions are currently the most widely used ones. In this paper, we present a collection of real-world robotics problems that can be used for benchmarking evolutionary computation methods. The proposed benchmark problems are a combination of inverse kinematics and path planning in robotics that can be parameterized. We conducted an extensive numerical investigation that encompassed solving 200 benchmark problems by seven selected metaheuristic algorithms. The results of this investigation showed that the proposed benchmark problems are quite difficult (multimodal and non-separable) and that they can be successfully used for differentiating and ranking various metaheuristics.

  • 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

    2023

  • 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

    26th International Conference on Applications of Evolutionary Computation, EvoApplications 2023, held as part of EvoStar 2023

  • ISBN

    978-3-031-30229-9

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    „364 “-„379“

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Brno

  • Event date

    Apr 12, 2023

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article