A Hybrid Maximum Error Algorithm with Neighborhood Training for CMAC
نویسندگان
چکیده
In this paper, several possible algorithms and training methods for the CMAC network are analyzed thoroughly. Improvements are then examined and a Hybrid approach has been developed for the Maximum Error Algorithm by using the Neighborhood Training for the initial training period. The employment of the technique yielded faster initial convergence which is very important for many control applications. The proposed hybrid approach is demonstrated in an inverse kinematics problem of a two-link robot arm. Intex Terms: CMAC algorithms, Maximum error algorithm, Neighborhood training.
منابع مشابه
A Combine Algorithm for a Cmac Network
The performance of a CMAC neural network depends on the training algorithms and the selection of input points. Papers have been published that explain CMAC algorithms but little work has been done to improve existing algorithms. In this paper, the existing algorithms are first explained and then compared using computational results and the algorithm properties. Improvements are made to the reco...
متن کاملTwo Novel Learning Algorithms for CMAC Neural Network Based on Changeable Learning Rate
Cerebellar Model Articulation Controller Neural Network is a computational model of cerebellum which acts as a lookup table. The advantages of CMAC are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. In the training phase, the disadvantage of some CMAC models is unstable phenomenon...
متن کاملImproving the Generalization Capability of the Binary CMAC
This paper deals with some important questions of the binary CMAC neural networks. CMAC which belongs to the family of feed-forward networks with a single linear trainable layer has some attractive features. The most important ones are its extremely fast learning capability and the special architecture that lets e ective digital hardware implementation possible. Although the CMAC architecture w...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کامل