ALENA : adaptive-length evolving neural arrays
Material type:
Item type | Home library | Collection | Call number | URL | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
![]() |
Biblioteca de la Facultad de Informática | Biblioteca digital | A0600 (Browse shelf(Opens below)) | Link to resource | No corresponde |
Browsing Biblioteca de la Facultad de Informática shelves, Collection: Biblioteca digital Close shelf browser (Hides shelf browser)
Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
Evolving neural arrays (ENA) have proved to be capable of learning complex behaviors, i.e., problems whose solution requires strategy learning. For this reason, they present many applications in various areas such as robotics and process control. Unlike conventional methods -based on a single neural network- ENAs are made up of a set of networks organized as an array. Each of them represents a part of the expected solution. This work describes a new method, ALENA, that enhances the solutions obtained by solving the main deficiencies of ENA since it eases the obtaining of specialized components, does not require the explicit decomposition of the problem into subtasks, and is capable of automatically adjusting the arrays length for each particular use. The measurements of the proposed method -applied to problems of obstacle evasion and objects collection- show the superiority of ALENA in relation to the traditional methods that deal with populations of neural networks. SANE has been used in particular as a comparative referent due to its high performance. Eventually, conclusions and some future lines of work are presented.
Journal of Computer Science & Technology, 4(1), pp. 59-65