Open In Colab

2.1. Modeling the World State#

The physical properties of a piece of trash comprise all of the information needed by the robot.

Splash image with robot approaching a trash bin

For our simple trash sorting robot, the only thing that matters at a given moment is the category of the item of trash on the conveyor belt. Remember that items of trash are presented individually to the robot, so there is no clutter, and no circumstance in which multiple pieces of trash are simultaneously in the workspace. Therefore, it is natural to define the world state explicitly in terms of the category of the current item of trash.

We consider five possible categories:

  • cardboard

  • paper

  • cans

  • scrap metal

  • bottle

For simplicity, we assume here that there will never be a piece of trash that does not belong to one of these categories. We do not, however, assume that the category of an item can be reliably determined with 100% accuracy. Instead, we use probability theory to quantify the uncertainty associated to an object’s categorization.

2.1.1. Using Probability to Model Uncertainty#

Probability theory provides a rigorous methodology for reasoning about uncertainty.

We will use probability theory to model uncertainty. While a comprehensive coverage of probability theory is beyond the scope of this book, we introduce key concepts and methods throughout the text, as needed, to deal with various kinds of uncertainty that occur in robotics applications. Rigorous introductions can be found in many textbooks, including Probability for Data Science (which is available online).

The starting point for reasoning with uncertainty is to define the set of outcomes that might occur. This set of all possible outcomes is called the sample space, often denoted by \(\Omega.\) In our example, when an item of trash arrives on the conveyor belt, there are five possible outcomes,

\(\Omega = \{ \rm{cardboard, paper, cans, scrap \; metal, bottle}\}.\)

2.1.2. Probability Distributions#

Subsets of \(\Omega\) are called events. A probability distribution, \(P\), assigns a probability \(0 \leq P(A) \leq 1\) to each event \(A \subseteq \Omega\), with \(P(\emptyset) = 0\) and \(P(\Omega)=1\). In addition, for disjoint events, \(A_i \cap A_j = \emptyset\), we have \(P(A_i \cup A_j) = P(A_i) + P(A_j)\). Using this property, it is a simple matter to compute the probability for any \(A \subseteq \Omega\) if we are provided with the probabilities of the individual outcomes. Further, since \(P(\Omega)=1\), it follows immediately that

\[P(\Omega) = \sum_{\omega \in \Omega} P(\{\omega\}) = 1\]

i.e., that the probabilities of the individual outcomes sum to unity. As a slight abuse of notation, for singleton events, we will often write \(P(\omega)\) rather than \(P(\{\omega\})\) to simplify notation.

In robotics applications, the probability assigned to an outcome reflects our certainty in that outcome. These probabilities can change based on the arrival of new evidence. In robotics, this can occur when the robot acts in the world, or based on sensor data. How evidence affects the propagation of probability values is a recurring topic in this book.

2.1.3. Prior Probability Distributions#

A prior that describes our beliefs before any sensor data is obtained.

Once we have enumerated the set of possible outcomes, we confront a fundamental question: Where do the probability values come from? In this section we explicitly consider the notion of prior knowledge that is available in a particular application. High-quality “priors” can make a big difference in performance, especially when measurements are few or unreliable.

In some cases, we merely assume that all outcomes are equally likely, for example, when rolling a die or tossing coin. In such cases, the probability of any outcome is merely \(P(\omega) = 1/N\) for each \(\omega \in \Omega\), where \(N =| \Omega |\). This leads to \(P(\mathrm{heads}) = P(\mathrm{tails}) = 0.5\) when tossing a fair coin, where \(\Omega = \{ \mathrm{heads, tails} \}\).

In other cases, we can estimate probabilities using data. Suppose, for example, that the owner of the trash-sorting facility has told us (or we have kept statistics over time) that for every 1000 pieces of trash, the observed category counts are approximately as follows:

  • cardboard: 200

  • paper: 300

  • cans: 250

  • scrap metal: 200

  • bottle: 50

It is common to assume that outcomes occur in proportion to their probability (there are a number of technical conditions that underlie this assumption, such as the condition that outcomes are independent, but we will not address these here). Thus, from the above observed frequencies, we might estimate that the probability of seeing a piece of cardboard in the work cell is given by

\[P(\mathrm{cardboard}) \approx 200/1000 = 0.2\]

Using the same logic, we can do the same for all categories, yielding:

Category (C)

P(C)

cardboard

0.20

paper

0.30

can

0.25

scrap metal

0.20

bottle

0.05

We call this type of probabilistic knowledge about the state of the world, in the absence of any other information, a prior, because it represents our belief before any evidence (e.g., sensor data) has been acquired.

2.1.4. Probability Distributions in Python#

We represent probability distributions using the DiscreteDistribution class in GTSAM.

The GTSAM toolbox (GTSAM stands for “Georgia Tech Smoothing and Mapping”) toolbox is a BSD-licensed C++ library based on factor graphs, first developed at the Georgia Institute of Technology. It provides state of the art solutions to important problems in robotics, such as the Simultaneous Localization and Mapping (SLAM) and Structure from Motion (SfM) problems, but can also be used to model and solve both simpler and more complex estimation problems. More information is available at http://gtsam.org.

GTSAM also provides both a MATLAB and a python interface, enabling rapid prototype development, visualization, and user interaction. The python library can be imported directly into a Google colab via “import gtsam”. A large subset of the GTSAM functionality can be accessed through wrapped classes from within python. To not interrupt the flow of the book too much we do not always fully explain the code throughout the text, but rather include a “GTSAM 101” sub-section at the end that elaborates on the types and functions we used.

The code below illustrates the use of GTSAM. First we create a Variables data structure that will be used to obtain more informative output from other code below:

VARIABLES = Variables()
categories = ["cardboard", "paper", "can", "scrap metal", "bottle"]
Category = VARIABLES.discrete("Category", categories)

Conceptually, the Variables class keeps track of the names of variables and what values each variable can take on. For example in the above, we need the variable Category, and it can take on the values cardboard, paper, can, scrap metal, and bottle. We do this so that later when we print, it can show us a nicely rendered outputs.

We can now create a prior probability \(P(Category)\) on the category using a DiscreteDistribution constructor:

category_prior = gtsam.DiscreteDistribution(Category, "200/300/250/200/50")

The constructor automatically normalizes the numbers given to it to a proper probability distribution, i.e., it makes the probabilities sum to one. It is rendered in notebook as a table below, where we can verify this:

pretty(category_prior)

P(Category):

Categoryvalue
cardboard0.2
paper0.3
can0.25
scrap metal0.2
bottle0.05

We can evaluate the prior for any category value, e.g., “can”, but that function does take integer indices, not srings. Hence, we use the built-in python function index to obtain that integer (2 in this case):

index = categories.index('can')  # we still have to use an integer value
P_can = category_prior(index)
print(f"P('can') = {P_can}")
P('can') = 0.25

We can also recover all values in the probability distribution at once, using the pmf method:

PMF = category_prior.pmf()
PMF
[0.2, 0.3, 0.25, 0.2, 0.05]

Here “pmf” is short for “probability mass function”, which we define more precisely in Section 2.2. Note that the ordering of the array was fixed when we defined categories above. It is your responsibility to maintain consistency when using arrays to store values associated to a collection of variables.

We can display probability distributions in various ways, including as a bar graph, as shown below.

#| caption: A discrete probability distribution as a bar graph.
#| label: fig:discrete-distribution
px.bar(y=PMF, x=categories)
_images/63fb2c2c5568cefc3f102d932d7997ae06c90e1a33af3e5578ae549f0c8ec255.png

2.1.5. Simulation by Sampling#

We can simulate our trash sorting cell by sampling from the prior.

Suppose we wish to simulate our trash sorting system such that the behavior of the simulation matches, in some statistical sense, the behavior of the actual system. In our case, this amounts to generating samples from the probability distribution on trash categories. In particular, we would like to generate a sequence of categories, \(\omega_1, \omega_2, \dots, \omega_n\) such that \(\omega_i = \mathrm{cardboard}\) approximately 25% of the time, \(\omega_i = \mathrm{paper}\) approximately 20% of the time, etc. How can we write a computer program to do this?

While most programming libraries do not include functions to generate samples from an arbitrary distribution, almost all include a random number generator that will generate a random number from the unit interval. We denote by \(U(a,b)\) the uniform probability distribution on the interval \([a,b]\). In numpy, the function np.random.rand() generates a sample \(x \sim U(0,1)\). How can we use this result to generate a sample from an arbitrary probability distribution?

2.1.5.1. Cumulative Distribution Function#

We begin by introducing the Cumulative Distribution Function (CDF) for a random variable \(X\). We will more carefully introduce the notion of a discrete random variable in Section 2.2, but for now it is sufficient to know that a discrete random variable takes a value from a countable set, each of which is assigned a probability value. For a random variable \(X\), the CDF for \(X\) is denoted by \(F_X\), and is defined as

\[ F_X(\alpha) = P(X \leq \alpha) \]

It follows immediately that \(0 \leq F_X(\alpha) \leq 1\), since \(F_X(\alpha)\) is itself a probability. In the case of discrete random variables, say \(X \in \{ x_0, \dots x_{n-1}\}\), we can compute the CDF \(F_X(\alpha)\) by summing the probabilities assigned to all \(x_i \leq \alpha\)

\[ F_X(\alpha) = \sum_{x_i \leq \alpha} P(x_i) = \sum_{i=0}^{k-1} P(x_i) \]

in which the rightmost summation follows if we choose \(k\) such that \(x_{k-1} \leq \alpha < x_k\). The terminology Cumulative Distribution Function is due to the fact that \(F_X(\alpha)\) is the accumulated probability assigned to all outcomes less than or equal to \(\alpha\), which is apparent in these summation expressions.

But what does this have to do with generating samples from our distribution on categories? The idea is simple: we can generate \(x\sim U(0,1)\), and a CDF takes on values in the interval \([0,1]\). For a discrete random variable \(X \in \{ x_0, \dots x_{n-1}\}\) the probability that our sample \(x\) corresponds to category \(k\) is exactly equal to \(F_X(x_k) - F_X(x_{k-1})\), and we define \(F_X(x_k)=0\) for \(k < 0\).

To see this, we impose an ordering on our categories,

  • \(c_0 = \mathrm{cardboard}\)

  • \(c_1 = \mathrm{paper}\)

  • \(c_2 = \mathrm{can}\)

  • \(c_3 = \mathrm{scrap \; metal}\)

  • \(c_4 = \mathrm{bottle}\)

and we define the random variable \(X \in \{ 0,1,2,3,4\}\) to be the index of the chosen category. The CDF for \(X\) is given by:

\(k\)

\(x_k\)

\(F_X\)(\(x_k\))

0

cardboard

0.20

1

paper

0.50

2

can

0.75

3

scrap metal

0.95

4

bottle

1.00

2.1.5.2. Example#

Some numpy code to generate the CDF:

CDF = np.cumsum(PMF)
print(CDF)
[0.2  0.5  0.75 0.95 1.  ]

Now, suppose we generate a random sample \(x \sim U(0,1)\), and use this \(x\) to choose category \(k\) such that \(F_X(x_{k-1}) < x \leq F_X(x_k)\). For example, we choose category 4 if \(0.95 < x \leq 1.0\). In this case, what is the probability of choosing category 4? The answer follows from the fact that, for the uniform distribution on the unit interval, \(P(X \in [a,b]) = b-a\). Therefore, the probability that our sample lies in the interval \([0.95,1.0]\) is \(0.05\), which happens to be exactly the prior probability assigned to category 4! Likewise, if our sample \(x\) satisfies \(0.2 < x \leq 0.5\), we choose category 1, and the probability that our sample lies in the interval \([0.2,0.5]\) is \(0.3\), which is, as expected, exactly the prior probability assigned to category 1.

The code to accomplish sampling is:

def sample():
    u = np.random.rand()
    for category in range(5):
        if u<float(CDF[category]):
            return category

If we simulate our system by generating a large number of samples, we expect that the frequencies of each category will approximate their prior probabilities. To see this, the code below generates a histogram for 1000 generated samples. While the histogram values do not exactly match the prior probabilities, we can see that the approximation is quite good.

Plotting this as a histogram:

#| caption: A histogram of samples from the discrete distribution.
#| label: fig:discrete-samples
px.histogram(x=[sample() for i in range(1000)])
_images/b33433991fd172b07ea2f25d136a4d40f8ca45a02712f5c31552f57361967984.png

Of course, GTSAM has all this machinery built-in:

#| caption: The same histogram produced by GTSAM's `DiscreteDistribution.sample` method.
#| label: fig:discrete-samples-gtsam
px.histogram(x=[category_prior.sample() for i in range(1000)])
_images/7bad8f0a41b4c99c5927d9679b378cc08d40a34bb3d5dd274439b596394f1a85.png

2.1.6. GTSAM 101#

The GTSAM concepts used in this section, explained.

Above we created an instance of the gtsam.DiscreteDistribution class. As with any GTSAM class, you can type

help(gtsam.DiscreteDistribution)

to get documentation on its constructors and methods. In particular, we called the constructor

 __init__(self: gtsam.DiscreteDistribution, key: Tuple[int, int], spec: str) -> None

which expects two arguments (besides self, which you can ignore):

  • key: Many GTSAM objects take a key to indicate which variable is involved. In the case of a DiscreteDistribution, the key is actually a tuple of ints:

    • the first int is a 64-bit identifier for the variable;

    • the second int is the cardinality of the variable.

  • spec: The DiscreteDistribution class specifies a PMF (remember: probability mass function) which is given as a string of numbers, separated by /.

Let’s look at an example below:

prior = gtsam.DiscreteDistribution((42, 3), "0.4/0.1/0.5")
prior

P(42):

42value
00.4
10.1
20.5

As you can see, this is a PMF on the variable with id \(42\), and it indeed has probabilities (that add up to one) for values 0..2. Internally, GTSAM actually represents a PMF as a small decision tree, which you can reveal using show:

#| caption: The decision tree representation for a discrete probability distribution.
#| label: fig:discrete-decision-tree
show(prior)
_images/a10d6b0c2e8de03e6b610f6813b6068073eecdebfdcb3e1c282ae0957f402805.svg

Of course, it would be much nicer if we could print out these PMFs in a more readable format, that shows us a name for each variable as well as a pretty name for each. This is where the Variables class comes to the rescue. We actually defined a global variable at the top of this notebook, like so:

VARIABLES = Variables()

which then allows us to give a name to a variable. It will also pick a unique ID for our variable. We can do this with the discrete method, which takes a name and a set of value names:

T = VARIABLES.discrete("TresCommas", ["one", "two", "three"])
print(f"key = {T}")
key = (1, 3)

As you can see, the id for the variable is 1 (Category, defined above, took id 0), and the cardinality was inferred to be three from the length of the list given as second argument.

The Variables class can tell us about any discrete variable so defined, using the two methods name and domain:

print(f"key = {T}, name = {VARIABLES.name(T)}, domain = {VARIABLES.domain(T)}")
key = (1, 3), name = TresCommas, domain = ['one', 'two', 'three']

Conceptually, the Variables class keeps track of the names of variables and what values each variable can take on. We do this so that later when we print, it can show us a beautiful outputs. Of course, this only works if we actually use the key returned to use by Variables.discrete. Let’s demonstrate this next:

prior_on_tres_commas = gtsam.DiscreteDistribution(T, "2/4/2")
pretty(prior_on_tres_commas)

P(TresCommas):

TresCommasvalue
one0.25
two0.5
three0.25

The above also illustrates once again that the spec string does not need to contain normalized probabilities. The constructor will do the normalization for us!

Note that the function pretty(*) above is just a shortcut for gtbook.discrete.pretty(*, VARIABLES), and is also defined alongside VARIABLES.

Finally, let us also look at the other DiscreteDistribution methods we called above:

  • sample(self: gtsam.DiscreteConditional) -> int: The sample method samples according to the PMF, returning the integer index of the sampled value, in \(0\dots cardinality-1\).

  • pmf(self: gtsam.DiscreteDistribution) -> List[float]: The pmf method will simply return all probability values, in order.

  • __call__(self: gtsam.DiscreteDistribution, arg0: int) -> float: The call operator: when given an integer value, will return just the one corresponding probability value.

We have illustrated the use of all of these in the text, already.

Finally, we can also inspect the VARIABLES, as it has an HTML representation:

VARIABLES
VariableDomain
Categorycardboard, paper, can, scrap metal, bottle
TresCommasone, two, three

The table shows that we have defined two variables so far, Category and TresCommas, with respectively six and three possible values, shown in the “Domain” column.