RSS 2020, Early Career Award Keynote + Q&A: Luca Carlone - YouTube
Key Idea
Convert a non-convex, hard problem into a convex problem that can be optimized
in polynomial time. See TEASER++.
Convert a non-convex, hard problem into a convex problem that can be optimized
in polynomial time. See TEASER++.