• 제목/요약/키워드: Scheduling stage

검색결과 167건 처리시간 0.026초

다중무인운반차 시스템의 새로운 동적경로계획 알고리즘 : 비정지우선 우회 알고리즘 (A New Dynamic Routing Algorithm for Multiple AGV Systems : Nonstop Preferential Detour Algorithm)

  • 신성영;조광현
    • 제어로봇시스템학회논문지
    • /
    • 제8권9호
    • /
    • pp.795-802
    • /
    • 2002
  • We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

High-throughput and low-area implementation of orthogonal matching pursuit algorithm for compressive sensing reconstruction

  • Nguyen, Vu Quan;Son, Woo Hyun;Parfieniuk, Marek;Trung, Luong Tran Nhat;Park, Sang Yoon
    • ETRI Journal
    • /
    • 제42권3호
    • /
    • pp.376-387
    • /
    • 2020
  • Massive computation of the reconstruction algorithm for compressive sensing (CS) has been a major concern for its real-time application. In this paper, we propose a novel high-speed architecture for the orthogonal matching pursuit (OMP) algorithm, which is the most frequently used to reconstruct compressively sensed signals. The proposed design offers a very high throughput and includes an innovative pipeline architecture and scheduling algorithm. Least-squares problem solving, which requires a huge amount of computations in the OMP, is implemented by using systolic arrays with four new processing elements. In addition, a distributed-arithmetic-based circuit for matrix multiplication is proposed to counterbalance the area overhead caused by the multi-stage pipelining. The results of logic synthesis show that the proposed design reconstructs signals nearly 19 times faster while occupying an only 1.06 times larger area than the existing designs for N = 256, M = 64, and m = 16, where N is the number of the original samples, M is the length of the measurement vector, and m is the sparsity level of the signal.

Vehicle Lateral Stability Management Using Gain-Scheduled Robust Control

  • You, Seung-Han;Jo, Joon-Sang;Yoo, Seung-Jin;Hahn, Jin-Oh;Lee, Kyo-Il
    • Journal of Mechanical Science and Technology
    • /
    • 제20권11호
    • /
    • pp.1898-1913
    • /
    • 2006
  • This paper deals with the design of a yaw rate controller based on gain-scheduled H$\infty$ optimal control, which is intended to maintain the lateral stability of a vehicle. Uncertain factors such as vehicle mass and cornering stiffness in the vehicle yaw rate dynamics naturally call for the robustness of the feedback controller and thus H$\infty$ optimization technique is applied to synthesize a controller with guaranteed robust stability and performance against the model uncertainty. In the implementation stage, the feed-forward yaw moment by driver's steer input is estimated by the disturbance observer in order to determine the accurate compensatory moment. Finally, HILS results indicate that the proposed yaw rate controller can satisfactorily improve the lateral stability of an automobile.

KSR-III 1단 자세제어 시스템 모델링 및 벤딩필터 최적 설계 (Control System Modeling and Optimal Bending Filter Design for KSR-III First Stage)

  • 안재명;노웅래;조현철;박정주
    • 한국항공우주학회지
    • /
    • 제30권7호
    • /
    • pp.113-122
    • /
    • 2002
  • KSR-III 로켓의 자세제어 시스템 모델링과 최적 벤딩 필터 설계가 이루어졌다. 모델링에는 로켓 강체 동역학, 공력, 슬로싱, 구조적 벤딩, 구동기 동역학, 센서 동역학, 그리고 탑재 컴퓨터 특성이 고려되었다. 시간의 변화에 따른 자세제어 시스템 파라미터들의 변화를 보상하기 위하여 이득 스케쥴링 기법이 사용되었다. 벤딩 모드를 안정화시키기 위한 필터가 매개변수 최적화 방법을 이용하여 설계되었다. 설계된 자세제어 시스템은 주파수 영역에서 요구되는 이득 및 위상 안정성 여유를 가지게 되었다.

불확실한 상황하에서의 다복적 R & D 투자계획수립에 관한 연구-최적화 기법과 계층화 분석과정의 통합접 접근방안을 중심으로- (Multiobjective R&D Investment Planning under Uncertainty)

  • 이영찬;민재형
    • 한국경영과학회지
    • /
    • 제20권2호
    • /
    • pp.39-60
    • /
    • 1995
  • In this paper, an integration of stochastic dynamic programming (SDP), integer goal programming (IGP) and analytic hierarchy process (AHP) is proposed to handle multiobjective-multicriteria sequential decision making problems under uncertainty inherent in R & D investment planning. SDP has its capability to handle problems which are sequential and stochastic. In the SDP model, the probabilities of the funding levels in any time period are generated using a subjective model which employs functional relationships among interrelated parameters, scenarios of future budget availability and subjective inputs elicited from a group of decision makers. The SDP model primarily yields an optimal investment planning policy considering the possibility that actual funding received may be less than anticipated one and thus the projects being selected under the anticipated budget would be interrupted. IGP is used to handle the multiobjective issues such as tradoff between economic benefit and technology accumulation level. Other managerial concerns related to the determination of the optimal project portifolio within each stage of the SDP model. including project selection, project scheduling and annual budget allocation are also determined by the IGP. AHP is proposed for generating scenario-based transformation probabilities under budgetary uncertainty and for quantifying the environmental risk to be considered.

  • PDF

Shipyard Spatial Scheduling Solution using Genetic Algorithms

  • Yoon Duck Young;Ranjan Varghese
    • 한국해양공학회:학술대회논문집
    • /
    • 한국해양공학회 2004년도 학술대회지
    • /
    • pp.35-39
    • /
    • 2004
  • In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

  • PDF

Low-Complexity Distributed Algorithms for Uplink CoMP in Heterogeneous LTE Networks

  • Annavajjala, Ramesh
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.150-161
    • /
    • 2016
  • Coordinated multi-point transmission (CoMP) techniques are being touted as enabling technologies for interference mitigation in next generation heterogeneous wireless networks (HetNets). In this paper, we present a comparative performance study of uplink (UL) CoMP algorithms for the 3GPP LTE HetNets. Focusing on a distributed and functionally-split architecture, we consider six distinct UL-CoMP algorithms: 1. Joint reception in the frequency-domain (JRFD) 2. Two-stage equalization (TSEQ) 3. Log-likelihood ratio exchange (LLR-E) 4. Symmetric TSEQ (S-TSEQ) 5. Transport block selection diversity (TBSD) 6. Coordinated scheduling with adaptive interference mitigation (CS-AIM) where JRFD, TSEQ, S-TSEQ, TBSD and CS-AIM are our main contributions in this paper, and quantify their relative performances via the post-processing signal-to-interference-plus-noise ratio distributions.We also compare the CoMP-specific front-haul rate requirements for all the schemes considered in this paper. Our results indicate that, with a linear minimum mean-square error receiver, the JRFD and TSEQ have identical performances, whereas S-TSEQ relaxes the front-haul latency requirements while approaching the performance of TSEQ. Furthermore, in a HetNet environment, we find that CS-AIM provides an attractive alternative to TBSD and LLR-E with a significantly reduced CoMP-specific front-haul rate requirement.

다품종 제품과 전용 대기공간을 고려한 다단계 베르누이 라인을 위한 성능 모델 (Performance Models of Multi-stage Bernoulli Lines with Multiple Product and Dedicated Buffers)

  • 박경수;한준희;김우성
    • 산업경영시스템학회지
    • /
    • 제44권3호
    • /
    • pp.22-32
    • /
    • 2021
  • To meet rapidly changing market demands, manufacturers strive to increase both of productivity and diversity at the same time. As a part of those effort, they are applying flexible manufacturing systems that produce multiple types and/or options of products at a single production line. This paper studies such flexible manufacturing system with multiple types of products, multiple Bernoulli reliability machines and dedicated buffers between them for each of product types. As one of the prevalent control policies, priority based policy is applied at each machines to select the product to be processed. To analyze such system and its performance measures exactly, Markov chain models are applied. Because it is too complex to define all relative transient and its probabilities for each state, an algorithm to update transient state probability are introduced. Based on the steady state probability, some performance measures such as production rate, WIP-based measures, blocking probability and starvation probability are derived. Some system properties are also addressed. There is a property of non-conservation of flow, which means the product ratio at the input flow is not conserved at the succeeding flows. In addition, it is also found that increased buffer capacity does not guarantee improved production rate in this system.

FACTORS ACOUNTING FOR ACTIVITY-TIME AND PROJECT-TIME UNCERTAINITIES IN BORED PILES CONSTRUCTION PLANNING: CASE STUDY ON A BUIDLING PROJECT IN HONG KONG

  • Stephen K.K. Cheng;Ming Lu;Hongqin Fan
    • 국제학술발표논문집
    • /
    • The 3th International Conference on Construction Engineering and Project Management
    • /
    • pp.747-753
    • /
    • 2009
  • Planning the construction for a system of bored piles in building foundation engineering is (1) to predict the time duration required to complete all the bored piles with due consideration of relevant engineering factors and site constraints; then (2) to predict the total project time generally by aggregating the predicted working duration for construction of each bored pile. The duration for construction of an individual bored pile results from analyzing various working sequences and different activity duration (such as predrilling, excavation, steelfixing, air-lifting, and concreting, etc.), which is informed by experiences and site records of previous projects. However, determining the project duration for constructing many bored piles on one site is much more complicated than adding up the time duration for individual piles. In practice, project schedules are often found to be unrealistic and incorrect during the construction stage. This is because construction planning is not based on a exhaustive and comprehensive evaluation of site factors, such as site layout plan, site constraints, quality control, environmental control, safety control and logical relationships between different trades. In this paper, we identify those factors based on a foundation engineering site in Hong Kong with ninety-seven bored piles and address their effects on uncertainties in activity time and project time.

  • PDF

Using the METHONTOLOGY Approach to a Graduation Screen Ontology Development: An Experiential Investigation of the METHONTOLOGY Framework

  • Park, Jin-Soo;Sung, Ki-Moon;Moon, Se-Won
    • Asia pacific journal of information systems
    • /
    • 제20권2호
    • /
    • pp.125-155
    • /
    • 2010
  • Ontologies have been adopted in various business and scientific communities as a key component of the Semantic Web. Despite the increasing importance of ontologies, ontology developers still perceive construction tasks as a challenge. A clearly defined and well-structured methodology can reduce the time required to develop an ontology and increase the probability of success of a project. However, no reliable knowledge-engineering methodology for ontology development currently exists; every methodology has been tailored toward the development of a particular ontology. In this study, we developed a Graduation Screen Ontology (GSO). The graduation screen domain was chosen for the several reasons. First, the graduation screen process is a complicated task requiring a complex reasoning process. Second, GSO may be reused for other universities because the graduation screen process is similar for most universities. Finally, GSO can be built within a given period because the size of the selected domain is reasonable. No standard ontology development methodology exists; thus, one of the existing ontology development methodologies had to be chosen. The most important considerations for selecting the ontology development methodology of GSO included whether it can be applied to a new domain; whether it covers a broader set of development tasks; and whether it gives sufficient explanation of each development task. We evaluated various ontology development methodologies based on the evaluation framework proposed by G$\acute{o}$mez-P$\acute{e}$rez et al. We concluded that METHONTOLOGY was the most applicable to the building of GSO for this study. METHONTOLOGY was derived from the experience of developing Chemical Ontology at the Polytechnic University of Madrid by Fern$\acute{a}$ndez-L$\acute{o}$pez et al. and is regarded as the most mature ontology development methodology. METHONTOLOGY describes a very detailed approach for building an ontology under a centralized development environment at the conceptual level. This methodology consists of three broad processes, with each process containing specific sub-processes: management (scheduling, control, and quality assurance); development (specification, conceptualization, formalization, implementation, and maintenance); and support process (knowledge acquisition, evaluation, documentation, configuration management, and integration). An ontology development language and ontology development tool for GSO construction also had to be selected. We adopted OWL-DL as the ontology development language. OWL was selected because of its computational quality of consistency in checking and classification, which is crucial in developing coherent and useful ontological models for very complex domains. In addition, Protege-OWL was chosen for an ontology development tool because it is supported by METHONTOLOGY and is widely used because of its platform-independent characteristics. Based on the GSO development experience of the researchers, some issues relating to the METHONTOLOGY, OWL-DL, and Prot$\acute{e}$g$\acute{e}$-OWL were identified. We focused on presenting drawbacks of METHONTOLOGY and discussing how each weakness could be addressed. First, METHONTOLOGY insists that domain experts who do not have ontology construction experience can easily build ontologies. However, it is still difficult for these domain experts to develop a sophisticated ontology, especially if they have insufficient background knowledge related to the ontology. Second, METHONTOLOGY does not include a development stage called the "feasibility study." This pre-development stage helps developers ensure not only that a planned ontology is necessary and sufficiently valuable to begin an ontology building project, but also to determine whether the project will be successful. Third, METHONTOLOGY excludes an explanation on the use and integration of existing ontologies. If an additional stage for considering reuse is introduced, developers might share benefits of reuse. Fourth, METHONTOLOGY fails to address the importance of collaboration. This methodology needs to explain the allocation of specific tasks to different developer groups, and how to combine these tasks once specific given jobs are completed. Fifth, METHONTOLOGY fails to suggest the methods and techniques applied in the conceptualization stage sufficiently. Introducing methods of concept extraction from multiple informal sources or methods of identifying relations may enhance the quality of ontologies. Sixth, METHONTOLOGY does not provide an evaluation process to confirm whether WebODE perfectly transforms a conceptual ontology into a formal ontology. It also does not guarantee whether the outcomes of the conceptualization stage are completely reflected in the implementation stage. Seventh, METHONTOLOGY needs to add criteria for user evaluation of the actual use of the constructed ontology under user environments. Eighth, although METHONTOLOGY allows continual knowledge acquisition while working on the ontology development process, consistent updates can be difficult for developers. Ninth, METHONTOLOGY demands that developers complete various documents during the conceptualization stage; thus, it can be considered a heavy methodology. Adopting an agile methodology will result in reinforcing active communication among developers and reducing the burden of documentation completion. Finally, this study concludes with contributions and practical implications. No previous research has addressed issues related to METHONTOLOGY from empirical experiences; this study is an initial attempt. In addition, several lessons learned from the development experience are discussed. This study also affords some insights for ontology methodology researchers who want to design a more advanced ontology development methodology.