Algorithms for Walking, Running, Swimming, Flying, and Manipulation

© Russ Tedrake, 2024

Last modified .

How to cite these notes, use annotations, and give feedback.

**Note:** These are working notes used for a course being taught
at MIT. They will be updated throughout the Spring 2024 semester. Lecture videos are available on YouTube.

Previous Chapter | Table of contents | Next Chapter |

This chapter is intended to provide a collection of tips and formulations that can make seemingly non-smooth constraints smooth, seemingly non-convex constraints convex, etc. (It's very much a work in progress...)

Imagine an ellipsoid centered at the origin: $E = \{x | x^T S x \leq
1\}$ with $S=S^T\succ0$. The volume of this ellipse is proportional to
$\left(\det S^{-1} \right)^\frac{1}{2}$. We know that $\log\det(S)$ is a
concave function in the elements of $S$

maximizing volume.

minimizing volume.

volume of a semi-algebraic set. (via a contained ellipsoid)

- "Convex Optimization", Cambridge University Press , 2004. ,

Previous Chapter | Table of contents | Next Chapter |