[Tyler]

Bee Solves Travelling Salesman Problem
     






Researchers at Queen Mary, University of London and Royal Holloway have
discovered that bees learn
to fly the shortest possible route between flowers even if they
discover the flowers in a different order.
This 'Travelling
Salesman Problem' often takes supercomputers days to solve, but Bees
are now the first animals proven to do it.
Computer-controlled artificial flowers were used to track the bee's path
and found
they quickly learned the shortest route.
Since a bee's brain is only the size of a pinhead, researchers are
hoping to identify the neural circuitry required and use that
understanding to construct their own systems that rival the
computational power of existing machines.


   

http://robots.net/article/3066.html