Convergence Analysis of Swarm Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A86077773" target="_blank" >RIV/61989100:27240/09:86077773 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Convergence Analysis of Swarm Algorithm
Original language description
Swarm Intelligence (SI) is an innovative distributed intelligent paradigm whereby the collective behaviors of unsophisticated individuals interacting locally with their environment cause coherent functional global patterns to emerge. Although the swarm algorithms have exhibited good performance across a wide range of application problems, it is difficult to analyze the convergence. We discuss the swarm intelligent model namely the particle swarm based on its iterated function system. The dynamic trajectory of the particle is described based single individual. We also attempt to theoretically prove that the swarm algorithm converges with a probability of I towards the global optimal.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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
World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009
ISBN
978-1-4244-5053-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos, California
Event location
Indie
Event date
Dec 9, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000288686500308