Jump to content

Emergent algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Bwieser (talk | contribs) at 22:11, 8 March 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An emergent algorithm is an algorithm that exhibits emergent behavior. In essence an emergent algorithm implements a set of simple building block behaviors that when combined exhibit more complex behaviors. One example of this is the implementation of fuzzy motion controllers used to adapt robot behavior to environmental challenges.[1]

An emergent algorithm has the following characteristics: [dubiousdiscuss]


Examples of emergent algorithms and models include cellular automata,[2] artificial neural networks and swarm intelligence systems (ant colony optimization, bees algorithm, etc.).

See also

References

  1. ^ Emergent behaviors of a fuzzy sensory-motor controller evolved by genetic algorithm, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on (Volume:31 , Issue: 6 )
  2. ^ Brunner, Klaus A. (2002). "What's emergent in Emergent Computing?" (PDF). Cybernetics and Systems 2002: Proceedings of the 16th European Meeting on Cybernetics and Systems Research. Vol. 1. Vienna. pp. 189–192. Retrieved 2009-02-18. {{cite conference}}: Cite has empty unknown parameter: |coauthors= (help); Unknown parameter |booktitle= ignored (|book-title= suggested) (help)