A Saddle Point Strategy for Path Planning

This thesis explores a new strategy for addressing the local minimum problem. As a prerequisite, a smooth potential function with a well-defined analytical gradient is devised. The availability of exact derivatives permits the use of more sophisticated optimization methods than those typically employed by potential planners. Through minor modifications to a trust-region Quasi-Newton algorithm, a procedure is obtained for locating saddle points as well as local minima.