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.

Sign up for GitHub

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

Jump to bottom

Implement hash trie or any similar data structure for states in the Planner #27

Open

luxkun opened this issue Feb 13, 2018 · 0 comments

Owner

luxkun commented Feb 13, 2018

Currently we are doing a deep copy of the state between each node.
This is very expensive and non-optimal.

Since the state rarely change between nodes (usually only 1-2 values do), we should implement a data structure that can handle this correctly.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment