Finding multiple local minima using chaotic jump

In this paper, the local minima free search algorithm using chaos is proposed for an unstructured search space. The problem is that given the quality function, find the value of a configuration that minimizes the quality function. The proposed algorithm started basically from the gradient search technique but at the prescribed points, that is, local minimum points, which are to be automatically detected the chaotic jump is introduced by the dynamics of a chaotic neuron. Chaotic motions are mainly because of the Gaussian function having a hysteresis as a refractoriness. In order to enhance the probability of finding the global minimum, a parallel search strategy is also given. The validity of the proposed method will be verified in simulation examples of the function minimization problem and the motion planning problem of a mobile robot.
Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
Issue Date
1998-03
Language
ENG
Keywords

NEURAL NETWORKS

Citation

INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS, v.7, no.1, pp.105 - 115

ISSN
0218-8430
URI
http://hdl.handle.net/10203/74751
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 154
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0