Skip to main content

Async behavior tree

Project description

Async Behaviour Tree for Python

Unix Build Status Coverage Status Codacy Badge Scrutinizer Code Quality PyPI Version PyPI License

Versions following Semantic Versioning

Overview

What's a behavior tree ?

Unlike a Finite State Machine, a Behaviour Tree is a tree of hierarchical nodes that controls the flow of decision and the execution of "tasks" or, as we will call them further, "Actions". -- behaviortree

If your new (or not) about behavior tree, you could spend some time on this few links:

Few implementation libraries:

  • task_behavior_engine A behavior tree based task engine written in Python
  • pi_trees a Python/ROS library for implementing Behavior Trees
  • pr_behavior_tree A simple python behavior tree library based on coroutines
  • btsk Behavior Tree Starter Kit
  • behave A behavior tree implementation in Python

Why another library so ?

SIMPLICITY

When you study behavior tree implementation, reactive node, dynamic change, runtime execution, etc ... At a moment you're build more or less something that mimic an evaluator 'eval/apply' or a compilator, with a complex hierachical set of class. All complexity came with internal state management, using tree of blackboard to avoid global variable, multithreading issue, maybe few callback etc ... This break the simplicity and beauty of your initial design.

What I find usefull with behavior tree:

  • clarity of expression
  • node tree representation
  • possibility to reuse behavior
  • add external measure to dynamicaly change a behavior, a first step on observable pattern...

As I've used OOP for years (very long time), I will try to avoid class tree and prefer using the power of functionnal programming to obtain what I want: add metadata on a sematic construction, deal with closure, use function in parameters or in return value...

And a last reason, more personal, it that i would explore python expressivity.

SO HOW ?

In this module, I purpose you to use the concept of coroutines, and their mecanisms to manage the execution flow. By this way:

  • we reuse simple language idiom to manage state, parameter, etc
  • no design constraint on action implementation
  • most of language build block could be reused

You could build expression like this:

async def a_func():
    """A great function"""
    return "a"

async def b_decorator(child_value, other=""):
    """A great decorator..."""
    return f"b{child_value}{other}"

assert run(decorate(a_func, b_decorator)) == "ba"

This expression apply b_decorator on function a_func. Note that decorate(a_func, b_decorator) is not an async function, only action, or condition are async function.

Few guidelines of this implementation:

  • In order to mimic all NodeStatus (success, failure, running), I replace this by truthy/falsy meaning of evaluation value. A special dedicated exception decorate standard exception in order to give them a Falsy meaning.
  • Blackboard pattern, act as a manager of context variable for behavior tree. With python 3, please... simply use contextvars !
  • In order to be able to build a sematic tree, I've introduce a metadata tuple added on function implementation.

The rest is just implementation details..

A little note:

You should not use this until you're ready to think about what you're doing :)

Note about 'async' framework

As we use async function as underlaying mechanism to manage the execution flow, the standard library asyncio is pretty fine. But, (always a but somewhere isn't it...), you should read this [amazing blog post}(https://vorpus.org/blog/some-thoughts-on-asynchronous-api-design-in-a-post-asyncawait-world/) by Nathaniel J. Smith. And next study curio framework in deep.

As curio say:

Don't Use Curio if You're Allergic to Curio

Personaly, after few time of testing and reading curio code, I'm pretty addict.

Installation

Install this library directly into an activated virtual environment:

$ pip install async-btree

or add it to your Poetry project:

$ poetry add async-btree

Usage

After installation, the package can imported:

$ python
>>> import async_btree
>>> async_btree.__version__

See documentation.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

async_btree-1.0.1.tar.gz (14.9 kB view details)

Uploaded Source

Built Distribution

async_btree-1.0.1-py3-none-any.whl (13.5 kB view details)

Uploaded Python 3

File details

Details for the file async_btree-1.0.1.tar.gz.

File metadata

  • Download URL: async_btree-1.0.1.tar.gz
  • Upload date:
  • Size: 14.9 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: poetry/1.0.2 CPython/3.7.3 Darwin/17.7.0

File hashes

Hashes for async_btree-1.0.1.tar.gz
Algorithm Hash digest
SHA256 5b14741ebd60384e98291796826a319391332fdb47274ded37911cd44e2b819f
MD5 cbfc25e6dabd684a46ab96fc91ddfe66
BLAKE2b-256 721b60b8ce9b4bb72ddbe2fbcfe0a7e3ec139170548218130f27f96c8afe05e9

See more details on using hashes here.

File details

Details for the file async_btree-1.0.1-py3-none-any.whl.

File metadata

  • Download URL: async_btree-1.0.1-py3-none-any.whl
  • Upload date:
  • Size: 13.5 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: poetry/1.0.2 CPython/3.7.3 Darwin/17.7.0

File hashes

Hashes for async_btree-1.0.1-py3-none-any.whl
Algorithm Hash digest
SHA256 587e39e1f44ed9a3197eb5007a5d1fa42ce1b3a80986dc20604c58100149bda8
MD5 feefe23d2b14aa60c9c965769752c6fa
BLAKE2b-256 a662c5ba593aaf87449e5237410a7028a07268b995c8e8147898c66de175c593

See more details on using hashes here.

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page