Volume 14, Issue 4 (JIAEEE Vol.14 No.4 2018)                   Journal of Iranian Association of Electrical and Electronics Engineers 2018, 14(4): 79-88 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Ahmadi Mousavi M, Moshiri B, Heshmati Z. Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization. Journal of Iranian Association of Electrical and Electronics Engineers. 2018; 14 (4) :79-88
URL: http://jiaeee.com/article-1-463-en.html
Abstract:   (1066 Views)
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.
Full-Text [PDF 456 kb]   (451 Downloads)    
Type of Article: Research | Subject: Control
Received: 2017/11/28 | Accepted: 2017/11/28 | Published: 2017/11/28

Add your comments about this article : Your username or Email:

Send email to the article author

© 2018 All Rights Reserved | Journal of Iranian Association of Electrical and Electronics Engineers

Designed & Developed by : Yektaweb