NONSMOOTH ANALYSIS, CONVEX ANALYSIS, AND THEIR APPLICATIONS TO MOTION PLANNING

Abstract

Nonsmooth analysis of a broad class of functions taking the form F(x)= min ifi(x), where each fi is a convex function. One element of this class of functions is the distance function, which measures the distance between a point and the nearest point on the nearest obstacle. Many motion planning algorithms are based on the distance function, and thus rigorous analysis of the distance function can provide a better understanding of how to implement traditional motion planning algorithms. Finally, this paper enumerates some useful results in convex analysis.