@@ -8,7 +8,7 @@ The __leaves__ of the tree are the actual commands, i.e. the place where
88our coordinating component interacts with the rest of the system.
99
1010For instance, in a service-oriented architecture, the leaves would contain
11- the "client" code that communicate with the "server" that performs the
11+ the "client" code that communicates with the "server" that performs the
1212operation.
1313
1414In the following example, we can see two Actions executed in a sequence,
@@ -19,7 +19,7 @@ In the following example, we can see two Actions executed in a sequence,
1919The other nodes of the tree, those which are __ not leaves__ , control the
2020"flow of execution".
2121
22- To better understand how this control flow takes place , imagine a signal
22+ To better understand how this control flow takes place, imagine a signal
2323called "__ tick__ "; it is executed at the __ root__ of the tree and it propagates
2424through the branches until it reaches one or multiple leaves.
2525
@@ -51,10 +51,10 @@ which child should be ticked next or may return a result to its own parent.
5151__ ControlNodes__ are nodes which can have 1 to N children. Once a tick
5252is received, this tick may be propagated to one or more of the children.
5353
54- __ DecoratorNodes__ is similar to the ControlNode, but it can have only a single child.
54+ __ DecoratorNodes__ are similar to the ControlNode, but can only have a single child.
5555
5656__ ActionNodes__ are leaves and do not have any children. The user should
57- implement their own ActionNodes to perform the actual task .
57+ implement their own ActionNodes to perform the actual tasks .
5858
5959__ ConditionNodes__ are equivalent to ActionNodes, but
6060they are always atomic and synchronous, i.e. they must not return RUNNING.
@@ -65,7 +65,7 @@ They should not alter the state of the system.
6565
6666## Examples
6767
68- To better understand how a BehaviorTrees work, let's focus on some practical
68+ To better understand how BehaviorTrees work, let's focus on some practical
6969examples. For the sake of simplicity we will not take into account what happens
7070when an action returns RUNNING.
7171
@@ -108,7 +108,7 @@ You can extend your grammar creating your own Decorators.
108108![ Simple Decorator: Enter Room] ( images/DecoratorEnterRoom.png )
109109
110110The node __ Inverter__ is a Decorator that inverts
111- the result returned by its child; Inverter followed by the node called
111+ the result returned by its child; An Inverter followed by the node called
112112__ DoorOpen__ is therefore equivalent to
113113
114114 "Is the door closed?".
@@ -133,9 +133,9 @@ But...
133133
134134### Second ControlNode: Fallback
135135
136- [ FallbackNodes] ( FallbackNode.md ) , known also as __ "Selector "__ ,
136+ [ FallbackNodes] ( FallbackNode.md ) , known also as __ "Selectors "__ ,
137137are nodes that can express, as the name suggests, fallback strategies,
138- ie . what to do next if a child returns FAILURE.
138+ i.e . what to do next if a child returns FAILURE.
139139
140140It ticks the children in order and:
141141
@@ -144,7 +144,7 @@ It ticks the children in order and:
144144 Fallback returns SUCCESS.
145145- If all the children return FAILURE, then the Fallback returns FAILURE too.
146146
147- In the next example, you can see how Sequence and Fallbacks can be combined:
147+ In the next example, you can see how Sequences and Fallbacks can be combined:
148148
149149![ FallbackNodes] ( images/FallbackBasic.png )
150150
0 commit comments