Tim Quatmann
|
d184d67b53
|
Refactored under-approximation code a bit.
|
5 years ago |
|
Tim Quatmann
|
97842f356d
|
Fixed beliefgrid exploration.
|
5 years ago |
|
Tim Quatmann
|
b3796d740f
|
Fixed confusing lower and upper result bounds for minimizing properties.
|
5 years ago |
|
Tim Quatmann
|
6fee61feb1
|
POMDP: Started to split belief logic from exploration logic.
|
5 years ago |
|
Tim Quatmann
|
b53b6ab275
|
Added missing line breaks
|
5 years ago |
|
Tim Quatmann
|
7f102c915b
|
Improved some output
|
5 years ago |
|
Tim Quatmann
|
e76efd14d5
|
POMDP: Filling the statistics struct with information. Also incorporated aborting (SIGTERM, i.e. CTRL+C)
|
5 years ago |
|
Tim Quatmann
|
6f3fab8e80
|
Added a statistics struct to the approximatePOMDP model checker
|
5 years ago |
Alexander Bork
|
311362d995
|
Removal of some more obsolete code
|
5 years ago |
|
Alexander Bork
|
0507da4ffa
|
Adjusted Refinement Procedure for rewards
|
5 years ago |
|
Alexander Bork
|
62e3a62686
|
Fix for belief reward computation
|
5 years ago |
|
Alexander Bork
|
44fd26bd13
|
Implementation of exploration stopping in refinement procedure for newly added states
|
5 years ago |
|
Alexander Bork
|
77b1de510f
|
Renaming of naive underapproximation value map
|
5 years ago |
|
Alexander Bork
|
02a325ba75
|
Fixed error that refinement did not stop if initial computation already yields same values for over- and under-approximation
|
5 years ago |
|
Alexander Bork
|
054c2a906e
|
Fixed wrong error when over- and under-approximation values are equal
|
5 years ago |
|
Alexander Bork
|
d28c982fbd
|
Fix for missing initial belief ID in return struct
|
5 years ago |
|
Alexander Bork
|
8e30e27eb9
|
Removal of obsolete code
|
5 years ago |
|
Tim Quatmann
|
581e165fb9
|
Actually use the refinement precision....
|
5 years ago |
|
Tim Quatmann
|
b3493b5888
|
Grid: Added cli setting to cache subsimplices.
|
5 years ago |
|
Tim Quatmann
|
a11ec691a9
|
Introduced options in the ApproximatePOMDPModelChecker.
|
5 years ago |
|
Tim Quatmann
|
24faf636d7
|
removed unused variables.
|
5 years ago |
|
Alexander Bork
|
c2582058c9
|
Added first version of refinement with reuse of previous results
|
5 years ago |
Sebastian Junges
|
63e0d772a4
|
do not use the 'goal' label for internal purposes, but rather __goal__. TODO: Consider if we can do without a fresh label
|
5 years ago |
|
Sebastian Junges
|
d703516d2d
|
make code compile
|
5 years ago |
|
Alexander Bork
|
c74a6ea201
|
Removal of unused extractActions function
|
5 years ago |
|
Alexander Bork
|
53d5e9edf5
|
Code Cleanup
|
5 years ago |
|
Alexander Bork
|
91232a2b11
|
Changed data structure for belief distributions from vector to map to exploit sparsity
|
5 years ago |
|
Alexander Bork
|
e02ea57a58
|
Rudimentary version of the refinement loop
|
5 years ago |
|
Alexander Bork
|
a5fc9fc5b7
|
Added naive underapproximation by unrolling the belief support up to a given size
|
5 years ago |
|
Alexander Bork
|
4bbb02dcaa
|
Wrong method for underapproximation for future reference
|
5 years ago |
|
Alexander Bork
|
8d3254b8d0
|
Use boost::bimap for the belief space <-> state space mapping
|
5 years ago |
|
Alexander Bork
|
0facf4a572
|
Preparation work for the implementation of the refinement procedure
|
5 years ago |
|
Alexander Bork
|
94b93f013c
|
Added option to stop approximation space exploration early if difference between over- and under-approximation is under a given threshold
|
5 years ago |
|
Alexander Bork
|
f416cc8291
|
Added flag to toggle caching of subsimplex and lambda values
|
5 years ago |
|
Alexander Bork
|
aca676a0a5
|
Added model generation and checking for initial approximation bounds
|
5 years ago |
|
Sebastian Junges
|
4418422ea8
|
merge -- but code is not working atm
|
5 years ago |
|
Alexander Bork
|
8992b70da3
|
Made Value Iteration its own function to reduce duplicate code
|
5 years ago |
|
Alexander Bork
|
fe81e0d7cf
|
Smaller touch-ups (Removal of unused code, pass-by-reference)
|
5 years ago |
|
Alexander Bork
|
877c15ed43
|
Removed obsolete function to create transition matrices from a data structure not used anymore
|
5 years ago |
|
Alexander Bork
|
b7b213571d
|
Refactoring of underapproximation procedures to reduce code duplication
|
5 years ago |
|
Alexander Bork
|
8f81958268
|
Refactoring of reachability reward and probability methods to reduce code duplication
|
5 years ago |
|
Alexander Bork
|
4664b4244b
|
Refactoring of on-the-fly computation to reduce code duplication
|
5 years ago |
|
Alexander Bork
|
c6902e0ca7
|
Added reward MDP generation for the overapproximation
|
5 years ago |
|
Alexander Bork
|
c663edbd85
|
Added generation of an MDP for the over-approximation in the on-the-fly state exploration
|
5 years ago |
|
Alexander Bork
|
bbd3ec7287
|
Fix of wrong MDP underapproximation
|
5 years ago |
|
Alexander Bork
|
b9c0af6628
|
Added on-the-fly belief grid generation for rewards
|
6 years ago |
|
Alexander Bork
|
21e417bdac
|
Added on-the-fly belief grid generation to avoid computations for unreachable beliefs
|
6 years ago |
|
Alexander Bork
|
bc52aa86ca
|
Added procedure to repeat probability computation with higher resolution
|
6 years ago |
|
Alexander Bork
|
a65c445243
|
Avoid multiple computation of size in subsimplex computation
|
6 years ago |
|
Alexander Bork
|
4b8664c521
|
Added reward under-approximation
|
6 years ago |
