Sciweavers

355 search results - page 24 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
116
Voted
ATAL
2003
Springer
15 years 8 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver
142
Voted
ATAL
2005
Springer
15 years 9 months ago
Coordinating multiple rovers with interdependent science objectives
This paper describes an integrated system for coordinating multiple rover behavior with the overall goal of collecting planetary surface data. The MISUS system combines techniques...
Tara A. Estlin, Daniel M. Gaines, Forest Fisher, R...
230
Voted
GIS
2007
ACM
16 years 4 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
144
Voted
ATAL
2010
Springer
15 years 4 months ago
Agreeing on plans through iterated disputes
Autonomous agents transcend their individual capabilities by cooperating towards achieving shared goals. The different viewpoints agents have on the environment cause disagreement...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...
ISCC
2000
IEEE
15 years 7 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve