Matching horizon features using a Messy Genetic Algorithm

doi:10.1016/S0045-7825(99)00399-0

Return

Matching horizon features using a Messy Genetic Algorithm

2000-06-01

PRE

Beveridge, JR

K. Balasubramaniam

Darrell Whitley

DOI：10.1016/S0045-7825(99)00399-0

Original

Original request for help

Save

Abstract

En 中文

Three line segment matching techniques are compared on horizon line matching problems. The application is to reduce camera angle uncertainty for outdoor robots. Each of the three algorithms seeks an optimal many-to-many match between a subset of 2D line segments extracted fi om a rendered terrain map and segments extracted from an image. Two algorithms are non-deterministic, with one performing Random Starts Local Search and the other using a Messy Genetic Algorithm. The third algorithm searches a list of ranked key feature matches using a limited deterministic local search. The Random Starts Local Search Algorithm is the slowest of the three algorithms and fails to iind the best match on 9 out of 54 problems. In contrast, the Messy Genetic Algorithm correctly solves all 54 test problems. The Key Feature Algorithm is the fastest, but it fails to find the optimal match in three cases. The results suggest the Messy Genetic Algorithm is superior to the other two algorithms on problems of this type. The test imagery was collected on one of the Unmanned Ground Vehicle Program's vehicles operating at the Lockheed Martin Demo C test site. Using the optimal matches it is shown that uncertainty in camera pointing angle is reduced from several degrees to less than a degree. (C) 2000 Elsevier Science S.A. All rights reserved.

Keywords:

Messy Genetic Algorithm

line segment matching

robot orientation correction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.