Alexander Bork
|
e02ea57a58
|
Rudimentary version of the refinement loop
|
6 years ago |
|
Alexander Bork
|
a5fc9fc5b7
|
Added naive underapproximation by unrolling the belief support up to a given size
|
6 years ago |
|
Alexander Bork
|
4bbb02dcaa
|
Wrong method for underapproximation for future reference
|
6 years ago |
Sebastian Junges
|
858e2f8a60
|
various improvements and fixes in winning region computation
|
6 years ago |
|
Sebastian Junges
|
aae8774e5f
|
added options, allow to toggle output
|
6 years ago |
|
Sebastian Junges
|
3f4bb4cf8d
|
we now compute the winning region
|
6 years ago |
|
Sebastian Junges
|
93ed0224a1
|
options for searching for qualitative schedulers
|
6 years ago |
|
Sebastian Junges
|
9a5b01b6f7
|
a new encoding for almost sure reachability
|
6 years ago |
|
Alexander Bork
|
8d3254b8d0
|
Use boost::bimap for the belief space <-> state space mapping
|
6 years ago |
|
Alexander Bork
|
0facf4a572
|
Preparation work for the implementation of the refinement procedure
|
6 years ago |
|
Sebastian Junges
|
5bbf54cb78
|
make everything compile again, add/fix method for memless strategy search (CCD16) and towards iterative search
|
6 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
|
6 years ago |
|
Alexander Bork
|
f416cc8291
|
Added flag to toggle caching of subsimplex and lambda values
|
6 years ago |
|
Alexander Bork
|
aca676a0a5
|
Added model generation and checking for initial approximation bounds
|
6 years ago |
|
Sebastian Junges
|
4418422ea8
|
merge -- but code is not working atm
|
6 years ago |
|
Sebastian Junges
|
77c63f4c12
|
SAT based zerostate analysis: work in progress
|
6 years ago |
|
Alexander Bork
|
8992b70da3
|
Made Value Iteration its own function to reduce duplicate code
|
6 years ago |
|
Alexander Bork
|
fe81e0d7cf
|
Smaller touch-ups (Removal of unused code, pass-by-reference)
|
6 years ago |
|
Alexander Bork
|
877c15ed43
|
Removed obsolete function to create transition matrices from a data structure not used anymore
|
6 years ago |
|
Alexander Bork
|
b7b213571d
|
Refactoring of underapproximation procedures to reduce code duplication
|
6 years ago |
|
Alexander Bork
|
8f81958268
|
Refactoring of reachability reward and probability methods to reduce code duplication
|
6 years ago |
|
Alexander Bork
|
4664b4244b
|
Refactoring of on-the-fly computation to reduce code duplication
|
6 years ago |
|
Alexander Bork
|
c6902e0ca7
|
Added reward MDP generation for the overapproximation
|
6 years ago |
|
Alexander Bork
|
c663edbd85
|
Added generation of an MDP for the over-approximation in the on-the-fly state exploration
|
6 years ago |
|
Alexander Bork
|
bbd3ec7287
|
Fix of wrong MDP underapproximation
|
6 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
|
7afc47f354
|
Fixed wrong size of stateLabeling if no probability 0 states were found
|
6 years ago |
|
Alexander Bork
|
11f89de9e8
|
Added preprocessing to reduce the POMDP state space before analysis
|
6 years ago |
|
Alexander Bork
|
4b8664c521
|
Added reward under-approximation
|
6 years ago |
|
Alexander Bork
|
f119e3d4c7
|
Added reward over-approximation
|
6 years ago |
|
Alexander Bork
|
4c8395c3b1
|
Speedup of probability approximation
|
6 years ago |
|
Alexander Bork
|
f6d9a6ac02
|
Changed datatype used in POMDP analysis from RationalNumber to double for better comparision of approximation speeds with PRISM
|
6 years ago |
|
Alexander Bork
|
5de96cc170
|
Modified implementation to speed up the subsimplex computation
|
6 years ago |
|
Alexander Bork
|
959a2c2400
|
Added ability to use an MDP for the underapproximation
|
6 years ago |
Tim Quatmann
|
cb00c21db2
|
Fixed type uintX -> uintX_t
|
6 years ago |
|
Alexander Bork
|
3bd910f42b
|
Added timing and caching of subsimplex computation results
|
6 years ago |
|
Alexander Bork
|
d814942997
|
Working version of under-approximation
|
6 years ago |
|
Alexander Bork
|
2bc79e6e07
|
Refactoring to include a list of all generated beliefs
|
6 years ago |
|
Alexander Bork
|
74cfecd011
|
Working version of over-approximation
|
6 years ago |
|
Alexander Bork
|
7f9ad39d34
|
First version for the over-approximation of POMDP reachability
|
6 years ago |
Matthias Volk
|
685b5c6b27
|
Throw exceptions after switch/case to silence compiler warnings about not returning anything
|
7 years ago |
|
Matthias Volk
|
8332abab58
|
Removed unused variables
|
7 years ago |
|
TimQu
|
19070a27a9
|
added 'fixed ring' pattern
|
8 years ago |
|
TimQu
|
d06c2c791a
|
introducing pomdp memory patterns
|
8 years ago |
|
TimQu
|
d34a2dd9fd
|
fix for mec choice elimination
|
8 years ago |
|
TimQu
|
820f2ddf4c
|
extended mec eliminator to minimal rewards
|
8 years ago |
|
TimQu
|
90087ff526
|
added transformation to binary pomdp
|
8 years ago |
