But thanks to a control algorithm, MIT has solved this equation.
Each robot uses observations to measure a region without obstacles in its immediate context.
Then it passes such a map to its nearest neighbors.
And each robot ends up with a map that reflects all the obstacles the team detected.
The algorithm considers moving obstacles to include time as a fourth dimension in the mapping.
Each robot updates its map several times per second, calculating the trajectory to maximize local and global goals.
