Skip to content
This repository has been archived by the owner on Oct 31, 2024. It is now read-only.

Commit

Permalink
Merge pull request #1 from facontidavide/facontidavide-patch-1
Browse files Browse the repository at this point in the history
fix some typos
  • Loading branch information
ct2034 authored Feb 6, 2024
2 parents 65e9a91 + 5b6d645 commit 3f9c8e6
Showing 1 changed file with 17 additions and 17 deletions.
34 changes: 17 additions & 17 deletions rep-2018.rst
Original file line number Diff line number Diff line change
Expand Up @@ -21,18 +21,18 @@ following:

- The execution starts by ticking the root node;

- Control flow nodes activates when ticked and can propagate the tick
- Control flow nodes activate when ticked and can propagate the tick
to their children;

- Execution nodes activates when ticked and respond *Success*,
- Execution nodes activate when ticked and respond *Success*,
*Failure*, or *Running*;

- Control flow nodes receives responses from their children and decide
- Control flow nodes receive responses from their children and decide
what to respond to their parents;

- Finally, a response reach the root node, terminating the execution.
- Finally, a response reaches the root node, terminating the execution.

Moreover, unlike behavior trees as used in, e.g., videogame developement,
Moreover, unlike behavior trees as used in, e.g., videogame development,
behavior trees in robotics need to handle concurrency.
For this reason, we need to introduce a *halt* signal to interrupt
the executions of conflicting concurrent actions.
Expand Down Expand Up @@ -102,7 +102,7 @@ We have the following types of control flow nodes:
- *Parallel*

Beware that the nomenclature in the literature is inconsistent and might
not correspond to the one defined in this document. In we present a
not correspond to the one defined in this document. We present a
nomenclature comparison between this document,
[colledanchise2018]_, and [behavior_tree_cpp]_.

Expand Down Expand Up @@ -137,7 +137,7 @@ either Failure or Running, then it returns Failure or Running
accordingly to its own parent. It returns Success if and only if all its
children return Success. Note that when a child returns Running or
Failure, the Reactive Sequence node does not route the ticks to the next
child (if any). The symbol of the the Reactive Sequence node is a box
child (if any). The symbol of the Reactive Sequence node is a box
containing the label “:math:`\rightarrow`”, shown below.

.. image:: rep-2018/react-sequence.png
Expand Down Expand Up @@ -202,7 +202,7 @@ accordingly to its own parent. Moreover, if a node returns Running, the
successive execution will restart from the same node. It returns Success
if and only if all its children return Success. Note that when a child
returns Running or Failure, the Sequence with Memory node does not route
the ticks to the next child (if any). The symbol of the the Sequence
the ticks to the next child (if any). The symbol of the Sequence
with Memory node is a box containing the label “:math:`\rightarrow^*`”
as shown below.

Expand All @@ -225,8 +225,8 @@ accordingly to its own parent. Moreover, if a node returns Running, the
successive execution will restart from the same node. It returns Failure
if and only if all its children return Failure. Note that when a child
returns Running or Success, the Fallback with Memory node does not route
the ticks to the next child (if any). The symbol of the the Fallback
with Memory node is a box containing the label “:math:`?^*`” as shown in
the ticks to the next child (if any). The symbol of the Fallback
with Memory node is a box containing the label “:math:`?^*`” as shown
below.

.. image:: rep-2018/fallback-memory.png
Expand All @@ -245,12 +245,12 @@ below.
return response
return Failure

The *(Reactive) Parallel* node with success treshold :math:`k`
The *(Reactive) Parallel* node with success threshold :math:`k`
executes (with :math:`k \leq n`), which corresponds to
routing the ticks to all its children and it returns Success if at lease
routing the ticks to all its children and it returns Success if at least
:math:`k` children return Success, it returns Failure if at least
:math:`n - k + 1` children return Failure, and it returns Running otherwise. The
symbol of the the Parallel Sequence node with success treshold :math:`k`
symbol of the Parallel Sequence node with success threshold :math:`k`
is a box containing the label
:math:`\rightrightarrows^{k}`”, shown below.

Expand All @@ -277,13 +277,13 @@ is a box containing the label
return Running
.. Do we want this too?
.. The *Parallel with Memory* node with success treshold :math:`k` and failure treshold
.. The *Parallel with Memory* node with success threshold :math:`k` and failure threshold
.. :math:`h` executes (with :math:`k+h-1 \leq n`), which corresponds to
.. routing the ticks to all its running children and it returns Success if at lease
.. routing the ticks to all its running children and it returns Success if at least
.. :math:`k` children return Success, it returns Failure if at least
.. :math:`h` children return Failure, and it returns Running otherwise. The
.. symbol of the the Parallel Sequence node with success treshold :math:`k`
.. and failure treshold :math:`h` is a box containing the label
.. symbol of the Parallel Sequence node with success threshold :math:`k`
.. and failure threshold :math:`h` is a box containing the label
.. “:math:`\rightrightarrows^{k}_{h}`”, shown below.
.. successCount ← 0
Expand Down

0 comments on commit 3f9c8e6

Please sign in to comment.