Sciweavers

251 search results - page 24 / 51
» RGSep Action Inference
Sort
View
NIPS
2003
13 years 9 months ago
Extending Q-Learning to General Adaptive Multi-Agent Systems
Recent multi-agent extensions of Q-Learning require knowledge of other agents’ payoffs and Q-functions, and assume game-theoretic play at all times by all other agents. This pap...
Gerald Tesauro
ENTCS
2007
89views more  ENTCS 2007»
13 years 7 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 6 months ago
Searching for objects: Combining multiple cues to object locations using a maximum entropy model
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...
Dominik Joho, Wolfram Burgard
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
13 years 6 months ago
Understanding and executing instructions for everyday manipulation tasks from the World Wide Web
Service robots will have to accomplish more and more complex, open-ended tasks and regularly acquire new skills. In this work, we propose a new approach to generating plans for su...
Moritz Tenorth, Daniel Nyga, Michael Beetz
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint