• Structural Engineering and Mechanics
• /
• 제15권1호
• /
• pp.39-52
• /
• 2003

A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.

• Journal of Power Electronics
• /
• 제18권3호
• /
• pp.841-852
• /
• 2018

This paper presents a dual-algorithm search method (GWO-GSO) combining grey wolf optimization (GWO) and golden-section optimization (GSO) to realize maximum power point tracking (MPPT) for photovoltaic (PV) systems. First, a modified grey wolf optimization (MGWO) is activated for the global search. In conventional GWO, wolf leaders possess the same impact on decision-making. In this paper, the decision weights of wolf leaders are automatically adjusted with hunting progression, which is conducive to accelerating hunting. At the later stage, the algorithm is switched to GSO for the local search, which play a critical role in avoiding unnecessary search and reducing the tracking time. Additionally, a novel restart judgment based on the quasi-slope of the power-voltage curve is introduced to enhance the reliability of MPPT systems. Simulation and experiment results demonstrate that the proposed algorithm can track the global maximum power point (MPP) swiftly and reliably with higher accuracy under various conditions.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.127-138
• /
• 1993

The Production Switching Heuristic (PSH) develope dby Mellichamp and Love (1978) has been suggested as a more realistic, practical and intuitively appealing approach to aggregate production planning (APP). In this researh, PSH has been modified to present a more sophisticated open grid search procedure for solving the APP problem. The effectiveness of this approach has been demonstrated by determining a better near-optimala solution to the classic paint factory problem. The performance of the modified production switching heuristic is then compared in the context of the paint factory problem with results obtained by other prominent APP models including LDR, PPP, and PSH to conclude that the modified PSH offers a better minimum cost solution than the original PSH model.

• Journal of Computing Science and Engineering
• /
• 제2권4호
• /
• pp.321-338
• /
• 2008

This paper presents a Modified Multiple Depth First Search algorithm for the exploration of the indoor environments occupied with obstacles in random distribution. The proposed algorithm was designed and implemented to employ one or a team of Khepera II mini robots for the exploration process. In case of multi-robots, the BlueCore2 External Bluetooth module was used to establish wireless networks with one master robot and one up to three slaves. Messages are sent and received via the module's Universal Asynchronous Receiver/Transmitter (UART) interface. Real exploration experiments were performed using locally developed teleworkbench with various autonomy features. In addition, computer simulation tool was also developed to simulate the exploration experiments with one master robot and one up to ten slaves. Computer simulations were in good agreement with the real experiments for the considered cases of one to one up to three networks. Results of the MMDFS for single robot exhibited 46% reduction in the needed number of steps for exploring environments with obstacles in comparison with other algorithms, namely the Ants algorithm and the original MDFS algorithm. This reduction reaches 71% whenever exploring open areas. Finally, results performed using multi-robots exhibited more reduction in the needed number of exploration steps.

• 한국멀티미디어학회논문지
• /
• 제17권3호
• /
• pp.333-341
• /
• 2014

다시점 비디오는 하나의 3차원 장면을 여러 시점에서 다수의 카메라로 촬영한 동영상으로 다시점 비디오 부호화는 카메라의 수에 비례하여 데이터의 양이 증가하기 때문에 계산량을 줄일 수 있는 다시점 비디오 부호화 기술이 필요하다. 본 논문에서 다시점 비디오의 부호화를 위한 움직임 추정의 계산량을 줄이면서 화질을 유지하는 움직임 추정 기법을 제안한다. 제안한 움직임 추정 기법은 움직임 벡터의 분포 특성을 이용한 효과적인 초기 종료 움직임 추정 기법이다. 제안한 움직임 추정기법은 계층적 움직임 추정 기법으로 다중 사각형 탐색 패턴, 래스터 탐색 패턴, 수정된 다이아몬드 탐색 패턴 그리고 작은 다이아몬드 탐색으로 이루어져있다. 제안한 기법의 성능은 JMVC의 고속 움직임 추정 기법인 TZ 탐색 기법과 전역 탐색 기법(FS)의 성능과 비교한 경우, 영상 화질과 비트량을 비슷하지만 움직임 추정 속도를 각각 약 1.7~4.5배, 90배 향상시킨다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• 대한토목학회논문집
• /
• 제43권3호
• /
• pp.321-335
• /
• 2023

자연하천에서의 유사량 계측은 하천공학적으로 중요한 의미를 가지지만 계측 방법의 비용 문제로 유사량 실측에 어려움이 따른다. 특히 소류사량 계측의 어려움으로 인해 주기적인 유사량 모니터링의 대부분이 부유사 농도 계측에만 제한되어 있는 실정이다. 본 연구에는 자동유량관측소에 설치된 횡방향 도플러 유속계(H-ADCP)의 후방산란값과 부유사 농도의 상관관계를 이용해 실시간으로 부유사 농도를 산정하고 총유사량을 산정하는 서포트벡터회귀 모형을 제안한다. 제안하는 실시간 총유사량 모니터링 시스템은 부유사 농도 모형과 수정 아인슈타인 방법을 모사하는 총유사량 산정 모형으로 구성된다. 각 모형의 매개변수와 입력변수는 K겹 교차검증 기반 격자검색 방법과 재귀적 특징 제거법을 이용해 결정되었다. 교차검증에서 부유사 농도 모형과 총유사량 산정 모형의 R²가 각각 0.885와 0.860으로 유사량-유량 관계곡선에 비해 정확한 것으로 나타났다. 시계열 유사량 관측을 통해 새로 제시되는 실시간 총유사량 관측 시스템이 자연하천에서 발달하는 유사량-유량 이력관계와 미세한 유량 변화에서 나타나는 유사량 변화를 성공적으로 관측할 수 있음을 확인했다. 본 연구에서 제안하는 방법은 마찰경사나 부유사 입도 등의 수리 조건을 가정할 필요 없이 H-ADCP의 원시자료만으로 부유사 농도와 총유사량을 산정할 수 있어 기존 방법에 비해 불확도가 적으며 경제적이다. 본 방법은 H-ADCP가 설치된 유사량 관측소에 광범위하게 적용 가능해 유사량 모니터링의 시간적 해상도를 경제적으로 크게 줄일 수 있을 것으로 기대된다.