Skip to content

Commit e2c0fb4

Browse files
authored
Merge pull request #53 from KIT-MRT/improve_comparison_to_behavior_trees
Improve comparison to behavior trees a bit further
2 parents fff46df + 27b5961 commit e2c0fb4

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

content/03_fundamentals.tex

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -65,22 +65,22 @@ \subsection{Decision-Making}
6565
\textbf{Comparing Arbitration graphs to BTs}, both appear similar at first glance, but differ in several key aspects:
6666

6767
% Return Type/Interfaces
68-
\gls{BT} nodes return execution status, while arbitration graphs return commands.
68+
\gls{BT} nodes return execution status, while behavior components in arbitration graphs return commands.
6969
%% note: we talk about the AG behavior components, but "arbitration graph behavior components" is a bit lengthy…
7070
%
7171
% While the former adds more flexibility to each nodes actuator-facing interfaces,
72-
While the former adds more flexibility to each nodes actuator interfaces,
72+
While the former adds more flexibility to each node's actuator interfaces,
7373
%
7474
% the latter focuses on a consistent control theory motivated interface $f(\situation) \to \command$.
7575
% the latter focuses on a control theory motivated and verifiable interface $f(\situation) \to \command$.
76-
the latter focuses on a control theory motivated interface $f(\situation) \to \command$ % with verifiable~$\command$.
77-
allowing the command to be verified before executing it in a down-stream module.
76+
the latter focuses on a control theory motivated interface ${f(\situation) \to \command}$ % with verifiable~$\command$.
77+
allowing the command to be verified by each arbitrator before executing it in a down-stream module.
7878

7979
% Preconditions
80-
In \glspl{BT}, preconditions are realized by condition nodes distributed throughout the tree.
80+
In \glspl{BT}, preconditions are implemented by condition nodes distributed throughout the tree.
8181
%
8282
% In contrast, arbitration graphs couple a behavior component with its preconditions.
83-
In contrast, arbitration graphs require behavior components to implement their own preconditions.
83+
In contrast, arbitration graphs require behavior components to define their own preconditions.
8484
%
8585
% This tight coupling ensures that robustness and safety are less dependent on node arrangement.
8686
% This tight coupling is a foundation for robustness and safety being independent of node arrangement.

0 commit comments

Comments
 (0)