Belief selection in point-based planning algorithms for POMDPs
Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value function can be derived by interpolation from the values of a specially selected set of points. The performance of these algorithms can...
Saved in:
| Main Author: | Azar, Danielle (author) |
|---|---|
| Other Authors: | Izadi, Masoumeh T. (author), Precup, Doina (author) |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5374 http://dx.doi.org/10.1007/11766247_33 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007/11766247_33 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhancing fairness and scalability in IOTA tangle networks: a POMDP-based tip selection algorithm for decentralized systems
by: Mays Alshaikhli (22564811)
Published: (2025) -
A combined ant colony optimization and simulated annealing algorithm to assess Stability and fault-proneness of classes based on internal software quality attributes
by: Azar, Danielle
Published: (2016) -
A simulated annealing algorithm for the capacitated vehicle routing problem
by: Azar, Danielle
Published: (2017) -
Using genetic algorithms to optimize software quality estimation models
by: Azar, Danielle
Published: (2004) -
A simulated annealing algorithm for the capacitated vehicle routing problem
by: Azar, Danielle
Published: (2011)