An astrological survey simulation designed for testing MDP-style algorithms
BSD 3-Clause "New" or "Revised" License
3
stars
0
forks
source link
Codify the problems listed in the nuerips submission as a survey subclass #40
Closed
voetberg closed 11 months ago
Problem 1 - continuous teff (already included)
Problem 2 - maximize times seeing a specific object:
$
R_{s_{n}} = \frac{1}{||T||} (||\{s_i: s_i \in S_{interest}\}|| + \lambda \Sigma^{t_{n}}_{t=0} T_{eff_t}(s))
$Problem 3 - even coverage
$
R_{S_{n}} = \frac{1}{||T||* Var(\{||(s_i)||: s_i \in S_n\})}* \Sigma^{S_{n}}_{i=0} \begin{cases} \Sigma^{t_{n}}_{j=0} T_{eff}(s_{i,j}) & ||s_i|| \geq N \\ 0 & ||s_i|| < N \\ \end{cases}
$