Because finding the shortest path is overrated (and not NP-Hard).

This is the fourth post in a series of posts describing an approach to doing path-planning in real-time... Read more →

Category: auvsi-competition

This is the third post in a series of posts describing an approach to doing path-planning in real-time... Read more →

Category: auvsi-competition

For a class that's currently being written (*ahem*, EE104), Prof. Boyd posed an interesting...
Read more →

Category: optimization-methods

This is the second post in a series of posts describing an initial approach to doing path-planning in... Read more →

Category: auvsi-competition

I usually see path planning in some shape or form usually solved as a Bellman update, Dynamic... Read more →

Category: auvsi-competition

Least squares is one of those things that seems relatively simple once you first look at it (perhaps... Read more →

Category: least-squares

I want to say this is a folk theorem (borrowing terminology from game theory) in that everyone who does... Read more →

Category: least-squares

(Maybe.)

Category: random