Sciweavers

388 search results - page 30 / 78
» Learning to Optimize Plan Execution in Information Agents
Sort
View
ATAL
2008
Springer
13 years 9 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
KER
2007
90views more  KER 2007»
13 years 7 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
ATAL
2006
Springer
13 years 11 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
IJCAI
2001
13 years 9 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IJCAI
2007
13 years 9 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb