Blog

[True or False] After the resampling wheel algorithm makes one full rotation around the wheel, every particle has been given a chance to be selected.

Using the A* Algorithm, what is the order of expanded nodes to find the optimal path from Node A to the Goal?   Line weights are cost between nodes, and the heuristic on right is estimated cost from node to goal.

Assume a Gaussian distribution is used to calculate importance weights in a particle filter.  Currently, particle A has the highest importance weight.  Which particle will have the highest importance weight if both mu and sigma are increased by 50%?

In a situation where a robot is navigating from a known starting location to a fixed ending position with no movement noise, the most computationally efficient path planning algorithm to use is:

Given y=[y].  What value of x makes the probability distribution in this grid world valid?

In a cyclic world, if the robot is at position 0 with the current prior belief: 0.85 0.1 0.025 0.025 0.0 If the robot attempts to move, there is a 0.95 probability it will do so successfully, and a 0.05 probability that it will fail to move.Calculate the probabilities of each of the positions if the robot keeps attempting to move to the right an infinite number of times: [cell0] [cell1] [cell2] [cell3] [cell4]

In the lecture, an example of smoothing algorithm is given as follows: Minimize -> (xi -yi)2 Minimize -> (yi – yi + 1)2 What do xi , yi , and yi + 1 represent?

Searching for an optimal path using dynamic programming differs from a search using A* in what ways? (Select ALL correct answers.)

The brand name for temazepam is:

MD5 can be manipulated by creating two identical hashes using two different messages, resulting in a collision. This is difficult (if impossible) to do with SHA-256. Why is this?