Scalability of Theo
There are two scalability problems: first, complexity of actions and world
states can increase the search space combinatorially; second, as the number of
reactive rules grows, performance due to matching decreases
(this is an example of the
Utility Problem).
The former issue is handled with explanation-based learning, which adds
control knowledge to constrain the search time, somewhat alleviating the
Utility Problem. The latter question still lingers above all
architectures.
To return, press HOME.
To go to the next document, press NEXT.