Initial commit.

Author: renatopp

.gitignore

@@ -0,0 +1,57 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+env/
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+*.egg-info/
+.installed.cfg
+*.egg
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*,cover
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/

LICENSE

@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Renato de Pontes Pereira
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+

README.md

@@ -0,0 +1,24 @@
+# BEHAVIOR3PY
+
+This is the official python version of the Behavior3 library, originally written in Javascript.
+
+- Info: http://behavior3.com
+
+NOTE: this version still lacks specific documentation, but almost everything you need can be dig from the javascript-version.
+
+
+## Main features
+
+- Based on the work of [(Marzinotto et al., 2014)](http://www.csc.kth.se/~miccol/Michele_Colledanchise/Publications_files/2013_ICRA_mcko.pdf), in which they propose a **formal**, **consistent** and **general** definition of Behavior Trees;
+
+- **Optimized to control multiple agents**: you can use a single behavior tree instance to handle hundreds of agents;
+
+- It was **designed to load and save trees in a JSON format**, in order to use, edit and test it in multiple environments, tools and languages;
+
+- A **cool visual editor** which you can access online;
+
+- Several **composite, decorator and action nodes** available within the library. You still can define your own nodes, including composites and decorators;
+
+- **Completely free**, the core module and the visual editor are all published under the MIT License, which means that you can use them for your open source and commercial projects;
+
+- **Lightweight**!

b3/__init__.py

@@ -0,0 +1,43 @@
+VERSION   = '0.1.0'
+
+SUCCESS   = 1
+FAILURE   = 2
+RUNNING   = 3
+ERROR     = 4
+
+COMPOSITE = 'composite'
+DECORATOR = 'decorator'
+ACTION    = 'action'
+CONDITION = 'condition'
+
+# CORE
+from b3.core.tick import Tick
+from b3.core.basenode import BaseNode
+from b3.core.blackboard import Blackboard
+from b3.core.behaviortree import BehaviorTree
+from b3.core.composite import Composite
+from b3.core.decorator import Decorator
+from b3.core.action import Action
+from b3.core.condition import Condition
+
+# COMPOSITES
+from b3.composites.sequence import Sequence
+from b3.composites.priority import Priority
+from b3.composites.mempriority import MemPriority
+from b3.composites.memsequence import MemSequence
+
+# ACTIONS
+from b3.actions.succeeder import Succeeder
+from b3.actions.failer import Failer
+from b3.actions.runner import Runner
+from b3.actions.error import Error
+from b3.actions.wait import Wait
+
+# DECORATORS
+from b3.decorators.inverter import Inverter
+from b3.decorators.limiter import Limiter
+from b3.decorators.maxtime import MaxTime
+from b3.decorators.repeater import Repeater
+from b3.decorators.repeatuntilfailure import RepeatUntilFailure
+from b3.decorators.repeatuntilsuccess import RepeatUntilSuccess
+

b3/actions/__init__.py

@@ -0,0 +1,7 @@
+import b3
+
+__all__ = ['Error']
+
+class Error(b3.Action):
+    def tick(self, tick):
+        return b3.ERROR;

b3/actions/error.py

@@ -0,0 +1,7 @@
+import b3
+
+__all__ = ['Failer']
+
+class Failer(b3.Action):
+    def tick(self, tick):
+        return b3.FAILURE;

b3/actions/failer.py

@@ -0,0 +1,7 @@
+import b3
+
+__all__ = ['Runner']
+
+class Runner(b3.Action):
+    def tick(self, tick):
+        return b3.RUNNING;

b3/actions/runner.py

@@ -0,0 +1,7 @@
+import b3
+
+__all__ = ['Succeeder']
+
+class Succeeder(b3.Action):
+    def tick(self, tick):
+        return b3.SUCCESS;

b3/actions/succeeder.py

@@ -0,0 +1,22 @@
+import b3
+import time
+
+__all__ = ['Wait']
+
+class Wait(b3.Action):
+    def __init__(self, milliseconds=0):
+        super(Wait, self).__init__()
+        self.end_time = milliseconds/1000.
+
+    def open(self, tick):
+        start_time = time.time()
+        tick.blackboard.set('start_time', start_time, tick.tree.id, self.id)
+
+    def tick(self, tick):
+        curr_time = time.time()
+        start_time = tick.blackboard.get('start_time', tick.tree.id, self.id)
+
+        if (curr_time-start_time > self.end_time):
+            return b3.SUCCESS
+
+        return b3.RUNNING