• Title/Summary/Keyword: Multiple Constraint

Search Result 324, Processing Time 0.019 seconds

Multiple UAVs Nonlinear Guidance Laws for Stationary Target Observation with Waypoint Incidence Angle Constraint

  • Kim, Mingu;Kim, Youdan
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.1
    • /
    • pp.67-74
    • /
    • 2013
  • Nonlinear guidance law combined with a pseudo pursuit guidance is proposed, to perform stationary target observation mission. Multiple UAVs are considered, with waypoint constraint. The whole guidance is divided into two steps: firstly, waypoint approach, with specified incidence angle; and secondly, loitering around the stationary target. Geometric approach is used to consider the constraint on the waypoint, and a specified phase angle between the loitering UAV and the approaching UAV. In the waypoint approach step, UAVs fly to the waypoint using the pseudo pursuit guidance law. After passing the waypoint, UAVs turn around the target, using a distance error dynamics-based guidance law. Numerical simulations are performed, to verify the performance of the proposed guidance law.

On the Capacities of Spectrum-Sharing Systems with Transmit Diversity

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.10 no.3
    • /
    • pp.99-103
    • /
    • 2010
  • Motivated by recent works on spectrum-sharing systems, this paper investigates the effects of transmit diversity on the peak interference power limited cognitive radio(CR) networks. In particular, we derive the ergodic and outage capacities of a spectrum-sharing system with multiple transmit-antennas. To derive the capacities, peak interference power constraint is imposed to protect the primary receiver. In a CR transmitter and receiver pair with multiple antennas at the transmitter side, the allowable transmit power is distributed over the transmit-antennas to achieve transmit diversity at the receiver. We investigate the effect of this power distribution when a peak interference power constraint is imposed to protect the primary receiver. We show that the transmit diversity does not improve the ergodic capacity compared to the single-antenna system. On the other hand, the transmit diversity significantly improves the outage capacity. For example, two transmit-antennas improve the outage capacity 10 times compared to the single-antenna with a 0 dB interference constraint.

A Bus Scheduling Problem with Multiple Objective Functions and Travel Time Constraint (여러 개의 목적함수와 운행시간제약을 가진 버스일정계획)

  • Kim, Woo-Je
    • IE interfaces
    • /
    • v.15 no.1
    • /
    • pp.49-54
    • /
    • 2002
  • A bus scheduling problem with multiple objective functions and travel time constraint is to determine the allocation of buses to customer service requests minimizing the number of buses and travel costs under the travel time restriction for each bus. For the scheduling, we first represent the scheduling problem using a graph and develop a hierarchical approach. Second, we develop a mathematical model based algorithm for the scheduling problem including heuristic methods. We tested the performance of the algorithm on instances with real data. As a result, the total number of buses and travel costs are reduced over about 10% comparing with that of current practice at the company.

Preprocessing based Scheduling for Multi-Site Constraint Resources (전처리 방식의 복수지역 제약공정 스케줄링)

  • Hong, Min-Sun;Rim, Suk-Chul;Noh, Seung-J.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.1
    • /
    • pp.117-129
    • /
    • 2008
  • Make-to-order manufacturers with multiple plants at multiple sites need to have the ability to quickly determine which plant will produce which customer order to meet the due date and minimize the transportation cost from the plants to the customer. Balancing the work loads and minimizing setups and make-span are also of great concern. Solving such scheduling problems usually takes a long time. We propose a new approach, which we call 'preprocessing', for resolving such complex problems. In preprocessing scheme, a 'good' a priori schedule is prepared and maintained using unconfirmed order information. Upon the confirmation of orders. the preprocessed schedule is quickly modified to obtain the final schedule. We present a preprocessing solution algorithm for multi-site constraint scheduling problem (MSCSP) using genetic algorithm; and conduct computational experiments to evaluate the performance of the algorithm.

Design of a Robust Controller Using Genetic Algorithms and LMI Design Method (유전자 알고리즘과 LMI 설계 방법을 이용한 강인 제어기의 설계)

  • Lee, Moon-Noh;Lee, Hong-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.7
    • /
    • pp.619-624
    • /
    • 2011
  • This paper presents a controller design method for a robust control problem with multiple constraints using genetic algorithms and LMI design method. A robust $H_{\infty}$ constraint with loop shaping and pole placement is used to address disturbance attenuation with error limits and desired transient specifications, in spite of the plant uncertainties and disturbances. In addition, a loop gain constraint is considered so as not to enlarge the loop gain unnecessarily. The robust $H_{\infty}$ constraint and pole placement constraint can be expressed in terms of two matrix inequalities and the loop gain constraint can be considered as an objective function so that genetic algorithms can be applied. Accordingly, a robust controller can be obtained by integrating genetic algorithms with LMI approach. The proposed controller design method is applied to a track-following system of an optical disk drive and is evaluated through simulation results.

Resource allocation in downlink SWIPT-based cooperative NOMA systems

  • Wang, Longqi;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.20-39
    • /
    • 2020
  • This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF

Relationships between Leisure Constraint, Leisure Constraint Negotiation, Participation for Chinese Students Studying in Korea (중국인 유학생의 여가제약, 여가제약 협상 및 여가참가의 관계)

  • Kim, Jong-Ho;Jo, Woog-Yeon;Xing, Cao;Hwang, Sun-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.8
    • /
    • pp.428-437
    • /
    • 2011
  • The purpose of this study was to explore the relationships between leisure constraint, leisure constraint negotiation and leisure participation of Chinese students studying in Korea. A total of 210 respondents, participating in the athletic competition for Chinese students, were selected to conduct this study, using the purposive sampling method. Finally, 194 surveys except 17 respondents, were used for this study. The reliability of the questionnaire was analyzed using Cronbach's ${\alpha}$ with SPSS 18.0 and the Simple Regression Analysis and Multiple Regression Analysis were conducted. As a result, Main findings were as follows; First, leisure constraint had a positive relationship with leisure constraint negotiation. Specifically, leisure constraint had an influence on 'leisure activity partner search' and 'leisure activity intensity control effort' out of leisure constraint negotiation strategies. Second, leisure constraint had a negative relationship with leisure participation. Third, leisure constraint negotiation had no significant influence on leisure participation.

Active Control of Road-Booming-Noise with Constraint Multiple Filtered-X LMS Algorithm

  • Oh, Shi-Hwan;Kim, Hyoun-Suk;Park, Young-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.2E
    • /
    • pp.3-7
    • /
    • 2000
  • Vibration generated by the non-uniform road profile propagates though each tire and the suspension and finally generates structure born noise in the interior of the passenger vehicle. In this paper, the road-booming-noise which has strong correlation with the vibration signals measured at the suspension system was compensated. Active noise control of the road-booming-noise is rather difficult to achieve because of its non-stationary characteristics. CMFX LMS (Constraint Multiple Filtered-X Least Mean Square) algorithm, which can track non-stationary process rather well, is applied. Comprison of the proposed method and the conventional MFX LMS (Multiple Filtered-X Least Mean Square) algorithm is made through the hardware-in-the-loop simulation and the feasibility of the proposed method is demonstrated with the experiment.

  • PDF

An Integer Ambiguity Resolution Method for GPS Attitude Determination (GPS를 이용한 자세 측정 시스템의 미지정수 결정기법)

  • 박찬식;김일선
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.1
    • /
    • pp.62-68
    • /
    • 1999
  • The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.

  • PDF