### Abstract

Approximate fuzzy rule-based models are more precise if their size is bigger. A larger model, however, requires more time for its evaluation and hence the problem arises of finding a compromise between size and accuracy for the task at hand. This trade-off between computation time and precision is mapped into the problem of tracking a moving target: higher accuracy results in a tighter precision of the target location, but at the cost of longer computation time, during which the target can move further away, thus ultimately requiring a longer search time for target localization. This paper examines the problem of determining the optimal rule-base size that will yield a minimum total time required to repeatedly re-acquire a moving target, as done by a cat that plays with a mouse. The general problem has no known solution: here solutions of specific cases will be presented.

Original language | English |
---|---|

Pages | 1865-1870 |

Number of pages | 6 |

Publication status | Published - dec. 1 1996 |

Event | Proceedings of the 1996 5th IEEE International Conference on Fuzzy Systems. Part 3 (of 3) - New Orleans, LA, USA Duration: szept. 8 1996 → szept. 11 1996 |

### Other

Other | Proceedings of the 1996 5th IEEE International Conference on Fuzzy Systems. Part 3 (of 3) |
---|---|

City | New Orleans, LA, USA |

Period | 9/8/96 → 9/11/96 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Artificial Intelligence
- Applied Mathematics

### Cite this

*Optimal fuzzy rule bases - the cat and mouse problem*. 1865-1870. Paper presented at Proceedings of the 1996 5th IEEE International Conference on Fuzzy Systems. Part 3 (of 3), New Orleans, LA, USA, .