Posts Tagged ‘coordination’

June 2nd, 2011

Any-shape robot formations - article


Arbitrarily shaped formations of mobile robots: artificial potential fields and coordinate transformation
Lorenzo Sabattini, Cristian Secchi, Cesare Fantuzzi

Groups of robots that move in precise formations could be used to sense an environment from multiple points of view or navigate a warehouse in a compact manner. The challenge is to build formations in a distributed manner, meaning there is no leader telling every robot where to go. Instead robots must react to neighboring robots within a limited sensing range.

To solve this problem, Sabattini et al. propose an elegant algorithm that guarantees robots will move in formations of any desirable shape without bumping into each other. Let’s start with a simple scenario where N robots are asked to form a polygon with N edges of length L. Such a polygon can hold in a circle of radius R as shown in the figure below. Robots reach that configuration by being repulsed from the center of the circle until they are at a distance R, along the circle. Combine that with a rule to make each robot repulse from neighbors that are closer than a distance L and you get a polygon. However, using these two rules alone, robots would form polygons oriented in any direction. To make sure the polygon points in the right direction, simply attract one of the robots to a specific position (a* in the figure). All the other robots will then adapt to this robot to form a polygon oriented in the desired manner.

So how do you go from making a polygon to making any arbitrary shape? The trick is to cleverly change the coordinate system of the robots so that they think they are forming a polygon, when in fact they are forming the desired shape. This can be seen in the figure below which shows simulated robots in a real coordinate system, and in the transformed coordinate system.

Robot trajectories simulated with Matlab: black dots are the starting positions, red stars are the final positions. Trajectories are plotted with respect to the real reference frame (left) and the transformed one (right).


Experiment were conducted in matlab, Player/Stage and in reality using three Roomba vacuum cleaners. The Roombas were equipped with a gumstix computer and wireless hardware. During formation, robots would calculate their position using odometry and transmit their location to neighboring robots using WiFi. Results show that the proposed algorithm is successful in creating the desired formations, regardless of the original positions of the robots.

In the future, authors hope to optimize robot trajectories, avoid obstacles in the environment and control the heading of the individual robots.

| More

Related posts

October 12th, 2010

Robot coordination for fire response - article


Time-extended multi-robot coordination for domains with intra-path constraints
E. Gil Jones, M. Bernardine Dias, Anthony Stentz

Robots can work together to cooperatively execute tasks much faster than a single robot. In the scenario proposed by Jones et al. fire trucks are sent out to extinguish fires caused by a large-scale disaster. Because of the disaster, roads are blocked by debris that can only be cleared by bulldozer robots. Coordination in this scenario amounts to figuring out which routes the fire trucks should take to extinguish which fires and how bulldozers should be used to clear the way. Good coordination leads to a maximum number of fires being extinguished as fast as possible.

Allocating the tasks to the different agents (fire trucks and bulldozers) over time is challenging because of the explosion in possible combinations of agents, tasks and routes. To address this challenge, Jones et al. propose two approaches. In the first, agents bid on groups of tasks to be accomplished over time and auctions are then held to distribute the tasks. The second approach searches over all possible solutions by using a genetic algorithm.

Experiments in simulation show that the genetic algorithm, if given enough time, results in better system performance than auction-based systems that tend to result in local minima. Higher performance however comes at the price of orders of magnitude increase in processing. Because both approaches are able to achieve good solutions, the tradeoff between performance and execution time will need to be considered on a case by case basis.

Two examples of auction-based approaches are shown below. On the left side, only a single fire is assigned per fire truck at a time, while the right side approach allows several fires to be assigned at a time. Result show that assigning a set of tasks to accomplish over a period of time leads to better performance (green bar) than assigning a single task at a time (time-extended coordination).

| More

Related posts