• Title/Summary/Keyword: Processing routes

Search Result 143, Processing Time 0.038 seconds

A Method for Creating Global Routes for Unmanned Ground Vehicles Using Open Data Road Section Data (공개데이터 도로구간 정보를 활용한 무인지상차량의 전역경로 생성 방법)

  • Seungjae Yun;Munchul Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.26 no.1
    • /
    • pp.31-43
    • /
    • 2023
  • In this paper, we propose a method for generating a global path for an unmanned vehicle using public data of road section information. First, the method of analyzing road section information of the Ministry of Land, Infrastructure and Transport is presented. Second, we propose a method of preprocessing the acquired road section information and processing it into meaningful data that can be used for global routes. Third, we present a method for generating a global path using the preprocessed road section information. The proposed method has proven its effectiveness through actual autonomous driving experiments of unmanned ground vehicles.

Contamination patterns of Listeria spp. in pork processing plants using random amplified polymorphic DNA (RAPD를 이용한 돈육 가공장의 Listeria 오염양상 분석)

  • Ha, Sung-Yeol;Choi, Weon-Sang;Bahk, Gyung-Jin;Hong, Chong-Hae
    • Korean Journal of Veterinary Research
    • /
    • v.45 no.3
    • /
    • pp.359-367
    • /
    • 2005
  • This study was carried out to understand the contamination patterns of Listeria in pork processing plants. A total of 402 samples were collected from carcass, pork during processing, surfaces of equipment and environment, and 238 isolates of Listeria species were identified. L. innocua was found in 64.7% of the isolates, L. monocytogenes in 33.2%, and L. welshimeri in 2.1%. Random amplified polymorphic DNA (RAPD) analysis performed to investigate the origin and routes of Listeria contamination, showed 21 composite types of L. monocytogenes and 26 composite types of L. innocua. It was confirmed that Listeria contamination begins with contaminated incoming carcass and ever-present contaminants in the processing environments. The persistence and dissemination of the same strain of L. monocytogenes and L. innocua throughout the processing line revealed that the sanitation standard operating procedure should be implemented to minimize the risk of colonization in the workplace. Molecular subtyping of L. innocua allowed us to tracing the possibility of cross-contamination during processing.

Saving Tool Cost in Flexible Manufacturing Systems: Optimal Processing Times and Routing Mix (유연생산시스템에서 절삭공구 비용절감을 위한 가공시간과 경로배합 최적화)

  • Kim, Jeong-Seop
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.475-478
    • /
    • 2004
  • Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

  • PDF

Saving Tool Costs in Flexible Manufacturing Systems: Optimal Processing Times and Routing Mix (유연생산시스템에서 절삭공구 비용절감을 위한 가공시간과 경로배합 최적화)

  • Kim, Jeong seob
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.4
    • /
    • pp.328-337
    • /
    • 2004
  • Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

Event Processing for Complicated Routes in VRML (VRML에서 복잡한 루트에 대한 이벤트 처리)

  • Lee, Sung-Tae;Kim, Yi-Sun;Kim, Pan-Koo;Lee, Yun-Bae;Yeom, Soon-Ja
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10a
    • /
    • pp.139-142
    • /
    • 2001
  • VRML(Virtual Reality Modeling Language)에서 객체를 구성하는 자는 VRML 노드들 사이에 놓인 이벤트들의 루트를 밝힘으로써 가상 세계에서 동적으로 상태가 변화하는 것을 허용한다. 그런데 VRML에 정의된 개념적인 실행 모델에서 이벤트는 즉각적으로 노드들의 예정지로 전달되어야만 한다. 그러나 다양한 분야에서 동시에 일어나는 이벤트나 노드들 사이에서의 주기적 의존성과 같은 복잡한 요구를 수반하는 노드들 사이의 관계에서는 브라우저 실행을 어렵게 하는 문제가 있다. 따라서 본 논문에서는 VRML 부라우저에서 이벤트를 처리하는 기법과 복잡한 형태 루트들에 대한 이벤트 처리 방법을 제시하고 시뮬레이션을 통해 타당성을 검증한다.

  • PDF

A Systolic Parallel Simulation System for Dynamic Traffic Assignment : SPSS-DTA

  • Park, Kwang-Ho;Kim, Won-Kyu
    • Journal of Intelligence and Information Systems
    • /
    • v.6 no.1
    • /
    • pp.113-128
    • /
    • 2000
  • This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

  • PDF

Development of a Logistics Network Simulator (물류망 설계 및 계획을 위한 컴퓨터 시뮬레이터의 개발)

  • Park, Yang-Byung
    • IE interfaces
    • /
    • v.14 no.1
    • /
    • pp.30-38
    • /
    • 2001
  • Logistics network management has become one of the most important sources of competitive advantage regarding logistics cost and customer service in numerous business segments. Logistics network simulation is a powerful analysis method for designing and planning the logistics network optimally in an integrated way. This paper introduces a logistics network simulator, LONSIM, developed by author. LONSIM deploys a mix of simulation and optimization functions to model and analysis logistics network issues such as facility location, inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment, order processing priority rule, and vehicle routes. LONSIM is built with AweSim 2.1 and Visual Basic 6.0, and executed in windows environment.

  • PDF

A Study of SSA Routing Protocol using Utilization Metric in Ad Hoc Networks (Ad Hoc 환경에서의 Utilization Metric을 이용한 SSA 라우팅 프로토콜에 관한 연구)

  • Ji Jong-Bok;Park Joo-Ha;Lee Kaug-Seok;Song Joo-Seok
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.543-550
    • /
    • 2005
  • Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

Trust in User-Generated Information on Social Media during Crises: An Elaboration Likelihood Perspective

  • Pee, L.G.;Lee, Jung
    • Asia pacific journal of information systems
    • /
    • v.26 no.1
    • /
    • pp.1-21
    • /
    • 2016
  • Social media is increasingly being used as a source of information during crises, such as natural disasters and civil unrests. However, the quality and truthfulness of user-generated information on social media have been a cause of concern. Many users find distinguishing between true and false information on social media difficult. Basing on the elaboration likelihood model and the motivation, opportunity, and ability framework, this study proposes and empirically tests a model that identifies the information processing routes through which users develop trust, as well as the factors that influence the use of these routes. The findings from a survey of Twitter users seeking information about the Fukushima Daiichi nuclear crisis indicate that individuals evaluate information quality more when the crisis information has strong personal relevance or when individuals have low anxiety about the crisis. By contrast, they rely on majority influence more when the crisis information has less personal relevance or when these individuals have high anxiety about the crisis. Prior knowledge does not have significant moderating effects on the use of information quality and majority influence in forming trust. This study extends the theorization of trust in user-generated information by focusing on the process through which users form trust. The findings also highlight the need to alleviate anxiety and manage non-victims in controlling the spread of false information on social media during crises.

Mean value analysis of re-entrant lines with batch machines processing multiclass jobs (여러 종류의 가공물과 배치 기계가 있는 재진입 흐름생산의 평균치분석)

  • 박영신;전지혁;김수영
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.1
    • /
    • pp.37-50
    • /
    • 2000
  • We are concerned with estimating the average performance of a re-entrant line with single-job machines and batch machines. The system has multiclass jobs, which will be processed in predetermined routes. An analytical approach may be intractable since the system would not be modeled by product form queueing networks due to the inclusion of batch machines and the consideraton of multiclass jobs which have different processing times. We propose an approximation method based on the Mean Value Analysis(MVA). Our method obtains the mean walting time in each buffer of a workstation and the mean cycle time using the MVA and heuristics. numerical experiments show that the errors of our method are within 5% compared with simulation.

  • PDF