Back to search

NJIT

A successive approximation algorithm to solve motion planning problems

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical and Computer Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chang, Cheng-Ming
Contributors dc:contributor
  • MengChu Zhou
  • Marshall Chuan Yung Kuo
  • Yun Q. Shi

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/1733

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chang, Cheng-Ming. A successive approximation algorithm to solve motion planning problems. https://digitalcommons.njit.edu/theses/1733