• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2000.11a
• /
• pp.36-41
• /
• 2000

• Proceedings of the Korean Society of Rural Planning Conference
• /
• 1997.03a
• /
• pp.30-32
• /
• 1997

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.12
• /
• pp.995-1006
• /
• 1989

If robots have the ability to track the parts on a moving conveyor belt, the efficiency of the manipulation tasks will be increased. This paper presents a motion planning algorithm for conveyor tracking. Tracking trajectory of a robot manipulator is determined by belt speed, initial part position, and initial robot position. Torque limit, maximum velocity, maximum acceleration and maximum jerk are also taken into account. To obtain the tracking solution, the problem is converted to the linear quadratic tracking problem. We describe the manipulator dynamics as second order state equation using parametric functions. Constraints on torques and smoothness are converted to those on input and state variables. The solution of the state equation which minimizes the performance index is obtained by dynamic programming method. Numerical examples are then presented to demonstrate the utility of the motion planning method developed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.383-386
• /
• 2004

급변하는 시장환경으로 인한 제조의 복잡성과 동적 특성의 증대로 인해 기업은 재공품의 감소, 납기일 준수를 위한 기술적 방법의 개발과 조화의 중요성을 인식하고 있다. 이에 기존에 사용하고 있는 MRP, JIT의 생산계획 및 통제 방식은 적용하는 데 있어 단점을 지니고 있다. 이에 최근 각광 받고 있는 TOC의 DBR 방식을 이해하고 기존 생산시스템(MRP, JIT)의 단점을 극복하고 동적인 생산환경에서도 효율적으로 생산 가능한 유연한 생산 스케줄링 모델을 개발하고자 한다. 개발된 생산 스케줄링 모델은 동적인 제조환경에서 효율적이고 유연한 생산 계획 및 통제 시스템이 될 것이며, 비용절감과 함께 기업의 생산성을 향상시킬 것이다. 또한, 이런 유연 생산 스케줄링을 증명하기 위해 프로토타입을 통해 그 효과를 증명하여 보기로 한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.760-771
• /
• 1995

생산시스템에서의 스케쥴링에 관한 연구는 단일기계작업 스케쥴링으로부터 유연생산시스템(FMS)에 이르기까지 매우 광범위하게 이루어져 왔으며, 정수계획법, 동적계획법, Branch and Bound, PERT/CPM, 그리고 기타의 휴리스틱 기법등 많은 연구결과를 찾아볼수 있다. 그러나, 대부분의 연구는 소규모의 문제를 대상으로 이루어진 것으로 대규모의 현실세계 문제를 풀기에는 부적절한 것으로 판명되었다. 또한, 적용이 가능한 휴리스틱(Heuristic) 기법들도 현실세계와는 맞지 않는 많은 가정하에서 주어진 목적함수를 극대화하도록 개발되었기 때문에 현실적인 문제를 풀기 위해서는 각종 가정을 완화시킴으로써 휴리스틱을 현실에 적용하기 위한 또 다른 연구가 필요하게 되었다. 따라서, 이 연구에서는 새로운 휴리스틱을 개발하기보다는 기존의 휴리스틱 기법을 그대로 이용하면서 현실세계의 문제에서 발생하는 동적(dynamic) 스케쥴링과 재스케쥴링(rescheduling) 문제를 해결하는 시스템을 설계, 구현하는데 초점을 맞추고 있다. 특히, 데이터베이스 접근법을 사용함으로써, 가용자원의 수가 증감하거나 새로운 작업이 추가되는 등 기존의 가정을 상당부분 완화시킨 동적스케듈링 환경하에서도 재스케쥴링이 가능한 동적 재스케쥴링(dynamic rescheduling)시스템을 설계, 구현하였으며, 이의 세부기능을 보완하는 작업이 계속되고 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.753-757
• /
• 2008

In this paper, we propose a new scheduling strategy for dynamic programming in Grid environment. The key idea of this scheme is to reduce the execution time of a job by dividing the dynamic table based on the locality of table and allocating jobs to nodes which minimize network latency. This scheme obtains optimal concurrency by constructing the dynamic table using a distributed top down method. Through simulation, we show that the proposed Grid strategy improves the performance of Grid environment compared to previous branch-bound strategies.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.493-496
• /
• 2007

그리드 컴퓨팅은 방대한 데이터 저장 공간과 고성능 연산능력을 요구하는 작업에 적합하다. 동적계획법(dynamic programming)은 방대한 크기의 동적 테이블(dynamic table)을 구성하여 최적해(optimal solution)을 찾기 때문에 그리드에서 수행하기에 적합한 작업이다. 본 논문에서는 동적 테이블을 구성하고 분산 배치하는 할당 정책을 제안한다. 그리고 동적계획법 기반의 어플리케이션을 그리드에서 효율적으로 수행할 수 있는 그리드 시스템 구조를 제안한다.

• Journal of Navigation and Port Research
• /
• v.35 no.3
• /
• pp.235-241
• /
• 2011

The shuttle that currently connects Busan New Port to the logistics companies in the Hinterland has the following companies: first, resources are consumed redundantly as each logistics company has independent transport vehicles. Second, the companies are not taking advantage of geographical merits of clustered complexes because different vehicles are used each time due to irregular schedules. In this respect, this study had the following purposes to realize these solutions: first, heuristic approach was made for operation scheduling and real-time operating rules to configure the best possible dynamic plan. Second, the reduction of consumption of resources with the shuttle and the efficiency were examined through a simulation of pooling and dual cycling applied to logistics companies' shipping plans.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2000.06a
• /
• pp.93-105
• /
• 2000

GIS is a powerful toolbox in managing spatial data associated with attribute data. However GIS is short of spatial analysis function and graphic user interface(GUI) function in dealing with dynamic planning problems. Decision Support Systems(DSS) make up for the shortage of GIS by providing GUI function, modeling function and database function. Spatial Decision Support Systems(SDSS), a new kind of DSS, incorporate display function, basic spatial analysis function and manipulation function of spatial data and attribute data of GIS and GUI function, modeling function and database function of DSS in dealing with spatial planning problems. Planning Support Systems(PSS) add more advanced spatial analysis function and intertemporal function to the functions of SDSS. This study focuses on the modeling of a PSS for capacity expansion of water-distribution network depending upon land use planning by using GIS, value engineering(VE) and life cycle costing(LCC). The PSS shows a guideline about the investment of water-distribution networks related to urban growth management through generating certain numbers of dynamic alternatives to supply the amount of water caused by land use planning.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.123-137
• /
• 2004

The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.