single-rb.php

JRM Vol.7 No.1 pp. 86-90
doi: 10.20965/jrm.1995.p0086
(1995)

Paper:

A Study of Line-Fitting Method by Using Genetic Algorithm

Takatoshi Yamagishi and Takehiko Tomikawa

Kanagawa Institute of Technology, Atsugi, Kanagawa, 243-02 Japan

Received:
October 17, 1994
Accepted:
October 30, 1994
Published:
February 20, 1995
Keywords:
Line-Fitting, Genetic Algorithm, Polygonal approximation, Vector conversion
Abstract

A straight line approximation method of either closed curve or open-ended curve is proposed. In this system, Genetic Algorithm is considered to meet robustness requirements in a multi-point searching procedure, since conventional line fitting methods have a tendency to take troublesome parameters while having less flexibility in system configurations. Whether or not the entire divided point, which is initially allocated at regular intervals along the curved line, is adequate for approximation according to the objective function. This function: (the total length of approximate lines) – ( the value in proportion to the number of approximate points), is newly introduced in between two patterns as a quantitative measure. Some comparative simulations are performed for confirmation of this system performance. As a result, we have learned that a) the provided parameters in this system are easily handled regardless of the shape of original patterns, and b) the approximate points are not remarkably affected by the starting location of implementation along the curved line.

Cite this article as:
Takatoshi Yamagishi and Takehiko Tomikawa, “A Study of Line-Fitting Method by Using Genetic Algorithm,” J. Robot. Mechatron., Vol.7, No.1, pp. 86-90, 1995.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Mar. 05, 2021