Misplaced Pages

Swarm intelligence: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editContent deleted Content addedVisualWikitext
Revision as of 08:27, 18 December 2015 editBgwhite (talk | contribs)Extended confirmed users547,151 edits WP:CHECKWIKI error fix #61 Punctuation before ref. Do general fixes and cleanup if needed. -, typo(s) fixed: life-like → lifelike, et. al. → et al. using AWB (11756)← Previous edit Latest revision as of 14:47, 6 November 2024 edit undoOAbot (talk | contribs)Bots442,414 editsm Open access bot: hdl updated in citation with #oabot. 
(317 intermediate revisions by more than 100 users not shown)
Line 1: Line 1:
{{more citations needed|date=March 2023}}
'''Swarm intelligence (SI)''' is the ] of ], ] systems, natural or artificial. The concept is employed in work on ]. The expression was introduced by ] and Jing Wang in 1989, in the context of cellular robotic systems.<ref>Beni, G., Wang, J. Swarm Intelligence in Cellular Robotic Systems, Proceed. NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy, June 26–30 (1989)</ref>
{{Short description|Collective behavior of decentralized, self-organized systems}}
]s reacting to a predator]]
'''Swarm intelligence''' ('''SI''') is the ] of ], ] systems, natural or artificial. The concept is employed in work on ]. The expression was introduced by ] and Jing Wang in 1989, in the context of cellular robotic systems.<ref>{{cite book|author1=Beni, G. |author2=Wang, J.|chapter=Swarm Intelligence in Cellular Robotic Systems|title=Proceed. NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy, June 26–30 (1989)|pages=703–712|doi=10.1007/978-3-642-58069-7_38|year=1993|publisher=Springer|location=Berlin, Heidelberg|isbn=978-3-642-63461-1}}</ref><ref>{{Cite book |last=Beni |first=G. |chapter=The concept of cellular robotic system |date=1989 |title=Proceedings IEEE International Symposium on Intelligent Control 1988 |chapter-url=https://ieeexplore.ieee.org/document/65405 |publisher=IEEE |pages=57–62 |doi=10.1109/ISIC.1988.65405 |isbn=978-0-8186-2012-6}}</ref>


SI systems consist typically of a population of simple ] or ] interacting locally with one another and with their environment. The inspiration often comes from nature, especially biological systems. The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the ] of "intelligent" global behavior, unknown to the individual agents. Examples in natural systems of SI include ], bird ], animal ], ], fish ] and ]. SI systems consist typically of a population of simple ] or ] interacting locally with one another and with their environment.<ref name="tcds">Hu, J.; Turgut, A.; Krajnik, T.; Lennox, B.; Arvin, F., "" IEEE Transactions on Cognitive and Developmental Systems, 2020.</ref> The inspiration often comes from nature, especially biological systems.<ref>{{Cite journal |last=Gad |first=Ahmed G. |date=2022-08-01 |title=Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review |journal=Archives of Computational Methods in Engineering |language=en |volume=29 |issue=5 |pages=2531–2561 |doi=10.1007/s11831-021-09694-4 |issn=1886-1784|doi-access=free }}</ref> The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the ] of "intelligent" global behavior, unknown to the individual agents.<ref name="tro">Hu, J.; Bhowmick, P.; Jang, I.; Arvin, F.; Lanzon, A., "" IEEE Transactions on Robotics, 2021.</ref> Examples of swarm intelligence in natural systems include ], ], bird ], hawks ], animal ], ], fish ] and ].


The application of swarm principles to ]s is called ], while 'swarm intelligence' refers to the more general set of algorithms. 'Swarm prediction' has been used in the context of forecasting problems. The application of swarm principles to ]s is called '']'' while ''swarm intelligence'' refers to the more general set of algorithms. ''Swarm prediction'' has been used in the context of forecasting problems. Similar approaches to those proposed for swarm robotics are considered for ] in synthetic collective intelligence.<ref>{{cite journal | vauthors = Solé R, Rodriguez-Amor D, Duran-Nebreda S, Conde-Pueyo N, Carbonell-Ballestero M, Montañez R | title = Synthetic Collective Intelligence | journal = BioSystems | volume = 148 | pages = 47–61 | date = October 2016 | doi = 10.1016/j.biosystems.2016.01.002 | pmid = 26868302 | bibcode = 2016BiSys.148...47S | hdl = 10630/32279 | hdl-access = free }}</ref>


== Models of swarm behavior ==
==Example algorithms==
{{See also|Swarm behaviour}}


=== Boids (Reynolds 1987) ===
===Particle swarm optimization===
{{main|Boids}}
] (PSO) is a ] algorithm for dealing with problems in which a best solution can be represented as a point or surface in an n-dimensional space. Hypotheses are plotted in this space and seeded with an initial ], as well as a communication channel between the particles.<ref>{{cite journal |doi=10.1023/A:1016568309421 |title=Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization |last=Parsopoulos |first=K. E. |last2=Vrahatis |first2=M. N. |journal=Natural Computing |volume=1 |issue=2-3 |pages=235–306 |year=2002 }}</ref><ref> by Maurice Clerc, ISTE, ISBN 1-905209-04-5, 2006.</ref> Particles then move through the solution space, and are evaluated according to some ] criterion after each timestep. Over time, particles are accelerated towards those particles within their communication grouping which have better fitness values. The main advantage of such an approach over other global minimization strategies such as ] is that the large number of members that make up the particle swarm make the technique impressively resilient to the problem of ].
Boids is an ] program, developed by ] in 1986, which simulates ]. It was published in 1987 in the proceedings of the ] ] conference.<ref name="reynolds">{{Cite book
| last1=Reynolds
| first1=Craig
| title=Proceedings of the 14th annual conference on Computer graphics and interactive techniques
| date=1987
| chapter=Flocks, herds and schools: A distributed behavioral model
| s2cid=546350
| author1-link=Craig Reynolds (computer graphics)
| publisher=]
| pages=25–34
| isbn=978-0-89791-227-3
| doi=10.1145/37401.37406
| citeseerx=10.1.1.103.7187
}}</ref>
The name "boid" corresponds to a shortened version of "bird-oid object", which refers to a bird-like object.<ref>{{Cite journal
| last1=Banks
| first1=Alec
| last2=Vincent
| first2=Jonathan
| last3=Anyakoha
| first3=Chukwudi
| s2cid=2344624
| title=A review of particle swarm optimization. Part I: background and development
|date=July 2007
| volume=6
| issue=4
| pages=467–484
| journal=Natural Computing
| doi=10.1007/s11047-007-9049-5
| citeseerx=10.1.1.605.5879
}}</ref>


As with most artificial life simulations, Boids is an example of ] behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules. The rules applied in the simplest Boids world are as follows:
===Ant colony optimization===
] (ACO), introduced by Dorigo in his doctoral dissertation, is a class of ] ]s modeled on the actions of an ]. ACO is a ] useful in problems that deal with finding better paths through graphs. Artificial 'ants'—simulation agents—locate optimal solutions by moving through a ] representing all possible solutions. Natural ants lay down ]s directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions.<ref>Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. ISBN 0-262-04219-3</ref>


* '''separation''': ] to avoid crowding local flockmates
===Artificial bee colony algorithm===
* '''alignment''': steer towards the average heading of local flockmates
] (ABC) is a meta-heuristic algorithm introduced by Karaboga in 2005,<ref>{{cite journal | last1 = Karaboga | first1 = Dervis | year = 2010 | title = Artificial bee colony algorithm | url = http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm | journal = Scholarpedia | volume = 5 | issue = 3| page = 6915 | doi=10.4249/scholarpedia.6915}}</ref> and simulates the foraging behaviour of honey bees. The ABC algorithm has three phases: employed bee, onlooker bee and scout bee. In the employed bee and the onlooker bee phases, bees exploit the sources by local searches in the neighbourhood of the solutions selected based on deterministic selection in the employed bee phase and the ] in the onlooker bee phase. In the scout bee phase which is an analogy of abandoning exhausted food sources in the foraging process, solutions that are not beneficial anymore for search progress are abandoned, and new solutions are inserted instead of them to explore new regions in the search space. The algorithm has a well-balanced exploration and exploitation ability.
* '''cohesion''': steer to move toward the average position (center of mass) of local flockmates


More complex rules can be added, such as obstacle avoidance and goal seeking.
=== Differential evolution ===
] is similar to genetic algorithm and pattern search. It uses multiagents or search vectors to carry out search. It has mutation and crossover, but do not have the global best solution in
its search equations, in contrast with the particle swarm optimization.


=== Self-propelled particles (Vicsek ''et al''. 1995) ===
=== The bees algorithm ===
{{main|Self-propelled particles}}
The ] in its basic formulation was created by Pham and his co-workers in 2005,<ref name="Pham & al, 2005">Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005.</ref> and further refined in the following years.<ref name="Pham & Castellani, 2009">{{cite journal | last1 = Pham | first1 = D.T. | last2 = Castellani | first2 = M. | year = 2009 | title = The Bees Algorithm – Modelling Foraging Behaviour to Solve Continuous Optimisation Problems | url = http://pic.sagepub.com/content/223/12/2919.short | journal = Proc. ImechE, Part C | volume = 223 | issue = 12| pages = 2919–2938 | doi=10.1243/09544062jmes1494}}</ref> Modelled on the foraging behaviour of ], the algorithm combines global explorative search with local exploitative search. A small number of artificial bees (scouts) explores randomly the solution space (environment) for solutions of high fitness (highly profitable food sources), whilst the bulk of the population search (harvest) the neighbourhood of the fittest solutions looking for the fitness optimum. A deterministics recruitment procedure which simulates the ] of biological bees is used to communicate the scouts' findings to the foragers, and distribute the foragers depending on the fitness of the neighbourhoods selected for local search. Once the search in the neighbourhood of a solution stagnates, the local fitness optimum is considered to be found, and the site is abandoned. In summary, the Bees Algorithm searches concurrently the most promising regions of the solution space, whilst continuously sampling it in search of new favourable regions.
Self-propelled particles (SPP), also referred to as the '']'', was introduced in 1995 by ] ''et al.''<ref name="Vicsek1995">{{cite journal | last1 = Vicsek | first1 = T. |author-link1=Tamás Vicsek| last2 = Czirok | first2 = A. | last3 = Ben-Jacob | first3 = E. | last4 = Cohen | first4 = I. | last5 = Shochet | first5 = O. | s2cid = 15918052 | year = 1995 | arxiv = cond-mat/0611743 | title = Novel type of phase transition in a system of self-driven particles | journal = ] | volume = 75 | issue = 6 | pages = 1226–1229 | doi = 10.1103/PhysRevLett.75.1226 | pmid=10060237|bibcode = 1995PhRvL..75.1226V }}</ref> as a special case of the ] model introduced in 1986 by ].<ref name="reynolds" /> A swarm is modelled in SPP by a collection of particles that move with a constant speed but respond to a random perturbation by adopting at each time increment the average direction of motion of the other particles in their local neighbourhood.<ref>{{cite journal | last1 = Czirók | first1 = A. | last2 = Vicsek | first2 = T. | s2cid = 14211016 | year = 2006 | arxiv = cond-mat/0611742 | title = Collective behavior of interacting self-propelled particles | journal = ] | volume = 281 | issue = 1 | pages = 17–29 | doi = 10.1016/S0378-4371(00)00013-3 | bibcode=2000PhyA..281...17C}}</ref> SPP models predict that swarming animals share certain properties at the group level, regardless of the type of animals in the swarm.<ref name="Buhl et al">{{cite journal | last1 = Buhl | first1 = J. | last2 = Sumpter | first2 = D.J.T. | last3 = Couzin | first3 = D. | last4 = Hale | first4 = J.J. | last5 = Despland | first5 = E. | last6 = Miller | first6 = E.R. | last7 = Simpson | first7 = S.J. | s2cid = 359329 | year = 2006 | title = From disorder to order in marching locusts | url = http://webscript.princeton.edu/~icouzin/website/wp-content/plugins/bib2html/data/papers/buhl06.pdf | journal = Science | volume = 312 | issue = 5778 | pages = 1402–1406 | doi = 10.1126/science.1125142 | pmid = 16741126 | bibcode = 2006Sci...312.1402B | display-authors = etal | access-date = 2011-10-07 | archive-date = 2011-09-29 | archive-url = https://web.archive.org/web/20110929220754/http://webscript.princeton.edu/~icouzin/website/wp-content/plugins/bib2html/data/papers/buhl06.pdf | url-status = dead }}</ref> Swarming systems give rise to ]s which occur at many different scales, some of which are turning out to be both universal and robust. It has become a challenge in theoretical physics to find minimal statistical models that capture these behaviours.<ref>{{cite journal | last1 = Toner | first1 = J. | last2 = Tu | first2 = Y. | last3 = Ramaswamy | first3 = S. | year = 2005 | title = Hydrodynamics and phases of flocks | url = http://eprints.iisc.ernet.in/3397/1/A89.pdf | journal = Annals of Physics | volume = 318 | issue = 1 | pages = 170–244 | bibcode = 2005AnPhy.318..170T | doi = 10.1016/j.aop.2005.04.011 | access-date = 2011-10-07 | archive-date = 2011-07-18 | archive-url = https://web.archive.org/web/20110718172510/http://eprints.iisc.ernet.in/3397/1/A89.pdf | url-status = dead }}</ref><ref name="Bertin et al">{{cite journal | last1 = Bertin | first1 = E. | last2 = Droz | first2 = M. | last3 = Grégoire | first3 = G. | s2cid = 17686543 | year = 2009 | arxiv = 0907.4688 | title = Hydrodynamic equations for self-propelled particles: microscopic derivation and stability analysis | journal = ] | volume = 42 | issue = 44 | page = 445001 | doi = 10.1088/1751-8113/42/44/445001 |bibcode = 2009JPhA...42R5001B }}</ref><ref name="Li et al">{{cite journal | last1 = Li | first1 = Y.X. | last2 = Lukeman | first2 = R. | last3 = Edelstein-Keshet | first3 = L. | year = 2007 | title = Minimal mechanisms for school formation in self-propelled particles | url = http://www.iam.ubc.ca/~lukeman/fish_school_f.pdf | archive-url = https://web.archive.org/web/20111001032730/http://www.iam.ubc.ca/~lukeman/fish_school_f.pdf | url-status = dead | archive-date = 2011-10-01 | journal = Physica D: Nonlinear Phenomena | volume = 237 | issue = 5 | pages = 699–720 | doi = 10.1016/j.physd.2007.10.009 | bibcode = 2008PhyD..237..699L | display-authors = etal }}</ref>


== Metaheuristics ==
===Artificial immune systems===
{{See also|List of metaphor-based metaheuristics}}
] (AIS) concerns the usage of abstract structure and function
]s (EA), ] (PSO), ] (DE), ] (ACO) and their variants dominate the field of nature-inspired ]s.<ref>{{cite book|first=Michael A.|last=Lones|title=Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation |chapter=Metaheuristics in nature-inspired algorithms |date=2014 |s2cid=14997975|pages=1419–1422|url=http://www.macs.hw.ac.uk/~ml355/common/papers/lones-gecco2014-metaheuristics.pdf|doi=10.1145/2598394.2609841|isbn=9781450328814|citeseerx=10.1.1.699.1825}}</ref> This list includes algorithms published up to circa the year 2000. A large number of more recent metaphor-inspired metaheuristics have started to ] for hiding their lack of novelty behind an elaborate metaphor. For algorithms published since that time, see ].
of the immune system to computational systems, and investigating the application of these systems towards solving computational problems from mathematics, engineering, and information technology. AIS is a sub-field of Biologically inspired computing, and natural computation, with interests in Machine Learning and belonging to the broader field of Artificial Intelligence.


]s lack a confidence in a solution.<ref name="Silberholz 2019 581–604">{{Citation| last1=Silberholz| first1=John| title=Computational Comparison of Metaheuristics|date=2019|work=Handbook of Metaheuristics|pages=581–604|editor-last=Gendreau|editor-first=Michel|series=International Series in Operations Research & Management Science|place=Cham|publisher=Springer International Publishing|language=en|doi=10.1007/978-3-319-91086-4_18|isbn=978-3-319-91086-4|last2=Golden|first2=Bruce|last3=Gupta|first3=Swati|last4=Wang|first4=Xingyin| s2cid=70030182|editor2-last=Potvin|editor2-first=Jean-Yves}}</ref> When appropriate parameters are determined, and when sufficient convergence stage is achieved, they often find a solution that is optimal, or near close to optimum – nevertheless, if one does not know optimal solution in advance, a quality of a solution is not known.<ref name="Silberholz 2019 581–604"/> In spite of this obvious drawback it has been shown that these types of ]s work well in practice, and have been extensively researched, and developed.<ref>{{Citation|last1=Burke|first1=Edmund|title=Variable Neighborhood Search for Nurse Rostering Problems|date=2004|work=Metaheuristics: Computer Decision-Making|pages=153–172|editor-last=Resende|editor-first=Mauricio G. C.|series=Applied Optimization|place=Boston, MA|publisher=Springer US|language=en|doi=10.1007/978-1-4757-4137-7_7|isbn=978-1-4757-4137-7|last2=De Causmaecker|first2=Patrick|last3=Petrovic|first3=Sanja|last4=Berghe|first4=Greet Vanden|editor2-last=de Sousa|editor2-first=Jorge Pinho}}</ref><ref>{{Cite journal|last=Fu|first=Michael C.|date=2002-08-01|title=Feature Article: Optimization for simulation: Theory vs. Practice|journal=INFORMS Journal on Computing|volume=14|issue=3|pages=192–215|doi=10.1287/ijoc.14.3.192.113|issn=1091-9856}}</ref><ref>{{Cite journal|last1=Dorigo|first1=Marco|last2=Birattari|first2=Mauro|last3=Stutzle|first3=Thomas|date=November 2006|title=Ant colony optimization|journal=IEEE Computational Intelligence Magazine|volume=1|issue=4|pages=28–39|doi=10.1109/MCI.2006.329691|issn=1556-603X}}</ref><ref>{{Cite journal|last=Hayes-RothFrederick|date=1975-08-01|title=Review of "Adaptation in Natural and Artificial Systems by John H. Holland", The U. of Michigan Press, 1975|journal=ACM SIGART Bulletin|issue=53|page=15|language=EN|doi=10.1145/1216504.1216510|s2cid=14985677}}</ref><ref>{{Citation|last1=Resende|first1=Mauricio G.C.|title=Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications|date=2010|work=Handbook of Metaheuristics|pages=283–319|editor-last=Gendreau|editor-first=Michel|series=International Series in Operations Research & Management Science|place=Boston, MA|publisher=Springer US|language=en|doi=10.1007/978-1-4419-1665-5_10|isbn=978-1-4419-1665-5|last2=Ribeiro|first2=Celso C.|editor2-last=Potvin|editor2-first=Jean-Yves}}</ref> On the other hand, it is possible to avoid this drawback by calculating solution quality for a special case where such calculation is possible, and after such run it is known that every solution that is at least as good as the solution a special case had, has at least a solution confidence a special case had. One such instance is ]-inspired ] for ] where this has been achieved probabilistically via hybridization of ] with ] technique.<ref>{{Cite journal|last1=Kudelić|first1=Robert|last2=Ivković|first2=Nikola|date=2019-05-15|title=Ant inspired Monte Carlo algorithm for minimum feedback arc set|url=http://www.sciencedirect.com/science/article/pii/S0957417418307899|journal=Expert Systems with Applications|language=en|volume=122|pages=108–117|doi=10.1016/j.eswa.2018.12.021|s2cid=68071710|issn=0957-4174}}</ref>
===Bat algorithm===
] (BA) is a swarm-intelligence-based algorithm, inspired by the ] behavior of ]s. BA automatically balances exploration (long-range jumps around the global search space to avoid getting stuck around one local maxima) with exploitation (searching in more detail around known good solutions to find local maxima) by controlling loudness and pulse emission rates of simulated bats in the multi-dimensional search space.<ref>X. S. Yang, A New Metaheuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for Optimization (NISCO 2010) (Eds. J. R. Gonzalez et al.), Studies in Computational Intelligence, Springer Berlin, 284, Springer, 65-74 (2010).</ref>


===Glowworm swarm optimization=== === Ant colony optimization (Dorigo 1992) ===
{{main|Ant colony optimization}}
] (GSO), introduced by Krishnanand and Ghose in 2005 for simultaneous computation of multiple optima of multimodal functions.<ref>Krishnanand K.N. and D. Ghose (2005) "Detection of multiple source locations using a glowworm metaphor with applications to collective robotics". ''IEEE Swarm Intelligence Symposium'', Pasadena, California, USA, pp. 84–91.</ref><ref>{{cite journal | last1 = Krishnanand | first1 = K.N. | last2 = Ghose | first2 = D. | year = 2009 | title = Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions | url = | journal = Swarm Intelligence | volume = 3 | issue = 2| pages = 87–124 | doi=10.1007/s11721-008-0021-5}}</ref><ref>{{cite journal | last1 = Krishnanand | first1 = K.N. | last2 = Ghose | first2 = D. | year = 2008 | title = Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations | url = | journal = Robotics and Autonomous Systems | volume = 56 | issue = 7| pages = 549–569 | doi=10.1016/j.robot.2007.11.003}}</ref><ref>{{cite journal | last1 = Krishnanand | first1 = K.N. | last2 = Ghose | first2 = D. | year = 2006 | title = Glowworm swarm based optimization algorithm for multimodal functions with collective robotics applications | url = | journal = Multi-agent and Grid Systems | volume = 2 | issue = 3| pages = 209–222 }}</ref> The algorithm shares a few features with some better known algorithms, such as ] and ], but with several significant differences. The agents in GSO are thought of as ]s that carry a ] quantity called ] along with them. The glowworms encode the fitness of their current locations, evaluated using the objective function, into a luciferin value that they broadcast to their neighbors. The glowworm identifies its neighbors and computes its movements by exploiting an adaptive neighborhood, which is bounded above by its sensor range. Each glowworm selects, using a ], a neighbor that has a luciferin value higher than its own and moves toward it. These movements—based only on local information and selective neighbor interactions—enable the swarm of glowworms to partition into disjoint subgroups that converge on multiple optima of a given multimodal function.
Ant colony optimization (ACO), introduced by Dorigo in his doctoral dissertation, is a class of ] ]s modeled on the actions of an ]. ACO is a ] useful in problems that deal with finding better paths through graphs. Artificial 'ants'—simulation agents—locate optimal solutions by moving through a ] representing all possible solutions. Natural ants lay down ]s directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate for better solutions.<ref>Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. {{ISBN|0-262-04219-3}}</ref>


=== Particle swarm optimization (Kennedy, Eberhart & Shi 1995) ===
===Gravitational search algorithm===
{{main|Particle swarm optimization}}
Gravitational search algorithm (GSA) based on the ] and the notion of mass interactions. The GSA algorithm uses the theory of Newtonian physics and its searcher agents are the collection of masses. In GSA, there is an isolated system of masses. Using the gravitational force, every mass in the system can see the situation of other masses. The gravitational force is therefore a way of transferring information between different masses (Rashedi, Nezamabadi-pour and Saryazdi 2009).<ref>{{cite journal |first=E. |last=Rashedi |first2=H. |last2=Nezamabadi-pour |first3=S. |last3=Saryazdi |title=GSA: a gravitational search algorithm |journal=Information Science |volume=179 |issue=13 |pages=2232–2248 |year=2009 |doi=10.1016/j.ins.2009.03.004}}</ref>
Particle swarm optimization (PSO) is a ] algorithm for dealing with problems in which a best solution can be represented as a point or surface in an n-dimensional space. Hypotheses are plotted in this space and seeded with an initial ], as well as a communication channel between the particles.<ref>{{cite journal |doi=10.1023/A:1016568309421 |title=Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization |last1=Parsopoulos |first1=K. E. |last2=Vrahatis |first2=M. N. |s2cid=4021089 |journal=Natural Computing |volume=1 |issue=2–3 |pages=235–306 |year=2002 }}</ref><ref> by Maurice Clerc, ISTE, {{ISBN|1-905209-04-5}}, 2006.</ref> Particles then move through the solution space, and are evaluated according to some ] criterion after each timestep. Over time, particles are accelerated towards those particles within their communication grouping which have better fitness values. The main advantage of such an approach over other global minimization strategies such as ] is that the large number of members that make up the particle swarm make the technique impressively resilient to the problem of ].
In GSA, agents are considered as objects and their performance is measured by their masses. All these objects attract each other by a gravity force, and this force causes a movement of all objects globally towards the objects with heavier masses. The heavy masses correspond to good solutions of the problem. The position of the agent corresponds to a solution of the problem, and its mass is determined using a fitness function. By lapse of time, masses are attracted by the heaviest mass, which would ideally present an optimum solution in the search space. The GSA could be considered as an isolated system of masses. It is like a small artificial world of masses obeying the Newtonian laws of gravitation and motion (Rashedi, Nezamabadi-pour and Saryazdi 2009). A multi-objective variant of GSA, called MOGSA, was proposed by Hassanzadeh et al. in 2010.<ref>Hassanzadeh, Hamid Reza, and Modjtaba Rouhani. "A multi-objective gravitational search algorithm." Computational Intelligence, Communication Systems and Networks (CICSyN), 2010 Second International Conference on. IEEE, 2010.</ref>


=== Artificial bee colony algorithm (Karaboga 2005) ===
===River Formation Dynamics===
{{Main|Artificial bee colony algorithm}}
River Formation Dynamics (RFD) is based on imitating how water forms rivers by eroding the ground and depositing sediments (the drops act as the swarm). After drops transform the landscape by increasing/decreasing the altitude of places, solutions are given in the form of paths of decreasing altitudes. Decreasing gradients are constructed, and these gradients are followed by subsequent drops to compose new gradients and reinforce the best ones.
Karaboga introduced ABC metaheuristic in 2005 as an answer to optimize numerical problems. Inspired by ] foraging behavior, Karaboga's model had three components. The employed, onlooker, and scout. In practice, the artificial scout bee would expose all food source positions (solutions) good or bad. The employed bee would search for the shortest route to each position to extract the food amount (quality) of the source. If the food was ] from the source, the employed bee would become a scout and randomly search for other food sources. Each source that became abandoned created negative feedback meaning, the answers found were poor solutions. The onlooker bees wait for employed bees to either abandon a source or give information that the source has a large quantity of food and is worth sending additional resources to. The more an onlooker bee is recruited, the more positive the feedback is meaning that the answer is likely a good solution.
This heuristic optimization method was first presented in 2007 by Rabanal et al.<ref>P. Rabanal, I. Rodríguez, and F. Rubio (2007) "Using River Formation Dynamics to Design Heuristic Algorithms". ''Unconventional Computation'', Springer, LNCS 4616, pp. 163–177.</ref> The applicability of RFD to other NP-complete problems was studied in,<ref>P. Rabanal, I. Rodríguez, and F. Rubio (2008) "Finding minimum spanning/distances trees by using river formation dynamics". ''Ant Colony Optimization and Swarm Intelligence'', Springer, LNCS 5217, pp. 60–71.</ref><ref>P. Rabanal, I. Rodríguez, and F. Rubio (2009) "Applying River Formation Dynamics to Solve NP-Complete Problems". ''Nature-Inspired Algorithms for Optimisation'', Springer, SCI 193, pp. 333–368.</ref><ref>P. Rabanal, I. Rodríguez, and F. Rubio (2013) "Testing restorable systems: formal definition and heuristic solution based on river formation dynamics". ''Formal Aspects of Computing'', Springer, Volume 25, Number 5, pp. 743–768.</ref> The algorithm has also been applied in other fields as routing,<ref>S.H. Amin, H.S. Al-Raweshidy, R.S. Abbas (2014) "Smart data packet ad hoc routing protocol", ''Computer Networks'', Elsevier, Volume 62, pp. 162-181</ref><ref>K. Guravaiah, R.L. Velusamy (2015), "RFDMRP: River Formation Dynamics based Multi-hop Routing Protocol for Data Collection in Wireless Sensor Networks", ''Procedia Computer Science'', Elsevier, Volume 54, pp. 31-36</ref> or robot navigation.<ref>G. Redlarski, A. Pałkowski, M. Dąbkowski (2013), "Using River Formation Dynamics Algorithm in Mobile Robot Navigation", ''Solid State Phenomena'', Volume 198, pp. 138-143</ref>


=== Artificial Swarm Intelligence (2015) ===
===Self-propelled particles===
Artificial Swarm Intelligence (ASI) is method of amplifying the collective intelligence of networked human groups using control algorithms modeled after natural swarms. Sometimes referred to as Human Swarming or Swarm AI, the technology connects groups of human participants into real-time systems that deliberate and converge on solutions as dynamic swarms when simultaneously presented with a question<ref>{{Cite book|last=Rosenberg|first=Louis|date=2015-07-20|chapter=Human Swarms, a real-time method for collective intelligence|chapter-url=https://www.mitpressjournals.org/doi/abs/10.1162/978-0-262-33027-5-ch117|volume=27|pages=658–659|doi=10.7551/978-0-262-33027-5-ch117|isbn=9780262330275|title=07/20/2015-07/24/2015}}</ref><ref name=":0">{{Cite book|last1=Rosenberg|first1=Louis|last2=Willcox|first2=Gregg|title=Intelligent Systems and Applications |chapter=Artificial Swarm Intelligence |date=2020|editor-last=Bi|editor-first=Yaxin|editor2-last=Bhatia|editor2-first=Rahul|editor3-last=Kapoor|editor3-first=Supriya|series=Advances in Intelligent Systems and Computing|language=en|publisher=Springer International Publishing|volume=1037|pages=1054–1070|doi=10.1007/978-3-030-29516-5_79|isbn=9783030295165|s2cid=195258629}}</ref><ref>{{Cite journal|last1=Metcalf|first1=Lynn|last2=Askay|first2=David A.|last3=Rosenberg|first3=Louis B.|s2cid=202323483|date=2019|title=Keeping Humans in the Loop: Pooling Knowledge through Artificial Swarm Intelligence to Improve Business Decision Making|journal=California Management Review|language=en|volume=61|issue=4|pages=84–109|doi=10.1177/0008125619862256|issn=0008-1256|url=https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1105&context=it_fac}}</ref> ASI has been used for a wide range of applications, from enabling business teams to generate highly accurate financial forecasts<ref>{{Cite book |doi = 10.1109/HCC46620.2019.00019|chapter = "Human Swarming" Amplifies Accuracy and ROI when Forecasting Financial Markets|title = 2019 IEEE International Conference on Humanized Computing and Communication (HCC)|pages = 77–82|year = 2019|last1 = Schumann|first1 = Hans|last2 = Willcox|first2 = Gregg|last3 = Rosenberg|first3 = Louis|last4 = Pescetelli|first4 = Niccolo|s2cid = 209496644|isbn = 978-1-7281-4125-1}}</ref> to enabling sports fans to outperform Vegas betting markets.<ref name=":2">{{Cite news|title=How AI systems beat Vegas oddsmakers in sports forecasting accuracy|work=TechRepublic|url=https://www.techrepublic.com/article/how-ai-systems-beat-vegas-oddsmakers-in-sports-forecasting-accuracy/ |first=Macy |last=Bayern |date=September 4, 2018|access-date=2018-09-10}}</ref> ASI has also been used to enable groups of doctors to generate diagnoses with significantly higher accuracy than traditional methods.<ref name=":4" /><ref name=":3" /> ASI has been used by the ] of the ] to help forecast famines in hotspots around the world.<ref>{{Cite web|last=Rosenberg|first= Louis |date=October 13, 2021
] (SPP), also referred to as the ''Vicsek model'', was introduced in 1995 by ] ''et al.''<ref name="Vicsek1995">{{cite journal | last1 = Vicsek | first1 = T. |authorlink1=Tamas Vicsek| last2 = Czirok | first2 = A. | last3 = Ben-Jacob | first3 = E.; | last4 = Cohen | first4 = I. | last5 = Shochet | first5 = O. | year = 1995 | arxiv = cond-mat/0611743 | title = Novel type of phase transition in a system of self-driven particles | journal = ] | volume = 75 | pages = 1226–1229 | doi = 10.1103/PhysRevLett.75.1226 | pmid=10060237|bibcode = 1995PhRvL..75.1226V }}</ref> as a special case of the ] model introduced in 1986 by ].<ref>{{cite journal | last = Reynolds | first = C. W. | year = 1987 | id = {{citeseerx|10.1.1.103.7187}} | title = Flocks, herds and schools: A distributed behavioral model | journal = Computer Graphics | volume = 21 | issue = 4 | pages = 25–34 | doi = 10.1145/37401.37406 }}</ref> A swarm is modelled in SPP by a collection of particles that move with a constant speed but respond to a random perturbation by adopting at each time increment the average direction of motion of the other particles in their local neighbourhood.<ref>{{cite journal | last1 = Czirók | first1 = A. | last2 = Vicsek | first2 = T. | year = 2006 | arxiv = cond-mat/0611742 | title = Collective behavior of interacting self-propelled particles | journal = ] | volume = 281 | pages = 17–29 | doi = 10.1016/S0378-4371(00)00013-3 | bibcode=2000PhyA..281...17C}}</ref> SPP models predict that swarming animals share certain properties at the group level, regardless of the type of animals in the swarm.<ref name="Buhl et al">{{cite journal | last1 = Buhl | first1 = J. | last2 = Sumpter | first2 = D.J.T. | last3 = Couzin | first3 = D. | last4 = Hale | first4 = J.J. | last5 = Despland | first5 = E. | last6 = Miller | first6 = E.R. | last7 = Simpson | first7 = S.J.| year = 2006 | title = From disorder to order in marching locusts | url = http://webscript.princeton.edu/~icouzin/website/wp-content/plugins/bib2html/data/papers/buhl06.pdf | format = PDF | journal = Science | volume = 312 | issue = 5778| pages = 1402–1406 | doi = 10.1126/science.1125142 | pmid = 16741126 |bibcode = 2006Sci...312.1402B |display-authors=etal}}</ref> Swarming systems give rise to ]s which occur at many different scales, some of which are turning out to be both universal and robust. It has become a challenge in theoretical physics to find minimal statistical models that capture these behaviours.<ref>{{cite journal | last1 = Toner | first1 = J. | last2 = Tu | first2 = Y. | last3 = Ramaswamy | first3 = S. | year = 2005 | title = Hydrodynamics and phases of flocks | url = http://eprints.iisc.ernet.in/3397/1/A89.pdf | format = PDF | journal = Annals of Physics | volume = 318 | issue = | pages = 170–244 |bibcode = 2005AnPhy.318..170T |doi = 10.1016/j.aop.2005.04.011 }}</ref><ref name="Bertin et al">{{cite journal | last1 = Bertin | first1 = E. | last2 = Droz | first2 = M. | last3 = Grégoire | first3 = G. | year = 2009 | arxiv = 0907.4688 | title = Hydrodynamic equations for self-propelled particles: microscopic derivation and stability analysis | journal = ] | volume = 42 | issue = 44 | page = 445001 | doi = 10.1088/1751-8113/42/44/445001 |bibcode = 2009JPhA...42R5001B }}</ref><ref name="Li et al">{{cite journal | last1 = Li | first1 = Y.X. | last2 = Lukeman | first2 = R. | last3 = Edelstein-Keshet | first3 = L.| year = 2007 | title = Minimal mechanisms for school formation in self-propelled particles | url = http://www.iam.ubc.ca/~lukeman/fish_school_f.pdf | format = PDF | journal = Physica D: Nonlinear Phenomena | volume = 237 | issue = 5| pages = 699–720 | doi = 10.1016/j.physd.2007.10.009 | bibcode=2008PhyD..237..699L|display-authors=etal}}</ref>
|title=Swarm intelligence: AI inspired by honeybees can help us make better decisions|url=https://bigthink.com/the-future/swarm-intelligence-ai-honeybees/|access-date=|website=Big Think|language=en-US}}</ref>{{Better source needed|reason=Citation is the written by company's owner, need secondary or tertiary source to confirm.|date=December 2021}}

===Stochastic diffusion search===
] (SDS)<ref>Bishop, J.M., Stochastic Searching Networks, Proc. 1st IEE Int. Conf. on
Artificial Neural Networks, pp. 329-331, London, UK, (1989).</ref><ref>Nasuto, S.J. & Bishop, J.M., (2008), Stabilizing swarm intelligence search via positive feedback resource allocation, In: Krasnogor, N., Nicosia, G, Pavone, M., & Pelta, D. (eds), Nature Inspired Cooperative Strategies for Optimization, Studies in Computational Intelligence, vol 129, Springer, Berlin, Heidelberg, New York, pp. 115-123.</ref> is an agent-based ] global search and optimization technique best suited to problems where the objective function can be decomposed into multiple independent partial-functions. Each agent maintains a hypothesis which is iteratively tested by evaluating a randomly selected partial objective function parameterised by the agent's current hypothesis. In the standard version of SDS such partial function evaluations are binary, resulting in each agent becoming active or inactive. Information on hypotheses is diffused across the population via inter-agent communication. Unlike the ] communication used in ACO, in SDS agents communicate ] via a one-to-one communication strategy analogous to the ] procedure observed in ].<ref>Moglich, M.; Maschwitz, U.; Holldobler, B., Tandem Calling: A New Kind of Signal in Ant Communication, Science, Volume 186, Issue 4168, pp. 1046-1047</ref> A positive feedback mechanism ensures that, over time, a population of agents stabilise around the global-best solution. SDS is both an efficient and robust global search and optimisation algorithm, which has been extensively mathematically described.<ref>Nasuto, S.J., Bishop, J.M. & Lauria, S., Time complexity analysis of the Stochastic Diffusion Search, Proc. Neural Computation '98, pp. 260-266, Vienna, Austria, (1998).</ref><ref>Nasuto, S.J., & Bishop, J.M., (1999), Convergence of the Stochastic Diffusion Search, Parallel Algorithms, 14:2, pp: 89-107.</ref><ref>Myatt, D.M., Bishop, J.M., Nasuto, S.J., (2004), Minimum stable convergence criteria for Stochastic Diffusion Search, Electronics Letters, 22:40, pp. 112-113.</ref> Recent work has involved merging the global search properties of SDS with other swarm intelligence algorithms.<ref>al-Rifaie, M.M., Bishop, J.M. & Blackwell, T., An investigation into the merger of stochastic diffusion search and particle swarm optimisation, Proc. 13th Conf. Genetic and Evolutionary Computation, (GECCO), pp.37-44, (2012).</ref><ref>al-Rifaie, Mohammad Majid, John Mark Bishop, and Tim Blackwell. "Information sharing impact of stochastic diffusion search on differential evolution algorithm." Memetic Computing 4.4 (2012): 327-338.</ref>

===Multi-swarm optimization===
] is a variant of particle swarm optimization (PSO) based on the use of multiple sub-swarms instead of one (standard) swarm. The general approach in multi-swarm optimization is that each sub-swarm focuses on a specific region while a specific diversification method decides where and when to launch the sub-swarms. The multi-swarm framework is especially fitted for the optimization on multi-modal problems, where multiple (local) optima exist.


==Applications== ==Applications==
Swarm Intelligence-based techniques can be used in a number of applications. The U.S. military is investigating swarm techniques for controlling unmanned vehicles. The ] is thinking about an orbital swarm for self-assembly and interferometry. ] is investigating the use of swarm technology for planetary mapping. A 1992 paper by ] and ] discusses the possibility of using swarm intelligence to control nanobots within the body for the purpose of killing cancer tumors.<ref>{{cite paper |last=Lewis |first=M. Anthony |last2=Bekey |first2=George A. |title=The Behavioral Self-Organization of Nanorobots Using Local Rules |work=Proceedings of the 1992 IEEE/RSJ International Conference on Intelligent Robots and Systems }}</ref> Conversely al-Rifaie and Aber have used ] to help locate tumours.<ref>{{cite journal | last1 = al-Rifaie | first1 = M.M. | last2 = Aber | first2 = A. | year = | title = Identifying metastasis in bone scans with Stochastic Diffusion Search | url = | journal = Proc. IEEE Information Technology in Medicine and Education, ITME | volume = 2012 | issue = | pages = 519–523 }}</ref><ref>al-Rifaie, Mohammad Majid, Ahmed Aber, and Ahmed Majid Oudah. "Utilising Stochastic Diffusion Search to identify metastasis in bone scans and microcalcifications on mammographs." In Bioinformatics and Biomedicine Workshops (BIBMW), 2012 IEEE International Conference on, pp. 280-287. IEEE, 2012.</ref> Swarm intelligence has also been applied for data mining.<ref>{{cite journal |first=D. |last=Martens |first2=B. |last2=Baesens |first3=T. |last3=Fawcett |title=Editorial Survey: Swarm Intelligence for Data Mining |journal=Machine Learning |volume=82 |issue=1 |pages=1–42 |year=2011 |doi=10.1007/s10994-010-5216-5 }}</ref> Swarm Intelligence-based techniques can be used in a number of applications. The U.S. military is investigating swarm techniques for controlling unmanned vehicles. The ] is thinking about an orbital swarm for self-assembly and interferometry. ] is investigating the use of swarm technology for planetary mapping. A 1992 paper by ] and ] discusses the possibility of using swarm intelligence to control nanobots within the body for the purpose of killing cancer tumors.<ref>{{cite journal |last1=Lewis |first1=M. Anthony |last2=Bekey |first2=George A. |title=The Behavioral Self-Organization of Nanorobots Using Local Rules |journal=Proceedings of the 1992 IEEE/RSJ International Conference on Intelligent Robots and Systems |url=https://www.researchgate.net/publication/3690783}}</ref> Conversely al-Rifaie and Aber have used ] to help locate tumours.<ref>{{cite journal | last1 = al-Rifaie | first1 = M.M. | last2 = Aber | first2 = A. | title = Identifying metastasis in bone scans with Stochastic Diffusion Search | url =https://www.researchgate.net/publication/262223271 | journal = Proc. IEEE Information Technology in Medicine and Education, ITME | volume = 2012 | pages = 519–523 }}</ref><ref>al-Rifaie, Mohammad Majid, Ahmed Aber, and Ahmed Majid Oudah. "{{dead link|date=July 2022|bot=medic}}{{cbignore|bot=medic}}." In Bioinformatics and Biomedicine Workshops (BIBMW), 2012 IEEE International Conference on, pp. 280-287. IEEE, 2012.</ref> Swarm intelligence (SI) is increasingly applied in Internet of Things (IoT)<ref>{{Cite journal |last1=Sun |first1=Weifeng |last2=Tang |first2=Min |last3=Zhang |first3=Lijun |last4=Huo |first4=Zhiqiang |last5=Shu |first5=Lei |date=January 2020 |title=A Survey of Using Swarm Intelligence Algorithms in IoT |journal=Sensors |language=en |volume=20 |issue=5 |pages=1420 |doi=10.3390/s20051420 |doi-access=free |pmid=32150912 |pmc=7085620 |bibcode=2020Senso..20.1420S |issn=1424-8220}}</ref><ref>{{Cite journal |last1=Abualigah |first1=Laith |last2=Falcone |first2=Deborah |last3=Forestiero |first3=Agostino |date=2023-05-29 |title=Swarm Intelligence to Face IoT Challenges |journal=Computational Intelligence and Neuroscience |volume=2023 |pages=4254194 |doi=10.1155/2023/4254194 |doi-access=free |issn=1687-5265 |pmid=37284052|pmc=10241578 }}</ref> systems, and by association to Intent-Based Networking (IBN),<ref>{{Cite web |title=Intent-Based Networking for the Internet of Things {{!}} Frontiers Research Topic |url=https://www.frontiersin.org/research-topics/59831/intent-based-networking-for-the-internet-of-things/overview |access-date=2024-08-14 |website=www.frontiersin.org |language=en}}</ref> due to its ability to handle complex, distributed tasks through decentralized, self-organizing algorithms. Swarm intelligence has also been applied for ]<ref>{{cite journal |first1=D. |last1=Martens |first2=B. |last2=Baesens |first3=T. |last3=Fawcett |title=Editorial Survey: Swarm Intelligence for Data Mining |journal=Machine Learning |volume=82 |issue=1 |pages=1–42 |year=2011 |doi=10.1007/s10994-010-5216-5 |doi-access=free }}</ref> and ].<ref>{{cite journal |first1=M. |last1=Thrun |first2=A. |last2=Ultsch |title= Swarm Intelligence for Self-Organized Clustering |journal=Artificial Intelligence |volume=290 |pages= 103237 |year=2021 |doi=10.1016/j.artint.2020.103237|s2cid=213923899 |arxiv=2106.05521 }}</ref> Ant-based models are further subject of modern management theory.<ref>{{cite book |last1=Fladerer |first1=Johannes-Paul |last2=Kurzmann |first2=Ernst |title=THE WISDOM OF THE MANY : how to create self -organisation and how to use collective... intelligence in companies and in society from mana. |date=November 2019 |publisher=BOOKS ON DEMAND |isbn=9783750422421}}</ref>


===Ant-based routing=== ===Ant-based routing===
The use of Swarm Intelligence in ] has also been researched, in the form of ]. This was pioneered separately by Dorigo et al. and ] in the mid-1990s, with a number of variations since. Basically this uses a ] routing table rewarding/reinforcing the route successfully traversed by each "ant" (a small control packet) which flood the network. Reinforcement of the route in the forwards, reverse direction and both simultaneously have been researched: backwards reinforcement requires a symmetric network and couples the two directions together; forwards reinforcement rewards a route before the outcome is known (but then you pay for the cinema before you know how good the film is). As the system behaves stochastically and is therefore lacking repeatability, there are large hurdles to commercial deployment. Mobile media and new technologies have the potential to change the threshold for collective action due to swarm intelligence (Rheingold: 2002, P175). The use of swarm intelligence in ] has also been researched, in the form of ]. This was pioneered separately by Dorigo et al. and ] in the mid-1990s, with a number of variants existing. Basically, this uses a ] routing table rewarding/reinforcing the route successfully traversed by each "ant" (a small control packet) which flood the network. Reinforcement of the route in the forwards, reverse direction and both simultaneously have been researched: backwards reinforcement requires a symmetric network and couples the two directions together; forwards reinforcement rewards a route before the outcome is known (but then one would pay for the cinema before one knows how good the film is). As the system behaves stochastically and is therefore lacking repeatability, there are large hurdles to commercial deployment. Mobile media and new technologies have the potential to change the threshold for collective action due to swarm intelligence (Rheingold: 2002, P175).


The location of transmission infrastructure for wireless communication networks is an important engineering problem involving competing objectives. A minimal selection of locations (or sites) are required subject to providing adequate area coverage for users. A very different-ant inspired swarm intelligence algorithm, ] (SDS), has been successfully used to provide a general model for this problem, related to circle packing and set covering. It has been shown that the SDS can be applied to identify suitable solutions even for large problem instances.<ref>Whitaker, R.M., Hurley, S.. An agent based approach to site selection for wireless networks. Proc ACM Symposium on Applied Computing, pp. 574–577, (2002).</ref> The location of transmission infrastructure for wireless communication networks is an important engineering problem involving competing objectives. A minimal selection of locations (or sites) are required subject to providing adequate area coverage for users. A very different, ant-inspired swarm intelligence algorithm, stochastic diffusion search (SDS), has been successfully used to provide a general model for this problem, related to circle packing and set covering. It has been shown that the SDS can be applied to identify suitable solutions even for large problem instances.<ref>Whitaker, R.M., Hurley, S.. . Proc ACM Symposium on Applied Computing, pp. 574–577, (2002).</ref>


Airlines have also used ant-based routing in assigning aircraft arrivals to airport gates. At ] a software program uses swarm theory, or swarm intelligence—the idea that a colony of ants works better than one alone. Each pilot acts like an ant searching for the best airport gate. "The pilot learns from his experience what's the best for him, and it turns out that that's the best solution for the airline," ] explains. As a result, the "colony" of pilots always go to gates they can arrive at and depart from quickly. The program can even alert a pilot of plane back-ups before they happen. "We can anticipate that it's going to happen, so we'll have a gate available," Lawson says.<ref>{{cite news |work=Science Daily |date=April 1, 2008 |title=Planes, Trains and Ant Hills: Computer scientists simulate activity of ants to reduce airline delays |url=http://www.sciencedaily.com/videos/2008/0406-planes_trains_and_ant_hills.htm |accessdate=December 1, 2010 }}</ref> Airlines have also used ant-based routing in assigning aircraft arrivals to airport gates. At ] a software program uses swarm theory, or swarm intelligence—the idea that a colony of ants works better than one alone. Each pilot acts like an ant searching for the best airport gate. "The pilot learns from his experience what's the best for him, and it turns out that that's the best solution for the airline," ] explains. As a result, the "colony" of pilots always go to gates they can arrive at and depart from quickly. The program can even alert a pilot of plane back-ups before they happen. "We can anticipate that it's going to happen, so we'll have a gate available," Lawson says.<ref>{{cite news |work=Science Daily |date=April 1, 2008 |title=Planes, Trains and Ant Hills: Computer scientists simulate activity of ants to reduce airline delays |url=https://www.sciencedaily.com/videos/2008/0406-planes_trains_and_ant_hills.htm |access-date=December 1, 2010 |url-status=dead |archive-url=https://web.archive.org/web/20101124132227/https://www.sciencedaily.com/videos/2008/0406-planes_trains_and_ant_hills.htm |archive-date=November 24, 2010 }}</ref>


===Crowd simulation=== ===Crowd simulation===
Artists are using swarm technology as a means of creating complex interactive systems or ]. Artists are using swarm technology as a means of creating complex interactive systems or ].{{Citation needed|reason=How?, direct mathematical use? 'Poetic' use? and if so, abstract or concrete usage?|date=May 2021}}


====Instances====
] was the first movie to make use of swarm technology for rendering, realistically depicting the movements of groups of fish and birds using the ] system. Tim Burton's '']'' also made use of swarm technology for showing the movements of a group of bats. ] made use of similar technology, known as ], during battle scenes. Swarm technology is particularly attractive because it is cheap, robust, and simple.


] made use of similar technology, known as ], during battle scenes. Swarm technology is particularly attractive because it is cheap, robust, and simple.
Airlines have used swarm theory to simulate passengers boarding a plane. Southwest Airlines researcher ] used an ant-based computer simulation employing only six interaction rules to evaluate boarding times using various boarding methods.(Miller, 2010, xii-xviii).<ref>{{cite book |last=Miller |first=Peter |year=2010 |title=The Smart Swarm: How understanding flocks, schools, and colonies can make us better at communicating, decision making, and getting things done |publisher=Avery |location=New York |isbn=978-1-58333-390-7 }}</ref>

'']'' was the first movie to make use of swarm technology for rendering, realistically depicting the movements of groups of fish and birds using the Boids system.{{Citation needed|reason='the first movie' to show X by Y while using Z system needs a citation|date=May 2021}}

Tim Burton's '']'' also made use of swarm technology for showing the movements of a group of bats.
<ref>{{cite journal |last1=Mahant |first1=Manish |last2=Singh Rathore |first2=Kalyani |last3=Kesharwani |first3=Abhishek |last4=Choudhary |first4=Bharat |title=A Profound Survey on Swarm Intelligence |journal=International Journal of Advanced Computer Research |date=2012 |volume=2 |issue=1 |url=http://scholar.googleusercontent.com/scholar?q=cache:-gCjl9XY6IcJ:scholar.google.com/+A+Profound+Survey+on+Swarm+Intelligence&hl=vi&as_sdt=0,5 |access-date=3 October 2022}}</ref>

Airlines have used swarm theory to simulate passengers boarding a plane. Southwest Airlines researcher Douglas A. Lawson used an ant-based computer simulation employing only six interaction rules to evaluate boarding times using various boarding methods.(Miller, 2010, xii-xviii).<ref>{{cite book |last=Miller |first=Peter |year=2010 |title=The Smart Swarm: How understanding flocks, schools, and colonies can make us better at communicating, decision making, and getting things done |publisher=Avery |location=New York |isbn=978-1-58333-390-7 |url-access=registration |url=https://archive.org/details/smartswarmhowund00mill }}</ref>


===Human swarming=== ===Human swarming===
Networks of distributed users can be organized into "human swarms" through the implementation of real-time closed-loop control systems.<ref>{{Cite web|url=http://www.bbc.com/future/story/20161215-why-bees-could-be-the-secret-to-superhuman-intelligence|title=Why bees could be the secret to superhuman intelligence|last=Oxenham|first=Simon|access-date=2017-01-20}}</ref><ref name="Rosenberg 58–62">{{Cite book|last1=Rosenberg|first1=L.|last2=Pescetelli|first2=N.|last3=Willcox|first3=G.|title=2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON) |chapter=Artificial Swarm Intelligence amplifies accuracy when predicting financial markets |s2cid=21312426|date=October 2017|pages=58–62|doi=10.1109/UEMCON.2017.8248984|isbn=978-1-5386-1104-3}}</ref> Developed by ] in 2015, human swarming, also called artificial swarm intelligence, allows the collective intelligence of interconnected groups of people online to be harnessed.<ref>{{Cite journal|url=https://www.csmonitor.com/Technology/2016/0512/Smarter-as-a-group-How-swarm-intelligence-picked-Derby-winners|title=Smarter as a group: How swarm intelligence picked Derby winners|journal=Christian Science Monitor}}</ref><ref>{{Cite web|url=https://www.cnet.com/tech/services-and-software/swarm-ai-unu-boasts-it-can-predict-winners-using-humans/|title=AI startup taps human 'swarm' intelligence to predict winners|website=CNET}}</ref> The collective intelligence of the group often exceeds the abilities of any one member of the group.<ref>{{Cite journal|last=Rosenberg|first=Louis|date=2016-02-12|title=Artificial Swarm Intelligence, a human-in-the-loop approach to A.I.|url=https://dl.acm.org/doi/10.5555/3016387.3016604|journal=Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence|series=AAAI'16|location=Phoenix, Arizona|publisher=AAAI Press|pages=4381–4382}}</ref>
Enabled by mediating software such as the collective intelligence platform, networks of distributed users can be organized into "human swarms" (also referred to as "social swarms") through the implementation of real-time closed-loop control systems. As published by ] (2015), such real-time control systems enable groups of human participants to behave as a unified ].<ref>http://sites.lsa.umich.edu/collectiveintelligence/wp-content/uploads/sites/176/2015/05/Rosenberg-CI-2015-Abstract.pdf</ref> When logged into the UNU platform, for example, groups of distributed users can collectively answer questions, generate ideas, and make predictions as a singular emergent entity.<ref>{{cite web|url=https://mitpress.mit.edu/sites/default/files/titles/content/ecal2015/ch117.html|title=Human Swarms, a real-time method for collective intelligence|publisher=}}</ref><ref>{{cite web|url=http://news.discovery.com/human/life/swarms-of-humans-power-a-i-platform-150603.htm|title=Swarms of Humans Power A.I. Platform|work=DNews}}</ref> Early testing shows that human swarms can out-predict individuals across a variety of real-world projections.<ref>{{cite web|url=http://unanimousai.com/swarms-are-smart-its-kinda-scary/|title=SWARMS are SMART... it's kinda scary!|work=UNANIMOUS A.I.}}</ref>


] published in 2018 a study showing that groups of human doctors, when connected together by real-time swarming algorithms, could diagnose medical conditions with substantially higher accuracy than individual doctors or groups of doctors working together using traditional crowd-sourcing methods. In one such study, swarms of human radiologists connected together were tasked with diagnosing chest x-rays and demonstrated a 33% reduction in diagnostic errors as compared to the traditional human methods, and a 22% improvement over traditional machine-learning.<ref name=":4">{{Cite web|url=https://spectrum.ieee.org/ai-human-hive-mind-diagnoses-pneumonia|title=AI-Human "Hive Mind" Diagnoses Pneumonia|last=Scudellari|first=Megan|date=2018-09-13|website=IEEE Spectrum: Technology, Engineering, and Science News|access-date=2019-07-20}}</ref><ref>{{Cite web|url=https://venturebeat.com/2018/09/10/unanimous-ai-achieves-22-more-accurate-pneumonia-diagnoses/|title=Unanimous AI achieves 22% more accurate pneumonia diagnoses|date=2018-09-10|website=VentureBeat|access-date=2019-07-20}}</ref><ref>{{Cite web|url=https://www.radiologytoday.net/archive/rt0119p12.shtml|title=A Swarm of Insight - Radiology Today Magazine|website=www.radiologytoday.net|access-date=2019-07-20}}</ref><ref name=":3">{{Cite book|last1=Rosenberg|first1=Louis|last2=Lungren|first2=Matthew|last3=Halabi|first3=Safwan|last4=Willcox|first4=Gregg|last5=Baltaxe|first5=David|last6=Lyons|first6=Mimi|title=2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON) |chapter=Artificial Swarm Intelligence employed to Amplify Diagnostic Accuracy in Radiology |s2cid=58675679|date=November 2018|location=Vancouver, BC|publisher=IEEE|pages=1186–1191|doi=10.1109/IEMCON.2018.8614883|isbn=9781538672662}}</ref>
===Swarmic art===
In a series of works al-Rifaie et al.<ref name=":1">{{cite journal | last1 = al-Rifaie | first1 = MM | last2 = Bishop | first2 = J.M. | last3 = Caines | first3 = S. | year = 2012 | title = Creativity and Autonomy in Swarm Intelligence Systems | url = | journal = Cognitive Computing | volume = 4 | issue = 3| pages = 320–331 | doi=10.1007/s12559-012-9130-y}}</ref> have successfully used two swarm intelligence algorithms – one mimicking the behaviour of one species of ants (Leptothorax acervorum) foraging (], SDS) and the other algorithm mimicking the behaviour of birds flocking (], PSO) – to describe a novel integration strategy exploiting the local search properties of the PSO with global SDS behaviour. The resulting ] is used to sketch novel drawings of an input image, exploiting an artistic tension between the local behaviour of the ‘birds flocking’ - as they seek to follow the input sketch - and the global behaviour of the "ants foraging" - as they seek to encourage the flock to explore novel regions of the canvas. The "creativity" of this hybrid swarm system has been analysed under the philosophical light of the "rhizome" in the context of ]’s "Orchid and Wasp" metaphor.<ref>Deleuze G, Guattari F, Massumi B. A thousand plateaus. Minneapolis: University of Minnesota Press; 2004.</ref>


The ] released a ] in 2021 about the diagnosis of ] by small groups of collaborating doctors. The study showed a 23% increase in diagnostic accuracy when using Artificial Swarm Intelligence (ASI) technology compared to majority voting.<ref>{{cite arXiv|last1=Shah|first1=Rutwik|last2=Astuto|first2=Bruno|last3=Gleason|first3=Tyler|last4=Fletcher|first4=Will|last5=Banaga|first5=Justin|last6=Sweetwood|first6=Kevin|last7=Ye|first7=Allen|last8=Patel|first8=Rina|last9=McGill|first9=Kevin|last10=Link|first10=Thomas|last11=Crane|first11=Jason|date=2021-09-06|title=Utilizing a digital swarm intelligence platform to improve consensus among radiologists and exploring its applications|class=cs.HC|eprint=2107.07341}}</ref><ref>{{Cite journal|title=Utilizing a Digital Swarm Intelligence Platform to Improve Consensus Among Radiologists and Exploring Its Applications|first1=Rutwik|last1=Shah|first2=Bruno|last2=Astuto Arouche Nunes|first3=Tyler|last3=Gleason|first4=Will|last4=Fletcher|first5=Justin|last5=Banaga|first6=Kevin|last6=Sweetwood|first7=Allen|last7=Ye|first8=Rina|last8=Patel|first9=Kevin|last9=McGill|first10=Thomas|last10=Link|first11=Jason|last11=Crane|first12=Valentina|last12=Pedoia|first13=Sharmila|last13=Majumdar|date=April 4, 2023|journal=Journal of Digital Imaging|volume=36|issue=2|pages=401–413|doi=10.1007/s10278-022-00662-3|pmid=36414832|pmc=10039189 }}</ref>
In a more recent work of al-Rifaie et al., "Swarmic Sketches and Attention Mechanism",<ref>al-Rifaie, Mohammad Majid, and John Mark Bishop. "". Evolutionary and Biologically Inspired Music, Sound, Art and Design. Springer Berlin Heidelberg, 2013. 85-96.</ref> introduces a novel approach deploying the mechanism of 'attention' by adapting ] to selectively attend to detailed areas of a digital canvas. Once the attention of the swarm is drawn to a certain line within the canvas, the capability of ] is used to produce a 'swarmic sketch' of the attended line. The swarms move throughout the digital canvas in an attempt to satisfy their dynamic roles – attention to areas with more details – associated to them via their fitness function. Having associated the rendering process with the concepts of attention, the performance of the participating swarms creates a unique, non-identical sketch each time the ‘artist’ swarms embark on interpreting the input line drawings. In other works while ] is responsible for the sketching process, ] controls the attention of the swarm.

===Swarm grammars===
Swarm grammars are swarms of ]s that can be evolved to describe complex properties such as found in art and architecture.<ref>{{cite journal|last1=vonMammen|first1=Sebastian|last2=Jacob|first2=Christian|s2cid=17882213|title=The evolution of swarm grammars -- growing trees, crafting art and bottom-up design|journal= IEEE Computational Intelligence Magazine|volume=4|issue=3|pages=10–19|date=2009 |doi=10.1109/MCI.2009.933096|citeseerx=10.1.1.384.9486}}</ref> These grammars interact as agents behaving according to rules of swarm intelligence. Such behavior can also suggest ] algorithms, in particular when mapping of such swarms to neural circuits is considered.<ref>{{cite journal|last1=du Castel|first1=Bertrand|title=Pattern Activation/Recognition Theory of Mind|journal=Frontiers in Computational Neuroscience|volume=9|issue=90|pages=90|date = 15 July 2015|doi=10.3389/fncom.2015.00090|pmid=26236228|pmc=4502584|ref=neuroscience|doi-access=free}}</ref>

===Swarmic art===
In a series of works, al-Rifaie et al.<ref name=":1">{{cite journal | last1 = al-Rifaie | first1 = MM | last2 = Bishop | first2 = J.M. | last3 = Caines | first3 = S. | s2cid = 942335 | year = 2012 | title = Creativity and Autonomy in Swarm Intelligence Systems | url = http://research.gold.ac.uk/17273/1/2012_CC_updated.pdf| journal = Cognitive Computation | volume = 4 | issue = 3| pages = 320–331 | doi=10.1007/s12559-012-9130-y}}</ref> have successfully used two swarm intelligence algorithms—one mimicking the behaviour of one species of ants (''Leptothorax acervorum'') foraging (], SDS) and the other algorithm mimicking the behaviour of birds flocking (], PSO)—to describe a novel integration strategy exploiting the local search properties of the PSO with global SDS behaviour. The resulting ] is used to sketch novel drawings of an input image, exploiting an artistic tension between the local behaviour of the 'birds flocking'—as they seek to follow the input sketch—and the global behaviour of the "ants foraging"—as they seek to encourage the flock to explore novel regions of the canvas. The "creativity" of this hybrid swarm system has been analysed under the philosophical light of the "rhizome" in the context of ]'s "Orchid and Wasp" metaphor.<ref>Deleuze G, Guattari F, Massumi B. A thousand plateaus. Minneapolis: University of Minnesota Press; 2004.</ref>


A more recent work of al-Rifaie et al., "Swarmic Sketches and Attention Mechanism",<ref>{{Cite book | doi=10.1007/978-3-642-36955-1_8|chapter = Swarmic Sketches and Attention Mechanism|title = Evolutionary and Biologically Inspired Music, Sound, Art and Design| volume=7834| pages=85–96|series = Lecture Notes in Computer Science|year = 2013|last1 = Al-Rifaie|first1 = Mohammad Majid| last2=Bishop| first2=John Mark| isbn=978-3-642-36954-4|url = https://research.gold.ac.uk/17268/1/2013_EvoMUSART_sketches_April%283-5%29.pdf| chapter-url=http://research.gold.ac.uk/17268/1/2013_EvoMUSART_sketches_April%283-5%29.pdf}}</ref> introduces a novel approach deploying the mechanism of 'attention' by adapting SDS to selectively attend to detailed areas of a digital canvas. Once the attention of the swarm is drawn to a certain line within the canvas, the capability of PSO is used to produce a 'swarmic sketch' of the attended line. The swarms move throughout the digital canvas in an attempt to satisfy their dynamic roles—attention to areas with more details—associated with them via their fitness function. Having associated the rendering process with the concepts of attention, the performance of the participating swarms creates a unique, non-identical sketch each time the 'artist' swarms embark on interpreting the input line drawings. In other works, while PSO is responsible for the sketching process, SDS controls the attention of the swarm.
In a similar work, "Swarmic Paintings and Colour Attention",<ref>al-Rifaie, Mohammad Majid, and John Mark Bishop. "". Evolutionary and Biologically Inspired Music, Sound, Art and Design. Springer Berlin Heidelberg, 2013. 97-108.</ref> non-photorealistic images are produced using ] algorithm which, in the context of this work, is responsible for colour attention.


In a similar work, "Swarmic Paintings and Colour Attention",<ref>{{Cite book | doi=10.1007/978-3-642-36955-1_9| chapter=Swarmic Paintings and Colour Attention| title=Evolutionary and Biologically Inspired Music, Sound, Art and Design| volume=7834| pages=97–108| series=Lecture Notes in Computer Science| year=2013| last1=Al-Rifaie| first1=Mohammad Majid| last2=Bishop| first2=John Mark| isbn=978-3-642-36954-4| url=https://research.gold.ac.uk/17267/1/2013_EvoMUSART_paintings_April%283-5%29.pdf| chapter-url=http://research.gold.ac.uk/17267/1/2013_EvoMUSART_paintings_April%283-5%29.pdf}}</ref> non-photorealistic images are produced using SDS algorithm which, in the context of this work, is responsible for colour attention.
The "computational creativity" of the above-mentioned systems are discussed in<ref name=":1" /><ref>al-Rifaie, Mohammad Majid, Mark JM Bishop, and Ahmed Aber. "Creative or Not? Birds and Ants Draw with Muscle." Proceedings of AISB'11 Computing and Philosophy (2011): 23-30.</ref><ref>al-Rifaie, Mohammad Majid, Ahmed Aber and John Mark Bishop. "Cooperation of Nature and Physiologically Inspired Mechanisms in Visualisation." Biologically-Inspired Computing for the Arts: Scientific Data through Graphics. IGI Global, 2012. 31-58. Web. 22 Aug. 2013. {{DOI|10.4018/978-1-4666-0942-6.ch003}}</ref><ref>al-Rifaie MM, Bishop M (2013) Swarm intelligence and weak artificial creativity. In: The Association for the Advancement of Artificial Intelligence (AAAI) 2013: Spring Symposium, Stanford University, Palo Alto, California, U.S.A., pp 14–19</ref> through the two prerequisites of creativity (i.e. freedom and constraints) within the swarm intelligence's two infamous phases of exploration and exploitation.


The "]" of the above-mentioned systems are discussed in<ref name=":1" /><ref>al-Rifaie, Mohammad Majid, Mark JM Bishop, and Ahmed Aber. "." Proceedings of AISB'11 Computing and Philosophy (2011): 23-30.</ref><ref>al-Rifaie MM, Bishop M (2013) {{Webarchive|url=https://web.archive.org/web/20190811190817/https://www.aaai.org/ocs/index.php/SSS/SSS13/paper/viewFile/5728/5925 |date=2019-08-11 }}. In: The Association for the Advancement of Artificial Intelligence (AAAI) 2013: Spring Symposium, Stanford University, Palo Alto, California, U.S.A., pp 14–19</ref> through the two prerequisites of creativity (i.e. freedom and constraints) within the swarm intelligence's two infamous phases of exploration and exploitation.
Michael Theodore and ] use swarm intelligent art installation to explore what it takes to have engineered systems to appear lifelike<ref></ref> Notable work include ] (2012) and ] (2014).


Michael Theodore and ] use swarm intelligent art installation to explore what it takes to have engineered systems to appear lifelike.<ref>{{Cite web|url=https://www.colorado.edu/lab/correll/|title=Correll lab|website=Correll lab}}</ref>
==In popular culture==
{{refimprove section|date=August 2013}}
{{main|Group mind (science fiction)}}
Swarm intelligence-related concepts and references can be found throughout popular culture, frequently as some form of ] or ] involving far more agents than used in current applications.
<!-- please keep in chronological order -->
* ] writer ] may have been the first to discuss swarm intelligences equal or superior to humanity. In '']'' (1931), a swarm intelligence from ] consists of tiny individual cells that communicate with each other by ]; in ] (1937) swarm intelligences founded numerous civilizations.
* '']'' (1964), a ] novel by ] where a human spaceship finds intelligent behavior in a flock of small particles that were able to defend themselves against what they found as a menace.
* In the dramatic novel and subsequent mini-series '']'' (1969) by Michael Crichton, an extraterrestrial virus communicates between individual cells and displays the ability to think and react individually and as a whole, and as such displays a semblance of "swarm intelligence".
* ], the Many – an intelligent being consisting of a swarm of many wasp-like insects, a character in the novel '']'' (1979) written by ]. Ygramul is also mentioned in a scientific paper, "Flocks, Herds, and Schools" written by Knut Hartmann (Computer Graphics and Interactive Systems, ]).<ref></ref>
* '']'' (1982)<!-- April 1982 issue of The Magazine of Fantasy and Science Fiction -->, a short story by ] about a mission undertaken by a faction of humans, to understand and exploit a space-faring swarm intelligence.
* In the book '']'' (1985), the ] (known popularly as ''Buggers'') are a swarm intelligence with colonies or armadas each directed by a single queen.
* '']'' (1994), a book by ] on AI ants within a virtual environment.
* '']'' (1995), a posthumously-published short story by ] about an alien insect-like swarm, capable of organization and provided with a sort of swarm intelligence.
* The ] (1998) of the ] universe demonstrate such concepts when in groups and enhanced by the psychic control of taskmaster breeds.
* '']'' (2001) by ] deals with the swarm intelligence of ] that guard against intruders in ].
* In the video game series ], the Covenant (2001) species known as the Hunters are made up of thousands of worm-like creatures which are individually non-sentient, but, collectively form a sentient being. Also, in the same game series, if there is a ] present among the parasitic organisms known as ], the Gravemind will function as the leader of a hive mind that controls each individual member of the Flood.
* '']'' (2002), by ] deals with the danger of ] escaping from human control and developing a swarm intelligence.
* In the '']'' series (2002), ] becomes a swarm intelligence by taking over almost all of the artificial intelligence that exists in the universe
* The science fiction novel '']'' (2004), by ], deals with underwater single-celled creatures who act in unison to destroy humanity.
* In the video game '']'' (2007), a galactic race known as the ] created a race of humanoid machines known as the ] which worked as a swarm intelligence in order to avoid restrictions on true-AI. However the Geth obtained a shared sentience through the combined processing power of every geth unit.
* In '']'' (2007), the ]s are revealed to have developed into a swarm intelligence represented by ]
* In the video game '']'' (2008), the Tuurngait is a hivemind that grows by infecting other organisms with a virus.
* '']'' (2012), a novel by ] features autonomous ] programmed with the aggressive swarming intelligence of ]s.<ref>{{cite web|last1=Kelly|first1=James Floyd|title=Book Review and Author Interview: ''Kill Decision'' by Daniel Suarez|url=http://archive.wired.com/geekdad/2012/07/daniel-suarez-kill-decision/|website=Wired|publisher=Condé Nast|accessdate=11 January 2015}}</ref>


==Notable researchers== ==Notable researchers==
{{div col|cols=2}} {{div col}}
* ]
* ]
*]
* ] * ]
* ] * ]
Line 114: Line 133:
* ] * ]
* ] * ]
* ]
* ]{{citation needed|date=September 2015}}
* ]
* ]
{{div col end}} {{div col end}}


==See also== ==See also==
{{div col}}
{{Portal|Artificial intelligence}}
* ]
{{div col|cols=2}}
* ]
* ]
* ]
* ] * ]
* ] * ]
* ] * ]
* ]
* ]
* ]
* ] * ]
* ] * ]
* ] * ]
* ] * ]
* ]
* ] * ]
* ] * ]
* ] * ]
* ] * ]
* ]
* ] * ]
* ] * ]
* ]
* ] * ]
* ]
* ] * ]
* ] * ]
* ]
* ] * ]
* ] * ]
Line 150: Line 176:


==Further reading== ==Further reading==
* {{cite book |title=Swarm Intelligence: From Natural to Artificial Systems |first1=Eric |last1=Bonabeau |first2=Marco |last2=Dorigo |first3=Guy |last3=Theraulaz |year=1999 |publisher=Oup USA |isbn=978-0-19-513159-8}}
* {{cite web|last=Bernstein|first=Jeremy|title=Project Swarm|url=http://www.projectswarm.net/abstract.php|work=Report on technology inspired by swarms in nature}}
* {{cite book |title=Swarm Intelligence: From Natural to Artificial Systems |first1=Eric |last1=Bonabeau |first2=Marco |last2=Dorigo |first3=Guy |last3=Theraulaz |year=1999 |isbn=0-19-513159-2}} * {{cite book |title=Swarm Intelligence |first1=James |last1=Kennedy |first2=Russell C. |last2=Eberhart |isbn=978-1-55860-595-4|date=2001-04-09 |publisher=Morgan Kaufmann }}
* {{cite book |title=Fundamentals of Computational Swarm Intelligence |first=Andries |last=Engelbrecht |publisher=Wiley & Sons |isbn=0-470-09191-6}} * {{cite book |title=Fundamentals of Computational Swarm Intelligence |first=Andries |last=Engelbrecht |publisher=Wiley & Sons |isbn=978-0-470-09191-3|date=2005-12-16 }}
* {{cite book |first=L. |last=Fisher |title=The Perfect Swarm : The Science of Complexity in Everyday Life |publisher=Basic Books |year=2009}}
* {{cite journal | last1 = Fister | first1 = I | last2 = Yang | first2 = XS | last3 = Fister | first3 = I | last4 = Brest | first4 = J | last5 = Fister | first5 = D | year = 2013 | title = A Brief Review of Nature-Inspired Algorithms for Optimization | url = http://arxiv.org/pdf/1307.4186 | journal = Elektrotehniski Vestnik | volume = 80 | issue = 3| pages = 1–7 }}
* {{cite book |title=Swarm Intelligence |first1=James |last1=Kennedy |first2=Russell C. |last2=Eberhart |isbn=1-55860-595-9}}
* {{Citation | last=Miller | first=Peter | title=Swarm Theory | magazine=] | date=July 2007 | url=http://www7.nationalgeographic.com/ngm/0707/feature5/}}
* {{cite book |title=Turtles, Termites, and Traffic Jams: Explorations in Massively Parallel Microworlds |first1=Mitchel |last1=Resnick |isbn=0-262-18162-2}}
* {{cite journal | first1 = E. | last1 = Ridge | first2 = E. | last2 = Curry | id = {{citeseerx|10.1.1.67.1030}} | title = A roadmap of nature-inspired systems research and development | journal = Multiagent and Grid Systems | volume = 3 | issue = 1 | pages = 3–8 | year = 2007 }}
* {{cite journal | first1 = E. | last1 = Ridge | first2 = D. | last2 = Kudenko | first3 = D. | last3 = Kazakov | first4 = E. | last4 = Curry | id = {{citeseerx|10.1.1.64.3403}} | title = Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments | journal = Self-Organization and Autonomic Informatics (I) | year = 2005 | volume = 135 | pages = 35–49 }}
* ''Swarm Intelligence'' (journal). Chief Editor: Marco Dorigo. Springer New York. ISSN 1935-3812 (Print) 1935-3820 (Online)
* {{cite book |title=Nanocomputers and Swarm Intelligence |first=Jean-Baptiste |last=Waldner| author-link = Jean-Baptiste Waldner |publisher=ISTE |isbn=978-1-84704-002-2 |year=2007}}
* {{cite journal | title = Metaheuristic Optimization | first = Xin-She | last = Yang | journal = Scholarpedia | volume = 6 | issue = 8 | page =11472 | year = 2011 | url = http://www.scholarpedia.org/article/Metaheuristic_Optimization | doi = 10.4249/scholarpedia.11472 |bibcode = 2011SchpJ...611472Y }}
* {{cite news |url=http://www.nytimes.com/2007/11/13/science/13traff.html?ei=5087&em=&en=2770422853e9f63e&ex=1195102800&pagewanted=print |title=From Ants to People: an Instinct to Swarm |work=] |date=November 13, 2007 |first=Carl |last=Zimmer}}


== External links ==
{{Sisterlinks|Swarm Intelligence}}
* Marco Dorigo and Mauro Birattari (2007). in '']''
* Antoinette Brown.
{{animal cognition}} {{animal cognition}}
{{collective animal behaviour}} {{collective animal behaviour}}
{{optimization algorithms|state=collapsed}} {{optimization algorithms|state=collapsed}}
{{Authority control}}


{{DEFAULTSORT:Swarm Intelligence}} {{DEFAULTSORT:Swarm Intelligence}}
] ]
] ]
] ]
] ]
]

Latest revision as of 14:47, 6 November 2024

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Swarm intelligence" – news · newspapers · books · scholar · JSTOR (March 2023) (Learn how and when to remove this message)
Collective behavior of decentralized, self-organized systems
A flock of starlings reacting to a predator

Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. The expression was introduced by Gerardo Beni and Jing Wang in 1989, in the context of cellular robotic systems.

SI systems consist typically of a population of simple agents or boids interacting locally with one another and with their environment. The inspiration often comes from nature, especially biological systems. The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the emergence of "intelligent" global behavior, unknown to the individual agents. Examples of swarm intelligence in natural systems include ant colonies, bee colonies, bird flocking, hawks hunting, animal herding, bacterial growth, fish schooling and microbial intelligence.

The application of swarm principles to robots is called swarm robotics while swarm intelligence refers to the more general set of algorithms. Swarm prediction has been used in the context of forecasting problems. Similar approaches to those proposed for swarm robotics are considered for genetically modified organisms in synthetic collective intelligence.

Models of swarm behavior

See also: Swarm behaviour

Boids (Reynolds 1987)

Main article: Boids

Boids is an artificial life program, developed by Craig Reynolds in 1986, which simulates flocking. It was published in 1987 in the proceedings of the ACM SIGGRAPH conference. The name "boid" corresponds to a shortened version of "bird-oid object", which refers to a bird-like object.

As with most artificial life simulations, Boids is an example of emergent behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules. The rules applied in the simplest Boids world are as follows:

  • separation: steer to avoid crowding local flockmates
  • alignment: steer towards the average heading of local flockmates
  • cohesion: steer to move toward the average position (center of mass) of local flockmates

More complex rules can be added, such as obstacle avoidance and goal seeking.

Self-propelled particles (Vicsek et al. 1995)

Main article: Self-propelled particles

Self-propelled particles (SPP), also referred to as the Vicsek model, was introduced in 1995 by Vicsek et al. as a special case of the boids model introduced in 1986 by Reynolds. A swarm is modelled in SPP by a collection of particles that move with a constant speed but respond to a random perturbation by adopting at each time increment the average direction of motion of the other particles in their local neighbourhood. SPP models predict that swarming animals share certain properties at the group level, regardless of the type of animals in the swarm. Swarming systems give rise to emergent behaviours which occur at many different scales, some of which are turning out to be both universal and robust. It has become a challenge in theoretical physics to find minimal statistical models that capture these behaviours.

Metaheuristics

See also: List of metaphor-based metaheuristics

Evolutionary algorithms (EA), particle swarm optimization (PSO), differential evolution (DE), ant colony optimization (ACO) and their variants dominate the field of nature-inspired metaheuristics. This list includes algorithms published up to circa the year 2000. A large number of more recent metaphor-inspired metaheuristics have started to attract criticism in the research community for hiding their lack of novelty behind an elaborate metaphor. For algorithms published since that time, see List of metaphor-based metaheuristics.

Metaheuristics lack a confidence in a solution. When appropriate parameters are determined, and when sufficient convergence stage is achieved, they often find a solution that is optimal, or near close to optimum – nevertheless, if one does not know optimal solution in advance, a quality of a solution is not known. In spite of this obvious drawback it has been shown that these types of algorithms work well in practice, and have been extensively researched, and developed. On the other hand, it is possible to avoid this drawback by calculating solution quality for a special case where such calculation is possible, and after such run it is known that every solution that is at least as good as the solution a special case had, has at least a solution confidence a special case had. One such instance is Ant-inspired Monte Carlo algorithm for Minimum Feedback Arc Set where this has been achieved probabilistically via hybridization of Monte Carlo algorithm with Ant Colony Optimization technique.

Ant colony optimization (Dorigo 1992)

Main article: Ant colony optimization

Ant colony optimization (ACO), introduced by Dorigo in his doctoral dissertation, is a class of optimization algorithms modeled on the actions of an ant colony. ACO is a probabilistic technique useful in problems that deal with finding better paths through graphs. Artificial 'ants'—simulation agents—locate optimal solutions by moving through a parameter space representing all possible solutions. Natural ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate for better solutions.

Particle swarm optimization (Kennedy, Eberhart & Shi 1995)

Main article: Particle swarm optimization

Particle swarm optimization (PSO) is a global optimization algorithm for dealing with problems in which a best solution can be represented as a point or surface in an n-dimensional space. Hypotheses are plotted in this space and seeded with an initial velocity, as well as a communication channel between the particles. Particles then move through the solution space, and are evaluated according to some fitness criterion after each timestep. Over time, particles are accelerated towards those particles within their communication grouping which have better fitness values. The main advantage of such an approach over other global minimization strategies such as simulated annealing is that the large number of members that make up the particle swarm make the technique impressively resilient to the problem of local minima.

Artificial bee colony algorithm (Karaboga 2005)

Main article: Artificial bee colony algorithm

Karaboga introduced ABC metaheuristic in 2005 as an answer to optimize numerical problems. Inspired by honey bee foraging behavior, Karaboga's model had three components. The employed, onlooker, and scout. In practice, the artificial scout bee would expose all food source positions (solutions) good or bad. The employed bee would search for the shortest route to each position to extract the food amount (quality) of the source. If the food was depleted from the source, the employed bee would become a scout and randomly search for other food sources. Each source that became abandoned created negative feedback meaning, the answers found were poor solutions. The onlooker bees wait for employed bees to either abandon a source or give information that the source has a large quantity of food and is worth sending additional resources to. The more an onlooker bee is recruited, the more positive the feedback is meaning that the answer is likely a good solution.

Artificial Swarm Intelligence (2015)

Artificial Swarm Intelligence (ASI) is method of amplifying the collective intelligence of networked human groups using control algorithms modeled after natural swarms. Sometimes referred to as Human Swarming or Swarm AI, the technology connects groups of human participants into real-time systems that deliberate and converge on solutions as dynamic swarms when simultaneously presented with a question ASI has been used for a wide range of applications, from enabling business teams to generate highly accurate financial forecasts to enabling sports fans to outperform Vegas betting markets. ASI has also been used to enable groups of doctors to generate diagnoses with significantly higher accuracy than traditional methods. ASI has been used by the Food and Agriculture Organization (FAO) of the United Nations to help forecast famines in hotspots around the world.

Applications

Swarm Intelligence-based techniques can be used in a number of applications. The U.S. military is investigating swarm techniques for controlling unmanned vehicles. The European Space Agency is thinking about an orbital swarm for self-assembly and interferometry. NASA is investigating the use of swarm technology for planetary mapping. A 1992 paper by M. Anthony Lewis and George A. Bekey discusses the possibility of using swarm intelligence to control nanobots within the body for the purpose of killing cancer tumors. Conversely al-Rifaie and Aber have used stochastic diffusion search to help locate tumours. Swarm intelligence (SI) is increasingly applied in Internet of Things (IoT) systems, and by association to Intent-Based Networking (IBN), due to its ability to handle complex, distributed tasks through decentralized, self-organizing algorithms. Swarm intelligence has also been applied for data mining and cluster analysis. Ant-based models are further subject of modern management theory.

Ant-based routing

The use of swarm intelligence in telecommunication networks has also been researched, in the form of ant-based routing. This was pioneered separately by Dorigo et al. and Hewlett-Packard in the mid-1990s, with a number of variants existing. Basically, this uses a probabilistic routing table rewarding/reinforcing the route successfully traversed by each "ant" (a small control packet) which flood the network. Reinforcement of the route in the forwards, reverse direction and both simultaneously have been researched: backwards reinforcement requires a symmetric network and couples the two directions together; forwards reinforcement rewards a route before the outcome is known (but then one would pay for the cinema before one knows how good the film is). As the system behaves stochastically and is therefore lacking repeatability, there are large hurdles to commercial deployment. Mobile media and new technologies have the potential to change the threshold for collective action due to swarm intelligence (Rheingold: 2002, P175).

The location of transmission infrastructure for wireless communication networks is an important engineering problem involving competing objectives. A minimal selection of locations (or sites) are required subject to providing adequate area coverage for users. A very different, ant-inspired swarm intelligence algorithm, stochastic diffusion search (SDS), has been successfully used to provide a general model for this problem, related to circle packing and set covering. It has been shown that the SDS can be applied to identify suitable solutions even for large problem instances.

Airlines have also used ant-based routing in assigning aircraft arrivals to airport gates. At Southwest Airlines a software program uses swarm theory, or swarm intelligence—the idea that a colony of ants works better than one alone. Each pilot acts like an ant searching for the best airport gate. "The pilot learns from his experience what's the best for him, and it turns out that that's the best solution for the airline," Douglas A. Lawson explains. As a result, the "colony" of pilots always go to gates they can arrive at and depart from quickly. The program can even alert a pilot of plane back-ups before they happen. "We can anticipate that it's going to happen, so we'll have a gate available," Lawson says.

Crowd simulation

Artists are using swarm technology as a means of creating complex interactive systems or simulating crowds.

Instances

The Lord of the Rings film trilogy made use of similar technology, known as Massive (software), during battle scenes. Swarm technology is particularly attractive because it is cheap, robust, and simple.

Stanley and Stella in: Breaking the Ice was the first movie to make use of swarm technology for rendering, realistically depicting the movements of groups of fish and birds using the Boids system.

Tim Burton's Batman Returns also made use of swarm technology for showing the movements of a group of bats.

Airlines have used swarm theory to simulate passengers boarding a plane. Southwest Airlines researcher Douglas A. Lawson used an ant-based computer simulation employing only six interaction rules to evaluate boarding times using various boarding methods.(Miller, 2010, xii-xviii).

Human swarming

Networks of distributed users can be organized into "human swarms" through the implementation of real-time closed-loop control systems. Developed by Louis Rosenberg in 2015, human swarming, also called artificial swarm intelligence, allows the collective intelligence of interconnected groups of people online to be harnessed. The collective intelligence of the group often exceeds the abilities of any one member of the group.

Stanford University School of Medicine published in 2018 a study showing that groups of human doctors, when connected together by real-time swarming algorithms, could diagnose medical conditions with substantially higher accuracy than individual doctors or groups of doctors working together using traditional crowd-sourcing methods. In one such study, swarms of human radiologists connected together were tasked with diagnosing chest x-rays and demonstrated a 33% reduction in diagnostic errors as compared to the traditional human methods, and a 22% improvement over traditional machine-learning.

The University of California San Francisco (UCSF) School of Medicine released a preprint in 2021 about the diagnosis of MRI images by small groups of collaborating doctors. The study showed a 23% increase in diagnostic accuracy when using Artificial Swarm Intelligence (ASI) technology compared to majority voting.

Swarm grammars

Swarm grammars are swarms of stochastic grammars that can be evolved to describe complex properties such as found in art and architecture. These grammars interact as agents behaving according to rules of swarm intelligence. Such behavior can also suggest deep learning algorithms, in particular when mapping of such swarms to neural circuits is considered.

Swarmic art

In a series of works, al-Rifaie et al. have successfully used two swarm intelligence algorithms—one mimicking the behaviour of one species of ants (Leptothorax acervorum) foraging (stochastic diffusion search, SDS) and the other algorithm mimicking the behaviour of birds flocking (particle swarm optimization, PSO)—to describe a novel integration strategy exploiting the local search properties of the PSO with global SDS behaviour. The resulting hybrid algorithm is used to sketch novel drawings of an input image, exploiting an artistic tension between the local behaviour of the 'birds flocking'—as they seek to follow the input sketch—and the global behaviour of the "ants foraging"—as they seek to encourage the flock to explore novel regions of the canvas. The "creativity" of this hybrid swarm system has been analysed under the philosophical light of the "rhizome" in the context of Deleuze's "Orchid and Wasp" metaphor.

A more recent work of al-Rifaie et al., "Swarmic Sketches and Attention Mechanism", introduces a novel approach deploying the mechanism of 'attention' by adapting SDS to selectively attend to detailed areas of a digital canvas. Once the attention of the swarm is drawn to a certain line within the canvas, the capability of PSO is used to produce a 'swarmic sketch' of the attended line. The swarms move throughout the digital canvas in an attempt to satisfy their dynamic roles—attention to areas with more details—associated with them via their fitness function. Having associated the rendering process with the concepts of attention, the performance of the participating swarms creates a unique, non-identical sketch each time the 'artist' swarms embark on interpreting the input line drawings. In other works, while PSO is responsible for the sketching process, SDS controls the attention of the swarm.

In a similar work, "Swarmic Paintings and Colour Attention", non-photorealistic images are produced using SDS algorithm which, in the context of this work, is responsible for colour attention.

The "computational creativity" of the above-mentioned systems are discussed in through the two prerequisites of creativity (i.e. freedom and constraints) within the swarm intelligence's two infamous phases of exploration and exploitation.

Michael Theodore and Nikolaus Correll use swarm intelligent art installation to explore what it takes to have engineered systems to appear lifelike.

Notable researchers

See also

References

  1. Beni, G.; Wang, J. (1993). "Swarm Intelligence in Cellular Robotic Systems". Proceed. NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy, June 26–30 (1989). Berlin, Heidelberg: Springer. pp. 703–712. doi:10.1007/978-3-642-58069-7_38. ISBN 978-3-642-63461-1.
  2. Beni, G. (1989). "The concept of cellular robotic system". Proceedings IEEE International Symposium on Intelligent Control 1988. IEEE. pp. 57–62. doi:10.1109/ISIC.1988.65405. ISBN 978-0-8186-2012-6.
  3. Hu, J.; Turgut, A.; Krajnik, T.; Lennox, B.; Arvin, F., "Occlusion-Based Coordination Protocol Design for Autonomous Robotic Shepherding Tasks" IEEE Transactions on Cognitive and Developmental Systems, 2020.
  4. Gad, Ahmed G. (2022-08-01). "Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review". Archives of Computational Methods in Engineering. 29 (5): 2531–2561. doi:10.1007/s11831-021-09694-4. ISSN 1886-1784.
  5. Hu, J.; Bhowmick, P.; Jang, I.; Arvin, F.; Lanzon, A., "A Decentralized Cluster Formation Containment Framework for Multirobot Systems" IEEE Transactions on Robotics, 2021.
  6. Solé R, Rodriguez-Amor D, Duran-Nebreda S, Conde-Pueyo N, Carbonell-Ballestero M, Montañez R (October 2016). "Synthetic Collective Intelligence". BioSystems. 148: 47–61. Bibcode:2016BiSys.148...47S. doi:10.1016/j.biosystems.2016.01.002. hdl:10630/32279. PMID 26868302.
  7. ^ Reynolds, Craig (1987). "Flocks, herds and schools: A distributed behavioral model". Proceedings of the 14th annual conference on Computer graphics and interactive techniques. Association for Computing Machinery. pp. 25–34. CiteSeerX 10.1.1.103.7187. doi:10.1145/37401.37406. ISBN 978-0-89791-227-3. S2CID 546350.
  8. Banks, Alec; Vincent, Jonathan; Anyakoha, Chukwudi (July 2007). "A review of particle swarm optimization. Part I: background and development". Natural Computing. 6 (4): 467–484. CiteSeerX 10.1.1.605.5879. doi:10.1007/s11047-007-9049-5. S2CID 2344624.
  9. Vicsek, T.; Czirok, A.; Ben-Jacob, E.; Cohen, I.; Shochet, O. (1995). "Novel type of phase transition in a system of self-driven particles". Physical Review Letters. 75 (6): 1226–1229. arXiv:cond-mat/0611743. Bibcode:1995PhRvL..75.1226V. doi:10.1103/PhysRevLett.75.1226. PMID 10060237. S2CID 15918052.
  10. Czirók, A.; Vicsek, T. (2006). "Collective behavior of interacting self-propelled particles". Physica A. 281 (1): 17–29. arXiv:cond-mat/0611742. Bibcode:2000PhyA..281...17C. doi:10.1016/S0378-4371(00)00013-3. S2CID 14211016.
  11. Buhl, J.; Sumpter, D.J.T.; Couzin, D.; Hale, J.J.; Despland, E.; Miller, E.R.; Simpson, S.J.; et al. (2006). "From disorder to order in marching locusts" (PDF). Science. 312 (5778): 1402–1406. Bibcode:2006Sci...312.1402B. doi:10.1126/science.1125142. PMID 16741126. S2CID 359329. Archived from the original (PDF) on 2011-09-29. Retrieved 2011-10-07.
  12. Toner, J.; Tu, Y.; Ramaswamy, S. (2005). "Hydrodynamics and phases of flocks" (PDF). Annals of Physics. 318 (1): 170–244. Bibcode:2005AnPhy.318..170T. doi:10.1016/j.aop.2005.04.011. Archived from the original (PDF) on 2011-07-18. Retrieved 2011-10-07.
  13. Bertin, E.; Droz, M.; Grégoire, G. (2009). "Hydrodynamic equations for self-propelled particles: microscopic derivation and stability analysis". J. Phys. A. 42 (44): 445001. arXiv:0907.4688. Bibcode:2009JPhA...42R5001B. doi:10.1088/1751-8113/42/44/445001. S2CID 17686543.
  14. Li, Y.X.; Lukeman, R.; Edelstein-Keshet, L.; et al. (2007). "Minimal mechanisms for school formation in self-propelled particles" (PDF). Physica D: Nonlinear Phenomena. 237 (5): 699–720. Bibcode:2008PhyD..237..699L. doi:10.1016/j.physd.2007.10.009. Archived from the original (PDF) on 2011-10-01.
  15. Lones, Michael A. (2014). "Metaheuristics in nature-inspired algorithms". Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (PDF). pp. 1419–1422. CiteSeerX 10.1.1.699.1825. doi:10.1145/2598394.2609841. ISBN 9781450328814. S2CID 14997975.
  16. ^ Silberholz, John; Golden, Bruce; Gupta, Swati; Wang, Xingyin (2019), Gendreau, Michel; Potvin, Jean-Yves (eds.), "Computational Comparison of Metaheuristics", Handbook of Metaheuristics, International Series in Operations Research & Management Science, Cham: Springer International Publishing, pp. 581–604, doi:10.1007/978-3-319-91086-4_18, ISBN 978-3-319-91086-4, S2CID 70030182
  17. Burke, Edmund; De Causmaecker, Patrick; Petrovic, Sanja; Berghe, Greet Vanden (2004), Resende, Mauricio G. C.; de Sousa, Jorge Pinho (eds.), "Variable Neighborhood Search for Nurse Rostering Problems", Metaheuristics: Computer Decision-Making, Applied Optimization, Boston, MA: Springer US, pp. 153–172, doi:10.1007/978-1-4757-4137-7_7, ISBN 978-1-4757-4137-7
  18. Fu, Michael C. (2002-08-01). "Feature Article: Optimization for simulation: Theory vs. Practice". INFORMS Journal on Computing. 14 (3): 192–215. doi:10.1287/ijoc.14.3.192.113. ISSN 1091-9856.
  19. Dorigo, Marco; Birattari, Mauro; Stutzle, Thomas (November 2006). "Ant colony optimization". IEEE Computational Intelligence Magazine. 1 (4): 28–39. doi:10.1109/MCI.2006.329691. ISSN 1556-603X.
  20. Hayes-RothFrederick (1975-08-01). "Review of "Adaptation in Natural and Artificial Systems by John H. Holland", The U. of Michigan Press, 1975". ACM SIGART Bulletin (53): 15. doi:10.1145/1216504.1216510. S2CID 14985677.
  21. Resende, Mauricio G.C.; Ribeiro, Celso C. (2010), Gendreau, Michel; Potvin, Jean-Yves (eds.), "Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications", Handbook of Metaheuristics, International Series in Operations Research & Management Science, Boston, MA: Springer US, pp. 283–319, doi:10.1007/978-1-4419-1665-5_10, ISBN 978-1-4419-1665-5
  22. Kudelić, Robert; Ivković, Nikola (2019-05-15). "Ant inspired Monte Carlo algorithm for minimum feedback arc set". Expert Systems with Applications. 122: 108–117. doi:10.1016/j.eswa.2018.12.021. ISSN 0957-4174. S2CID 68071710.
  23. Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. ISBN 0-262-04219-3
  24. Parsopoulos, K. E.; Vrahatis, M. N. (2002). "Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization". Natural Computing. 1 (2–3): 235–306. doi:10.1023/A:1016568309421. S2CID 4021089.
  25. Particle Swarm Optimization by Maurice Clerc, ISTE, ISBN 1-905209-04-5, 2006.
  26. Rosenberg, Louis (2015-07-20). "Human Swarms, a real-time method for collective intelligence". 07/20/2015-07/24/2015. Vol. 27. pp. 658–659. doi:10.7551/978-0-262-33027-5-ch117. ISBN 9780262330275.
  27. Rosenberg, Louis; Willcox, Gregg (2020). "Artificial Swarm Intelligence". In Bi, Yaxin; Bhatia, Rahul; Kapoor, Supriya (eds.). Intelligent Systems and Applications. Advances in Intelligent Systems and Computing. Vol. 1037. Springer International Publishing. pp. 1054–1070. doi:10.1007/978-3-030-29516-5_79. ISBN 9783030295165. S2CID 195258629.
  28. Metcalf, Lynn; Askay, David A.; Rosenberg, Louis B. (2019). "Keeping Humans in the Loop: Pooling Knowledge through Artificial Swarm Intelligence to Improve Business Decision Making". California Management Review. 61 (4): 84–109. doi:10.1177/0008125619862256. ISSN 0008-1256. S2CID 202323483.
  29. Schumann, Hans; Willcox, Gregg; Rosenberg, Louis; Pescetelli, Niccolo (2019). ""Human Swarming" Amplifies Accuracy and ROI when Forecasting Financial Markets". 2019 IEEE International Conference on Humanized Computing and Communication (HCC). pp. 77–82. doi:10.1109/HCC46620.2019.00019. ISBN 978-1-7281-4125-1. S2CID 209496644.
  30. Bayern, Macy (September 4, 2018). "How AI systems beat Vegas oddsmakers in sports forecasting accuracy". TechRepublic. Retrieved 2018-09-10.
  31. ^ Scudellari, Megan (2018-09-13). "AI-Human "Hive Mind" Diagnoses Pneumonia". IEEE Spectrum: Technology, Engineering, and Science News. Retrieved 2019-07-20.
  32. ^ Rosenberg, Louis; Lungren, Matthew; Halabi, Safwan; Willcox, Gregg; Baltaxe, David; Lyons, Mimi (November 2018). "Artificial Swarm Intelligence employed to Amplify Diagnostic Accuracy in Radiology". 2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON). Vancouver, BC: IEEE. pp. 1186–1191. doi:10.1109/IEMCON.2018.8614883. ISBN 9781538672662. S2CID 58675679.
  33. Rosenberg, Louis (October 13, 2021). "Swarm intelligence: AI inspired by honeybees can help us make better decisions". Big Think.
  34. Lewis, M. Anthony; Bekey, George A. "The Behavioral Self-Organization of Nanorobots Using Local Rules". Proceedings of the 1992 IEEE/RSJ International Conference on Intelligent Robots and Systems.
  35. al-Rifaie, M.M.; Aber, A. "Identifying metastasis in bone scans with Stochastic Diffusion Search". Proc. IEEE Information Technology in Medicine and Education, ITME. 2012: 519–523.
  36. al-Rifaie, Mohammad Majid, Ahmed Aber, and Ahmed Majid Oudah. "Utilising Stochastic Diffusion Search to identify metastasis in bone scans and microcalcifications on mammographs." In Bioinformatics and Biomedicine Workshops (BIBMW), 2012 IEEE International Conference on, pp. 280-287. IEEE, 2012.
  37. Sun, Weifeng; Tang, Min; Zhang, Lijun; Huo, Zhiqiang; Shu, Lei (January 2020). "A Survey of Using Swarm Intelligence Algorithms in IoT". Sensors. 20 (5): 1420. Bibcode:2020Senso..20.1420S. doi:10.3390/s20051420. ISSN 1424-8220. PMC 7085620. PMID 32150912.
  38. Abualigah, Laith; Falcone, Deborah; Forestiero, Agostino (2023-05-29). "Swarm Intelligence to Face IoT Challenges". Computational Intelligence and Neuroscience. 2023: 4254194. doi:10.1155/2023/4254194. ISSN 1687-5265. PMC 10241578. PMID 37284052.
  39. "Intent-Based Networking for the Internet of Things | Frontiers Research Topic". www.frontiersin.org. Retrieved 2024-08-14.
  40. Martens, D.; Baesens, B.; Fawcett, T. (2011). "Editorial Survey: Swarm Intelligence for Data Mining". Machine Learning. 82 (1): 1–42. doi:10.1007/s10994-010-5216-5.
  41. Thrun, M.; Ultsch, A. (2021). "Swarm Intelligence for Self-Organized Clustering". Artificial Intelligence. 290: 103237. arXiv:2106.05521. doi:10.1016/j.artint.2020.103237. S2CID 213923899.
  42. Fladerer, Johannes-Paul; Kurzmann, Ernst (November 2019). THE WISDOM OF THE MANY : how to create self -organisation and how to use collective... intelligence in companies and in society from mana. BOOKS ON DEMAND. ISBN 9783750422421.
  43. Whitaker, R.M., Hurley, S.. An agent based approach to site selection for wireless networks. Proc ACM Symposium on Applied Computing, pp. 574–577, (2002).
  44. "Planes, Trains and Ant Hills: Computer scientists simulate activity of ants to reduce airline delays". Science Daily. April 1, 2008. Archived from the original on November 24, 2010. Retrieved December 1, 2010.
  45. Mahant, Manish; Singh Rathore, Kalyani; Kesharwani, Abhishek; Choudhary, Bharat (2012). "A Profound Survey on Swarm Intelligence". International Journal of Advanced Computer Research. 2 (1). Retrieved 3 October 2022.
  46. Miller, Peter (2010). The Smart Swarm: How understanding flocks, schools, and colonies can make us better at communicating, decision making, and getting things done. New York: Avery. ISBN 978-1-58333-390-7.
  47. Oxenham, Simon. "Why bees could be the secret to superhuman intelligence". Retrieved 2017-01-20.
  48. Rosenberg, L.; Pescetelli, N.; Willcox, G. (October 2017). "Artificial Swarm Intelligence amplifies accuracy when predicting financial markets". 2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON). pp. 58–62. doi:10.1109/UEMCON.2017.8248984. ISBN 978-1-5386-1104-3. S2CID 21312426.
  49. "Smarter as a group: How swarm intelligence picked Derby winners". Christian Science Monitor.
  50. "AI startup taps human 'swarm' intelligence to predict winners". CNET.
  51. Rosenberg, Louis (2016-02-12). "Artificial Swarm Intelligence, a human-in-the-loop approach to A.I." Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI'16. Phoenix, Arizona: AAAI Press: 4381–4382.
  52. "Unanimous AI achieves 22% more accurate pneumonia diagnoses". VentureBeat. 2018-09-10. Retrieved 2019-07-20.
  53. "A Swarm of Insight - Radiology Today Magazine". www.radiologytoday.net. Retrieved 2019-07-20.
  54. Shah, Rutwik; Astuto, Bruno; Gleason, Tyler; Fletcher, Will; Banaga, Justin; Sweetwood, Kevin; Ye, Allen; Patel, Rina; McGill, Kevin; Link, Thomas; Crane, Jason (2021-09-06). "Utilizing a digital swarm intelligence platform to improve consensus among radiologists and exploring its applications". arXiv:2107.07341 .
  55. Shah, Rutwik; Astuto Arouche Nunes, Bruno; Gleason, Tyler; Fletcher, Will; Banaga, Justin; Sweetwood, Kevin; Ye, Allen; Patel, Rina; McGill, Kevin; Link, Thomas; Crane, Jason; Pedoia, Valentina; Majumdar, Sharmila (April 4, 2023). "Utilizing a Digital Swarm Intelligence Platform to Improve Consensus Among Radiologists and Exploring Its Applications". Journal of Digital Imaging. 36 (2): 401–413. doi:10.1007/s10278-022-00662-3. PMC 10039189. PMID 36414832.
  56. vonMammen, Sebastian; Jacob, Christian (2009). "The evolution of swarm grammars -- growing trees, crafting art and bottom-up design". IEEE Computational Intelligence Magazine. 4 (3): 10–19. CiteSeerX 10.1.1.384.9486. doi:10.1109/MCI.2009.933096. S2CID 17882213.
  57. du Castel, Bertrand (15 July 2015). "Pattern Activation/Recognition Theory of Mind". Frontiers in Computational Neuroscience. 9 (90): 90. doi:10.3389/fncom.2015.00090. PMC 4502584. PMID 26236228.
  58. ^ al-Rifaie, MM; Bishop, J.M.; Caines, S. (2012). "Creativity and Autonomy in Swarm Intelligence Systems" (PDF). Cognitive Computation. 4 (3): 320–331. doi:10.1007/s12559-012-9130-y. S2CID 942335.
  59. Deleuze G, Guattari F, Massumi B. A thousand plateaus. Minneapolis: University of Minnesota Press; 2004.
  60. Al-Rifaie, Mohammad Majid; Bishop, John Mark (2013). "Swarmic Sketches and Attention Mechanism" (PDF). Evolutionary and Biologically Inspired Music, Sound, Art and Design (PDF). Lecture Notes in Computer Science. Vol. 7834. pp. 85–96. doi:10.1007/978-3-642-36955-1_8. ISBN 978-3-642-36954-4.
  61. Al-Rifaie, Mohammad Majid; Bishop, John Mark (2013). "Swarmic Paintings and Colour Attention" (PDF). Evolutionary and Biologically Inspired Music, Sound, Art and Design (PDF). Lecture Notes in Computer Science. Vol. 7834. pp. 97–108. doi:10.1007/978-3-642-36955-1_9. ISBN 978-3-642-36954-4.
  62. al-Rifaie, Mohammad Majid, Mark JM Bishop, and Ahmed Aber. "Creative or Not? Birds and Ants Draw with Muscle." Proceedings of AISB'11 Computing and Philosophy (2011): 23-30.
  63. al-Rifaie MM, Bishop M (2013) Swarm intelligence and weak artificial creativity Archived 2019-08-11 at the Wayback Machine. In: The Association for the Advancement of Artificial Intelligence (AAAI) 2013: Spring Symposium, Stanford University, Palo Alto, California, U.S.A., pp 14–19
  64. "Correll lab". Correll lab.

Further reading

  • Bonabeau, Eric; Dorigo, Marco; Theraulaz, Guy (1999). Swarm Intelligence: From Natural to Artificial Systems. Oup USA. ISBN 978-0-19-513159-8.
  • Kennedy, James; Eberhart, Russell C. (2001-04-09). Swarm Intelligence. Morgan Kaufmann. ISBN 978-1-55860-595-4.
  • Engelbrecht, Andries (2005-12-16). Fundamentals of Computational Swarm Intelligence. Wiley & Sons. ISBN 978-0-470-09191-3.

External links

Animal cognition
Cognition
Intelligence
Pain
Relation to brain
Swarming
Biological swarming
Animal migration
Swarm algorithms
Collective motion
Swarm robotics
Related topics
Optimization: Algorithms, methods, and heuristics
Unconstrained nonlinear
Functions
Gradients
Convergence
Quasi–Newton
Other methods
Hessians
Graph of a strictly concave quadratic function with unique maximum.
Optimization computes maxima and minima.
Constrained nonlinear
General
Differentiable
Convex optimization
Convex
minimization
Linear and
quadratic
Interior point
Basis-exchange
Combinatorial
Paradigms
Graph
algorithms
Minimum
spanning tree
Shortest path
Network flows
Metaheuristics
Categories:
Swarm intelligence: Difference between revisions Add topic