Sciweavers

1662 search results - page 57 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AI
2006
Springer
14 years 17 days ago
Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
Julien Laumonier, Brahim Chaib-draa
ATAL
2008
Springer
13 years 10 months ago
Autonomous geocaching: navigation and goal finding in outdoor domains
This paper describes an autonomous robot system designed to solve the challenging task of geocaching. Geocaching involves locating a goal object in an outdoor environment given on...
James Neufeld, Michael Sokolsky, Jason Roberts, Ad...
ATAL
2010
Springer
13 years 10 months ago
Distributed coordination of mobile agent teams: the advantage of planning ahead
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
Laura Barbulescu, Zachary B. Rubinstein, Stephen F...
AGENTS
1998
Springer
14 years 1 months ago
A Synergy of Agent Components: Social Comparison for Failure Detection
of other components. This abstract presents an implemented illustration of such explicit component synergy and its usefulness in dynamic multi-agent environments. In such environme...
Gal A. Kaminka, Milind Tambe
AAAI
2010
13 years 10 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer