• 제목/요약/키워드: Hybrid Algorithms

검색결과 586건 처리시간 0.021초

Hybrid Particle-Mesh 방법에 적합한 다중영역 방법 (A MULTI-DOMAIN APPROACH FOR A HYBRID PARTICLE-MESH METHOD)

  • 이승재;서정천
    • 한국전산유체공학회지
    • /
    • 제19권2호
    • /
    • pp.72-78
    • /
    • 2014
  • A hybrid particle-mesh method as the combination between the Vortex-In-Cell (VIC) method and penalization method has been achieved in recent years. The VIC method, which is based on the vorticity-velocity formulation, offers particle-mesh algorithms to numerically simulate flows past a solid body. The penalization method is used to enforce boundary conditions at a body surface with a decoupling between body boundaries and computational grids. The main advantage of the hybrid particle-mesh method is an efficient implementation for solid boundaries of arbitrary complexity on Cartesian grids. However, a numerical simulation of flows in large domains is still not too easy. In this study, a multi-domain approach is thus proposed to further reduce computation cost and easily implement it. We validate the implementation by numerical simulations of an incompressible viscous flow around an impulsively started circular cylinder.

혼합 비주얼 서보잉을 통한 모바일 로봇의 물체 추종 (Objects Tracking of the Mobile Robot Using the Hybrid Visual Servoing)

  • 박강일;우창준;이장명
    • 제어로봇시스템학회논문지
    • /
    • 제21권8호
    • /
    • pp.781-787
    • /
    • 2015
  • This paper proposes a hybrid visual servoing algorithm for the object tracking by a mobile robot with the stereo camera. The mobile robot with the stereo camera performs an object recognition and object tracking using the SIFT and CAMSHIFT algorithms for the hybrid visual servoing. The CAMSHIFT algorithm using stereo camera images has been used to obtain the three-dimensional position and orientation of the mobile robot. With the hybrid visual servoing, a stable balance control has been realized by a control system which calculates a desired angle of the center of gravity whose location depends on variations of link rotation angles of the manipulator. A PID controller algorithm has adopted in this research for the control of the manipulator since the algorithm is simple to design and it does not require unnecessary complex dynamics. To demonstrate the control performance of the hybrid visual servoing, real experiments are performed using the mobile manipulator system developed for this research.

분류기 앙상블 선택을 위한 혼합 유전 알고리즘 (Hybrid Genetic Algorithm for Classifier Ensemble Selection)

  • 김영원;오일석
    • 정보처리학회논문지B
    • /
    • 제14B권5호
    • /
    • pp.369-376
    • /
    • 2007
  • 이 논문은 최적의 분류기 앙상블 선택을 위한 혼합 유전 알고리즘을 제안한다. 혼합 유전 알고리즘은 단순 유전알고리즘의 미세 조정력을 보완하기 위해 지역 탐색 연산을 추가한 것이다. 혼합 유전 알고리즘의 우수성을 입증하기 위해 단순 유전 알고리즘과 혼합 유전 알고리즘 각각을 비교 실험하였다. 또한 혼합 유전 알고리즘의 지역 탐색 연산으로 두 가지 방법(SSO: 순차 탐색 연산, CSO: 조합 탐색 연산)을 제안한다. 비교 실험 결과는 혼합 유전 알고리즘이 단순 유전 알고리즘에 비해 해를 탐색하는 능력이 우수하였다. 또한 분류기들의 상관관계를 고려한 CSO 방법이 SSO 방법보다 더 우수하였다.

Gen2-Based Tag Anti-collision Algorithms Using Chebyshev's Inequality and Adjustable Frame Size

  • Fan, Xiao;Song, In-Chan;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub;Pyo, Cheol-Sig;Chae, Jong-Suk
    • ETRI Journal
    • /
    • 제30권5호
    • /
    • pp.653-662
    • /
    • 2008
  • Arbitration of tag collision is a significant issue for fast tag identification in RFID systems. A good tag anti-collision algorithm can reduce collisions and increase the efficiency of tag identification. EPCglobal Generation-2 (Gen2) for passive RFID systems uses probabilistic slotted ALOHA with a Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. In this paper, we analyze the performance of the Q algorithm used in Gen2, and analyze the methods for estimating the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose new tag anti-collision algorithms, namely, Chebyshev's inequality, fixed adjustable framed Q, adaptive adjustable framed Q, and hybrid Q. The simulation results show that all the proposed algorithms outperform the conventional Q algorithm used in Gen2. Of all the proposed algorithms, AAFQ provides the best performance in terms of identification time and collision ratio and maximizes throughput and system efficiency. However, there is a tradeoff of complexity and performance between the CHI and AAFQ algorithms.

  • PDF

인터넷 기반 가상 디자인 스튜디오에서 하이브리드 건축 협업 설계 방법론에 관한 연구 (An Internet-based Hybrid Design Methodology for Collaborative Virtual Design Studio)

  • 박재완;최진원
    • 한국실내디자인학회논문집
    • /
    • 제40호
    • /
    • pp.158-164
    • /
    • 2003
  • The rapid development of information technology has much influence on architectural design. Collaboration beyond time and space has been possible by networking the work environment and digital products. Thus, the virtual design studio on architectural design is getting more important than ever before. This research investigates a virtual design studio methodology for effective collaboration. The building design process and the communication model are studied and possible modes of design collaboration are defined. This paper proposes an internet-based Virtual Reality(VR) communication tool as well as new design methodology that we call the 'Hybrid Design Methodology'. We expect that this design methodology will dramatically increase design feedbacks, and thus results in better design alternatives. There are two issues involved in developing the collaborative virtual design studio: 1) an intuitive interface that presents collaborative relations, and 2) three-dimensional computer-mediated communication tool using sketch as a modeling method. Further research issues identified at the end of the research include developing algorithms that translate mapping images to polygons for the drafting phase in the design process.

2차부재가 포함된 다수의 1차부재를 가공하기 위한 레이저 토치의 절단경로 최적화 알고리즘 (An Algorithm for Generating an Optimal Laser-Torch Path to Cut Multiple Parts with Their Own Set of Sub-Parts Inside)

  • 권기범;이문규
    • 제어로봇시스템학회논문지
    • /
    • 제11권9호
    • /
    • pp.802-809
    • /
    • 2005
  • A hybrid genetic algorithm is proposed for the problem of generating laser torch paths to cut a stock plate nested with free-formed parts each having a set of sub-parts. In the problem, the total unproductive travel distance of the torch is minimized. The problem is shown to be formulated as a special case of the standard travelling salesman problem. The hybrid genetic algorithm for solving the problem is hierarchically structured: First, it uses a genetic algorithm to find the cutting path f3r the parts and then, based on the obtained cutting path, sequence of sub-parts and their piercing locations are optimally determined by using a combined genetic and heuristic algorithms. This process is repeated until any progress in the total unproductive travel distance is not achieved. Computational results are provided to illustrate the validity of the proposed algorithm.

반도체 Wafer Fabrication 공정에서의 생산일정계획 (Production Scheduling in Semiconductor Wafer Fabrication Process)

  • 이군희;홍유신;김수영
    • 대한산업공학회지
    • /
    • 제21권3호
    • /
    • pp.357-369
    • /
    • 1995
  • Wafer fabrication process is the most important and critical process in semiconductor manufacturing. The process is very complicated and hard to establish an efficient schedule due to its complexity. Furthermore, several performance indices such as due dates, throughput, cycle time and workstation utilizations are to be considered simultaneously for an efficient schedule, and some of these indices have negative correlations in performances each other. We develop an efficient heuristic scheduling algorithm; Hybrid Input Control Policy and Hybrid Dispatching Rule. Through numerical experiments, it is shown that the proposed Hybrid Scheduling Algorithm gives better performance compared with existing algorithms.

  • PDF

Reliability Optimization Problems using Adaptive Hybrid Genetic Algorithms

  • Minoru Mukuda;Yun, Young-Su;Mitsuo Gen
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.179-182
    • /
    • 2003
  • This paper proposes an adaptive hybrid genetic algorithm (aHGA) for effectively solving the complex reliability optimization problems. The proposed aHGA uses a loca1 search technique and an adaptive scheme for respectively constructing hybrid algorithm and adaptive ability. For more various comparisons with the proposed adaptive algorithm, other aHGAs with conventional adaptive schemes are considered. These aHGAs are tested and analyzed using two complex reliability optimization problems. Numerical result shows that the proposed aHGA outperforms the other competing aHGAs.

  • PDF

순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교 (Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems)

  • 임동순
    • 산업경영시스템학회지
    • /
    • 제33권4호
    • /
    • pp.58-68
    • /
    • 2010
  • Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

퍼지로직제어에 의해 강화된 혼합유전 알고리듬 (Hybrid Genetic Algorithm Reinforced by Fuzzy Logic Controller)

  • 윤영수
    • 대한산업공학회지
    • /
    • 제28권1호
    • /
    • pp.76-86
    • /
    • 2002
  • In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.