TimQu
|
9140c1dc0e
|
statistics and empty-epoch-matrix optimization also for single objective case
|
8 years ago |
TimQu
|
23686a0f09
|
reward bounded cumulative reward formulas + fixes for dimensions that do not need memory
|
8 years ago |
dehnert
|
55c787e0d8
|
proper EC elimination in hybrid helper
|
8 years ago |
dehnert
|
e557a8e069
|
started on EC elimination for hybrid engine
|
8 years ago |
TimQu
|
b788c1b403
|
reuse scheduler from previous epoch as initial hint
|
8 years ago |
dehnert
|
df05711f3e
|
finished rational search for MinMax solver, preparing rational search for NativeLinearEquationSolver
|
8 years ago |
TimQu
|
c396ab0ca5
|
more solver requirements for multi-objective model checking
|
8 years ago |
dehnert
|
2d41de479e
|
added progress outputs to iterative solvers
|
8 years ago |
dehnert
|
7f56c82523
|
moved to providing solve goals in sparse model checkers and helpers
|
8 years ago |
dehnert
|
c8e19d2e44
|
fixed priority queue implementation and upper reward bound computation
|
8 years ago |
dehnert
|
52d729b1c7
|
upper bounds computation for reachability rewards in sparse MDPs
|
8 years ago |
dehnert
|
b4a0016362
|
zero-reward MEC elimination for reachability rewards
|
8 years ago |
dehnert
|
fe8c3820fd
|
started cleanup of reachability rewards in sparse MDP helper
|
8 years ago |
dehnert
|
e5572db54e
|
eliminating ECs for sound value iteration for until probabilities
|
8 years ago |
dehnert
|
b4bfd0c39f
|
performance improvement in DS-MPI; some cleanups
|
8 years ago |
dehnert
|
cb849a9ab8
|
started on computing upper bounds for rewards for interval value iteration
|
8 years ago |
dehnert
|
df0b5fbfa5
|
fixed multiply-reduce operations in the presence of empty row groups
|
8 years ago |
dehnert
|
d25cc4b05f
|
first version of sound value iteration
|
8 years ago |
TimQu
|
41cf4e76db
|
The solutions are now stored epoch-wise and will be erased as soon as all predecessor epochs are computed
|
8 years ago |
TimQu
|
47ab74a16b
|
implemented single objective queries
|
8 years ago |
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
8 years ago |
dehnert
|
3c844a487f
|
some more optimizations
|
8 years ago |
dehnert
|
5fafe835cb
|
started on some optimizations for conditionals in MDPs
|
8 years ago |
dehnert
|
7c24607427
|
started on symbolic solver requirements
|
8 years ago |
dehnert
|
e81d979d56
|
hybrid MDP helper respecting solver requirements
|
8 years ago |
dehnert
|
a3cbaedcc1
|
intermediate commit to switch workplace
|
8 years ago |
dehnert
|
12b10af672
|
started on hybrid MDP helper respecting solver requirements
|
8 years ago |
dehnert
|
4c5cdfeafc
|
Sparse MDP helper now also respects solver requirements for reachability rewards
|
8 years ago |
dehnert
|
74eeaa7f81
|
computing unbounded until on MDPs with the sparse helper now respects solver requirements
|
8 years ago |
dehnert
|
569b0122b8
|
introduced different minmax equation system types for requirement retrieval
|
8 years ago |
dehnert
|
4adee85fa5
|
added checking requirements of MinMax solvers to model checker helpers
|
8 years ago |
TimQu
|
9ca14a54fc
|
templated the LpSolvers
|
8 years ago |
TimQu
|
25843ee53b
|
added setting 'lramethod'
|
8 years ago |
TimQu
|
5b10b027fc
|
implemented VI based Long-run-average method for MDPs
|
8 years ago |
dehnert
|
f5ba5204c9
|
adding some debug functionality to DdManager to corner dynamic reordering issue with CUDD
|
8 years ago |
TimQu
|
aebe9fa3c3
|
LP-based long run average rewards for MDPs
|
8 years ago |
TimQu
|
2f49255db6
|
Improved storage::Scheduler. We can now consider arbitrary finite memory schedulers, potentially employing randomization.
|
8 years ago |
TimQu
|
8a7609fb83
|
fixed Rmin computation with exact sparse engine when very high rewards occur
|
8 years ago |
TimQu
|
502cf4d6e0
|
extended model checker hint functionality to bypass the maybestates computations
|
8 years ago |
dehnert
|
0b6c481cf2
|
fix for sparse mdp model checker: computing cumulative rewards did one step too much
|
8 years ago |
TimQu
|
428cb710cc
|
Parameter lifting for mdps, some fixes
|
8 years ago |
TimQu
|
ac6694f103
|
Improved sparse mdp model checking: Now allows hints for expected rewards
|
8 years ago |
TimQu
|
92beab426f
|
created a modelCheckerHint class that allows to store all kinds of hints that a model checker might make use of
|
8 years ago |
TimQu
|
49e6df5860
|
resultHint for sparse mdp model checker
|
8 years ago |
dehnert
|
a2e29893f2
|
fixed a few bugs
|
8 years ago |
dehnert
|
61157cc1c5
|
add warning when computing minimal rewards on MDPs that reward values may be too low
|
8 years ago |
dehnert
|
5b09b91ae1
|
fixed more warnings
|
8 years ago |
dehnert
|
8d6b029d67
|
next batch of fixing warnings
|
8 years ago |
Sebastian Junges
|
d246517757
|
removed src prefix in all includes
|
9 years ago |
Sebastian Junges
|
e1d201c85e
|
c++ code compiles again after rename
|
9 years ago |