Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation of the probabilistic distribution can be shown using an error ellipse for a constant collision probability. Analytical forms of error ellipses can be obtained by quadratic inequalities. These quadratic inequalities make the optimization problem nonconvex. Thus, these inequalities are relaxed by applying a linearization approach. Finally, the optimization problem is reformulated to a convex optimization problem. There are some strong algorithms for solving a convex optimization problem, so the consequent path planning method can be solved efficiently with considerable performance that will be obtained in the end of this paper.
Language:
Persian
Published:
Journal of Iranian Association of Electrical and Electronics Engineers, Volume:14 Issue: 4, 2018
Pages:
79 to 88
magiran.com/p1781867
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!