MIT 4D Maps Help Robots Avoid Moving Obstacles
MIT researchers have developed a decentralized planning algorithm that can help teams of robots handle both stationary and moving obstacles, and do so with reduced communications bandwidth.
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.
This article was republished with permission from MIT News.