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

27 Aug 2016 AI4U (Observer)
20 Aug 2016 mwaibel (Master)
16 Aug 2016 Flanneltron (Journeyer)
9 Jul 2016 evilrobots (Observer)
8 Jul 2016 steve (Master)
27 Jun 2016 Petar.Kormushev (Master)
24 May 2016 shimniok (Journeyer)
2 May 2016 motters (Master)
6 Nov 2015 wedesoft (Master)
10 Sep 2015 svo (Master)
X
Share this page