Sign In

Communications of the ACM

ACM News

Robotic Consensus


View as: Print Mobile App Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook
Robotic groupthink

MIT researchers will present a new, decentralized planning algorithm for teams of robots that factors in not only stationary obstacles, but moving obstacles, as well. The algorithm still comes with strong mathematical guarantees that the robots will avoid collisions.

Credit: Christine Daniloff/MIT

Planning algorithms for teams of robots fall into two categories: centralized algorithms, in which a single computer makes decisions for the whole team, and decentralized algorithms, in which each robot makes its own decisions based on local observations.

From MIT News Office
View Full Article

 


 

No entries found