-
Notifications
You must be signed in to change notification settings - Fork 22
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How to run BlackDROPS with GP-MI #13
Comments
First of all, thank you for your interest.
Yes and no. Yes because we have already implemented the GP-MI optimization procedure (see here), but no because we haven't included an example usage. Let me create an example in the cartpole scenario (which is easy and fast to do), and I will ping you. Give me until 15th of June as I have a few urgent things to finish till then.. |
That would be great! I'll check the optimization procedure before you release an example. |
@urnotmeeto sorry for being late almost one month, but lots of things came up. I have created a branch with an example of using GP-MI with the cartpole: The process starts by optimizing the mean model first (with an initial guess of the optimization variables of the mean --- different from the actual system), and the proceeds with the normal loop of optimizing the model and then the policy given the model. Beware that the model optimization will take much longer as well as the policy optimization (we are calling the mean function every-time we query the model). |
@costashatz Great! I'll check it. Thank you! |
Have you implemented the BlackDROPS with GP-MI algorithm that was proposed in your ICRA 2018 paper in this repo? I am very interested in that idea and wondering how to replicate your experimental results.
The text was updated successfully, but these errors were encountered: