Sciweavers

200 search results - page 9 / 40
» Point-Based Policy Iteration
Sort
View
81
Voted
UAI
2004
14 years 11 months ago
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
Trey Smith, Reid G. Simmons
79
Voted
IAT
2007
IEEE
15 years 3 months ago
A Study of an Approach to the Collective Iterative Task Allocation Problem
A major challenge in the field of Multi-Agent Systems is to enable autonomous agents to allocate tasks efficiently. This paper extends previous work on an approach to the collec...
Christian Guttmann, Iyad Rahwan, Michael P. George...
75
Voted
EOR
2008
109views more  EOR 2008»
14 years 9 months ago
A dynamic model for managing overlapped iterative product development
Intense competition in many industries impels firms to develop more products in less time. Overlapping of development activities is regarded as one of the most promising strategie...
Jun Lin, Kah Hin Chai, Yoke San Wong, Aarnout Brom...
90
Voted
ECSQARU
2001
Springer
15 years 2 months ago
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Nevin Lianwen Zhang, Weihong Zhang
AAAI
2006
14 years 11 months ago
An Iterative Algorithm for Solving Constrained Decentralized Markov Decision Processes
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
Aurélie Beynier, Abdel-Illah Mouaddib