Path Planning with the Use of Artificial Ant Colony Algorithm

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F13%3APU106845" target="_blank" >RIV/00216305:26210/13:PU106845 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Path Planning with the Use of Artificial Ant Colony Algorithm

Original language description

Finding a way through an unexplored environment belongs to actual problems in many artificial agent systems. Common algorithms as state-space searchning or rapidly exploring random trees are used when the map of given environment is known. In this paperwe present simulation experiments with multi agent system represented as artificial ant colony

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2013

Confidentiality

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

Name of the periodical

Solid State Phenomena

ISSN

1012-0394

e-ISSN

—

Volume of the periodical

2013

Issue of the periodical within the volume

198

Country of publishing house

CH - SWITZERLAND

Number of pages

6

Pages from-to

114-119

UT code for WoS article

—

EID of the result in the Scopus database

—