Artificial ant colony method for state-space exploration
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F12%3APU102940" target="_blank" >RIV/00216305:26210/12:PU102940 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Artificial ant colony method for state-space exploration
Original language description
Finding a way through an unexplored environment belongs to actual problems in many artificial agent systems. Common algorithms as state-space searching or rapidly exploring random trees are used when the map of given environment is known. In this paper we present a simulation experiments with multi agent system which is represented as artificial ant colony.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
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
Engineering Mechanics 2012, Book of extended abstracts
ISBN
978-80-86246-40-6
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
366-367
Publisher name
Institute of Theoretical and Applied Mechanics
Place of publication
Praha
Event location
Svratka
Event date
May 14, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—