Volume 16, Issue 8 (10-2016)                   Modares Mechanical Engineering 2016, 16(8): 29-36 | Back to browse issues page

XML Persian Abstract Print


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

Mashhadi B, Vesal M A. Moving obstacle detection algorithm using cell decomposition method. Modares Mechanical Engineering 2016; 16 (8) :29-36
URL: http://mme.modares.ac.ir/article-15-2211-en.html
Abstract:   (7750 Views)
In this paper, the algorithm to detect obstacles surrounding an autonomous vehicle and the method to navigate this vehicle on the road are studied. For this purpose, the road is divided into cells in lateral and longitudinal directions. The assumption is that some special tools specify the cells positions and then full and empty-cell corresponding matrix is generated. In this matrix, full cells are displayed with digit 1 and empty cells are displayed with digit 0. In the next step, by analyzing the matrix in Matlab, the vehicle is navigated. In this analysis, firstly the position of the vehicle and the obstacles are identified. Then, based on the road conditions and the obstacles positions, required orders to move the vehicle are determined. If a lane change is needed, according to the road’s curvature and the distance between the vehicle and the obstacle, appropriate path for the vehicle will be chosen. In this paper, for the first time in autonomous vehicle navigations, the road is considered as a 1 and 0 matrix. In this method, the road matrix gets updated with time and provides the possibility of analyzing the vehicle’s movement. Also, the algorithm used to solve the problem is very simple.
Full-Text [PDF 643 kb]   (5403 Downloads)    

Received: 2016/04/17 | Accepted: 2016/07/4 | Published: 2016/08/14

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

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.