Iterative Methods for Efficient Sampling-Based Optimal Motion Planning of Nonlinear Systems

نویسندگان

  • Jung-Su Ha
  • Han-Lim Choi
  • Jeong Hwan Jeon
چکیده

This paper extends the RRT* algorithm, a recentlydeveloped but widely-used sampling-based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often leads to difficulties in choosing appropriate distance metric and in computing optimized trajectory segments in tree construction. To tackle these two difficulties, this work adopts the affine quadratic regulator-based pseudo metric as the distance measure and utilizes iterative two-point boundary value problem solvers for computing the optimized segments. The proposed extension then preserves the inherent asymptotic optimality of the RRT* framework, while efficiently handling a variety of kinodynamic constraints. Three numerical case studies validate the applicability of the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Importance sampling-based approximate optimal planning and control

In this paper, we propose a sampling-based planning and optimal control method of nonlinear systems under non-differentiable constraints. Motivated by developing scalable planning algorithms, we consider the optimal motion plan to be a feedback controller that can be approximated by a weighted sum of given bases. Given this approximate optimal control formulation, our main contribution is to in...

متن کامل

New adaptive interpolation schemes for efficient meshbased motion estimation

Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...

متن کامل

Sampling-Based Motion Planning Algorithms for Dynamical Systems

Dynamical systems bring further challenges to the problem of motion planning, by additionally complicating the computation of collision-free paths with collision-free dynamic motions. This dissertation proposes efficient approaches for the optimal sampling-based motion planning algorithms, with a strong emphasis on the accommodation of realistic dynamical systems as the subject of motion planni...

متن کامل

Improved Heuristic Search for Sparse Motion Planning Data Structures

Sampling-based methods provide efficient, flexible solutions for motion planning, even for complex, highdimensional systems. Asymptotically optimal planners ensure convergence to the optimal solution, but produce dense structures. This work shows how to extend sparse methods achieving asymptotic near-optimality using multiple-goal heuristic search during graph constuction. The resulting method ...

متن کامل

Dynamical ‎C‎ontrol of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear ‎Equations

One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1603.04112  شماره 

صفحات  -

تاریخ انتشار 2016