• 제목/요약/키워드: Approach determining algorithm

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

A Study on Kohenen Network based on Path Determination for Efficient Moving Trajectory on Mobile Robot

  • Jin, Tae-Seok;Tack, HanHo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제10권2호
    • /
    • pp.101-106
    • /
    • 2010
  • We propose an approach to estimate the real-time moving trajectory of an object in this paper. The object's position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Extended Kalman Filter(EKF) and neural networks are utilized cooperatively. Since the EKF needs to approximate a nonlinear system into a linear model in order to estimate the states, there still exist errors as well as uncertainties. To resolve this problem, in this approach the Kohonen networks, which have a high adaptability to the memory of the inputoutput relationship, are utilized for the nonlinear region. In addition to this, the Kohonen network, as a sort of neural network, can effectively adapt to the dynamic variations and become robust against noises. This approach is derived from the observation that the Kohonen network is a type of self-organized map and is spatially oriented, which makes it suitable for determining the trajectories of moving objects. The superiority of the proposed algorithm compared with the EKF is demonstrated through real experiments.

Aggregate Container Transportation Planning in the Presence of Dynamic Demand and Three Types of Vehicles (동적 수요와 세 가지 차량형태를 고려한 총괄 컨테이너 운송계획)

  • Ko, Chang-Seong;Chung, Ki-Ho;Shin, Jae-Young
    • IE interfaces
    • /
    • 제17권1호
    • /
    • pp.71-77
    • /
    • 2004
  • At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Annually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost. The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

A Novel AE Based Algorithm for PD Localization in Power Transformers

  • Mehdizadeh, Sina;Yazdchi, Mohammadreza;Niroomand, Mehdi
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권6호
    • /
    • pp.1487-1496
    • /
    • 2013
  • In this paper, a novel algorithm for PD localization in power transformers based on wavelet de-noising technique and energy criterion is proposed. Partial discharge is one of the main failures in power transformers. The localization of which could be very useful for maintenance systems. Acoustic signals due to a PD event are transient, irregular and non-repetitive. So wavelet transform is an efficient tool for this signal processing problem that gives a time-frequency demonstration. First, different wavelet based de-noising methods are analyzed. Then, a reasonable structure for threshold value determining and applying manner on signals is presented. Evaluated errors are good evidences for choices. Next, applying the elimination low energy frequency bands is discussed and developed as a de-noising method. Time differences between signals are used for PD localization. Different ways in time arrival detection are introduced and a novel approach in energy criterion method is presented. At the end, the quality of algorithm is verified through the different assays in lab.

Aggregate Transportation Planning Considering Three Types of Container Vehicles (세 가지 형태의 컨테이너 차량을 고려한 총괄수송계획)

  • Go Chang Seong;Jeong Gi Ho;Sin Jae Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
    • /
    • pp.171-178
    • /
    • 2002
  • At the present time, container transportation plays a key role in the international logistics and the efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This study suggests an approach for determining fleet size for container road transportation with dynamic demand. Usually the vehicles operated by the transportation trucking companies in Korea can be classified into three types depending on the ways how their expenses occur; company-owned truck, mandated truck which is owned by outsider who entrust the company with its operation, and rented vehicle (outsourcing). Armually the trucking companies should decide how many company-owned and mandated trucks will be operated considering vehicle types and the transportation demands. With the forecasted monthly data for the volume of containers to be transported a year, a heuristic algorithm using tabu search is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost The idea of the algorithm is based on both the aggregate production planning (APP) and the pickup-and-delivery problem (PDP). Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

  • PDF

Improved Convolutional Neural Network Based Cooperative Spectrum Sensing For Cognitive Radio

  • Uppala, Appala Raju;Narasimhulu C, Venkata;Prasad K, Satya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2128-2147
    • /
    • 2021
  • Cognitive radio systems are being implemented recently to tackle spectrum underutilization problems and aid efficient data traffic. Spectrum sensing is the crucial step in cognitive applications in which cognitive user detects the presence of primary user (PU) in a particular channel thereby switching to another channel for continuous transmission. In cognitive radio systems, the capacity to precisely identify the primary user's signal is essential to secondary user so as to use idle licensed spectrum. Based on the inherent capability, a new spectrum sensing technique is proposed in this paper to identify all types of primary user signals in a cognitive radio condition. Hence, a spectrum sensing algorithm using improved convolutional neural network and long short-term memory (CNN-LSTM) is presented. The principle used in our approach is simulated annealing that discovers reasonable number of neurons for each layer of a completely associated deep neural network to tackle the streamlining issue. The probability of detection is considered as the determining parameter to find the efficiency of the proposed algorithm. Experiments are carried under different signal to noise ratio to indicate better performance of the proposed algorithm. The PU signal will have an associated modulation format and hence identifying the presence of a modulation format itself establishes the presence of PU signal.

Generalized Solution Procedure for Slope Stability Analysis Using Genetic Algorithm (유전자 알고리즘을 이용한 사면안정해석의 일반화 해법)

  • Shin, Eun-Chul;Patra, Chittaranjan R.;Pradhan, R.
    • Journal of the Korean Geotechnical Society
    • /
    • 제24권3호
    • /
    • pp.5-11
    • /
    • 2008
  • This paper pertains to the incorporation of a genetic algorithm methodology for determining the critical slip surface and the corresponding factor of safety of soil slopes using inclined slice method. The analysis is formulated as a constrained optimization problem to solve the nonlinear equilibrium equations and finding the factor of safety and the critical slip surface. The sensitivity of GA optimization method is presented in terms of development of failure surface. Example problem is presented to demonstrate the efficiencies of the genetic algorithm approach. The results obtained by this method are compared with other traditional optimization technique.

Determining plasma boundary in Alvand-U tokamak

  • Yahya Sadeghi
    • Nuclear Engineering and Technology
    • /
    • 제55권9호
    • /
    • pp.3485-3492
    • /
    • 2023
  • One of the major topic of tokamak research is the determination of the magnetic profile due to magnetic coil fields and plasma current by mean of data from magnetic probes. The most practical approach is to use the current filament method, which models the plasma column with multiple current carrying filaments and the total current of these filaments is equal to the plasma current. Determining the plasma boundary in Alvand-U tokamak is the main purpose of this paper. In order to determine the magnetic field profile and plasma boundary, information concerning the magnetic coils, their position, and current is required in the computing code. Then, the plasma shape is determined and finally the plasma boundary is extracted by the code. In the conducted research, we discuss how to determine the plasma boundary and the performance of the computing code for extraction of the plasma boundary. The developed algorithm shows to be effective by running it in the regular pc machine with characteristics of Intel (R) core (TM) i3-10100 CPU @3.60 GHz and 8.00 GB of RAM. Finally, we present results of a test run for computing code using a typical experimental pulse.

Interactive Colision Detection for Deformable Models using Streaming AABBs

  • Zhang, Xinyu;Kim, Young-J.
    • 한국HCI학회:학술대회논문집
    • /
    • 한국HCI학회 2007년도 학술대회 3부
    • /
    • pp.306-317
    • /
    • 2007
  • We present an interactive and accurate collision detection algorithm for deformable, polygonal objects based on the streaming computational model. Our algorithm can detect all possible pairwise primitive-level intersections between two severely deforming models at highly interactive rates. In our streaming computational model, we consider a set of axis aligned bounding boxes (AABBs) that bound each of the given deformable objects as an input stream and perform massively-parallel pairwise, overlapping tests onto the incoming streams. As a result, we are able to prevent performance stalls in the streaming pipeline that can be caused by expensive indexing mechanism required by bounding volume hierarchy-based streaming algorithms. At run-time, as the underlying models deform over time, we employ a novel, streaming algorithm to update the geometric changes in the AABB streams. Moreover, in order to get only the computed result (i.e., collision results between AABBs) without reading back the entire output streams, we propose a streaming en/decoding strategy that can be performed in a hierarchical fashion. After determining overlapped AABBs, we perform a primitive-level (e.g., triangle) intersection checking on a serial computational model such as CPUs. We implemented the entire pipeline of our algorithm using off-the-shelf graphics processors (GPUs), such as nVIDIA GeForce 7800 GTX, for streaming computations, and Intel Dual Core 3.4G processors for serial computations. We benchmarked our algorithm with different models of varying complexities, ranging from 15K up to 50K triangles, under various deformation motions, and the timings were obtained as 30~100 FPS depending on the complexity of models and their relative configurations. Finally, we made comparisons with a well-known GPU-based collision detection algorithm, CULLIDE [4] and observed about three times performance improvement over the earlier approach. We also made comparisons with a SW-based AABB culling algorithm [2] and observed about two times improvement.

  • PDF

An Hybrid Approach for Designing Detention and Infiltration-based Retentions to Promote Sound Urban Hydrologic Cycle (도시 물 순환 건전성을 위한 유수지와 침투기반 저류지의 복합설계기법)

  • Choi, Chi-Hyun;Choi, Dae-Gyu;Lee, Jae-Kwan;Kim, Sang-Dan
    • Journal of Korean Society of Environmental Engineers
    • /
    • 제33권1호
    • /
    • pp.1-8
    • /
    • 2011
  • This article proposes a hybrid approach involved in determining the size of stormwater control facilities as part of a very large scale urban retrofit project. The objective of the proposed hybrid approach is to restore the pre-development hydrologic cycle. Firstly, an appropriate IETD is determined to isolate single storm events from the continuous rainfall record. Then, using the NRCS-CN method, direct runoff and infiltration volume are computed for every storm events. Long-term statistics of direct runoff and infiltration volume are analyzed in each case of pre-development, post development, post development with detention only, and post-development with the proposed hybrid approach. In order to preserve long-term statistics of direct runoff and infiltration volume in the case of pre-development, the size of detention and infiltration-based retention are estimated using the genetic algorithm. The result shows that the proposed hybrid approach is very useful for restoring statistics of natural direct runoff and infiltration volume.

Efficient and Robust Correspondence Detection between Unbalanced Stereo Images

  • Kim, Yong-Ho;Kim, Jong-Su;Lee, Sangkeun;Choi, Jong-Soo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제1권3호
    • /
    • pp.161-170
    • /
    • 2012
  • This paper presents an efficient and robust approach for determining the correspondence between unbalanced stereo images. The disparity vectors were used instead of feature points, such as corners, to calculate a correspondence relationship. For a faster and optimal estimation, the vectors were classified into several regions, and the homography of each region was calculated using the RANSAC algorithm. The correspondence image was calculated from the images transformed by each homography. Although it provided good results under normal conditions, it was difficult to obtain reliable results in an unbalanced stereo pair. Therefore, a balancing method is also proposed to minimize the unbalance effects using the histogram specification and structural similarity index. The experimental results showed that the proposed approach outperformed the baseline algorithms with respect to the speed and peak-signal-to-noise ratio. This work can be applied to practical fields including 3D depth map acquisition, fast stereo coding, 2D-to-3D conversion, etc.

  • PDF