Emergent algorithm

Revision as of 16:25, 18 November 2024 by imported>Hplotter
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:Short description 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.<ref>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)</ref>

An emergent algorithm has the following characteristics: {{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= Template:Fix }}

Other examples of emergent algorithms and models include cellular automata,<ref>Template:Cite conference</ref> artificial neural networks and swarm intelligence systems (ant colony optimization, bees algorithm, etc.).

See alsoEdit

ReferencesEdit

<references/>


Template:Chaos-stub