The following pages link to (Q4584885):
Displaying 13 items.
- Associative dynamic programs (Q1919588) (← links)
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data (Q2138306) (← links)
- Unbounded dynamic programming via the Q-transform (Q2138381) (← links)
- Rollout approach to sensor scheduling for remote state estimation under integrity attack (Q2165967) (← links)
- A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation (Q2664240) (← links)
- Dynamic programming with value convexity (Q2665320) (← links)
- (Q5152162) (← links)
- Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains (Q5222093) (← links)
- Solving nonlinear and dynamic programming equations on extended \(b\)-metric spaces with the fixed-point technique (Q6103683) (← links)
- Dissipativity in infinite horizon optimal control and dynamic programming (Q6118398) (← links)
- An approximation approach to dynamic programming with unbounded returns (Q6121892) (← links)
- Do not blame Bellman: it is Koopmans' fault (Q6536798) (← links)
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games (Q6614884) (← links)
