• Title/Summary/Keyword: target value

Search Result 2,220, Processing Time 0.032 seconds

Underwater Moving Target Simulation by Transmission Line Matrix Modeling Approach (전달선로행렬 모델링에 의한 수중물체의 이동 시뮬레이션 방법에 대한 연구)

  • Park, Kyu-Chil;Yoon, Jong Rak
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1777-1783
    • /
    • 2013
  • We do research on the simulation of Doppler effect from a target's moving under the sea by Transmission Line Matrix modeling which is one of numerical methods on time domain. To implement the effect, the input signal was entered at a moving node according to a moving target's moving speed. The result had maximum 2.47% error compared with the theoretical value. And from simulation results with speed control of a moving target, we could also obtain resonable results within 0.63% error range.

MAXIMUM BRAKING FORCE CONTROL UTILIZING THE ESTIMATED BRAKING FORCE

  • Hong, D.;Hwang, I.;SunWoo, M.;Huh, K.
    • International Journal of Automotive Technology
    • /
    • v.8 no.2
    • /
    • pp.211-217
    • /
    • 2007
  • The wheel slip control systems are able to control the braking force more accurately and can be adapted to different vehicles more easily than conventional ABS (Anti-lock Brake System) systems. In realizing the wheel slip control systems, real-time information such as the tire braking force at each wheel is required. In addition, the optimal target slip values need to be determined depending on the braking objectives such as minimum braking distance and stability enhancement. In this paper, a robust wheel slip controller is developed based on the adaptive sliding mode control method and an optimal target slip assignment algorithm is proposed for maximizing the braking force. An adaptive law is formulated to estimate the braking force in real-time. The wheel slip controller is designed based on the Lyapunov stability theory considering the error bounds in estimating the braking force and the brake disk-pad friction coefficient. The target slip assignment algorithm searches for the optimal target slip value based on the estimated braking force. The performance of the proposed wheel slip control system is verified in HILS (Hardware-In-the-Loop Simulator) experiments and demonstrates the effectiveness of the wheel slip control in various road conditions.

Weighted Parameter Analysis of L1 Minimization for Occlusion Problem in Visual Tracking (영상 추적의 Occlusion 문제 해결을 위한 L1 Minimization의 Weighted Parameter 분석)

  • Wibowo, Suryo Adhi;Jang, Eunseok;Lee, Hansoo;Kim, Sungshin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.101-103
    • /
    • 2016
  • Recently, the target object can be represented as sparse coefficient vector in visual tracking. Due to this reason, exploitation of the compressibility in the transform domain by using L1 minimization is needed. Further, L1 minimization is proposed to handle the occlusion problem in visual tracking, since tracking failures mostly are caused by occlusion. Furthermore, there is a weighted parameter in L1 minimization that influences the result of this minimization. In this paper, this parameter is analyzed for occlusion problem in visual tracking. Several coefficients that derived from median value of the target object, mean value of the arget object, the standard deviation of the target object are, 0, 0.1, and 0.01 are used as weighted parameter of L1 minimization. Based on the experimental results, the value which is equal to 0.1 is suggested as weighted parameter of L1 minimization, due to achieved the best result of success rate and precision performance parameter. Both of these performance parameters are based on one pass evaluation (OPE).

  • PDF

Comparison of Rigorous Design Procedure with Approximate Design Procedure for Variable Sampling Plans Indexed by Quality Loss

  • Ishii, Yoma;Arizono, Ikuo;Tomohiro, Ryosuke;Takemoto, Yasuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.231-238
    • /
    • 2016
  • Traditional acceptance sampling plans have focused on the proportion of nonconforming items as an attribute criterion for quality. In today's modern quality management under high quality production environments, the reduction of the deviation from a target value in a quality characteristic has become the most important purpose. In consequence, various inspection plans for the purpose of reducing the deviation from the target value in the quality characteristic have been investigated. In this case, a concept of the quality loss evaluated by the deviation from the target value has been accepted as the variable evaluation criterion of quality. Further, some quality measures based on the quality loss have been devised; e.g. the process loss and the process capability index. Then, as one of inspection plans based on the quality loss, the rigorous design procedure for the variable sampling plan having desired operating characteristics (VS-OC plan) indexed by the quality loss has been proposed by Yen and Chang in 2009. By the way, since the estimator of the quality loss obeys the non-central chi-square distribution, the rigorous design procedure for the VS-OC plan indexed by the quality loss is complicated. In particular, the rigorous design procedure for the VS-OC plan requires a large number of the repetitive and complicated numerical calculation about the non-central chi-square distribution. On the other hand, an approximate design procedure for the VS-OC plan has been proposed before the proposal of the above rigorous design procedure. The approximate design procedure for the VS-OC plan has been constructed by combining Patnaik approximation relating the non-central chi-square distribution to the central chi-square distribution and Wilson-Hilferty approximation relating the central chi-square distribution to the standard normal distribution. Then, the approximate design procedure has been devised as a convenient procedure without complicated and repetitive numerical calculations. In this study, through some comparisons between the rigorous and approximate design procedures, the applicability of the approximate design procedure has been confirmed.

A Market Development Strategy for WiBro Service (와이브로 서비스(WiBro service) 상용화를 위한 시장개발전략)

  • Kim, Youngchan;Jee, Kyoung-Yong;Kim, Moon-Koo;Kim, Jiyeon
    • Asia Marketing Journal
    • /
    • v.7 no.2
    • /
    • pp.71-92
    • /
    • 2005
  • Given the rapid changes in consumer tastes, technology, and competition, companies must develop a steady stream of new products and services. To be a successful product or service and explore the available market, the target market consumers need to be fully acknowledged a new product or service's value or benefit. And at the same time, the presented benefit should satisfy the customer's needs and wants. Therefore, a firm must investigate the target consumers' needs and wants before launching the new product or service. In this paper, we suggest the marketing strategy for newly developed WiBro service in telecommunication industry. We focus on consumer-oriented marketing strategy as well as the technology development process. To explore the customer's value scheme, we employ a self-explicated approach for estimating the customer's part-worth of the different target market in the process of market development stage. And we present the marketing strategy for each market development stages as well.

  • PDF

Analysis of Optimum Integration on the GNSS and the Vision System (GNSS와 Vision System의 최적 융합 분석)

  • Park, Chi-Ho;Kim, Nam-Hyeok;Park, Kyoung-Yong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.13-18
    • /
    • 2015
  • This paper proposes an optimum vision system analysis and a reliable high-precision positioning system that converges a GNSS and a vision system in order to resolve position error and outdoor shaded areas two disadvantages of GNSS. For location determination of the object, it should receive signal from at least four GNSS. However, in urban areas, exact location determination is difficult due to factors like high buildings, obstacles, and reflected waves. In order to deal with the above problem, a vision system was employed. First, determine an exact position value of a target object in urban areas whose environment is poor for a GNSS. Then, identify such target object by a vision system and its position error is corrected using such target object. A vehicle can identify such target object using a vision system while moving, make location data values, and revise location calculations, thereby resulting in reliable high precision location determination.

Object tracking based on adaptive updating of a spatial-temporal context model

  • Feng, Wanli;Cen, Yigang;Zeng, Xianyou;Li, Zhetao;Zeng, Ming;Voronin, Viacheslav
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5459-5473
    • /
    • 2017
  • Recently, a tracking algorithm called the spatial-temporal context model has been proposed to locate a target by using the contextual information around the target. This model has achieved excellent results when the target undergoes slight occlusion and appearance changes. However, the target location in the current frame is based on the location in the previous frame, which will lead to failure in the presence of fast motion because of the lack of a prediction mechanism. In addition, the spatial context model is updated frame by frame, which will undoubtedly result in drift once the target is occluded continuously. This paper proposes two improvements to solve the above two problems: First, four possible positions of the target in the current frame are predicted based on the displacement between the previous two frames, and then, we calculate four confidence maps at these four positions; the target position is located at the position that corresponds to the maximum value. Second, we propose a target reliability criterion and design an adaptive threshold to regulate the updating speed of the model. Specifically, we stop updating the model when the reliability is lower than the threshold. Experimental results show that the proposed algorithm achieves better tracking results than traditional STC and other algorithms.

A Method for Real Time Target Following of a Mobile Robot Using Heading and Distance Information (방향각 및 거리 정보에 의한 이동 로봇의 실시간 목표물 추종 방법)

  • Ko, Nak-Yong;Seo, Dong-Jin;Moon, Yong-Seon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.624-631
    • /
    • 2008
  • This paper presents a method for a mobile robot to follow a moving object in real time. The robot follows a target object keeping the facing angle toward the target and the distance to the target to given value. The method consists of two procedures: first, the detection of target position in the robot coordinate system, and the second, the calculation of translational velocity and rotational velocity to follow the object:. To detect the target location, range sensor data is represented in histogram. Based on the real time calculation of the location of the target relative to the robot, translational velocity and rotational velocity to follow the target are calculated. The velocities make the heading angle and the distance to target converge toward the desired ones. The performance of the method is tested through simulation. In the simulation, the target moves with three different trajectories, straight line trajectory, rectangular trajectory, and circular trajectory. As shown in the results, it is inevitable to lose track temporarily of the target when the target suddenly changes its motion direction. Nevertheless, the robot speeds up to catch up and finally succeeds to follow the target as soon as possible even in this case. The proposed method can also be utilized to coordinate the motion of multiple robots to keep their formation as well as to follow a target.

Hard Handover Algorithm for Self Optimization in 3GPP LTE System (3GPP LTE 시스템에서 기지국 구성 자동 설정 동작을 위한 하드 핸드오버 알고리즘)

  • Lee, Doo-Won;Hyun, Kwang-Min;Kim, Dong-Hoi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.217-224
    • /
    • 2010
  • In this paper, we propose a hard handover algorithm for a base station's self-optimization, one of the automatic operational technologies for the 3GPP LTE systems. The proposed algorithm simultaneously considers a mixed target sell selection method for optimal selection and a multiple parameter based active hysteresis method with the received signal strength from adjacent cells and the cell load information of the candidate target cells from information exchanges between eNBs through X2 interface. The active hysteresis method chooses optimal handover hysteresis value considering the costs of the various environmental parameters effect to handover performance. The algorithm works on the optimal target cell and the hysteresis value selections for a base station's automatic operational optimization of the LTE system with the gathered informaton effects to the handover performance. The simulation results show distinguished handover performances in terms of the most important performance indexes of handover, handover failure rate and load balancing.

An Application of Quantum-inspired Genetic Algorithm for Weapon Target Assignment Problem (양자화 유전자알고리즘을 이용한 무기할당)

  • Kim, Jung Hun;Kim, Kyeongtaek;Choi, Bong-Wan;Suh, Jae Joon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.260-267
    • /
    • 2017
  • Quantum-inspired Genetic Algorithm (QGA) is a probabilistic search optimization method combined quantum computation and genetic algorithm. In QGA, the chromosomes are encoded by qubits and are updated by quantum rotation gates, which can achieve a genetic search. Asset-based weapon target assignment (WTA) problem can be described as an optimization problem in which the defenders assign the weapons to hostile targets in order to maximize the value of a group of surviving assets threatened by the targets. It has already been proven that the WTA problem is NP-complete. In this study, we propose a QGA and a hybrid-QGA to solve an asset-based WTA problem. In the proposed QGA, a set of probabilistic superposition of qubits are coded and collapsed into a target number. Q-gate updating strategy is also used for search guidance. The hybrid-QGA is generated by incorporating both the random search capability of QGA and the evolution capability of genetic algorithm (GA). To observe the performance of each algorithm, we construct three synthetic WTA problems and check how each algorithm works on them. Simulation results show that all of the algorithm have good quality of solutions. Since the difference among mean resulting value is within 2%, we run the nonparametric pairwise Wilcoxon rank sum test for testing the equality of the means among the results. The Wilcoxon test reveals that GA has better quality than the others. In contrast, the simulation results indicate that hybrid-QGA and QGA is much faster than GA for the production of the same number of generations.