Science

Bee Solves Travelling Salesman Problem

Posted 25 Oct 2010 at 15:54 UTC by Rog-a-matic Share This

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.

See more of the latest robot news!

Recent blogs

14 Jun 2013 mwaibel (Master)
13 Jun 2013 Flanneltron (Journeyer)
8 Jun 2013 steve (Master)
27 May 2013 Petar.Kormushev (Master)
13 May 2013 JLaplace (Observer)
10 May 2013 AI4U (Observer)
21 Apr 2013 Pi Robot (Master)
12 Apr 2013 Pontifier (Apprentice)
31 Mar 2013 svo (Master)
16 Mar 2013 gidesa (Journeyer)
X
Share this page