2004
DOI: 10.1007/978-3-540-30217-9_55
|View full text |Cite
|
Sign up to set email alerts
|

Evolution of Voronoi-Based Fuzzy Controllers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
7
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…1). The "cell" associated to a model i is bounded by the adjacent sigmoids ψ ij , similar to the Voronoi cells of (Kavka & Schoenauer, 2004). However, adapting Voronoi sites incrementally to design appropriate boundaries is a complex coupled problem.…”
Section: Overview Of the Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…1). The "cell" associated to a model i is bounded by the adjacent sigmoids ψ ij , similar to the Voronoi cells of (Kavka & Schoenauer, 2004). However, adapting Voronoi sites incrementally to design appropriate boundaries is a complex coupled problem.…”
Section: Overview Of the Modelmentioning
confidence: 99%
“…Learning a deterministic partitioning of the input space x → i has been addressed before: (Bemporad et al, 2003) use a greedy search algorithm to find a polygonal partitioning constrained by an absolute error bound. (Kavka & Schoenauer, 2004) recently proposed a Voronoi cell partitioning with local fuzzy controllers learned with an Evolutionary Algorithm. Also decision trees (Model Trees, (Quinlan, 1992)) are possible choices to represent a partitioning.…”
Section: Introductionmentioning
confidence: 99%
“…The Voronoi diagram is used in other path planners including the roadmap [14] and HGVG algorithms [5]. A formal definition of the Voronoi diagram can be found in [5], [14], and [16]. Related to the Voronoi diagram is the Delaunay triangulation.…”
Section: Introductionmentioning
confidence: 99%
“…Related to the Voronoi diagram is the Delaunay triangulation. As defined in [16], the Delaunay triangulation T is the maximum planar subdivision of n points P = {P 1 …P n } such that no points of P are bounded by the circumcircle of any triangle in T. The Delaunay triangulation will be used to restrict the domain of our algorithms and will be expanded upon throughout this paper. Examples of each of these are shown in Fig.…”
Section: Introductionmentioning
confidence: 99%
“…In this work, we propose the Recurrent Fuzzy Voronoi (RFV) model, a representation for recurrent fuzzy systems. It is an extension of the FV model [13] that extends the application domain to include temporal problems. The FV model is a representation for fuzzy controllers based on Voronoi diagrams that can represent fuzzy systems with synergistic rules, fulfilling the ǫ-completeness property and providing a simple way to introduce a priory knowledge.…”
mentioning
confidence: 99%