Emergent algorithm: Difference between revisions
Content deleted Content added
mNo edit summary |
|||
| Line 27: | Line 27: | ||
* [[Emergence]] |
* [[Emergence]] |
||
* [[Evolutionary computation]] |
* [[Evolutionary computation]] |
||
* [[Fuzzy_logic|Fuzzy logic]] |
|||
* [[Genetic algorithm]] |
* [[Genetic algorithm]] |
||
* [[Heuristic]] |
* [[Heuristic]] |
||
Revision as of 18:25, 9 March 2015
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 movement in response to environmental obstacles.[1]
An emergent algorithm has the following characteristics: [dubious – discuss]
- it achieves predictable global effects
- it does not require global visibility
- it does not assume any kind of centralized control
- it is self-stabilizing
Other 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
- ^ 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 )
- ^ 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)