• 한국인터넷방송통신학회논문지
• /
• 제21권4호
• /
• pp.177-182
• /
• 2021

다양한 원재료를 혼합하여 원하는 성분 함유량을 가진 제품을 최소의 비용으로 생산하는 혼합 최적화 문제에 대해 일반적으로 O(n⁴)의 수행 복잡도의 선형계획법을 적용하고 있다. 본 논문에서는 이 문제에 대해 O(n log n)복잡도로 해를 얻을 수 있는 휴리스틱 알고리즘을 제안한다. 제안된 알고리즘은 합금 강판에서 요구하는 성분들의 함유량 범위를 충족시키면서 최소의 원자재비용을 얻기 위해, 원재료 단가 오름차순으로 성분별 함유량을 충족시키도록 원재료 양을 결정하였다. 3가지 사례에 대해 적용한 결과 제안된 알고리즘은 O(n log n)복잡도로 단순한 결정기법을 적용하였음에도 불구하고, LP의 최적화 기법과 동일하거나 보다 좋은 해를 얻을 수 있었다.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.319-327
• /
• 2022

Robots for construction sites, although not deeply widespread, are finding applications in the duties of project monitoring, material movement, documentation, security, and simple repetitive construction-related tasks. A significant shortcoming in the use of robots is the complexity involved in programming and re-programming an automation routine. Robotic programming is not an expected skill set of the traditional construction industry professional. Therefore, this research seeks to deliver a low-cost approach toward re-programming that does not involve a programmer's skill set. The researchers in this study examined an approach toward programming a terrestrial-based drone so that it follows a taped path. By doing so, if an alternative path is required, programmers would not be needed to re-program any part of the automated routine. Changing the path of the drone simply requires removing the tape and placing a different path - ideally simplifying the process and quickly allowing practitioners to implement a new automated routine. Python programming scripts were used with a DJI Robomaster EP Core drone, and a terrain navigation assessment was conducted. The study examined the pass/fail rates for a series of trial run over different terrains. The analysis of this data along with video recording for each trial run allowed the researchers to conclude that the accuracy of the tape follow technique was predictable on each of the terrain surfaces. The accuracy and predictability inform a non-coding construction practitioner of the optimal placement of the taped path. This paper further presents limitations and suggestions for some possible extended research options for this study.

• 한국컴퓨터정보학회논문지
• /
• 제20권4호
• /
• pp.111-117
• /
• 2015

시험 일정 계획 수립 문제는 정확한 해를 다항시간으로 구하는 알고리즘이 알려져 있지 않은 NP-완전이다. 이 문제에 대해, Gu${\acute{e}}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 O(m) 복잡도의 채색 수 알고리즘을 제안하였다. 제안된 방법은 원 데이터를 교과목에 대한 부적합성 행렬과 그래프로 변환시켰다. 다음으로, 부적합성 제약조건을 충족하면서 최소의 시간으로 시험을 치루기 위해, 최소 차수 정점(교과목)부터 인접하지 않은 정점들을 $C_i$ 색으로 배정하여 $B_i$ 상자에 채웠다. 실험 결과, 제안된 알고리즘은 시험 일정 계획 수립 문제에 대해 선형계획법의 $O(m^4)$를 O(m)으로 단축시키면서도 동일한 해를 얻었다.

• 한국컴퓨터정보학회논문지
• /
• 제19권12호
• /
• pp.171-175
• /
• 2014

NP-완전인 상자 포장 문제의 일종인 사탕수수 설탕 생산 문제에 대해, Gu$\acute{e}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 사탕수수 설탕 생산 문제는 다항시간으로 해를 찾아가는 규칙이 존재한다는 가정하에, 최대 손실량을 가진 로트를 우선 생산하는 탐욕 규칙인 O(mlogm)의 다항시간 복잡도로 해를 구할 수 있는 알고리즘을 제안하였다. 제안된 방법은 설탕 함유량 손실 기울기를 내림차순으로 정렬한 후, 해당 슬롯 생산능력의 로트들을 선택하는 방법과 해당 슬롯에서 수명을 다하는 로트들과 마지막으로 선택된 로트들과 교환하는 방법을 적용하였다. 실험 결과, 제안된 알고리즘은 사탕수수 설탕 생산 문제에 대해 선형계획법의 $O(m^4)$를 O(mlogm) 으로 단축시키면서도 보다 좋은 결과를 얻었다.

• 한국국방경영분석학회지
• /
• 제16권2호
• /
• pp.56-74
• /
• 1990

Programming-in-the-Large refers to software development environment and includes the organization and representation of a system structure, module decomposition, component dependence analysis, seperate compilation, subsystem and composition identification. The most intricate problem in this environment is the mastery of the structural complexity of large software systems. Ada programming language is tailored to the needs for building of large, integrated software systems from many program units. The visibility graph generating model presented in this paper transforms Ada source program into a visibility graph with nodes for program units and edges for visibility relations among program units. The system description in terms of program units and their visibility relations produced by this model can be utilized for some apects of Programming-in-the-Large environment and also assists designeers, programmers, integrators and maintainers in defining, understanding and exploring the structure of evolving software systems. The model designed and implemented in Ada programming language runs on PCs and will remain useful both in practice and as experimental tool.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.36.6-36
• /
• 2001

The problem of robot navigation and control is a complex task. Its complexity and characteristics depends on the characteristics of the environment robot inhabits, robot construction (mechanical abilities to move, sense) and the job the robot is supposed to do. In this paper we propose a hybrid programming approach to mobile robot navigation and control in an indoor environment. In our approach we used declarative, procedural, and object oriented programming paradigms and we utilized some advantages of our distributed computing architecture. The programming languages corresponding to the paradigms we used were C, C++ and Prolog. In the paper we present some details of our mobile robot hardware and software structure, focusing on the software design and implementation.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.208.1-212
• /
• 1997

In this paper, a computer simulation tool for evaluting integrated engine/transmission control system using MATLAB/SIMULINK is investigated. Since a modular programming technique based upon the object-oriented programming is used in the paper, the simulation tool developed reduces the burden of model complexity by dividing engine/transmission systems into hierarchical subsystem. Furthermore, it also provides user -friendly, reusable, and upgradable characteristics of the system. The simulation tool could be useful to the automotive engineers who frequently change models and develop new systems in the automotive powertrain and control area.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.252-255
• /
• 1999

Feed rate in the fed-batch reactor is the most important control variable in optimizing the reactor performance. Exact solution can be obtained only for limited cases of simple reactor. The complexity of the model equations makes it extremely difficult to solve fur the general class of system models. Evolutionary programming method is proposed to get the information of the profile types, and the final profile is calculated by that information. The modified evolutionary programming method is used to get the more optimal profiles and it is demonstrated that proposed method can solve a wide range of optimal control problems.

• 한국경영과학회지
• /
• 제11권2호
• /
• pp.88-100
• /
• 1986

The focus of this paper is to develop the optimization procedures and analyze the complexities of the nonserial diverging branch systems in Dynamic Programming. The optimization procedure of the system is developed such that it helps to reduce the computational demands of the system. The complexity of the network is analyzed with the increasing number of nodes, branches and their connectedness to the main serial system. Determination of the optimal set of nodes for the main serial chain is also investigated.