Swarm intelligence

From Wikipedia, the free encyclopedia

Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial.[1] 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.[2]

SI systems consist typically of a population of simple agents or boids interacting locally with one another and with their environment.[3] 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.[4] 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.[5]

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 the flocking behaviour of birds. His paper on this topic was published in 1987 in the proceedings of the ACM SIGGRAPH conference.[6] The name "boid" corresponds to a shortened version of "bird-oid object", which refers to a bird-like object.[7]

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.[8] as a special case of the boids model introduced in 1986 by Reynolds.[6] 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.[9] SPP models predict that swarming animals share certain properties at the group level, regardless of the type of animals in the swarm.[10] 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.[11][12][13]

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.[14] 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.

It should also be noted that metaheuristics, as good as they are, lack a confidence in a solution.[15] 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.[15] 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.[16][17][18][19][20] 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.[21]

Stochastic diffusion search (Bishop 1989)[]

Main article: Stochastic diffusion search

First published in 1989 Stochastic diffusion search (SDS)[22][23] was the first Swarm Intelligence metaheuristic. SDS is an agent-based probabilistic 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 that 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 stigmergic communication used in ACO, in SDS agents communicate hypotheses via a one-to-one communication strategy analogous to the tandem running procedure observed in Leptothorax acervorum.[24] 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.[25][26][27] Recent work has involved merging the global search properties of SDS with other swarm intelligence algorithms.[28][29]

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.[30]

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.[31][32] 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 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[33][34][35] ASI has been used for a wide range of applications, from enabling business teams to generate highly accurate financial forecasts[36] to enabling sports fans to outperform Vegas betting markets.[37] ASI has also been used to enable groups of doctors to generate diagnoses with significantly higher accuracy than traditional methods.[38][39]

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.[40] Conversely al-Rifaie and Aber have used stochastic diffusion search to help locate tumours.[41][42] Swarm intelligence has also been applied for data mining[43] and cluster analysis.[44] Ant based models are further subject of modern management theory.[45]

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.[46]

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.[47]

Crowd simulation[]

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

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.[citation needed]

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

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).[48]

Human swarming[]

Enabled by mediating software such as the SWARM platform (formally unu) from Unanimous A.I., networks of distributed users can be organized into "human swarms" through the implementation of real-time closed-loop control systems.[49][50][51] As published by Rosenberg (2015), such real-time systems enable groups of human participants to behave as a unified collective intelligence that works as a single entity to make predictions, answer questions, and evoke opinions.[52] Such systems, also referred to as "Artificial Swarm Intelligence" (or the brand name Swarm AI) have been shown to significantly amplify human intelligence,[53][54][34] resulting in a string of high-profile predictions of extreme accuracy.[55][56][57][58][50][37] Academic testing shows that human swarms can out-predict individuals across a variety of real-world projections.[59][60][51][61][62] Famously, human swarming was used to correctly predict the Kentucky Derby Superfecta, against 541 to 1 odds, in response to a challenge from reporters.[63]

Medical Use of Human Swarming—in 2018, Stanford University School of Medicine and Unanimous AI published studies 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 using the SWARM platform 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.[38][64][65][66][39]

Swarm grammars[]

Swarm grammars are swarms of stochastic grammars that can be evolved to describe complex properties such as found in art and architecture.[67] 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.[68]

Swarmic art[]

In a series of works, al-Rifaie et al.[69] 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.[70]

A more recent work of al-Rifaie et al., "Swarmic Sketches and Attention Mechanism",[71] 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",[72] 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[69][73][74] 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.[75]

Notable researchers[]

See also[]

References[]

  1. ^ Hu, J.; Turgut, A.; Lennox, B.; Arvin, F., "Robust Formation Coordination of Robot Swarms with Nonlinear Dynamics and Unknown Disturbances: Design and Experiments" IEEE Transactions on Circuits and Systems II: Express Briefs, 2021.
  2. ^ 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.CS1 maint: multiple names: authors list (link)
  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. ^ Hu, J.; Bhowmick, P.; Jang, I.; Arvin, F.; Lanzon, A., "A Decentralized Cluster Formation Containment Framework for Multirobot Systems" IEEE Transactions on Robotics, 2021.
  5. ^ 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. doi:10.1016/j.biosystems.2016.01.002. PMID 26868302.
  6. ^ Jump up to: a b Reynolds, Craig (1987). Flocks, herds and schools: A distributed behavioral model. SIGGRAPH '87: 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.
  7. ^ 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.
  8. ^ 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.
  9. ^ 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.
  10. ^ 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.
  11. ^ 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.
  12. ^ 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.
  13. ^ 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.
  14. ^ Lones, Michael A. (2014). "Metaheuristics in Nature-Inspired Algorithms". Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion - GECCO Comp '14 (PDF). GECCO '14. pp. 1419–1422. CiteSeerX 10.1.1.699.1825. doi:10.1145/2598394.2609841. ISBN 9781450328814. S2CID 14997975.
  15. ^ Jump up to: a b 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
  16. ^ 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
  17. ^ 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.
  18. ^ 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.
  19. ^ 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.
  20. ^ 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
  21. ^ 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.
  22. ^ Bishop, J.M., Stochastic Searching Networks, Proc. 1st IEE Int. Conf. on Artificial Neural Networks, pp. 329-331, London, UK, (1989).
  23. ^ 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.
  24. ^ Moglich, M.; Maschwitz, U.; Holldobler, B., Tandem Calling: A New Kind of Signal in Ant Communication, Science, Volume 186, Issue 4168, pp. 1046-1047
  25. ^ 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).
  26. ^ Nasuto, S.J., & Bishop, J.M., (1999), Convergence of the Stochastic Diffusion Search, Parallel Algorithms, 14:2, pp: 89-107.
  27. ^ 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.
  28. ^ 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).
  29. ^ 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.
  30. ^ Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. ISBN 0-262-04219-3
  31. ^ 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.
  32. ^ Particle Swarm Optimization by Maurice Clerc, ISTE, ISBN 1-905209-04-5, 2006.
  33. ^ Rosenberg, Louis (2015-07-20). "Human Swarms, a real-time method for collective intelligence". 07/20/2015-07/24/2015. 27. pp. 658–659. doi:10.7551/978-0-262-33027-5-ch117. ISBN 9780262330275.
  34. ^ Jump up to: a b Rosenberg, Louis; Willcox, Gregg (2020). Bi, Yaxin; Bhatia, Rahul; Kapoor, Supriya (eds.). "Artificial Swarm Intelligence". Intelligent Systems and Applications. Advances in Intelligent Systems and Computing. Springer International Publishing. 1037: 1054–1070. doi:10.1007/978-3-030-29516-5_79. ISBN 9783030295165.
  35. ^ 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.
  36. ^ 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.
  37. ^ Jump up to: a b "How AI systems beat Vegas oddsmakers in sports forecasting accuracy". TechRepublic. Retrieved 2018-09-10.
  38. ^ Jump up to: a b Scudellari, Megan (2018-09-13). "AI-Human "Hive Mind" Diagnoses Pneumonia". IEEE Spectrum: Technology, Engineering, and Science News. Retrieved 2019-07-20.
  39. ^ Jump up to: a b 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: 1186–1191. doi:10.1109/IEMCON.2018.8614883. ISBN 9781538672662. S2CID 58675679.
  40. ^ 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.
  41. ^ 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.
  42. ^ 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.
  43. ^ 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.
  44. ^ 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.
  45. ^ 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.
  46. ^ 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).
  47. ^ "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.
  48. ^ 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.
  49. ^ Oxenham, Simon. "Why bees could be the secret to superhuman intelligence". Retrieved 2017-01-20.
  50. ^ Jump up to: a b "This Startup Correctly Predicted the Oscars, World Series, and Super Bowl. Here's What It's Doing Next". Inc.com. 2018-06-14. Retrieved 2018-09-10.
  51. ^ Jump up to: a b 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.
  52. ^ http://sites.lsa.umich.edu/collectiveintelligence/wp-content/uploads/sites/176/2015/05/Rosenberg-CI-2015-Abstract.pdf
  53. ^ Metcalf, Lynn; Askay, David A.; Rosenberg, Louis B. (2019-07-17). "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.
  54. ^ Willcox, Gregg; Rosenberg, Louis; Askay, David; Metcalf, Lynn; Harris, Erick; Domnauer, Colin (2020). Arai, Kohei; Bhatia, Rahul (eds.). "Artificial Swarming Shown to Amplify Accuracy of Group Decisions in Subjective Judgment Tasks". Advances in Information and Communication. Lecture Notes in Networks and Systems. Springer International Publishing. 70: 373–383. doi:10.1007/978-3-030-12385-7_29. ISBN 9783030123857.
  55. ^ "Artificial intelligence turns $20 into $11,000 in Kentucky Derby bet". Newsweek. 2016-05-10. Retrieved 2017-01-20.
  56. ^ Burns, Janet. "AI That Clinched The Trifecta Gave The Super Bowl To Green Bay--In August". Forbes. Retrieved 2017-01-20.
  57. ^ "Human Swarms, a real-time method for collective intelligence". Archived from the original on 2015-10-27. Retrieved 2015-10-12.
  58. ^ "Swarms of Humans Power A.I. Platform". DNews. 2017-05-10.
  59. ^ Rosenberg, L.; Baltaxe, D.; Pescetelli, N. (2016-10-01). Crowds vs swarms, a comparison of intelligence. 2016 Swarm/Human Blended Intelligence Workshop (SHBI). pp. 1–4. doi:10.1109/SHBI.2016.7780278. ISBN 978-1-5090-3502-1. S2CID 12725324.
  60. ^ Rosenberg, Louis B. (2015). "Human swarming, a real-time method for parallel distributed intelligence". 2015 Swarm/Human Blended Intelligence Workshop (SHBI). pp. 1–7. doi:10.1109/SHBI.2015.7321685. ISBN 978-1-4673-6522-2. S2CID 15166767.
  61. ^ Rosenberg, L.; Willcox, G. (June 2018). Artificial Swarms find Social Optima : (Late Breaking Report). 2018 IEEE Conference on Cognitive and Computational Aspects of Situation Management (CogSIMA). pp. 174–178. doi:10.1109/COGSIMA.2018.8423987. ISBN 978-1-5386-5288-6. S2CID 51909462.
  62. ^ Rosenberg, L.; Pescetelli, N. (September 2017). Amplifying prediction accuracy using Swarm A.I. 2017 Intelligent Systems Conference (IntelliSys). pp. 61–65. doi:10.1109/IntelliSys.2017.8324329. ISBN 978-1-5090-6435-9. S2CID 4366745.
  63. ^ "Artificial intelligence turns $20 into $11,000 in Kentucky Derby bet". Newsweek. 2016-05-10. Retrieved 2018-09-10.
  64. ^ "Unanimous AI achieves 22% more accurate pneumonia diagnoses". VentureBeat. 2018-09-10. Retrieved 2019-07-20.
  65. ^ Liu, Fan (2018-09-27). "Artificial swarm intelligence diagnoses pneumonia better than individual computer or doctor". The Stanford Daily. Retrieved 2019-07-20.
  66. ^ "A Swarm of Insight - Radiology Today Magazine". www.radiologytoday.net. Retrieved 2019-07-20.
  67. ^ vonMammen, Sebastian; Jacob, Christian (2009). "The evolution of swarm grammars -- growing trees, crafting art and bottom-up design". Computational Intelligence. 4 (3): 10–19. CiteSeerX 10.1.1.384.9486. doi:10.1109/MCI.2009.933096. S2CID 17882213.
  68. ^ 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.
  69. ^ Jump up to: a b 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.
  70. ^ Deleuze G, Guattari F, Massumi B. A thousand plateaus. Minneapolis: University of Minnesota Press; 2004.
  71. ^ 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. 7834. pp. 85–96. doi:10.1007/978-3-642-36955-1_8. ISBN 978-3-642-36954-4.
  72. ^ 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. 7834. pp. 97–108. doi:10.1007/978-3-642-36955-1_9. ISBN 978-3-642-36954-4.
  73. ^ 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.
  74. ^ 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
  75. ^ N. Correll, N. Farrow, K. Sugawara, M. Theodore (2013): The Swarm Wall: Toward Life’s Uncanny Valley. In: K. Goldberg, H. Knight, P. Salvini (Ed.): IEEE International Conference on Robotics and Automation, Workshop on Art and Robotics: Freud's Unheimlich and the Uncanny Valley.

Further reading[]

  • Bonabeau, Eric; Dorigo, Marco; Theraulaz, Guy (1999). Swarm Intelligence: From Natural to Artificial Systems. ISBN 978-0-19-513159-8.
  • Kennedy, James; Eberhart, Russell C. (2001-04-09). Swarm Intelligence. 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[]

Retrieved from ""