Paper
8 October 2015 K-means clustering-spiral searching model to solve the rough or accurate obstacle avoidance
Zhuo Yang, Yueda Jiang, Yue Miao, Hua Zhou
Author Affiliations +
Proceedings Volume 9675, AOPC 2015: Image Processing and Analysis; 96750T (2015) https://doi.org/10.1117/12.2197958
Event: Applied Optics and Photonics China (AOPC2015), 2015, Beijing, China
Abstract
Solving the problem of obstacle avoidance with K-means clustering analysis method is discussed in this paper. Firstly, applying the MATLAB to read digital elevation a few kilometers away from the lunar surface, and obtaining the elevation matrix of all points. Then the different heights of points into four grays for different shades are classified with K-means clustering analysis method. Finally, a safe landing area (coordinates, radius and velocity increment) is determined with clockwise spiral forward searching method starting from the landing center.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhuo Yang, Yueda Jiang, Yue Miao, and Hua Zhou "K-means clustering-spiral searching model to solve the rough or accurate obstacle avoidance", Proc. SPIE 9675, AOPC 2015: Image Processing and Analysis, 96750T (8 October 2015); https://doi.org/10.1117/12.2197958
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

MATLAB

Data centers

Detection and tracking algorithms

Image processing

Mars

Current controlled current source

Back to Top