• Title/Summary/Keyword: 교착 방지

Search Result 18, Processing Time 0.029 seconds

자동화 컨테이너 터미널에서의 AGV 충돌 방지 및 교착 해결 방안

  • Gang, Jae-Ho;Choe, Lee;Gang, Byeong-Ho;Ryu, Gwang-Ryeol;Kim, Gap-Hwan
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.05a
    • /
    • pp.103-112
    • /
    • 2005
  • 자동화 컨테이너 터미널의 생산성을 향상시키기 위해서는 장치장과 안벽 사이를 오가며 컨테이너를 운반하는 무인유도 차량(Automated Guided Vehicle: AGV)들이 효율적으로 주행하여 제 시간에 필요한 위치에 도착함으로써 연계 작업들의 지연을 최소화하여야 한다, 만일 AGV들이 목적지까지 주행하여야 하는 거리가 길거나 주행 중에 다른 AGV들과의 충돌이나 교축을 피하기 위하여 대기하여야 하는 상황이 빈번히 발생하면 주행 효율이 떨어지게 된다, 주행 경로의 길이를 줄이기 위하여 경로들을 보다 유연하게 설정할 수 있게 허용하면 경로들간의 교차 가능성이 높아져 교통 통제가 어려워지고 결과적으로 충돌과 교착이 발생할 가능성은 높아진다. 특히 교착을 사전에 방지하기 위하서는 문제가 발생할 소지가 있는 영역을 미리 파악하여 일부 영역을 다른 AGV들이 점유하지 못하도록 제한하여야 하는데, 이는 자칫 AGV 주행 공간의 활용도를 떨어뜨릴 수 있다. 또한 교착의 파악과 이를 방지하기 위한 제어는 실시간에 이루어져야 하므로 연산 부담이 상당하다. 본 논문에서는 유연한 주행 경로 설정이 가능하며 주행 공간을 효율적으로 활용할 수 있는 주행 경로 표현법과 충돌 방지 방안을 제안한다. 또한 교착 발생 가능성을 사전에 파악하고 회피(avoidance)하는데 소요되는 연산비용을 줄여 실시간 적용 가능성을 높이기 위하여 교착해결(deadlock resolution)에 기반을 둔 AGV 주행 관리 방안을 제시한다. 본 논문에서 제안하는 방안의 효율성을 시뮬레이션을 통하여 검증해 보았다.

  • PDF

A Deadlock A voidance Method and a Regression-Based Route Selection Scheme for AGV s in Automated Container Terminals (자동화 컨테이너 터미널에서 AGV 교착 방지와 회귀 분석을 이용한 경로 선정 방안)

  • Jun Jin-Pyo;Ryu Kwang-Ryel;Yoon Hang-Mook
    • Journal of Navigation and Port Research
    • /
    • v.29 no.8 s.104
    • /
    • pp.723-733
    • /
    • 2005
  • This paper presents a deadlock avoidance method for AGVs in automated container terminals. For a more efficient use of AGV traveling area, we divided the area into small-sized grids not enough to cover a whole AGV. Our deadlock avoidance method controls AGVs by identifying strongly connected components(SCCs) in a graph derived from the paths of AGVs on the grids. Also in this paper we suggest a route selection scheme which selects a route by predicting and comparing travel times of candidate routes by using a regression formula. Simulation experiments have shown that the proposed method can control AGVs for 48 hours without deadlocks and the count of AGV visits per QC is increased by $2\~10$ an hour.

Constructing a Reservation Table for Automated Guided Vehicles in Port Container Terminal (컨테이너 터미널에서의 AGV의 교착방지를 위한 주행영역 예약 표 작성방법)

  • Jeon, Su-Min;Kim, Kap-Hwan
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.85-94
    • /
    • 2008
  • Automated Guided Vehicles (AGVs) are important equipment in automated container terminals. To utilize AGVs for transporting containers from a position to another, the deadlock is a serious problem that must be solved before they are deployed to real operations. This study assumes that traveling area for AGVs are divided into a large number of grid-blocks and, as a method of traffic control, grid-blocks are reserved in advance during the travel of AGVs. The purposes of the reservation are to make the room between AGVs and to prevent deadlocks. Because the size of an AGV is much larger than the size of a grid-block on guide paths, this study assumes an AGV may occupy more than one grid-block at the same time. This study suggests a method for constructing a table of reservation schedules by using a simulation. A sensitivity analysis was conducted to evaluate the performance of the reservation method in this study.

  • PDF

Error Time Message Broadcast Method to Prevent Deadlock in Dynamic Reconfiguration Environment (동적 재구성 환경에서 교착상태를 예방하기 위한 오차 시간 메시지 브로드캐스트 기법 연구)

  • Shin, Hyun-Jun;Kim, Sung-Jin;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.11
    • /
    • pp.2131-2136
    • /
    • 2016
  • Before Industry 4.0, a purpose of manufacturing processes is simply overcoming the weakness of product line. However, Industry 4.0 should determine its method of work of facilities' own accord. Manufacturing processes such as FMS, AMS, MAS have been developed in these procedures, but there are possibilities of deadlock that can be happened for the reason of machine, agent or resource sharing. There were many studies to solve this problem. However, studies about prevention of deadlock happened in the situation that manufacturing processes are reconfigured dinamically because of human's intervention are incomplete. This paper proposes the model of the situation reconfigured dinamically and the method to prevent the deadlock in this situation. The proposed method adjusts production and manufacturing time by broadcasting time error messages to machines around when the manufacturing time of machine intervened by human is changed. Through this, it is anticipated to prevent the deadlock if conditions of the product line are changed.

A Study about Finding Optimal Path Using HAS Dynamic Programming (RAS Dynamic Programming을 이용한 최적 경로 탐색에 관한 연구)

  • Kim, Jeong-Tae;Cho, Hyun-Chul;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2007.12a
    • /
    • pp.226-227
    • /
    • 2007
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

  • PDF

A Policy to Find All Siphons using Transitive Matrix (추이적 행렬을 이용한 사이폰 감지 정책)

  • Kim, Oe-Yeong;Lee, Jong-Kun
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.67-75
    • /
    • 2010
  • Deadlock usually appears in contain subsystem which is run in parallel and resources share modules. Siphons and traps have been well introduced to characterize deadlocks of Petri nets. Siphon concept be well used for proposing the detect and prevent deadlock by the pleasure researchers. But it's need many times and efforts to detect all siphon sub-nets in the Petri model. Since transitive matrix could explain all relations between the place and transitions in Petri nets, we propose an algorithm to detect all siphon sub-nets after analyzed the transitive matrix's properties. Examples are givens to illustrate the method.

Secured Verification of Intrusion Prevention System Security Model Based on CPNs (CPN 기반의 침입방지시스템 보안모델의 안정성 검증)

  • Lee, Moon-Goo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.3
    • /
    • pp.76-81
    • /
    • 2011
  • Intrusion prevention systems (IPS) are important solution about solved problems for inside system security or outsider attacks. When introduce this system, first consideration item is secured rather than multiple function. Colored Petri Nets (CPNs) used that in order to secured verification for user authentication function of intrusion prevention system security model. CPNs is a graphical modeling language suitable for modeling distributed, concurrent, deterministic or non-deterministic systems with synchronous. Like these CPNs was expressed every possible state and occurrence graph. Secured of IPS security model was verified because expression every state using CPN tool and as a result of analyzing the occurrence graph was without a loop or interruption.

Collision Avoidance and Deadlock Resolution for AGVs in an Automated Container Terminal (자동화 컨테이너 터미널에서의 AGV 충돌 방지 및 교착 해결 방안)

  • Kang, Jae-Ho;Choi, Lee;Kang, Byoung-Ho;Ryu, Kwang-Ryel;Kim, Kap-Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.11 no.3
    • /
    • pp.25-43
    • /
    • 2005
  • In modern automated container terminals, automated guided vehicle (AGV) systems are considered a viable option for the horizontal tansportation of containers between the stacking yard and the quayside cranes. AGVs in a container terminal move rather freely and do not follow fixed guide paths. For an efficient operation of such AGVs, however, a sophisticated traffic management system is required. Although the flexible routing scheme allows us to find the shortest possible routes for each of the AGVs, it may incur many coincidental encounters and path intersections of the AGVs, leading to collisions or deadlocks. However, the computational cost of perfect prediction and avoidance of deadlocks is prohibitively expensive for a real time application. In this paper, we propose a traffic control method that predicts and avoids some simple, but at the same time the most frequently occurring, cases of deadlocks between two AGVs. More complicated deadlock situations are not predicted ahead of time but detected and resolved after they occur. Our method is computationally cheap and readily applicable to real time applications. The efficiency and effectiveness of our proposed methods have been validated by simulation.

  • PDF

Two-phase Multicast in Wormhole-switched Bidirectional Banyan Networks (웜홀 스위칭하는 양방향 베니언 망에서의 두 단계 멀티캐스트)

  • Kwon, Wi-Nam;Kwon, Bo-Seob;Park, Jae-Hyung;Yun, Hyeon-Su
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.255-263
    • /
    • 2000
  • A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

  • PDF

Development a scheduling model for AGV dispatching of automated container terminals (자동화 컨테이너 터미널의 AGV 배차 스케줄링 모형 개발)

  • Jae-Yeong Shin;Ji-Yong Kwon;Su-Bin Lee
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2023.05a
    • /
    • pp.59-60
    • /
    • 2023
  • The automation of container terminals is an important factor that determines port competitiveness, and global advanced ports tend to strengthen their competitiveness through container terminal automation. The operational efficiency of the AGV, which is an essential transport equipment of the automated terminal, can improve the productivity of the automated terminal. The operation of AGVs in automated container terminals differs from that of conventional container terminals, as it is based on an automated system in which AGVs travel along designated paths and operate according to assigned tasks, requiring consideration of factors such as workload, congestion, and collisions. To prevent such problems and improve the efficiency of AGV operations, a more sophisticated model is necessary. Thus, this paper proposes an AGV scheduling model that takes into account the AGV travel path and task assignment within the terminal The model prevent the problem of deadlock and. various cases are generated by changing AGV algebra and number of tasks to create AGV driving situations and evaluate the proposed algorithm through algorithm and optimization analysis.

  • PDF