• 제목/요약/키워드: Swarm intelligence algorithms

검색결과 37건 처리시간 0.109초

군집지능과 모델개선기법을 이용한 구조물의 결함탐지 (Structural Damage Detection Using Swarm Intelligence and Model Updating Technique)

  • 최종헌;고봉환
    • 한국소음진동공학회논문집
    • /
    • 제19권9호
    • /
    • pp.884-891
    • /
    • 2009
  • This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.

Swarm Intelligence-based Power Allocation and Relay Selection Algorithm for wireless cooperative network

  • Xing, Yaxin;Chen, Yueyun;Lv, Chen;Gong, Zheng;Xu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1111-1130
    • /
    • 2016
  • Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

요청한 작업 경로에 따른 매니퓰레이터의 기구학적 변수 선정을 위한 군집 지능 기반 최적 설계 (Swarm Intelligence-based Optimal Design for Selecting the Kinematic Parameters of a Manipulator According to the Desired Task Space Trajectory)

  • 이준우
    • 한국생산제조학회지
    • /
    • 제25권6호
    • /
    • pp.504-510
    • /
    • 2016
  • Robots are widely utilized in many fields, and various demands need customized robots. This study proposes an optimal design method based on swarm intelligence for selecting the kinematic parameter of a manipulator according to the task space trajectory desired by the user. The optimal design method is dealt with herein as an optimization problem. This study is based on swarm intelligence-based optimization algorithms (i.e., ant colony optimization (ACO) and particle swarm optimization algorithms) to determine the optimal kinematic parameters of the manipulator. The former is used to select the optimal kinematic parameter values, whereas the latter is utilized to solve the inverse kinematic problem when the ACO determines the parameter values. This study solves a design problem with the PUMA 560 when the desired task space trajectory is given and discusses its results in the simulation part to verify the performance of the proposed design.

지능화 전장에서 인공지능 기반 공격용 군집드론 운용 방안 (The Development of Artificial Intelligence-Enabled Combat Swarm Drones in the Future Intelligent Battlefield)

  • 채희;이경석;엄정호
    • 융합보안논문지
    • /
    • 제23권3호
    • /
    • pp.65-71
    • /
    • 2023
  • 최근 발발한 러시아-우크라이나 전쟁을 통해 공격용 드론의 중요성이 부각되고 있다. 공격용 드론 활용은 그간의 재래식 전쟁의 통념을 깨는 게임체인저 역할을 하고 있다. 앞으로 지능화 전장에서 공격용 군집드론은 중요한 역할을 할 것으로 보인다. 이에 본 논문은 인공지능 기술을 바탕으로 향후 공격용 군집드론의 운용 발전 방향을 분석하고자 한다. 인간에 의해 운용되는 군집드론을 완전히 자율화된 군집드론으로 운용하기 위해서는 (1) 군집드론 운용에 최적화된 AI 알고리즘 적용, (2) 탈중앙식 지휘통제 방식 개발, (3) 드론 간 임무 분석 및 할당 자동화 기술 적용, (4) 드론 통신 보안 강화 및 (5) 무인화의 윤리 기준 확정이 중요하다. 세부적으로 군집드론 간의 충돌방지 및 이동형 표적을 공격하기 위한 AI 알고리즘이 필요하다. 또한, 급변하는 전장 상황에 빠르게 대처할 수 있는 탈중앙식 지휘통제 시스템 개발과 적 공격에 의한 드론 손실 발생 시 임무를 재할당 할 수 있어야 한다. 마지막으로, 군집드론의 안전한 운용을 위한 보안기술 개발 및 무인화에 따른 윤리문제 해결을 위한 기준제정이 중요하다.

Optimization Algorithms for Site Facility Layout Problems Using Self-Organizing Maps

  • Park, U-Yeol;An, Sung-Hoon
    • 한국건축시공학회지
    • /
    • 제12권6호
    • /
    • pp.664-673
    • /
    • 2012
  • Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

An Improvement of Particle Swarm Optimization with A Neighborhood Search Algorithm

  • Yano, Fumihiko;Shohdohji, Tsutomu;Toyoda, Yoshiaki
    • Industrial Engineering and Management Systems
    • /
    • 제6권1호
    • /
    • pp.64-71
    • /
    • 2007
  • J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.

Optimum design of steel space structures using social spider optimization algorithm with spider jump technique

  • Aydogdu, Ibrahim;Efe, Perihan;Yetkin, Metin;Akin, Alper
    • Structural Engineering and Mechanics
    • /
    • 제62권3호
    • /
    • pp.259-272
    • /
    • 2017
  • In this study, recently developed swarm intelligence algorithm called Social Spider Optimization (SSO) approach and its enhanced version of SSO algorithm with spider jump techniques is used to develop a structural optimization technique for steel space structures. The improved version of SSO uses adaptive randomness probability in generating new solutions. The objective function of the design optimization problem is taken as the weight of a steel space structure. Constraints' functions are implemented from American Institute of Steel Construction-Load Resistance factor design (AISC-LRFD) and Ad Hoc Committee report and practice which cover strength, serviceability and geometric requirements. Three steel space structures are optimized using both standard SSO and SSO with spider jump (SSO_SJ) algorithms and the results are compared with those available in the literature in order to investigate the performance of the proposed algorithms.

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • 제42권6호
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

Computer Architecture Execution Time Optimization Using Swarm in Machine Learning

  • Sarah AlBarakati;Sally AlQarni;Rehab K. Qarout;Kaouther Laabidi
    • International Journal of Computer Science & Network Security
    • /
    • 제23권10호
    • /
    • pp.49-56
    • /
    • 2023
  • Computer architecture serves as a link between application requirements and underlying technology capabilities such as technical, mathematical, medical, and business applications' computational and storage demands are constantly increasing. Machine learning these days grown and used in many fields and it performed better than traditional computing in applications that need to be implemented by using mathematical algorithms. A mathematical algorithm requires more extensive and quicker calculations, higher computer architecture specification, and takes longer execution time. Therefore, there is a need to improve the use of computer hardware such as CPU, memory, etc. optimization has a main role to reduce the execution time and improve the utilization of computer recourses. And for the importance of execution time in implementing machine learning supervised module linear regression, in this paper we focus on optimizing machine learning algorithms, for this purpose we write a (Diabetes prediction program) and applying on it a Practical Swarm Optimization (PSO) to reduce the execution time and improve the utilization of computer resources. Finally, a massive improvement in execution time were observed.

역할 모델의 적응적 전환을 통한 협업 채집 무리 로봇의 에너지 효율 향상 (Energy Efficient Cooperative Foraging Swarm Robots Using Adaptive Behavioral Model)

  • 이종현;안진웅;안창욱
    • 제어로봇시스템학회논문지
    • /
    • 제18권1호
    • /
    • pp.21-27
    • /
    • 2012
  • We can efficiently collect crops or minerals by operating multi-robot foraging. As foraging spaces become wider, control algorithms demand scalability and reliability. Swarm robotics is a state-of-the-art algorithm on wide foraging spaces due to its advantages, such as self-organization, robustness, and flexibility. However, high initial and operating costs are main barriers in performing multi-robot foraging system. In this paper, we propose a novel method to improve the energy efficiency of the system to reduce operating costs. The idea is to employ a new behavior model regarding role division in concert with the search space division.