• Title/Summary/Keyword: $A^*$ search algorithm

Search Result 3,553, Processing Time 0.034 seconds

Selection of Optimal Machinery Systems by the Sizes of the Mechanized Farming Group (기계화(機械化) 영농단(營農團)의 규모별 적정기종(適正機種) 선정 연구)

  • Chang, D.I.;Kim, S.R.;Jung, D.H.
    • Journal of Biosystems Engineering
    • /
    • v.15 no.3
    • /
    • pp.244-256
    • /
    • 1990
  • This study was conducted to select the optimal machinery systems for the Mechanized Farming Groups (MFG) by their sizes. In order to achieve the objective, a survey and systems analysis were taken for 50 MFG of Chungnam province. Then a mathematical model was developed. Based on it, a computer program (MFSDINGP) was developed by the Iterative Nonlinear Goal Programming (INGP) and Hooke & Jeeves pattern search algorithm. Using MFSDINGP, optimal machinery systems were selected and presented with annual costs of machinery for the sizes of 5-40 ha of MFG.

  • PDF

An EMG Signals Classification using Hybrid HMM and MLP Classifier with Genetic Algorithms (유전 알고리즘이 결합된 MLP와 HMM 합성 분류기를 이용한 근전도 신호 인식 기법)

  • 정정수;권장우;류길수
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.48-57
    • /
    • 2003
  • This paper describes an approach for classifying myoelectric patterns using a multilayer perceptrons (MLP's) with genetic algorithm and hidden Markov models (HMM's) hybrid classifier. Genetic Algorithms play a role of selecting Multilayer Perceptron's optimized initial connection weights by its typical global search. The dynamic aspects of EMG are important for tasks such as continuous prosthetic control or various time length EMG signal recognition, which have not been successfully mastered by the most neural approaches. It is known that the hidden Markov model (HMM) is suitable for modeling temporal patterns. In contrast, the multilayer feedforward networks are suitable for static patterns. And, a lot of investigators have shown that the HMM's to be an excellent tool for handling the dynamical problems. Considering these facts, we suggest the combination of ANN and HMM algorithms that might lead to further improved EMG recognition systems.

  • PDF

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

The configuration Optimization of Truss Structure (트러스 구조물의 형상최적화에 관한 연구)

  • Lim, Youn Su;Choi, Byoung Han;Lee, Gyu Won
    • Journal of Korean Society of Steel Construction
    • /
    • v.16 no.1 s.68
    • /
    • pp.123-134
    • /
    • 2004
  • In this research, a multilevel decomposition technique to enhance the efficiency of the configuration optimization of truss structures was proposed. On the first level, the nonlinear programming problem was formulated considering cross-sectional areas as design variables, weight, or volume as objective function and behavior under multiloading condition as design constraint. Said nonlinear programming problem was transformed into a sequential linear programming problem. which was effective in calculation through the approximation of member forces using behavior space approach. Such approach has proven to be efficient in sensitivity analysis and different form existing shape optimization studies. The modified method of feasible direction (MMFD) was used for the optimization process. On the second level, by treating only shape design variables, the optimum problem was transformed into and unconstrained optimal design problem. A unidirectional search technique was used. As numerical examples, some truss structures were applied to illustrate the applicability. and validity of the formulated algorithm.

A Smart Set-Pruning Trie for Packet Classification (패킷 분류를 위한 스마트 셋-프루닝 트라이)

  • Min, Seh-Won;Lee, Na-Ra;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1285-1296
    • /
    • 2011
  • Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.

Case Studies on Planning and Learning for Large-Scale CGFs with POMDPs through Counterfire and Mechanized Infantry Scenarios (대화력전 및 기계화 보병 시나리오를 통한 대규모 가상군의 POMDP 행동계획 및 학습 사례연구)

  • Lee, Jongmin;Hong, Jungpyo;Park, Jaeyoung;Lee, Kanghoon;Kim, Kee-Eung;Moon, Il-Chul;Park, Jae-Hyun
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.6
    • /
    • pp.343-349
    • /
    • 2017
  • Combat modeling and simulation (M&S) of large-scale computer generated forces (CGFs) enables the development of even the most sophisticated strategy of combat warfare and the efficient facilitation of a comprehensive simulation of the upcoming battle. The DEVS-POMDP framework is proposed where the DEVS framework describing the explicit behavior rules in military doctrines, and POMDP model describing the autonomous behavior of the CGFs are hierarchically combined to capture the complexity of realistic world combat modeling and simulation. However, it has previously been well documented that computing the optimal policy of a POMDP model is computationally demanding. In this paper, we show that not only can the performance of CGFs be improved by an efficient POMDP tree search algorithm but CGFs are also able to conveniently learn the behavior model of the enemy through case studies in the scenario of counterfire warfare and the scenario of a mechanized infantry brigade's offensive operations.

Improved 3D Shape Measurement Scheme for White Light Phase Shifting Interferometry (백색광 위상천이 간섭계를 위한 개선된 삼차원 형상 측정 방법)

  • Kim, Kyoung-Il;Lee, Dong-Yeol;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.51-60
    • /
    • 2010
  • This paper proposes a new scheme to obtain enhanced 3D shape information rapidly for WLPSI(White Light Phase Shifting Interferometry). WLPSI is a convenient method to measure the height of the micro products. First we propose an effective method of limiting search interval for detecting the peak of the visibility function in order to obtain 3D shpae information rapidly. Second we propose an automatic base level decision method basad on image processing and a correction algorithm using the least square approximation method to overcome the global tilt problem of the conventional WLPSI algorithms. Third we propose an adaptive filtering method to remove the distortion known as bat-wing effect which appears near the step discontinuity. Experimental results show that the proposed overall technique is fast and provides more enhanced 3D shape information compared with the conventional WLPSI algorithms.

A Study for the Minimum Weight Design of a Coastal Fishing Boat (소형 연안 어선의 최소 중량 설계에 관한 연구)

  • Song, Ha-Cheol;Kim, Yong-Sub;Shim, Chun-Sik
    • Journal of Navigation and Port Research
    • /
    • v.32 no.3
    • /
    • pp.223-228
    • /
    • 2008
  • As most of small fishing boats made of FRP have been constructed by experience in Korea, some structural safety problems have been occurred occasionally. To improve the structural strength and reduce the costs for construction and operation, optimum design for small fishing boat was carried out in this study. The weight of fishing boat and the main dimensions of structural members are chosen as objective function and design variables, respectively. By the combination of global and local search methods, a hybrid optimization algorithm was developed to escape the local minima and reduce CPU time in analysis procedure, and finite element analysis was performed to determine the constraint parameters at each iteration step in optimization loop. Optimization results were compared with the real existing fishing boat, and the effects of optimum design were examined from points of view; structural strength, material cost, etc.

Improved Shape Extraction Using Inward and Outward Curve Evolution (양방향 곡선 전개를 이용한 개선된 형태 추출)

  • Kim Ha-Hyoung;Kim Seong-Kon;Kim Doo-Young
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.1
    • /
    • pp.23-31
    • /
    • 2000
  • Iterative curve evolution techniques are powerful methods for image segmentation. Classical methods proposed curve evolutions which guarantee close contours at convergence and, combined with the level set method, they easily handled curve topology changes. In this paper, we present a new geometric active contour model based on level set methods introduced by Osher & Sethian for detection of object boundaries or shape and we adopt anisotropic diffusion filtering method for removing noise from original image. Classical methods allow only one-way curve evolutions : shrinking or expanding of the curve. Thus, the initial curve must encircle all the objects to be segmented or several curves must be used, each one totally inside one object. But our method allows a two-way curve evolution : parts of the curve evolve in the outward direction while others evolve in the inward direction. It offers much more freedom in the initial curve position than with a classical geodesic search method. Our algorithm performs accurate and precise segmentations from noisy images with complex objects(jncluding sharp angles, deep concavities or holes), Besides it easily handled curve topology changes. In order to minimize the processing time, we use the narrow band method which allows us to perform calculations in the neighborhood of the contour and not in the whole image.

  • PDF

Representative Feature Extraction of Objects using VQ and Its Application to Content-based Image Retrieval (VQ를 이용한 영상의 객체 특징 추출과 이를 이용한 내용 기반 영상 검색)

  • Jang, Dong-Sik;Jung, Seh-Hwan;Yoo, Hun-Woo;Sohn, Yong--Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.724-732
    • /
    • 2001
  • In this paper, a new method of feature extraction of major objects to represent an image using Vector Quantization(VQ) is proposed. The principal features of the image, which are used in a content-based image retrieval system, are color, texture, shape and spatial positions of objects. The representative color and texture features are extracted from the given image using VQ(Vector Quantization) clustering algorithm with a general feature extraction method of color and texture. Since these are used for content-based image retrieval and searched by objects, it is possible to search and retrieve some desirable images regardless of the position, rotation and size of objects. The experimental results show that the representative feature extraction time is much reduced by using VQ, and the highest retrieval rate is given as the weighted values of color and texture are set to 0.5 and 0.5, respectively, and the proposed method provides up to 90% precision and recall rate for 'person'query images.

  • PDF