Safe landing site selection based on computational geometry and genetic algorithm

Shao Wei*, Cui Pingyuan, Zhou Weiwen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

The landing site decision has direct relation to the safety of a spacecraft. This paper presents the use of computational geometry (CG) and genetic algorithm (GA) in the landing site selection. In order to describe the obstacles, we use computational geometry to compute the minimum enclosing circles and ellipses. Taking the obstacles as discrete circles and ellipses, we use the genetic algorithm to simplify and to solve the difficult problem of finding the largest empty circle (LEC) in circles and ellipses for the spacecraft landing on the surface. The results of tests on the solution procedure are presented.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference on Natural Computation, ICNC 2008
Pages660-664
Number of pages5
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event4th International Conference on Natural Computation, ICNC 2008 - Jinan, China
Duration: 18 Oct 200820 Oct 2008

Publication series

NameProceedings - 4th International Conference on Natural Computation, ICNC 2008
Volume1

Conference

Conference4th International Conference on Natural Computation, ICNC 2008
Country/TerritoryChina
CityJinan
Period18/10/0820/10/08

Fingerprint

Dive into the research topics of 'Safe landing site selection based on computational geometry and genetic algorithm'. Together they form a unique fingerprint.

Cite this