search

beniz / hmdp

hmdp is a C++ library and tools for solving Markov Decision Processes (MDPs) with hybrid discrete and/or continuous state-spaces.
Apache License 2.0
23 stars 4 forks source link

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

Open beniz opened 10 years ago

beniz commented 10 years ago

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 O(1) while the other is O(log N), see http://www.boost.org/doc/libs/1_52_0/doc/html/heap/data_structures.html

beniz commented 10 years ago

http://stackoverflow.com/questions/17823495/how-do-i-get-elements-from-boostfibonacci-heap-by-handle