Learning Domain Randomization Distributions for Training Robust Locomotion Policies

B. Mehta, M. Diaz, F. Golemo, C. J. Pal, and L. Paull, “Active domain randomization,” CoRR , vol. abs/1904.04762, 2019. [Online]. Available: http://arxiv.org/abs/1904.04762

Original

1904

Earlier work this paper cites.

G. Zames, “Feedback and optimal sensitivity: Model reference transformations, multiplicative seminorms, and approximate inverses,” IEEE Transactions on Automatic Control , vol. 26, no. 2, pp. 301–320, April 1981

1981

Earlier work this paper cites.

R. Caruana, “Multitask learning: A knowledge-based source of inductive bias,” in Proceedings of the Tenth International Conference on Machine Learning . Morgan Kaufmann, 1993, pp. 41–48

1993

Earlier work this paper cites.

N. Jakobi, P. Husbands, and I. Harvey, “Noise and the reality gap: The use of simulation in evolutionary robotics,” in European Conference on Artificial Life . Springer, 1995, pp. 704–720

1995

Earlier work this paper cites.

J. Baxter, “A bayesian/information theoretic model of learning to learn via multiple task sampling,” Machine Learning , vol. 28, no. 1, pp. 7–39, Jul 1997. [Online]. Available: https://doi.org/10.1023/A:1007327622663

1997

Earlier work this paper cites.

K. Zhou and J. C. Doyle, Essentials of robust control . Prentice hall Upper Saddle River, NJ, 1998, vol. 104

1998

Earlier work this paper cites.

M. C. Fu, “Gradient estimation,” Handbooks in operations research and management science , vol. 13, pp. 575–616, 2006

2006

Earlier work this paper cites.

A. Tamar, Y. Glassner, and S. Mannor, “Optimizing the cvar via sampling,” in Twenty-Ninth AAAI Conference on Artificial Intelligence , 2015

2015

Earlier work this paper cites.

A. Rajeswaran, S. Ghotra, S. Levine, and B. Ravindran, “EPOpt: Learning robust neural network policies using model ensembles,” CoRR , vol. abs/1610.01283, 2016. [Online]. Available: http://arxiv.org/abs/1610.01283

Original

2016

Cited alongside, same era.

G. Brockman, V. Cheung, L. Pettersson, J. Schneider, J. Schulman, J. Tang, and W. Zaremba, “Openai gym,” 2016

2016

Cited alongside, same era.

W. Yu, J. Tan, C. K. Liu, and G. Turk, “Preparing for the unknown: Learning a universal policy with online system identification,” arXiv preprint arXiv:1702.02453 , 2017

Original

2017

Cited alongside, same era.

J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Proximal policy optimization algorithms,” arXiv preprint arXiv:1707.06347 , 2017

Original

2017

Cited alongside, same era.

C. Packer, K. Gao, J. Kos, P. Krähenbühl, V. Koltun, and D. Song, “Assessing generalization in deep reinforcement learning,” arXiv preprint arXiv:1810.12282 , 2018

Original

2018

Later among the works it cites.

Y. Chebotar, A. Handa, V. Makoviychuk, M. Macklin, J. Issac, N. Ratliff, and D. Fox, “Closing the sim-to-real loop: Adapting simulation randomization with real world experience,” arXiv preprint arXiv:1810.05687 , 2018

Original

2018

Later among the works it cites.

S. Paul, M. A. Osborne, and S. Whiteson, “Contextual policy optimisation,” CoRR , vol. abs/1805.10662, 2018. [Online]. Available: http://arxiv.org/abs/1805.10662

Original

2018

Later among the works it cites.

W. Yu, C. K. Liu, and G. Turk, “Policy transfer with strategy optimization,” CoRR , vol. abs/1810.05751, 2018. [Online]. Available: http://arxiv.org/abs/1810.05751

Original

2018

Later among the works it cites.