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”

Santa Fe Trail for Artificial Ant by means of Analytic Programming and Evolutionary Computation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F08%3A63507082" target="_blank" >RIV/70883521:28140/08:63507082 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Santa Fe Trail for Artificial Ant by means of Analytic Programming and Evolutionary Computation

  • Original language description

    This paper deals with the usage of an alternative tool for symbolic regression - analytic programming which is able to solve various problems from the symbolic domain as well as genetic programming and gramatical evolution. The main tasks of analytic programming in this paper, is setting an optimal trajectory for a robot (artificial ant on Santa Fe trail). In this contribution main principles of analytic programming are described and explained. In the second part of the article is in detail described how analytic programming was used for setting an optimal trajectory for an artificial ant according the user requirements. An ability to create so called programs, as well as genetic programming or grammatical evolution do, is shown in that part. In this contribution three evolutionary algorithms were used - Self Organizing Migrating Algorithm, Differential Evolution and Simulated Annealing. The total number of simulations was 150 and results show that the first two used algorithms were mo

  • Czech name

    Stezka Santa Fe pro umělého mravence řešená pomocí analytického programování a evolučních algoritmů

  • Czech description

    Tento článěk řeší použití analytického programování na řešení optimální trajektorie robota (umělý mravenec podle originálního návrhu J. Kozy v Genetickém programování). Zde jsou popsány hlavní principy analytického programování a jeho použití při nastavování a nalezení vhodné trajektorie. 3 evoluční algoritmy byly použity v této práci - SOMA, diferenciální evoluce a simulované žíhání. Celkový počet simulací byl 150 a výsledky ukázaly, že první dva použité algoritmy byly úspěšnější než simulované žíhání.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA102%2F06%2F1132" target="_blank" >GA102/06/1132: Softcomputing in Control</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • 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

  • Name of the periodical

    International Journal of Simulation, Systems, Science and Technology

  • ISSN

    1473-8031

  • e-ISSN

  • Volume of the periodical

    9

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    14

  • Pages from-to

  • UT code for WoS article

  • EID of the result in the Scopus database