Path Following for a Target Point Attached to a Unicycle Type Vehicle
نویسندگان
چکیده
منابع مشابه
Vehicle path following using a target point attached to a unicycle type vehicle
In this article, we have addressed the control problem of unicycle path following, using a rigidly attached target point. The initial path following problem has been transformed into a reference trajectory following problem, using saturated control laws and a geometric characterization hypothesis. This hypothesis links the curvature of the path to be followed with the target point. The proposed...
متن کاملPath following for a target point attached to a unicycle type vehicle
In this article, we address the control problem of unicycle path following, using a rigidly attached target point. The initial path following problem has been transformed into a reference trajectory following problem, using saturated control laws and a geometric characterization hypothesis, which links the curvature of the path to be followed with the target point. The proposed controller allow...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملOnline Approximate Optimal Path-Following for a Kinematic Unicycle
Online approximation of an infinite horizon optimal path-following strategy for a kinematic unicycle is considered. The solution to the optimal control problem is approximated using an approximate dynamic programming technique that uses concurrent-learning-based adaptive update laws to estimate the unknown value function. The developed controller overcomes challenges with the approximation of t...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Applicandae Mathematicae
سال: 2012
ISSN: 0167-8019,1572-9036
DOI: 10.1007/s10440-012-9672-8