Share Email Print

Proceedings Paper

K-means clustering-spiral searching model to solve the rough or accurate obstacle avoidance
Author(s): Zhuo Yang; Yueda Jiang; Yue Miao; Hua Zhou
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 8 October 2015
PDF: 5 pages
Proc. SPIE 9675, AOPC 2015: Image Processing and Analysis, 96750T (8 October 2015); doi: 10.1117/12.2197958
Show Author Affiliations
Zhuo Yang, Hohai Univ. (China)
Yueda Jiang, Hohai Univ. (China)
Yue Miao, Hohai Univ. (China)
Hua Zhou, Hohai Univ. (China)

Published in SPIE Proceedings Vol. 9675:
AOPC 2015: Image Processing and Analysis
Chunhua Shen; Weiping Yang; Honghai Liu, Editor(s)

© SPIE. Terms of Use
Back to Top