Investigation on Evolutionary Synthesis of Movement Commands

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F09%3A63507972" target="_blank" >RIV/70883521:28140/09:63507972 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Investigation on Evolutionary Synthesis of Movement Commands

Popis výsledku v původním jazyce

This paper deals with 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 grammatical evolution. This paper describes a setting ofan optimal trajectory for a robot (originally designed as an artificial ant on Santa Fe trail) solved by means of analytic programming. Firstly, main principles of analytic programming are described and explained. The second part shows how analytic programming was used for the application of finding of a suitable trajectory step by step. Because analytic programming needs evolutionary algorithms for its run, three evolutionary algorithms were used ? Self Organizing Migrating Algorithm, Differential Evolution and Simulated Annealing ? to show that anyone can be used. The total number of simulations was 150 and results show that the first two used algorithms were more successful than not so robust Simulated Annealing.

Název v anglickém jazyce

Investigation on Evolutionary Synthesis of Movement Commands

Popis výsledku anglicky

This paper deals with 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 grammatical evolution. This paper describes a setting ofan optimal trajectory for a robot (originally designed as an artificial ant on Santa Fe trail) solved by means of analytic programming. Firstly, main principles of analytic programming are described and explained. The second part shows how analytic programming was used for the application of finding of a suitable trajectory step by step. Because analytic programming needs evolutionary algorithms for its run, three evolutionary algorithms were used ? Self Organizing Migrating Algorithm, Differential Evolution and Simulated Annealing ? to show that anyone can be used. The total number of simulations was 150 and results show that the first two used algorithms were more successful than not so robust Simulated Annealing.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1680" target="_blank" >GA102/09/1680: Evoluční návrh řídicích algoritmů</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

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 periodika

Modelling and Simulation in Engineering

ISSN

1687-5591

e-ISSN

—

Svazek periodika

2009

Číslo periodika v rámci svazku

845080

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—