Skip to content
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

Discrete step optimizer #209

Open
mpowelson opened this issue Oct 6, 2020 · 0 comments
Open

Discrete step optimizer #209

mpowelson opened this issue Oct 6, 2020 · 0 comments

Comments

@mpowelson
Copy link
Contributor

We've discussed similar things in the past like using trajopt costs/cnts in descartes and optimizing with various seeds with Pagmo. However, one thing that I think would be useful is an "optimizer" that takes trajopt(_ifopt) costs/cnts and a vector of states and returns which ones satisfy the constraints and the order of lowest to highest cost. That is what I am wanting to do, but it may be a subset of a more general optimizer.

An example use case could determining the best pose for performing some discrete function (be it a pick and place, welding, drilling, etc) where the end goal optimality is more important than the path. If you want to determine the best pose for that regardless of how you get there, this would be useful to determine the goal. Then you pass the goal into your motion planning pipeline and it can be tweaked to make the whole trajectory optimal.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant