Abstract

The application of the XCS family of classifier systems within multi-step problems has shown promise, but XCS classifier systems usually solve those problems with a large number of classifiers. If they can generate compact and readily interpretable solutions when used in multi-step problems, it will enhance their applicability and usefulness in a wide range of robot control and knowledge discovery tasks. In this paper, we describe some methods developed for XCS to compact the rule set and acquire explicit policy knowledge for multi-step problems, especially non-Markov problems. Experimental results show the ability to obtain a very compact rule set out of the final population of classifiers with little or no degradation of overall performance.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.