Behaviour Trees #1
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
If Haskell isn't your thing I recommend at least reading and understanding how WallFollow.ss works. |
|
Koolt. |
|
From what I understood it is OK |
|
I don't doubtt that it is ok but after you create your .ss file, which files does the parser/printer generate? the xxx.cpp and behaviour.hpp? |
|
Behaviour.hpp is written by me, the script generates this: https://gist.github.com/Jinxit/49444e7f68422f6633bf |
…porary nodes this is the worst i'm so sorry
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
seqsel/ contains the behaviour tree transpiler, data/ contains the example (simple) wall following tree
Send messages (std_msgs/Bool) to "/nord/houston/mission_result" to indicate success or failure, or an empty message (std_msgs/Empty) to "/nord/houston/mission_abort" to force a top-down re-evaluation of the tree.
Based on the usual https://en.wikipedia.org/wiki/Behavior_tree_%28artificial_intelligence,_robotics_and_control%29 except nodes are expected to run until they finish, instead of returning "running".