| 1 | @book{bertsekas1995dynamic, |
|---|
| 2 | title={{Dynamic Programming and Optimal Control, vol. 1}}, |
|---|
| 3 | author={Bertsekas, D.P.}, |
|---|
| 4 | publisher={Athena Scientific}, |
|---|
| 5 | year={1995} |
|---|
| 6 | } |
|---|
| 7 | |
|---|
| 8 | @book{bellman1957dynamic, |
|---|
| 9 | title={{Dynamic Programming}}, |
|---|
| 10 | author={Bellman, R.}, |
|---|
| 11 | publisher={Princeton University Press}, |
|---|
| 12 | year={1957} |
|---|
| 13 | } |
|---|
| 14 | |
|---|
| 15 | @book{feldbaum1965optimal, |
|---|
| 16 | title={{Optimal control systems}}, |
|---|
| 17 | author={Feldbaum, AA}, |
|---|
| 18 | publisher={Academic Press, New York}, |
|---|
| 19 | year={1965} |
|---|
| 20 | } |
|---|
| 21 | |
|---|
| 22 | @article{peterka1981bayesian, |
|---|
| 23 | title={{Bayesian system identification}}, |
|---|
| 24 | author={Peterka, V.}, |
|---|
| 25 | journal={Automatica}, |
|---|
| 26 | volume={17}, |
|---|
| 27 | number={1}, |
|---|
| 28 | pages={41--53}, |
|---|
| 29 | year={1981}, |
|---|
| 30 | publisher={Elsevier} |
|---|
| 31 | } |
|---|
| 32 | |
|---|
| 33 | @article{kalman1960new, |
|---|
| 34 | title={{A new approach to linear filtering and prediction problems}}, |
|---|
| 35 | author={Kalman, R.E.}, |
|---|
| 36 | journal={Journal of basic Engineering}, |
|---|
| 37 | volume={82}, |
|---|
| 38 | number={1}, |
|---|
| 39 | pages={35--45}, |
|---|
| 40 | year={1960}, |
|---|
| 41 | publisher={Citeseer} |
|---|
| 42 | } |
|---|
| 43 | |
|---|
| 44 | @article{peterka1981bayesian, |
|---|
| 45 | title={{Bayesian system identification}}, |
|---|
| 46 | author={Peterka, V.}, |
|---|
| 47 | journal={Automatica}, |
|---|
| 48 | volume={17}, |
|---|
| 49 | number={1}, |
|---|
| 50 | pages={41--53}, |
|---|
| 51 | year={1981}, |
|---|
| 52 | publisher={Elsevier} |
|---|
| 53 | } |
|---|
| 54 | |
|---|
| 55 | @book{luus2000iterative, |
|---|
| 56 | title={{Iterative dynamic programming}}, |
|---|
| 57 | author={Luus, R.}, |
|---|
| 58 | year={2000}, |
|---|
| 59 | publisher={CRC Press} |
|---|
| 60 | } |
|---|
| 61 | |
|---|
| 62 | @Article{bh-eamvb-01, |
|---|
| 63 | author = {G.~Barequet and S.~{Har-Peled}}, |
|---|
| 64 | journal = {Journal of Algorithms}, |
|---|
| 65 | title = {Efficiently Approximating the Minimum-Volume |
|---|
| 66 | Bounding Box of a Point Set in Three Dimensions}, |
|---|
| 67 | volume = {38}, |
|---|
| 68 | issue = {1}, |
|---|
| 69 | pages = {91--109}, |
|---|
| 70 | year = 2001 |
|---|
| 71 | } |
|---|
| 72 | |
|---|
| 73 | @article{thompson2005stochastic, |
|---|
| 74 | title={{Stochastic iterative dynamic programming: a Monte Carlo approach to dual control}}, |
|---|
| 75 | author={Thompson, A.M. and Cluett, W.R.}, |
|---|
| 76 | journal={Automatica}, |
|---|
| 77 | volume={41}, |
|---|
| 78 | number={5}, |
|---|
| 79 | pages={767--778}, |
|---|
| 80 | year={2005}, |
|---|
| 81 | publisher={Elsevier} |
|---|
| 82 | } |
|---|
| 83 | |
|---|
| 84 | @article{astrom1986dual, |
|---|
| 85 | title={{Dual control of an integrator with unknown gain}}, |
|---|
| 86 | author={{\AA}str�K. J. and Helmersson, A.}, |
|---|
| 87 | journal={Computers \& Mathematics with Applications}, |
|---|
| 88 | volume={12}, |
|---|
| 89 | number={6}, |
|---|
| 90 | pages={653--662}, |
|---|
| 91 | year={1986}, |
|---|
| 92 | publisher={Elsevier} |
|---|
| 93 | } |
|---|
| 94 | |
|---|
| 95 | @article{nelson2001simple, |
|---|
| 96 | title={{Simple procedures for selecting the best simulated system when the number of alternatives is large}}, |
|---|
| 97 | author={Nelson, B.L. and Swann, J. and Goldsman, D. and Song, W.}, |
|---|
| 98 | journal={Operations Research}, |
|---|
| 99 | volume={49}, |
|---|
| 100 | number={6}, |
|---|
| 101 | pages={950--963}, |
|---|
| 102 | year={2001}, |
|---|
| 103 | publisher={Institute for Operations Research and the Management Sciences} |
|---|
| 104 | } |
|---|
| 105 | |
|---|
| 106 | @book{hammersley1964monte, |
|---|
| 107 | title={{Monte carlo methods}}, |
|---|
| 108 | author={Hammersley, J.M. and Handscomb, D.C.}, |
|---|
| 109 | year={1964}, |
|---|
| 110 | publisher={Taylor \& Francis} |
|---|
| 111 | } |
|---|
| 112 | |
|---|
| 113 | |
|---|
| 114 | |
|---|
