• 대한전자공학회논문지
• /
• 제27권9호
• /
• pp.1364-1371
• /
• 1990

We propose a time-optimal path planning scheme for the robot manipulator using Hopfield neural network. The time-optimal path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural networke technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using a PUMA 560 manipulator.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 춘계학술대회 학술발표 논문집 제15권 제1호
• /
• pp.161-165
• /
• 2005

최적 교통 주기를 산출하기 위해서는 하위교차로에 대기차량이 얼마나 있는지를 점검해야 한다. 왜냐하면 대기차량이 상위교차로의 길이보다 크면 출발 지연 시간 및 승용차 대기시간이 발생하기 때문이다. 승용차 대기시간을 단축시키기 위해서 본 논문에서는 퍼지 신경망을 이용한 최적 연동 녹색시간 알고리즘을 제안한다. 컴퓨터 모의실험을 통해서, 서로 다른 교차로 조건을 고려하지 않은 고정 교통신호등 보다 평균 주행속도가 향상 된 것을 입증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

• 디지털산업정보학회논문지
• /
• 제6권2호
• /
• pp.183-191
• /
• 2010

Decision problem called an optimal release policies, after testing a software system in development phase and transfer it to the user, is studied. The applied model of release time exploited infinite non-homogeneous Poisson process. This infinite non-homogeneous Poisson process is a model which reflects the possibility of introducing new faults when correcting or modifying the software. The failure life-cycle distribution used mixture which has various intensity, if the system is complicated. Thus, software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement becomes an optimal release policies. In a numerical example, after trend test applied and estimated the parameters using maximum likelihood estimation of inter-failure time data, estimated software optimal release time.

• Journal of Construction Engineering and Project Management
• /
• 제4권4호
• /
• pp.33-40
• /
• 2014

Maximizing the profitability and minimizing the duration of construction projects in extreme weather regions is a challenging objective that is essential for project success. An optimization model is presented herein for the time-profit trade-off analysis of construction projects under extreme weather conditions. The model generates optimal/near optimal schedules that maximize profit and minimize the duration of construction projects in extreme weather regions. The computations in the model are organized into: (1) a scheduling module that develops practical schedules for construction projects, (2) a profit module that computes project costs (direct, indirect, and total) and project profit, and (3) a multi-objective module that determines optimal/near optimal trade-offs between project duration and profit. One example is used to show the impact of extreme weather on construction time and profit. Another example is used to show the model's ability to generate optimal trade-offs between the time and profit of construction projects under extreme weather conditions.

• 설비공학논문집
• /
• 제20권10호
• /
• pp.702-709
• /
• 2008

In this paper, the optimal thermal storage time of an air-conditioning system with slab thermal storage in office building was analyzed on the basis of the gradient method algorithm. The sum of room temperature deviation and heat extraction rate was set to the criterion function. It was calculated that four hours is the optimal thermal storage time under the standard evaluation criterion. Furthermore, some case studies were executed by controlling ratio of weight functions of room temperature deviation and heat extraction rate in criterion function. It is possible to design many kinds of optimal operation of an air-conditioning system with slab thermal storage by controlling ratio of the weight functions in criterion function.

• 대한교통학회지
• /
• 제13권3호
• /
• pp.67-86
• /
• 1995

It requires the detector system which can collect highly reliable traffic data in order to perform the real-time traffic signal control. This study is to decide the optimal shape of inductive loop for the real-time traffic signal control .This loop is located at the stopline in the signalized intersection for DS(Degree of Saturation) control. In order to find out the optimal shape of loop, 6types of experiments were performed . The results of the basic experiments of loops are as follows ; -the optimal number of turns for loop is 3 turns. -the impedance values of the loop detectors are similar to that of NEMA standards -the 1.8${\times}$4.5M loop is excellent for sensitivity in actual detection range of car length comparing to other shape of inductive loops. At the experimental of establishments of the optimal loop shape, it found that 1.8 4.5M loop has the highest values of $\DeltaL$ comparing to other types of loops, It means that the range of Lead-in cable length of this loop. And this loop is highly reliable in occpupancy time. Conclusivley, the 1.8${\times}$4.5M inductive loop is the optimal solution as a stop line loop detector for real -time traffic signal control.

• Structural Engineering and Mechanics
• /
• 제77권3호
• /
• pp.355-368
• /
• 2021

The time-varying mean (TVM) component of non-stationary wind speeds is commonly extracted utilizing empirical mode decomposition (EMD) in practice, whereas the accuracy of the extracted TVM is difficult to be quantified. To deal with this problem, this paper proposes an approach to identify and extract the optimal TVM from several TVM results obtained by the EMD. It is suggested that the optimal TVM of a 10-min time history of wind speeds should meet both the following conditions: (1) the probability density function (PDF) of fluctuating wind component agrees well with the modified Gaussian function (MGF). At this stage, a coefficient p is newly defined as an evaluation index to quantify the correlation between PDF and MGF. The smaller the p is, the better the derived TVM is; (2) the number of local maxima of obtained optimal TVM within a 10-min time interval is less than 6. The proposed approach is validated by a numerical example, and it is also adopted to extract the optimal TVM from the field measurement records of wind speeds collected during a sandstorm event.

• 한국멀티미디어학회논문지
• /
• 제5권6호
• /
• pp.745-752
• /
• 2002

도로에서의 최적 경로 탐색은 출발지와 목적지의 위치를 알고 있는 경우로서 탐색에 대한 일종의 사전 지식을 가진 탐색으로 A* 알고리즘이 널리 사용되고 있다. 단방향 A* 알고리즘은 최적의 경로를 보장해 주는 반면 탐색 시간이 많이 소요되고 양방향 A* 알고리즘은 최적 경로를 보장해 주지 못하거나 최적 경로 보장을 위해서는 오히려 단방향 A* 보다 탐색 시간이 더 많이 소요될 수도 있다. 본 논문에서는 탐색 시간이 우수하며 최적 경로를 보장하는 새로운 양방향 A* 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘의 효용성을 확인하기 위하여 실제 도로에 적용한 격과 정확한 최적 경로를 탐색하고 탐색 시간도 매우 우수한 것으로 확인되었다.

• 보건행정학회지
• /
• 제11권4호
• /
• pp.88-108
• /
• 2001

Separation of prescribing and dispensing practice in Korea has changed the service pattern of the pharmacy. The prescription dispensing activities, however, are concentrated excessively on the pharmacies near hospitals or clinics. Thus this study was conducted to estimate the number of optimal dispensing cases for the community pharmacy. Forty-six pharmacies were selected using systematic stratified random sampling method, and ninety-five pharmacists were interviewed on their workload of dispensing and other activities at pharmacies. One hundred and seventy prescriptions were chosen based on the length of drug administration and drug dosage form, and the dispensing time was measured by time-watch method. Also pharmacy benefit claims data were analyzed to identify the characteristics of the pharmacies which performed more than optimal dispensing cases. According to the study results, the average work time per pharmacist per day was found to be 10hours 32minutes and the dispensing activities occupied 7hours 36minutes. It took 5.72minutes on average for each dispensing case. The optimal dispensing case was estimated as 75 cases under the condition of 10hours 32minutes work time and 6% allowance rate. Even though the pharmacies near hospitals or clinics participated dispensing services actively, only pharmacies near clinics dealt with more than optimal dispensing cases. For the pharmacies near hospitals they dealt with less than optimal cases, but drug administration period per prescription was almost 3 times longer than that of pharmacies near clinics. Thus the intensity of dispensing activities such as drug administration period is to be considered to estimate optimal dispensing cases more accurately.