• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.21-26
• /
• 2005

A routing algorithm using the Hopfield Neural Netork (HNN) is proposed in this paper. The proposed algorithm modifies the energy function for achieving the optimality of the solution and higher convergence rate. Experimental results show that the proposed algorithm outperforms convensional methods both in optimality and convergence.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.157-163
• /
• 1998

A neural network structure able to perform the operations of analogue and binary addition is proposed. The network employs Hopfield' model of a neuron with the connection elements specified on the basis of an analysis of the energy function. Simulation using NMOS neurons has shown convergence predominantly to the correct global minima.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.247-251
• /
• 1990

Hopfield neural network has been applied to the problem of economic load dispatching of electric power(ELD). The optimum values of neuron potentials are represented in terms of large numbers. And the neuron potential converges to the medium values between the limit values of the sigmoid function. In three cases, ELD based upon Hopfield network is formulated, solved and discussed.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.189-192
• /
• 1991

This paper presents a modular structure design of analog Hopfield neural network. Each multiplier consists of four MOS transistors which are connected to an op-amp at the front end of a neuron. A pair of MOS transistor is used in order to maintain linear operation of the synapse and can produce positive or negative synaptic weight. This architecture can be expandable to any size neural network by forming tree structure. By altering the connections, other nework paradigms can also be implemented using this basic modules. The stength of this approach is the expandability and the general applicability. The layout design of a four-neuron fully connected feedback neural network is presented and is simulated using SPICE. The network shows correct retrival of distorted patterns.

• Structural Engineering and Mechanics
• /
• v.7 no.5
• /
• pp.485-502
• /
• 1999

Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1095-1098
• /
• 1993

This paper presents linear programming neural networks for job-shop scheduling. The starting times of tasks and constraints are formulated as the linear programming problem. A modified Hopfield neural network is proposed for solving job-shop scheduling.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1E
• /
• pp.55-63
• /
• 1994

A decision-theretic concept is introduced to investigate whether targets of interest in array sensor systems are present at some steering direction or not. The solutions to this problem are described as a set of discrete numbers 0 or 1 corresponding to the direction under consideration. This coded number representation is transplanted in the optimisation technique based on the Hopfield neural network, which may provide an easy understanding of determining the direction of arrival (DOA) of sources. Difficulties encountered in using the conventional state schemes of Hopfield neural network models are addressed and their related issues are raised. To deal with them, an idea that a neuron that decreases more energy difference for its state change of 0 to 1can have higher priority in the order of state transition than others is introduced. This does not only lead to an new state update scheme but also opens a different story in comparison to previous work. To cast the perspectives of the proposed approach and illustrate its effectiveness in source direction finding in array sensor system. simulation results and related discussions are presented in this paper.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1576-1583
• /
• 1989

In this paper, we describe real-time optical implementation of the Hopfield neural network model for two-dimensional associative memory by using commercial LCTV and Multifocus For real-time processing capability, we use LCTV as a memory mask and a input spatial light modulator. Inner product between input pattern and memory matrix is processed by the multifocus holographic lens. The output signal is then electrically thresholded fed back to the system input by 2-D CCD camera. From the good experimental results, the proposed system can be applied to pattern recognition and machine vision in future.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.726-730
• /
• 1990

In this paper, assuming that local range information is available, a collision-free path planning algorithm for multiple mobile robots is presented by using Hopfield neural optimization network. The energy function of the network is built using the present position and the goal position of each robot as well as its local range information. The proposed algorithm has several advantages such as the effective passing around obstacles with the directional safety distance, the easy implementation of robot motion planning including its rotation, the real-time path planning capability from the totally localized computations of path for each robot, and the adaptivity on arbitrary environment since any special shape of obstacles is not assumed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.169.5-169
• /
• 2001

This study proposes a neural network for solving optimization problems such as the TSP (Travelling Salesman Problem), scheduling, and line balancing. The Hopfield network has been used for solving such problems, but it frequently gives abnormal solutions or non-optimal ones. Moreover, the Hopfield network takes much time especially in solving large size problems. To overcome such disadvantages, this study adopts nodes whose outputs changes with a fixed value at every evolution. The proposed network is applied to solving a TSP, finding the shortest path for visiting all the cities, each of which is visted only once. Here, the travelling path is reflected to the energy function of the network. The proposed network evolves to globally minimize the energy function, and a ...