Distributed decision making for robot teams

Abstract

We review the problem of action coordination in a team of collaborative robots, viewed as a combinatorial optimization problem over a coordination graph. We outline a message-passing algorithm for action selection that approximately maximizes a payoff function that is additively decomposed over the graph. We discuss extensions to distributed stochastic optimal control problems, and outline some applications. © 2008 Springer-Verlag Berlin Heidelberg.