188 search results - page 13 / 38 » A distributed constraint optimization approach for coordinat... |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
TIT
2011
13 years 2 months ago
2011
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
This paper proposes a new multiagent planning approach to coordination synthesis that views distributed agents as discrete-event processes. The connection between discreteevent co...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...