# Gaussian Qualitative Trigonometric Functions in a Fuzzy Circle.

1. Introduction

The term "Trigonometry" was first coined as the title of a book (Trigonometria), which translates to "triangle's measurement." Although trigonometry is now taught with an emphasis on right triangles, its origin goes back to an era where it was used to determine the positions of celestial bodies and the distances between them and to understand the concept of chords in circles. Euclidean geometry, that is, planar geometry, deals with two-dimensional figures. The study of planar geometry provides constructions for planar figures, their properties, and the relationships between points, lines, and figures. The planar figure formed when a point traces a path at a fixed distance with respect to another fixed point called a circle, where the circle divides a plane into interior and exterior regions. Various theorems and properties on circles have been developed since time immemorial.

Gradually, researchers have developed theories on intersecting circles, which led to divergent properties between circular triangles and spherical triangles. The introduction of fuzzy sets and systems by Zadeh  changed the face of research in trigonometry. Fuzzy trigonometry was introduced by Buckley and Eslami , wherein continuous fuzzy numbers and sets were defined using the principle of extension. This method formed the basis of fuzzy trigonometry but failed to satisfy many criteria and identities. Furthermore, Ress  developed an approach for mapping standard trigonometric functions into the fuzzy realm. Using these modified fuzzy trigonometric functions, the proofs of a few inverse trigonometric identities, in addition to the standard identities, were given. A breakthrough in the study of fuzzy trigonometry was achieved by Liu et al. , with an aim of connecting symbolic cognitive functions to qualitative functions. The basic identities were satisfied, but a few properties could not be achieved. Ghosh and Chakraborty  proposed two methodologies for describing a fuzzy circle. The first methodology defines a circle as a set of points which are equidistant from a fixed point. The second methodology describes a circle using three fuzzy points. The definitions using both methods are as follows.

(1) Considering fuzzy numbers plotted along various line segments which pass through a specific point [??](a, b) which is fuzzy and located at a distance of [??] from the fixed fuzzy point, then the fuzzy circle is defined as

[mathematical expression not reproducible], (1)

where the distance between [[??].sub.[theta]] and a random point on the support is always fixed.

(2) Considering three fuzzy points, the fuzzy circle is drawn by passing the circle through these three points, and the supremum of the membership values defines the fuzzy circle which was proposed.

Technology in today's world needs advanced level procedures or heuristics which involve few or zero assumptions about the problem being optimized. The need for metaheuristics has many advantages over other algorithms, with one advantage being its ability to search very large candidate solutions spaces. Particle swarm optimization (PSO) is one such metaheuristic method which allows optimization based on iterations, which in turn helps in improving the candidate solution. The solution is improved by creating a population of candidate solutions (i.e., particles) and making them move around in the search-space, taking into consideration their positions and velocities. The movement of the particle is influenced by its local best known position, simultaneously being guided towards the best known position in the search area. These are updated time-to-time for all other particles to form a swarm. PSO was first introduced by Kennedy et al. with an intention of simulating the social behaviour in a flock of birds or a school of fish. Shi and Eberhart  developed an optimization technique for fuzzy systems by dynamically adjusting the inertia weight, improving PSO's performance. Pang et al.  utilized fuzzy discrete PSO to solve the Travelling salesman problem., Abdelbar et al.  compared the behaviour of the Gaussian and Cauchy membership functions in fuzzy PSO and concluded that the Cauchy membership functions are best suited for fuzzy PSO. It was noted that traditional PSO converges prematurely when applied as a global optimization technique. To prevent this downfall, Anantathanavit and Munlin  proposed radius (R-PSO) as an extension of standard PSO. R-PSO regroups the particles into a circle of the given radius and determines the best agent particle of the group. The experiment results proved that R-PSO performed better than traditional PSO when solving multimodal complex problems.

To produce wholesome proofs for identities based on fuzzy trigonometric functions, we introduce the Gaussian qualitative trigonometric functions (GQTFs) on a fuzzy circle. The unit fuzzy circle is defined using Gaussian membership function (GMF) partitions. Using the GMF circumference, fuzzy centre, and fuzzy point on the circle, trigonometric functions and their identities are successfully developed. In this paper, we use the advantages of R-PSO and GMFs to define a fuzzy R-PSO based on a fuzzy qualitative circle. Section 2 gives the preliminaries and introduces the concept of GQTFs on the fuzzy circle. Section 3 provides insight on the formation of the fuzzy centre and fuzzy point on the circle and provides a broad perspective of the redefined trigonometric functions, their ratio identities, their Pythagorean identities, their Taylor's series expansions, their differentials, and laws for obtaining the solutions of triangles. Section 4 describes the properties of intersecting fuzzy circles, and Section 5 describes the PSO with fuzzy matrices. Section 6 describes fuzzy R-PSO with GMF, which makes an efficient model for finding the best agent. Finally, Section 7 concludes the paper.

2. Prerequisites

The prerequisites required for the developed concept have been taken from various research articles which are cited in the references. Slightly modified versions of the concepts have been given in this section.

2.1. Fuzzy Subset. Considering a set E which is either finite or infinite, for every element x in E, the set consisting of all ordered pairs of the form {(x, [[mu].sub.[??]]A(x))} is called a fuzzy subset, denoted by [??], in E. Here, [[mu].sub.[??]](x) is called the membership function. The membership function gives a mapping of the elements in set E to the membership set M.

2.2. ZadehS Extension Principle. Considering a fuzzy subset of a universal set E, if f : E [right arrow] Z is a function, then the extension principle generates a function [??] whose membership function is defined over the supremum of all [f.sup.-1] (z) [not equal to] 0, that is,

[mathematical expression not reproducible]. (2)

Here, [f.sup.-1] is the preimage of z in E.

2.3. Gaussian Membership Function (GMF). The GMF is given by

[G.sub.mf] (x : c, [sigma]) = exp [- [(c - x).sup.2]/2[[sigma].sup.2], (3)

where c and [sigma] are the centre and width of the fuzzy set, respectively. An example of this function is shown in Figure 1. This membership function is also defined in terms of the interval [m, j] as follows:

[G.sub.mf] (x : m, j) = exp [- [(j - x).sup.2]/2[m.sup.2]. (4)

The GMF with fuzzification factor m is given by

[G.sub.mf] (x : c, [sigma], m) = exp [- [(c - x).sup.m]/2[[sigma].sup.2]. (5)

2.4. Arithmetic Operations on GMFs. The Arithmetic Operations on GMFs can be summarised as follows.

Letting [G.sub.mf] (x : m, c) and [G.sub.mf](x : j, a) be two GMFs, their arithmetic operations are shown in Table 1.

3. Proposed Method

Fuzzy Gaussian qualitative coordinates are proposed to facilitate the geometrical interpretation of GQTFs. To achieve this, we first define a fuzzy circle obtained using GMFs.

3.1. Gaussian Qualitative Coordinates. The x- and y-axes are defined for a unit circle. For the sake of simplicity and ease of use, the abscissa and ordinate are first considered as real lines. Figure 2 describes the circumference of the fuzzy unit circle which is obtained by partitioning the circumference into GMFs. The cloud formation, as described by Ghosh and Chakraborty , is now refined to obtain sharp boundaries for the circle. The crisp centre of the circle has a neighbourhood which is formed by extending and converging the core area of every GMF towards the centre of the circle. Thus the centre of the derived fuzzy circle will have infinitely many sides depending on the number of partitions. We can henceforth generalise the centre to be an infinitesimal circle with an infinitesimal radius, that is, l.

3.2. Fuzzy Centre and Position of a Point. The values of a and h obtained on the circumference of the fuzzy circle are now extended towards the core of the circle. Without loss of generality, a point on the proposed fuzzy circle can be assumed to be the centre of some GMF. The position of a point can be mapped as shown in Figure 3.

3.3. Trigonometric Functions. The graphs of sine, cosine, and tangent functions under the proposed concept have been obtained and verified to be in coherence with the crisp trigonometric functions. Various identities and laws for triangles are presented as follows.

3.3.1. Ratio Identities

(i) sin ([G.sub.mf] [-[delta] [delta]]) = [G.sub.mf] [[a.sub.y] [b.sub.y]]/

[G.sub.mf] [ [square root of [([a.sub.x] - [a.sub.0]).sup.2] + [a.sup.2.sub.y]] [square root of [([b.sub.x] - [b.sub.0]).sup.2] + [b.sup.2.sub.y]]

(ii) cos ([G.sub.mf] [-[delta] [delta]]) = [G.sub.mf] [[a.sub.0] - [b.sub.x] [b.sub.0] - [a.sub.x]/

[G.sub.mf] [[square root of [([a.sub.x] - [a.sub.0]).sup.2] + [a.sup.2.sub.y]] [square root of [([b.sub.x] - [b.sub.0]).sup.2] + [b.sup.2.sub.y]],

(iii) tan([G.sub.mf][-[delta] [delta]]) = [G.sub.mf][[a.sub.y] [b.sub.y]]/[G.sub.mf][[a.sub.0] - [b.sub.x] [b.sub.0] - [a.sub.x]].

3.3.2. Pythagorean Identities

(i) [sin.sup.2] ([G.sub.mf] [-[delta] [delta]]) + [cos.sup.2] ([G.sub.mf] [-[delta] [delta]]) = [G.sub.mf] [1 - [delta] 1 + [delta]],

(ii) [sec.sup.2] ([G.sub.mf][-[delta] [delta]]) - [tan.sup.2] ([G.sub.mf] [-[delta] [delta]]) = [G.sub.mf] [1 - [delta] 1 + [delta]],

(iii) [csc.sup.2] ([G.sub.mf][-[delta] [delta]]) - [cot.sup.2] ([G.sub.mf] [-[delta] [delta]]) = [G.sub.mf] [1 - [delta] 1 + [delta]].

3.3.3. Laws for Obtaining Solutions to Triangles

(i) The law of sines gives the relationship between the sines of the angles of a triangle and the lengths of the sides of the triangle:

[mathematical expression not reproducible]. (6)

(ii) The law of cosines relates the sides of a triangle with the cosine of an angle in the triangle:

(1) [G.sub.mf] [[[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]].sup.2] = [G.sub.mf] [[[c.sub.x] - [b.sub.y] [c.sub.y] - [b.sub.x]].sup.2] +

[G.sub.mf] [[[a.sub.x] - [c.sub.y] [a.sub.y] - [c.sub.x]].sup.2] - 2[G.sub.mf] [[c.sub.x] - [b.sub.y] [c.sub.y] - [b.sub.x]] x

[G.sub.mf] [[a.sub.x] - [c.sub.y] [a.sub.y] - [c.sub.x]] x cos [G.sub.mf] [C - [delta] C + [delta]])

(2) [G.sub.mf] [[[c.sub.x] - [b.sub.y] [c.sub.y] - [b.sub.x]].sup.2] = [G.sub.mf] [[[a.sub.x] - [c.sub.y] [a.sub.y] - [c.sub.x]].sup.2] +

[G.sub.mf] [[[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]].sup.2] - 2 x [G.sub.mf] [[a.sub.x] - [c.sub.y] [a.sub.y] - [c.sub.x]] x

[G.sub.mf] [[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]] x cos [G.sub.mf] [A - [delta] A + [delta]]),

(3) [G.sub.mf] [[[a.sub.x] - [c.sub.y] [a.sub.y] - [c.sub.x]].sup.2] = [G.sub.mf] [[[b.sub.x] - [c.sub.y] [b.sub.y] - [c.sub.x]].sup.2] +

[G.sub.mf] [[[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]].sup.2] - 2 x [G.sub.mf] [[b.sub.x] - [c.sub.y] [b.sub.y] - [c.sub.x]] x

[G.sub.mf] [[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]] x cos [G.sub.mf] [B - [delta] B + [delta]]),

(iii) The law of tangents gives the relationship between the sides and tangents of the angles of a triangle:

[G.sub.mf] [[b.sub.x] + [c.sub.x] - ([a.sub.y] + [c.sub.y]) [b.sub.y] + [c.sub.y] - ([a.sub.x] + [c.sub.x])]/ [G.sub.mf] [[b.sub.x] + [a.sub.x] - 2[c.sub.y] [b.sub.y] + [a.sub.y] - 2[c.sub.x]]

= tan ((1/2) [G.sub.mf] [A - B - 2[delta] A - B + 2[delta]])/tan((1/2)[G.sub.mf] [A + B - 2[delta] A + B + 2[delta]]). (7)

3.3.4. Mollweide's Identity. This identity is a tool for checking the solutions of triangles. It uses all sides and angles of the triangle.

[G.sub.mf] [[a.sub.x] + [b.sub.x] - 2[c.sub.y] [a.sub.y] + [b.sub.y] - 2[c.sub.x]]/[G.sub.mf] [[a.sub.x] - [b.sub.y] [a.sub.y] - [b.sub.x]]

= cos ((1/2) [G.sub.mf] [A - B - 2[delta] A - B + 2[delta]])/sin((1/2)[G.sub.mf] [C - [delta] C + [delta]]). (8)

3.4. Taylor's Series Expansions of Trigonometric Functions. The Taylor's series expansions of the trigonometric functions are as follows:

(i) cos([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [1 - [([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]].sup.2]/2! + [([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]].sup.4]/4! [- or +] ...]

Thus cos([G.sub.mf] [[x.sub.mf] - [delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [G.sub.mf] [cos([x.sub.mf] - [[delta].sub.mf]) - [[DELTA].sub.mf] cos([x.sub.mf] - [[delta].sub.mf]) + [[DELTA].sub.mf]], where [[DELTA].sub.mf] = 2 [[summation].sup.[infinity].sub.n=2,4,6, ...] [((([x.sub.mf] + [[delta].sub.mf]).sup.n] + [([x.sub.mf] - [[delta].sub.mf]).sup.n])/n!)

(ii) [sin([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]] - [([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]].sup.3]/3! [- or +] ...]

Thus sin([G.sub.mf] [[x.sub.mf] - [delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [G.sub.mf] [sin([x.sub.mf] - [[delta].sub.mf]) - [[DELTA].sub.1] sin([x.sub.mf] - [[delta].sub.mf]) + [[DELTA].sub.1]], where [[DELTA].sub.1] = 2 [[summation].sup.[infinity].sub.n=1,3,5, ...] [((([x.sub.mf] + [[delta].sub.mf]).sup.n] + [([x.sub.mf] - [[delta].sub.mf]).sup.n])/n!)

(iii) tan([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [([G.sub.mf] [[x.sub.mf] - [[delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]] + (1/3) [([G.sub.mf] [([x.sub.mf] - [[delta].sub.mf]).sup.3] [([x.sub.mf] + [[delta].sub.mf]].sup.3]] + (2/5)[G.sub.mf] [([G.sub.mf] [([x.sub.mf] - [[delta].sub.mf]).sup.5] + ...

Thus tan([G.sub.mf] [[x.sub.mf] - [delta].sub.mf] [x.sub.mf] + [[delta].sub.mf]]) = [G.sub.mf] [tan([x.sub.mf] - [[delta].sub.mf]) tan([x.sub.mf] + [[delta].sub.mf])]].

3.5. Differentiation of the Gaussian Trigonometric Functions. The trigonometric functions thus obtained are also fuzzy differentiable. Supposing that F(x) = f([G.sub.mf] [c [sigma]]) is a Gaussian fuzzy trigonometric function, then the derivatives of the function are as follows:

First Derivative: F'(x) = f'([G.sub.mf] [c [sigma]]) x exp(-[x.sup.2]/2[[sigma].sup.2]) x (-x/[[sigma].sup.2]).

The second and higher order derivatives are obtained by using the chain rule for the above functions.

4. Intersection of Fuzzy Circles

We now introduce the concept of intersecting fuzzy circles and study their structure and properties while comparing them with regular intersecting circles.

4.1. Circles Touching at Exactly One Point

Case 1. Two circles have an equal number of partitions, implying that the radii of both circles are equal. Figure 4 shows the fuzzified point of intersection.

In Figure 4, we observe that the centres of both Gaussian curves intersect at a crisp point. The fuzzified areas of the intersection are congruent triangles. The area of each triangle is given by [F.sub.ta] = 1/2 x (2r) x [sigma] = r x [sigma]. Thus, the total fuzzy area is 2r[sigma].

Case 2. The number of partitions on the intersecting circles is unequal, as shown in Figure 5.

We observe that the crisp point of intersection is obtained where the centres of both Gaussian curves meet. The point of intersection is bounded by triangles whose areas are given by

[mathematical expression not reproducible]. (9)

Hence, the total area is = [r.sub.1][[sigma].sub.1] + [r.sub.2][[sigma].sub.2]. The area obtained is in coherence with the traditional way of determining the area of intersection.

The intersection of circles becomes interesting when we consider circles intersecting at two points. In such a case, the area of intersection can be either symmetric or dominate a single circle with a small portion of the second circle as a common area.

4.2. Fuzzy Circles Intersecting at Two Points

Case 1. Two circles have an equal number of partitions. Figure 6 shows the intersecting fuzzy circles. From the following diagram, we observe that the crisp points of intersection and the common chord are obtained during the fuzzification process. We obtain congruent triangles in the fuzzy area of intersection. The centres of the Gaussian curves meet to produce the crisp point of intersection. The two points, when joined, produce the crisp common chord for the intersecting circles.

The area of the overlapping region is calculated as follows:

(i) The area of each sector is ([r.sub.-] x [theta])/2.

(ii) The length of the arc of the sector is given by r x [theta].

(iii) Thus, the area of the fuzzified sector is ([r.sup.2.sub.+] x [theta])/2.

(iv) The area of the smaller sector is ([r.sup.2.sub.-] x [theta])/2. Here, [r.sub.+] = r + [sigma] and [r.sub.-] = r - [sigma].

(v) Supposing the line [r.sub.+] cuts the smaller radius in the ratio m : n, then m = [r.sub.+]/2. Thus, the area is ([r.sup.2.sub.+] x [[theta].sub.1])/4, and the total area is [r.sup.2.sub.+]/2 x (2[theta] + [[theta].sub.1]).

Case 2. Two circles have an unequal number of partitions, which implies that the radii of both circles are different (Figure 7).

The area of the bigger fuzzy sector is ([r.sup.2] x [theta])/2 + ([r.sup.2] x [[theta].sub.1])/4 = ([r.sup.2]/4)(2[theta] + [[theta].sub.1]).

Similarly, the area of the smaller fuzzy sector is ([r.sup.2.sub.1]/4)(2[delta] + [[delta].sub.1]).

Thus, in both cases, we obtain a fuzzy diagram bounded by ten points. The area of the overlapping section is obtained using the following formulas:

[Area.sub.fuzzy] = 1/Dis [square root of C x J x A x M],

C = (-Dis + [rad.sub.1] + [rad.sub.2]),

J = (Dis - [rad.sub.1] + [rad.sub.2]),

A = (Dis + [rad.sub.1] - [rad.sub.2]),

M = (Dis + [rad.sub.1] + [rad.sub.2]), (10)

where Dis = [[O.sub.1] - [O.sub.2] - ([[sigma].sub.1] + [[sigma].sub.2]) [O.sub.1] - [O.sub.2] + ([[sigma].sub.1] + [[sigma].sub.2])] is the distance between the centres and [rad.sub.1] = [[r.sub.1] - [[sigma].sub.1] [r.sub.1] + [[sigma].sub.1]] and [rad.sub.2] = [[r.sub.2] - [[sigma].sub.2] [r.sub.2] + [[sigma].sub.2]] are the Gaussian radii of the fuzzy circles.

4.3. Intersection of Three Fuzzy Circles. Three circles can intersect in many ways, but we consider two special cases wherein we obtain circular triangles and irregular convex quadrilaterals. However, we must check whether an overlapping area exists between the considered circles. To verify, we check if either of the following conditions are satisfied.

(i) A point of intersection of two circles should bea point inside the third circle;

(ii) One of the circles should be engulfed completely inside another circle.

Case 1. Three fuzzy circles with equal numbers of partitions are considered, implying that the radii of all three circles are equal. The overlapping area formed by the three segments and an inner triangle whose sides are the arcs of the three circles is called a circular triangle (Figure 8).

The area of the triangle is calculated using Heron's formula:

[Area.sub.abc] = [square root of S(S - A) (S - B) (S - C)], (11)

where S = (1/2)(A + B + C), A = [G.sub.mf][[a.sub.x] [a.sub.y]], B = [G.sub.mf] [[b.sub.x] [b.sub.y]], and C = [G.sub.mf][[c.sub.x] [c.sub.y]]. The area of the combined overlap is given by

[Area.sub.seg] = [3.summation over (n=1)] [R.sup.2.sub.n][[sin.sup.-1] (A/2[R.sub.n]) - [3.summation over (n=1)] A/4 [square root of 4 x [R.sup.2.sub.n] - [A.sup.2]]

+ [square root of S(S - A) (S - B) (S - C)]. (12)

Case 2. Three fuzzy circles with unequal numbers of partitions will have different radii. In this case, we must recalculate the overlapping segment area using the area of the bigger circle (Figure 9).

Step 1. We find the midpoint of the chord in the segment, which is given by

[x.sub.mid] = [x.sub.i12] + [x.sub.i13]/2

[y.sub.mid] = [y.sub.i12] + [y.sub.i13]/2. (13)

Step 2. We then find the equation of the line joining the midpoint and the centre of the circle, which is given by

y = [B.sub.1] - [y.sub.mid]/[A.sub.1] - [x.sub.mid] x x - [x.sub.mid] ([B.sub.1] - [y.sub.mid])/[A.sub.1] - [x.sub.mid] + [y.sub.mid]. (14)

Step 3. Next, we determine the points of intersection of the above line and circle, which are given by [X.sub.ic1,ic2] = ([a.sub.1] + [b.sub.1] x m - m x n [+ or -] [square root of [delta]])/(1 + [m.sup.2]), [Y.sub.ic1,ic2] = (n + [a.sub.1] x m + [b.sub.1] x [m.sup.2] [+ or -] m x [square root of [delta]])/(1 + [m.sup.2]), where m = ([B.sub.1] - [y.sub.mid])/([A.sub.1] - [y.sub.mid]), n = ([x.sub.mid] x ([B.sub.1] - [y.sub.mid]))/([A.sub.1] - [x.sub.mid]) + [y.sub.mid].

Step 4. Finally, we check whether the other two radii of the circles are greater than the distance between the centre and the midpoint.

Thus, the area of the bigger segment completely encompassed by the bigger circle is ([R.sup.2.sub.1]/2)([[theta].sub.1] - sin[[theta].sub.1]).

Results

(i) The regions of intersection of three equal fuzzy circles have been considered. Hence the common value of radii has been denoted by R. Here R denotes the common radii.

(ii) Given three intersecting fuzzy circles, the lines joining the points of intersection outside the circular triangle satisfy ACE = BDF which defines Haruki's theorem.

(iii) The crisp circle which touches the inner circles of the circular triangle and its neighbouring triangles is either tangent to the innermost circle and internally tangent to the inner circles of the neighbouring triangles or vice versa. Such a circle is called the "Hart's circle." We can construct 8 such Hart circles for a given circular triangle.

Case 3. The most complex case is that of an overlapping area which is obtained when the circular segments form the boundary shown in Figure 10. In the process, we obtain an irregular convex quadrilateral.

The area of the irregular convex quadrilateral is given by [Area.sub.quad] = (1/2)P x Q x sin [phi], where [phi] is the angle between the diagonals P and Q.

Hence the combined area of the segments is given by

Area = [summation over (n=1)] 4[R.sup.2.sub.n] [sin.sup.-1] ([A.sub.n]/2 x [R.sub.n])

- [4.summation over (n=1)] [A.sub.n]/4 [square root of 4 x [R.sup.2.sub.n] - [A.sup.2.sub.n]]. (15)

Here [A.sub.n] is the length of the chord joining the points of intersection of the circles. There are four chords which form the edges of the convex quadrilateral. And, [R.sub.n] is the radii of the circles.

5. Fuzzy Particle Swarm Optimization (PSO) with Fuzzy Matrices and GMFs

5.1. Fuzzy Matrices. A matrix of the form P = [[p.sub.ij[mu]]].sub.mxn] where [p.sub.ij[mu]] is the membership degree of the element [p.sub.ij] [member of] [??] is called a fuzzy matrix.

In PSO, a finite number of particles define a swarm. The particles move in the n-dimensional space with certain velocity. The particle's velocity and position are updated using the following formula:

[V.sup.k+1.sub.i] = w [cross product] [V.sup.k.sub.i] [cross product] ([c.sub.1] [cross product] r(*))[cross product] ([P.sup.k.sub.i] [??] [X.sup.k.sub.i]) [direct sum] [summation over (h [member of [eta](i,k))] [c.sub.2]

[cross product] r(*)[cross product] [psi] ([p.sub.h]) ([P.sup.k.sub.g] [??] [X.sup.k.sub.i]), (16)

where [eta](i,k) denotes the k best particles in the neighbourhood of the particle and [psi]([p.sub.h]) denotes the matrix containing the corresponding membership degrees of the particles defined using the GMF.

5.2. Particle Position Initialization. The positions of the particles are initialized and represented in the form of a fuzzy matrix. The position matrix is given by

[mathematical expression not reproducible]. (17)

The positions of the particles for the fuzzy matrix are generated randomly and satisfy the following conditions:

[n.summation over (j=1)] [P.sub.rij] = 1, [P.sub.rij] [member of] [0, 1], i = 1, 2, ..., n. (18)

5.3. Particle Velocity Initialization. The velocity matrix is given by

[mathematical expression not reproducible], (19)

where the velocities of the particles are generated according to the randomly generated position of the particles with conditions

[n.summation over (j=1)] [v.sub.rij] = 0, i = 1, 2, ..., n. (20)

5.4. Normalization of the Particle Position Matrix. The particle position matrix generated using random positions may sometimes not adhere to the constraint [P.sub.rij] [member of] [0, 1]. Hence, we need to normalize the particle position matrix. The first step in normalization involves replacing all negative values in the matrix with zeros. Then, the matrix is transformed into

[mathematical expression not reproducible]. (21)

5.5. Choosing the Best Agents with [alpha]-levels. The agent particles are now selected based on the value of [alpha], where [alpha] is a real number in the interval [0 l]. Once the agent particles are selected, they are placed on the circumference of the circle of radius [alpha]. Furthermore, the global best position of the particle is calculated using the distance formula

[mathematical expression not reproducible]. (22)

This process is illustrated in Figure 11.

6. Algorithm for Fuzzy R-PSO with GMFs

The proposed algorithm provides the local best position of particles based on the threshold, as given in Figure 12.

(1) Start.

(2) Initialize: maximum number of particles in the target neighbourhood: [max.sub.p]; maximum number of iterations: [max.sub.n].

(3) Assign random position and velocity matrices for the particles.

(4) For i = 0 to [max.sub.p]

(a) Calculate positions and velocities of the particles as given in the equation.

(b) Normalize the particle position matrix using the equation.

(5) Fix the [alpha]-level for the normalized particle position matrix.

(6) If a particle's position in the normalized matrix is [less than or equal to] [alpha], then update the first neighbourhood circle.

(7) Calculate the distance between the particles and locate the global best position.

(8) Stop.

7. Discussion and Conclusion

The proposed methodology of constructing a fuzzy qualitative circle with GMF provides a smoother graphs of fuzzy trigonometric functions when compared to previously described methods. The graphs of the curves as obtained by Kaufmann and Gupta  flatten either the min- or max-curve depending upon the point of inflection, which led to a restriction on the extent of the spread in terms of angular measurements. This angular spread has now been defined in terms of [sigma] which is the width of the GMF. When [sigma] = 0, the Gaussian Fuzzy Circle reduces to the conventional crisp circle. The centre of the fuzzy circle is also fuzzy and the radius is a linear combination of fuzzy numbers. Also, we have demonstrated geometrical interpretation of the GQTFs and the representation of a fuzzy circle with n = 25 GMFs. The position of a point on the fuzzy circle has been explained. Trigonometrical identities, Pythagorean identities, and laws for obtaining solutions to triangles (i.e., law of sines, law of cosines, and law of tangents) have been derived. The GMFs on a fuzzy circle and Taylor's series expansions have been verified. The relationship between qualitative and quantitative trigonometric states is very difficult to describe; however, Gaussian fuzzy qualitative trigonometry helps in describing their relationship. In this paper, we have successfully described the intersection of fuzzy circles when the circle is divided into either equal or unequal numbers of partitions, and a study of circular triangles has been given. The results on circular triangles have also been verified. This research article gives a theoretical interpretation of applying R-PSO inside a fuzzy circle. The R-PSO with fuzzy circle of radius [alpha] (developed using [alpha]-cuts) reduced the premature convergence of the standard PSO algorithm. By fixing various levels of [alpha], global best position of the particles can be obtained. Furthermore, the development of fuzzy circles with partitions provides a sharper boundary when compared to the existing ideas of fuzzy circles and fuzzy qualitative circles.

7.1. Future Direction. The authors intend to implement this idea in designing a navigation stick using the concept of radar. We propose to utilize this concept in designing navigation systems for people with special needs. Further, this research, being an extension to fuzzy qualitative trigonometry, will be implemented in extensive research towards robot kinematics and human movement analysis.

https://doi.org/10.1155/2018/8623465

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The authors would like to thank Editage (https://www.editage.com) for English language editing and Mr. Mohamed E. for his timely help in developing the R-PSO for fuzzy circle algorithm using Matlab.

References

 L. A. Zadeh, "Fuzzy sets," Information and Computation, vol. 8, pp. 338-353,1965.

 J. J. Buckley and E. Eslami, An Introduction to Fuzzy Logic and Fuzzy Sets, Physica-Verlag Heidelberg, New York, NY, USA, 2002.

 D. A. Ress, Development of Fuzzy Trigonometric Functions to support design and manufacturing [Ph.D. Thesis], North Carolina University, North Carolina, NC, USA, 1999.

 H. Liu, G. M. Coghill, and D. P. Barnes, "Fuzzy qualitative trigonometry," International Journal of Approximate Reasoning, vol. 51, pp. 371-388, 2009.

 D. Ghosh and D. Chakraborty, "Analytical fuzzy plane geometry I," Fuzzy Sets and Systems, vol. 209, pp. 66-83, 2012.

 Y. Shi and R. Eberhart, "Fuzzy Adaptive Particle Swarm Optimization," in Proceedings of the Congress on Evolutionary Computation, pp. 101-106, 2001.

 W. Pang, K. Wang, C. Zhou, and L. Dong, "Fuzzy discrete particle swarm optimization for solving traveling salesman problem," in Proceedings of the 4th International Conference on Computer and Information Technology (CIT '04), pp. 796-800, 2004.

 A. M. Abdelbar, S. Abdelshahid, and D. C. Wunsch, "Gaussian versus Cauchy membership functions in fuzzy PSO," in Proceedings of the 2007 International Joint Conference on Neural Networks, IJCNN '07, August 2007

 M. Anantathanavit and M.-A. Munlin, "Radius particle swarm optimization," in Proceedings of the 17th International Computer Science and Engineering Conference, ICSEC '13, pp. 126-130, September 2013.

 D. Ghosh and D. Chakraborty, "Analytical fuzzy plane geometry III," Fuzzy Sets and Systems, vol. 283, pp. 83-107, 2016.

 A. Kaufmann and M. M. Gupta, Introduction to Fuzzy Arithmetic: Theory and Applications, Van Nostrand Reinhold, New York, NY, USA, 1985.

M. Clement Joe Anand (iD) and Janani Bharatraj

Department of Mathematics, Hindustan Institute of Technology and Science (Deemed to be University), Chennai 603103, India

Correspondence should be addressed to M. Clement Joe Anand; arjoemi@yahoo.com

Received 15 November 2017; Revised 26 February 2018; Accepted 11 April 2018; Published 3 June 2018

Academic Editor: Erich Peter Klement

Caption: Figure 1: GMF with c = 5 and [sigma] = 2.

Caption: Figure 2: Fuzzy circle with Gaussian membership function.

Caption: Figure 3: Coordinates of a point on the fuzzy circle.

Caption: Figure 4: Circles of equal radii touching at a single point.

Caption: Figure 5: Circles of unequal radii touching at a single point.

Caption: Figure 6: Intersecting circles of equal radii.

Caption: Figure 7: Intersecting circles of unequal radii.

Caption: Figure 8: Circles of equal radii intersecting and forming a circular triangle.

Caption: Figure 9: Three intersecting circles of unequal radii.

Caption: Figure 10: Formation of irregular convex quadrilateral.

Caption: Figure 11: Neighbourhood for obtaining the global best agent.

Caption: Figure 12: Neighbourhood obtained using [alpha]-cuts.
```Table 1: Arithmetic operations.

Sl.no.   Operation       Notation          Result

1.          Sum       [m,c] + [j,a]    [m + j, c + a]
2        Difference   [m,c] - [j,a]    [m - a, c - j]
3         Product     [m,c] x [j,a]    [m x j, c x a]
4         Quotient    [m,c] + [j,a]    [m + a, c + j]
```
COPYRIGHT 2018 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2018 Gale, Cengage Learning. All rights reserved.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters