Sciweavers

1639 search results - page 3 / 328
» Anytime Heuristic Search
Sort
View
AAAI
1990
13 years 8 months ago
Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...
Mark Drummond, John L. Bresina
NIPS
2007
13 years 8 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
ECAI
2004
Springer
14 years 6 days ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
EUMAS
2006
13 years 8 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
AAAI
2004
13 years 8 months ago
Effective Approaches for Partial Satisfaction (Over-Subscription) Planning
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...
Menkes van den Briel, Romeo Sanchez Nigenda, Minh ...