• Title/Summary/Keyword: Binary Particle Swarm Optimization

Search Result 29, Processing Time 0.025 seconds

Approach toward footstep planning considering the walking period: Optimization-based fast footstep planning for humanoid robots

  • Lee, Woong-Ki;Kim, In-Seok;Hong, Young-Dae
    • ETRI Journal
    • /
    • v.40 no.4
    • /
    • pp.471-482
    • /
    • 2018
  • This paper proposes the necessity of a walking period in footstep planning and details situations in which it should be considered. An optimization-based fast footstep planner that takes the walking period into consideration is also presented. This footstep planner comprises three stages. A binary search is first used to determine the walking period. The front stride, side stride, and walking direction are then determined using the modified rapidly-exploring random tree algorithm. Finally, particle swarm optimization (PSO) is performed to ensure feasibility without departing significantly from the results determined in the two stages. The parameters determined in the previous two stages are optimized together through the PSO. Fast footstep planning is essential for coping with dynamic obstacle environments; however, optimization techniques may require a large computation time. The two stages play an important role in limiting the search space in the PSO. This framework enables fast footstep planning without compromising on the benefits of a continuous optimization approach.

Dorsal Hand Vein Identification Based on Binary Particle Swarm Optimization

  • Benziane, Sarah Hachemi;Benyettou, Abdelkader
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.268-284
    • /
    • 2017
  • The dorsal hand vein biometric system developed has a main objective and specific targets; to get an electronic signature using a secure signature device. In this paper, we present our signature device with its different aims; respectively: The extraction of the dorsal veins from the images that were acquired through an infrared device. For each identification, we need the representation of the veins in the form of shape descriptors, which are invariant to translation, rotation and scaling; this extracted descriptor vector is the input of the matching step. The optimization decision system settings match the choice of threshold that allows accepting/rejecting a person, and selection of the most relevant descriptors, to minimize both FAR and FRR errors. The final decision for identification based descriptors selected by the PSO hybrid binary give a FAR =0% and FRR=0% as results.

Active Distribution System Planning Considering Battery Swapping Station for Low-carbon Objective using Immune Binary Firefly Algorithm

  • Shi, Ji-Ying;Li, Ya-Jing;Xue, Fei;Ling, Le-Tao;Liu, Wen-An;Yuan, Da-Ling;Yang, Ting
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.580-590
    • /
    • 2018
  • Active distribution system (ADS) considering distributed generation (DG) and electric vehicle (EV) is an effective way to cut carbon emission and improve system benefits. ADS is an evolving, complex and uncertain system, thus comprehensive model and effective optimization algorithms are needed. Battery swapping station (BSS) for EV service is an essential type of flexible load (FL). This paper establishes ADS planning model considering BSS firstly for the minimization of total cost including feeder investment, operation and maintenance, net loss and carbon tax. Meanwhile, immune binary firefly algorithm (IBFA) is proposed to optimize ADS planning. Firefly algorithm (FA) is a novel intelligent algorithm with simple structure and good convergence. By involving biological immune system into FA, IBFA adjusts antibody population scale to increase diversity and global search capability. To validate proposed algorithm, IBFA is compared with particle swarm optimization (PSO) algorithm on IEEE 39-bus system. The results prove that IBFA performs better than PSO in global search and convergence in ADS planning.

Modified Binary Particle Swarm Optimization using Genotype-Phenotype in Genetics (유전학의 유전자형-표현형을 적용한 수정된 이진 입자군집최적화)

  • Lim, Seungkyun;Lee, Sangwook
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2014.11a
    • /
    • pp.43-44
    • /
    • 2014
  • 본 논문에서는 유전알고리즘의 유전자형-표현형을 사용한 수정된 이진 입자군집최적화의 두 번째 버전을 소개한다. 첫 번째 버전의 수정된 이진 입자군집최적화는 위치 정보에 유전학의 표현형을 사용한 반면에 제안하는 버전은 유전학의 유전자형을 사용한다. 이진 정보만을 제공하는 표현형에 비해 연속 공간 전체를 탐색공간으로 제공하는 유전자형 정보를 사용하여 해 공간을 보다 넓은 공간으로 만들 수 있다. 10개의 실험 평가 함수에 실험한 결과, 두 번째 버전은 탐색 공간이 넓고 지역최적해가 많은 함수에서 우수한 결과를 보였다.

  • PDF

RBFNNs-based Recognition System of Vehicle License Plate Using Distortion Correction and Local Binarization (왜곡 보정과 지역 이진화를 이용한 RBFNNs 기반 차량 번호판 인식 시스템)

  • Kim, Sun-Hwan;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1531-1540
    • /
    • 2016
  • In this paper, we propose vehicle license plate recognition system based on Radial Basis Function Neural Networks (RBFNNs) with the use of local binarization functions and canny edge algorithm. In order to detect the area of license plate and also recognize license plate numbers, binary images are generated by using local binarization methods, which consider local brightness, and canny edge detection. The generated binary images provide information related to the size and the position of license plate. Additionally, image warping is used to compensate the distortion of images obtained from the side. After extracting license plate numbers, the dimensionality of number images is reduced through Principal Component Analysis (PCA) and is used as input variables to RBFNNs. Particle Swarm Optimization (PSO) algorithm is used to optimize a number of essential parameters needed to improve the accuracy of RBFNNs. Those optimized parameters include the number of clusters and the fuzzification coefficient used in the FCM algorithm, and the orders of polynomial of networks. Image data sets are obtained by changing the distance between stationary vehicle and camera and then used to evaluate the performance of the proposed system.

High Utility Itemset Mining by Using Binary PSO Algorithm with V-shaped Transfer Function and Nonlinear Acceleration Coefficient Strategy

  • Tao, Bodong;Shin, Ok Keun;Park, Hyu Chan
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.2
    • /
    • pp.103-112
    • /
    • 2022
  • The goal of pattern mining is to identify novel patterns in a database. High utility itemset mining (HUIM) is a research direction for pattern mining. This is different from frequent itemset mining (FIM), which additionally considers the quantity and profit of the commodity. Several algorithms have been used to mine high utility itemsets (HUIs). The original BPSO algorithm lacks local search capabilities in the subsequent stage, resulting in insufficient HUIs to be mined. Compared to the transfer function used in the original PSO algorithm, the V-shaped transfer function more sufficiently reflects the probability between the velocity and position change of the particles. Considering the influence of the acceleration factor on the particle motion mode and trajectory, a nonlinear acceleration strategy was used to enhance the search ability of the particles. Experiments show that the number of mined HUIs is 73% higher than that of the original BPSO algorithm, which indicates better performance of the proposed algorithm.

Optimized Simulation Framework for the Analysis in Battle systems (전투실험 분석을 위한 최적화 시뮬레이션 프레임워크)

  • Kang, Jong-Gu;Lee, Minkyu;Kim, Sunbum;Hwang, Kun-Chul;Lee, Donghoon
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.2
    • /
    • pp.1-9
    • /
    • 2015
  • The tactical employment is a critical factor to win the war in the modern battlefield. To apply optimized tactics, it needs analyses related to a battle system. Normally, M&S (Modeling & Simulation) has been studied to analyze data in general problems. However, this method is not suitable for military simulations because there are many variables which make complex interaction in the system. For this reason, we suggested the optimized simulation framework based on the M&S by using DPSO (Discrete binary version of PSO) algorithm. This optimized simulation framework makes the best tactical employment to reduce the searching time compared with the normal M&S used by Monte Carlo search method. This paper shows an example to find the best combination of anti-torpedo scenario in a short searching time. From the simulation example, the optimized simulation framework presents the effectiveness.

An Efficient Method to Extract the Micro-Motion Parameter of the Missile Using the Time-Frequency Image (시간-주파수 영상을 이용한 효과적인 미사일 미세운동 변수 추출 방법)

  • Choi, In-O;Kim, Si-Ho;Jung, Joo-Ho;Kim, Kyung-Tae;Park, Sang-Hong
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.6
    • /
    • pp.557-565
    • /
    • 2016
  • It is very difficult to intercept the missiles because of the small radar cross-section and the high maneuverability. In addition, due to the decoy with the similar motion parameters, additional features other than those of the translation motion parameters need to be developed. In this paper, for the successful recognition of missiles, we propose an efficient method to extract micro-motion parameters and scatterers of the missile engaged in the micro motion. The proposed method extracts motion parameters and scatterers by using the matching score between the modeled micro-Doppler function and the time-frequency binary image as a cost function. Simulation results using a target composed of the point scatterer show the parameters and the scatterers were accurately extracted.

Steel Plate Faults Diagnosis with S-MTS (S-MTS를 이용한 강판의 표면 결함 진단)

  • Kim, Joon-Young;Cha, Jae-Min;Shin, Junguk;Yeom, Choongsub
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.1
    • /
    • pp.47-67
    • /
    • 2017
  • Steel plate faults is one of important factors to affect the quality and price of the steel plates. So far many steelmakers generally have used visual inspection method that could be based on an inspector's intuition or experience. Specifically, the inspector checks the steel plate faults by looking the surface of the steel plates. However, the accuracy of this method is critically low that it can cause errors above 30% in judgment. Therefore, accurate steel plate faults diagnosis system has been continuously required in the industry. In order to meet the needs, this study proposed a new steel plate faults diagnosis system using Simultaneous MTS (S-MTS), which is an advanced Mahalanobis Taguchi System (MTS) algorithm, to classify various surface defects of the steel plates. MTS has generally been used to solve binary classification problems in various fields, but MTS was not used for multiclass classification due to its low accuracy. The reason is that only one mahalanobis space is established in the MTS. In contrast, S-MTS is suitable for multi-class classification. That is, S-MTS establishes individual mahalanobis space for each class. 'Simultaneous' implies comparing mahalanobis distances at the same time. The proposed steel plate faults diagnosis system was developed in four main stages. In the first stage, after various reference groups and related variables are defined, data of the steel plate faults is collected and used to establish the individual mahalanobis space per the reference groups and construct the full measurement scale. In the second stage, the mahalanobis distances of test groups is calculated based on the established mahalanobis spaces of the reference groups. Then, appropriateness of the spaces is verified by examining the separability of the mahalanobis diatances. In the third stage, orthogonal arrays and Signal-to-Noise (SN) ratio of dynamic type are applied for variable optimization. Also, Overall SN ratio gain is derived from the SN ratio and SN ratio gain. If the derived overall SN ratio gain is negative, it means that the variable should be removed. However, the variable with the positive gain may be considered as worth keeping. Finally, in the fourth stage, the measurement scale that is composed of selected useful variables is reconstructed. Next, an experimental test should be implemented to verify the ability of multi-class classification and thus the accuracy of the classification is acquired. If the accuracy is acceptable, this diagnosis system can be used for future applications. Also, this study compared the accuracy of the proposed steel plate faults diagnosis system with that of other popular classification algorithms including Decision Tree, Multi Perception Neural Network (MLPNN), Logistic Regression (LR), Support Vector Machine (SVM), Tree Bagger Random Forest, Grid Search (GS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The steel plates faults dataset used in the study is taken from the University of California at Irvine (UCI) machine learning repository. As a result, the proposed steel plate faults diagnosis system based on S-MTS shows 90.79% of classification accuracy. The accuracy of the proposed diagnosis system is 6-27% higher than MLPNN, LR, GS, GA and PSO. Based on the fact that the accuracy of commercial systems is only about 75-80%, it means that the proposed system has enough classification performance to be applied in the industry. In addition, the proposed system can reduce the number of measurement sensors that are installed in the fields because of variable optimization process. These results show that the proposed system not only can have a good ability on the steel plate faults diagnosis but also reduce operation and maintenance cost. For our future work, it will be applied in the fields to validate actual effectiveness of the proposed system and plan to improve the accuracy based on the results.