By Topic

Generating fuzzy rules for target tracking using a steady-state genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. C. C. Chan ; Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, Hong Kong ; V. Lee ; H. Leung

Radar target tracking involves predicting the future trajectory of a target based on its past positions. This problem has been dealt with using trackers developed under various assumptions about statistical models of process and measurement noise and about target dynamics. Due to these assumptions, existing trackers are not very effective when executed in a stressful environment in which a target may maneuver, accelerate, or decelerate and its positions be inaccurately detected or missing completely from successive scans. To deal with target tracking in such an environment, recent efforts have developed fuzzy logic-based trackers. These have been shown to perform better as compared to traditional trackers. Unfortunately, however, their design may not be easier. For these trackers to perform effectively, a set of carefully chosen fuzzy rules are required. These rules are currently obtained from human experts through a time-consuming knowledge acquisition process of iterative interviewing, verifying, validating, and revalidating. To facilitate the knowledge acquisition process and ensure that the best possible set of rules be found, we propose to use an automatic rule generator that was developed based on the use of a genetic algorithm (GA). This genetic algorithm adopts a steady-state reproductive scheme and is referred to as the steady-state genetic algorithm (SSGA) in this paper. To generate fuzzy rules, we encode different rule sets in different chromosomes. Chromosome fitness is then determined according to a fitness function defined in terms of the number of track losses and the prediction accuracy when the set of rules it encodes is tested against training data. The rules encoded in the fittest chromosome at the end of the evolutionary process are taken to be the best possible set of fuzzy rules

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:1 ,  Issue: 3 )