Statistical Shortest Path Problem Flashcards

1
Q

What is statistical shortest path?

A

It uses mean and variance to capture model uncertainties

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What kind of statistical uncertainties does the this method cover? Examples

A

I.E process variation, temperature variation, voltage variation, trip planning

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the difference between previous path problems and statistical ones?

A

Previous methods do not account for model uncertainties and are deterministic. I.E link cost = li whereas in statistical method link cost = (mu, sigma^2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are assumptions made when modelling transportation road modelling? (2)

A
  • That each link delay is Gaussian distributed
  • Delays of each link are independent of other links
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How would we denote travel time for a path (pi) ?

A

t(pi) = N(mu(pi), sigma^2(pi))

mu = sum from first link to last link INath of mu-e
sigma^2 = sum from first link to last link IN path of sigma^2-e

N: normally distributed with following mean and s.d
e: link
mu-e : link mean
sigma^2-e : link variance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How to calculate expected cost of travelling when using path pi if cost is C(t) = t

A

Expected cost of pi = EC(pi) = integral from -infinity to +infinity of t*f(t) dt = mu(pi)

  • f(t) : delay pdf.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What happens to the expected cost of travelling when using path PI if the cost of the path increases sharpy?

A

It becomes very large:

Expected cost of pi = EC(pi) = integral from -infinity to +infinity of e^(kt)f(t) dt = e(kmu(pi) + (k*sigma^2pi)/2)

  • f(t) : delay pdf.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How could

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly