Control algorithm for teams of robots factors in moving obstacles.
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.
With centralized algorithms, if the central computer goes offline, the whole system falls apart. Decentralized algorithms handle erratic communication better, but they’re harder to design, because each robot is essentially guessing what the others will do. Most research on decentralized algorithms has focused on making collective decision-making more reliable and has deferred the problem of avoiding obstacles in the robots’ environment.
At the International Conference on Robotics and Automation in May, 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 also requires significantly less communications bandwidth than existing decentralized algorithms, but preserves strong mathematical guarantees that the robots will avoid collisions.
In simulations involving squadrons of minihelicopters, the decentralized algorithm came up with the same flight plans that a centralized version did. The drones generally preserved an approximation of their preferred formation, a square at a fixed altitude — although to accommodate obstacles the square rotated and the distances between drones contracted. Occasionally, however, the drones would fly single file or assume a formation in which pairs of them flew at different altitudes.
“It’s a really exciting result because it combines so many challenging goals,” says Daniela Rus, the Andrew and Erna Viterbi Professor in MIT’s Department of Electrical Engineering and Computer Science and director of the Computer Science and Artificial Intelligence Laboratory, whose group developed the new algorithm. “Your group of robots has a local goal, which is to stay in formation, and a global goal, which is where they want to go or the trajectory along which you want them to move. And you allow them to operate in a world with static obstacles but also unexpected dynamic obstacles, and you have a guarantee that they are going to retain their local and global objectives. They will have to make some deviations, but those deviations are minimal.”
Rus is joined on the paper by first author Javier Alonso-Mora, a postdoc in Rus’ group; Mac Schwager, an assistant professor of aeronautics and astronautics at Stanford University who worked with Rus as an MIT PhD student in mechanical engineering; and Eduardo Montijano, a professor at Centro Universitario de la Defensa in Zaragoza, Spain.
In a typical decentralized group planning algorithm, each robot might broadcast its observations of the environment to its teammates, and all the robots would then execute the same planning algorithm, presumably on the basis of the same information.
But Rus, Alonso-Mora, and their colleagues found a way to reduce both the computational and communication burdens imposed by consensual planning. The essential idea is that each robot, on the basis of its own observations, maps out an obstacle-free region in its immediate environment and passes that map only to its nearest neighbors. When a robot receives a map from a neighbor, it calculates the intersection of that map with its own and passes that on.
This keeps down both the size of the robots’ communications — describing the intersection of 100 maps requires no more data than describing the intersection of two — and their number, because each robot communicates only with its neighbors. Nonetheless, each robot ends up with a map that reflects all of the obstacles detected by all the team members.
The maps have not three dimensions, however, but four — the fourth being time. This is how the algorithm accounts for moving obstacles. The four-dimensional map describes how a three-dimensional map would have to change to accommodate the obstacle’s change of location, over a span of a few seconds. But it does so in a mathematically compact manner.
The algorithm does assume that moving obstacles have constant velocity, which will not always be the case in the real world. But each robot updates its map several times a second, a short enough span of time that the velocity of an accelerating object is unlikely to change dramatically.
On the basis of its latest map, each robot calculates the trajectory that will maximize both its local goal — staying in formation — and its global goal.
The researchers are also testing a version of their algorithm on wheeled robots whose goal is to collectively carry an object across a room where human beings are also moving around, as a simulation of an environment in which humans and robots work together.
Learn more: Robotic consensus
The Latest on: Decentralized planning algorithm for teams of robots
via Google News
The Latest on: Decentralized planning algorithm for teams of robots
- High stakes AI research for NASA still possible during the era of Covid-19on June 26, 2020 at 9:21 am
You can learn more about their challenges and meet the teams here: The teams, comprised of early-career PhDs in AI and interdisciplinary science domains, are supported by subject matter experts from ...
- In Pursuit of Better Analyticson June 24, 2020 at 3:37 am
Finance analytics is the process of searching for and gathering meaningful insights from financial data to inform decision-making.
- Bitcoin Up Review: Is Bitcoin Up Legit of Scam?on June 23, 2020 at 8:56 pm
Bitcoin was introduced in the aftermath of the 2008 financial crisis. The main idea behind the digital currency is ending the control of the governments on currencies. Bitcoin is developed on a ...
- Comment: pandemic highlights future importance of robotson June 22, 2020 at 2:49 am
As UK Robotics Week 2020 kicks off, Professor Robert Richardson, Chair of EPSRC UK-RAS Network reflects on how the pandemic has demonstrated the key role that robots can play ... We now have AI and ...
- RoboCut is a robot sculptor that would put Edward Scissorhands to shameon June 18, 2020 at 12:46 pm
Researchers at ETH Zurich Computational Robotics Lab have created a cutting robot that can turn a block of styrofoam into just about any shape you can imagine.
- DMarket raises $6.5 million for blockchain marketpace, adds Trip Hawkins to boardon June 18, 2020 at 3:18 am
DMarket has raised $6.5 million for its cross-game, in-game item marketpace based on the blockchain, and it added Trip Hawkins as board member.
- Qualcomm releases platform for AI, 5G robotson June 17, 2020 at 10:19 am
Additional technologies by TDK include Hall effect and temperature sensors and validated and verified software algorithms ... robots and are critical to the needs of today's OEM development teams." ...
- Faces of the Pack: Engineering student is making a difference in autonomous systems researchon June 2, 2020 at 2:34 pm
“I am the lead researcher of the autonomous exploration planning algorithm for all robots on the team including flying and walking robots,” he said. “Since our team consists of several sub-teams in ...
- Hyperion Launched Global Map3 Initiation Conferenceon May 19, 2020 at 2:02 am
Co-founders of the Hyperion team ... based on decentralized map data and serve Map3 network at mobile ends. The current available functions include, but not limited to route planning ...
via Bing News