hmdp

hmdp copied to clipboard

Would you like to [replace any double quotes](https://github.com/beniz/hmdp/blob/23673cf49f4bfff7acd780c6f38093d9a1e92f17/src/engine/HmdpEngine.h#L20) by [angle brackets around file names for include statements](http://stackoverflow.com/questions/21593/what-is-the-difference-between-include-filename-and-include-filename)?

elfring

Efficient implementation of prioritized sweeping requires a mutable heap (e.g. Fibonacci heap)

1

A priority queue based Fibonacci heap appears to be the best solution as at least one direction of the mutation of the priority (increase or decrease depending on implementation) is...

beniz

``` pred_hst->setPriority((*pit).first*hst->getResidual()); ``` in HmdpEngine.cc is the culprit.

beniz

DFS uses a map of visited states, would be faster with an unordered_map

1

map stores pointer of state as key, should be able to use it as key of an unordered_map.

beniz

Multithread version of the current code, to take advantage of multiple cores. Likely to be implemented with openMP.

beniz

There's no difficulty, as the continuous state-space can be considered non-existent in this case.

beniz

This basically means the need for persistence of objects of the class BspTree, with specializations, as needed.

beniz

Implement lazy approximation

1

Implement the lazy approximation scheme described in Li & Littman 2005 (1). (1) Lihong Li and Michael L. Littman: Lazy approximation for solving continuous finite-horizon MDPs. In AAAI-05, pages 1175-1180,...

beniz