Document Type


Date of Award


Degree Name

Master of Science in Electrical Engineering - (M.S.)


Electrical and Computer Engineering

First Advisor

MengChu Zhou

Second Advisor

Marshall Chuan Yung Kuo

Third Advisor

Yun Q. Shi


A successive approximation algorithm is presented to solve motion planning problems and optimal control problems. A motion planning problem is included in an optimal control problem and due to the heavily nonlinear and coulped differential equations describing the dynamics of the manipulator and several constraints imposed on the system, few efficient methods exist to solve this kind of problems.

The successive approximation algorithm can decompose the global nonlinear problem into several nonlinear subproblems and each subproblem is solved by the nonlinear programming method with a highly convergent rate. Because the limited constraints and variables are included in each subproblem and only the trajectory and control sequence are needed to be stored in each iteration, the algorithm can be very easily implemented on the motion planning problems.

The convergence and optimality of the algorithm are also discussed and the implementations on motion planning problems and optimal control problems are presented with excellent results. The computational results show its promise for future applications.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.