355 search results - page 34 / 71 » A general, fully distributed multi-agent planning algorithm |
126
click to vote
JAIR
2008
15 years 3 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
108
Voted
IPPS
1996
IEEE
15 years 7 months ago
1996
IEEE
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
105
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
123
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
146
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...