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...
محفوظ في:
| المؤلف الرئيسي: | Azar, Danielle (author) |
|---|---|
| مؤلفون آخرون: | Izadi, Masoumeh T. (author), Precup, Doina (author) |
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Enhancing fairness and scalability in IOTA tangle networks: a POMDP-based tip selection algorithm for decentralized systems
حسب: Mays Alshaikhli (22564811)
منشور في: (2025) -
A combined ant colony optimization and simulated annealing algorithm to assess Stability and fault-proneness of classes based on internal software quality attributes
حسب: Azar, Danielle
منشور في: (2016) -
A simulated annealing algorithm for the capacitated vehicle routing problem
حسب: Azar, Danielle
منشور في: (2017) -
Using genetic algorithms to optimize software quality estimation models
حسب: Azar, Danielle
منشور في: (2004) -
A simulated annealing algorithm for the capacitated vehicle routing problem
حسب: Azar, Danielle
منشور في: (2011)