Feeding and unloading operation for part manufacturing are widely applied by industrial robots. In this paper, a set of algorithms has been used to reach higher efficiency and automation of trajectory planning for a 6...
详细信息
Feeding and unloading operation for part manufacturing are widely applied by industrial robots. In this paper, a set of algorithms has been used to reach higher efficiency and automation of trajectory planning for a 6-DOF integrated serial kinematic manipulator. Depending on the key nodes of the joint angles calculated by a hybrid inverse kinematics algorithm, the continuous quintic B-spline curve algorithm was utilized for planning smooth trajectories of the feeding motion from peer to peer. An adaptivecuckoosearch (ACS) algorithm with high efficiency and excellent stability was proposed to minimize the total motion time under strict dynamic constraints. Comparing with 5 commonly used heuristic methods, the ACS algorithm has faster convergence speed and higher accuracy based on the same fitness function. To verify the implementation effect of the strategy, a 1:5 scale experimental platform was designed and built to implement the time-optimal trajectories. The simulations and experiments indicate that these algorithms lead to efficient planning of time-optimal and smooth trajectory in joint space.
This paper present three versions of cuckoosearchalgorithm (CSA) including conventional cuckoosearchalgorithm (CSA), modified CSA (MCSA) and adaptive CSA (ACSA) for solving the fixed head short-term hydrothermal s...
详细信息
This paper present three versions of cuckoosearchalgorithm (CSA) including conventional cuckoosearchalgorithm (CSA), modified CSA (MCSA) and adaptive CSA (ACSA) for solving the fixed head short-term hydrothermal scheduling (ST-HTS) problem where the reservoir volume constraints and nonconvex fuel cost function of thermal unit as well as the power losses in transmission line are taken into account. Among the applied methods, ACSA is first developed in the study by performing two modifications on second new solution generation via the action of an alien egg to be abandoned. In the ACSA, all initial solutions or all solutions at the end of the previous iteration are evaluated and sorted into two kinds of solution, good solutions with lower fitness function and bad solutions with higher fitness function. The implementation of the first new solution generation first via Levy flights in the ACSA is carried out similarly to that in MCSA. However, at the second new solution generation the ACSA evaluates the current solutions to choose the best one and use the information of the best one with a random solution to generate the second new solutions via the action of an alien egg to be abandoned. In addition, the probability of an alien egg discovery is considered an adaptive variable, which is set to the largest value at the beginning and decreased as the iteration is increased. Due to the adaptive value of the parameter, the ACSA can search an optimal solution but the trial runs are significantly decreased compared to CSA and MCSA. The performance of the ACSA is validated by testing on two systems and comparing with CSA, MCSA and other existing methods available in the paper.
This paper proposes an adaptive cuckoo search algorithm (ACSA) for optimization of structural engineering problems. ACSA - an improved cuckoosearchalgorithm, utilizes an adaptive step size selection strategy its div...
详细信息
ISBN:
(纸本)9781509060887
This paper proposes an adaptive cuckoo search algorithm (ACSA) for optimization of structural engineering problems. ACSA - an improved cuckoosearchalgorithm, utilizes an adaptive step size selection strategy its diversification process. This approach improves the convergence characteristic while preserves the balance between intensification and diversification performances in the CSA simultaneously. The effectiveness of the ACSA in solving structural optimization problems is demonstrated in three structural engineering problems. Performance assessment shows that the ACSA outperforms the standard CSA and other methods available in the literature in most of the case studies.
Aiming at the low accuracy of DV-Hop localization algorithm in three-dimensional localization of wireless sensor network, a DV-Hop localization algorithm optimized by adaptive cuckoo search algorithm was proposed in t...
详细信息
Aiming at the low accuracy of DV-Hop localization algorithm in three-dimensional localization of wireless sensor network, a DV-Hop localization algorithm optimized by adaptive cuckoo search algorithm was proposed in this paper. Firstly, an improved DV-Hop algorithm was proposed, which can reduce the localization error of DV-Hop algorithm by controlling the network topology and improving the method for calculating average hop distance. Meanwhile, aiming at the slow convergence in traditional cuckoosearchalgorithm, the adaptive strategy was improved for the step search strategy and the bird's nest recycling strategy. And the adaptive cuckoo search algorithm was introduced to the process of node localization to optimize the unknown node position estimation. The experiment results show that compared with the improved DV-Hop algorithm and the traditional DV-Hop algorithm, the DV-Hop algorithm optimized by adaptive cuckoo search algorithm improved the localization accuracy and reduced the localization errors.
In this study, real size complex steel space frame structures are numerically designed to achieve optimal design weight. For this aim, standard cuckoosearchalgorithm is rectified through a newly proposed adaptive me...
详细信息
In this study, real size complex steel space frame structures are numerically designed to achieve optimal design weight. For this aim, standard cuckoosearchalgorithm is rectified through a newly proposed adaptive method over two fundamental algorithmic parameters of alien egg probability detection (Pa) and step size control (alpha) to overcome incompetency of trapping into local optima. Besides, to strengthen exploitation phase of newly proposed algorithm, it is boosted with greedy selection (GS). So, novel algorithm has more promising exploration and exploitation capabilities. An 8-story, 1024-member and a 20-story, 1860-member real size complex steel space frame structures are selected as design examples. Also, initially to verify the supremacy of novel algorithm, a well-known welded beam is optimized as a benchmark structural design problem. Afterwards, the steel space frame structures are optimally designed via novel algorithm. Since ready steel section lists are utilized as selection pool for design variables, discrete programming problem is come into existence. The dead, live, snow, and wind design loads acting on frame structures are calculated in direction of ASCE 7-05 provisions. Furthermore, the structural design constraints are determined from LRFD-AISC specifications. Eventually, the newly proposed adaptive cuckoo search algorithm boosted with GS presents outstanding algorithmic performance.
Optimizing the electrical operating point is crucial for photovoltaic (PV) systems due to the significant impact of environmental factors on their output power. Conventional maximum power point tracking (MPPT) algorit...
详细信息
The accurate estimation of the ultrasonic backscattered echoes pattern is essential in ultrasonic non-destructive evaluation. In this paper, a generalized parametric ultrasonic echo mode was presented. It is influence...
详细信息
ISBN:
(纸本)9781728100036
The accurate estimation of the ultrasonic backscattered echoes pattern is essential in ultrasonic non-destructive evaluation. In this paper, a generalized parametric ultrasonic echo mode was presented. It is influenced by a set of parameters: echo bandwidth, arrival time, center frequency, amplitude and phase. The adaptivecuckoosearch (ACS) and Particle Swarm Optimization (PSO) algorithms are used to estimate these parameters and there performances are compared. In first, simulations are carried out to assess the performance of the two algorithms, then these algorithms were applied on experimental ultrasonic signal. The ACS algorithm outperforms PSO.
This paper proposes a new methodology to optimize network topology and placement of distributed generation (DG) in distribution network with an objective of reduction real power loss and voltage stability enhancement....
详细信息
This paper proposes a new methodology to optimize network topology and placement of distributed generation (DG) in distribution network with an objective of reduction real power loss and voltage stability enhancement. A meta-heuristic cuckoosearchalgorithm (CSA) inspired from the obligate brood parasitism of some cuckoo species which lay their eggs in the nests of other birds of other species for solving optimization problems is adapted to simultaneously reconfigure and identify the optimal location and size of DG units in a distribution network. The graph theory is used to determine the search space which reduces infeasible network configurations of reconfiguration process and check the radial constraint of each configuration of distribution network. The effectiveness of the proposed method has been validated on three different distribution network systems at seven different scenarios. The obtained results show well the effectiveness and performance of the proposed method in distribution network reconfiguration with optimal location and size of DG problems. (C) 2015 Elsevier Ltd. All rights reserved.
暂无评论