A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
A designing method of intelligent proportional-integral-derivative(PID) controllers was proposed based on the ant system algorithm and fuzzy inference. This kind of controller is called Fuzzy-ant system PID controller...A designing method of intelligent proportional-integral-derivative(PID) controllers was proposed based on the ant system algorithm and fuzzy inference. This kind of controller is called Fuzzy-ant system PID controller. It consists of an off-line part and an on-line part. In the off-line part, for a given control system with a PID controller,by taking the overshoot, setting time and steady-state error of the system unit step response as the performance indexes and by using the ant system algorithm, a group of optimal PID parameters K*p , Ti* and T*d can be obtained, which are used as the initial values for the on-line tuning of PID parameters. In the on-line part, based on Kp* , Ti*and Td* and according to the current system error e and its time derivative, a specific program is written, which is used to optimize and adjust the PID parameters on-line through a fuzzy inference mechanism to ensure that the system response has optimal transient and steady-state performance. This kind of intelligent PID controller can be used to control the motor of the intelligent bionic artificial leg designed by the authors. The result of computer simulation experiment shows that the controller has less overshoot and shorter setting time.展开更多
The ant system algorithm (ASA) has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n + 1^ -fold cov...The ant system algorithm (ASA) has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n + 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.展开更多
A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal ...A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal PID controller parameters K p * , T i * , and T d * can be obtained by taking the overshoot, settling time, and steady-state error of the system's unit step response as the performance indexes and by use of our improved ant system algorithm. K p * , T i * , and T d * can be used in real-time control. This kind of controller is called the ASA-PID controller with incomplete derivation. To verify the performance of the ASA-PID controller, three different typical transfer functions were tested, and three existing typical tuning methods of PID controller parameters, including the Ziegler-Nichols method (ZN),the genetic algorithm (GA),and the simulated annealing (SA), were adopted for comparison. The simulation results showed that the ASA-PID controller can be used to control different objects and has better performance compared with the ZN-PID and GA-PID controllers, and comparable performance compared with the SA-PID controller.展开更多
Dynamic voltage scaling (DVS), supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some wi...Dynamic voltage scaling (DVS), supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some with quite good results. However, the previous algorithms either have a large time complexity or obtain results sensitive to the count of the voltage modes. Fine-grained voltage modes lead to optimal results, but coarse-grained voltage modes cause less optimal one. A new algorithm is presented, which is based on ant colony optimization, called ant colony optimization voltage and task scheduling (ACO-VTS) with a low time complexity implemented by parallelizing and its linear time approximation algorithm. Both of them generate quite good results, saving up to 30% more energy than that of the previous ones under coarse-grained modes, and their results don’t depend on the number of modes available.展开更多
The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become...The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints.So far,little research has been carried out in this field.This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes.Three optimization objectives are considered simultaneously: maximum probability of average fault,maximum average importance,and minimum average complexity of test.Under the constraints of both known symptoms and the causal relationship among different components,a multi-objective optimization mathematical model is set up,taking minimizing cost of fault reasoning as the target function.Since the problem is non-deterministic polynomial-hard(NP-hard),a modified multi-objective ant colony algorithm is proposed,in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives.At last,a Pareto optimal set is acquired.Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set,through which the final fault causes can be identified according to decision-making demands,thus realize fault reasoning of the multi-constraint and multi-objective complex system.Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model,which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.展开更多
Travelling Salesman Problem(TSP) is a classical optimization problem and it is one of a class of NP-Problem.The purposes of this work is to apply data mining methodologies to explore the patterns in data generated by ...Travelling Salesman Problem(TSP) is a classical optimization problem and it is one of a class of NP-Problem.The purposes of this work is to apply data mining methodologies to explore the patterns in data generated by an Ant Colony Algorithm(ACA) performing a searching operation and to develop a rule set searcher which approximates the ACA′s searcher.An attribute-oriented induction methodology was used to explore the relationship between an operations′ sequence and its attributes and a set of rules has been developed.At the end of this paper,the experimental results have shown that the proposed approach has good performance with respect to the quality of solution and the speed of computation.展开更多
This work proposes a novel nature-inspired algorithm called Ant Lion Optimizer (ALO). The ALO algorithm mimics the search mechanism of antlions in nature. A time domain based objective function is established to tune ...This work proposes a novel nature-inspired algorithm called Ant Lion Optimizer (ALO). The ALO algorithm mimics the search mechanism of antlions in nature. A time domain based objective function is established to tune the parameters of the PI controller based LFC, which is solved by the proposed ALO algorithm to reach the most convenient solutions. A three-area interconnected power system is investigated as a test system under various loading conditions to confirm the effectiveness of the suggested algorithm. Simulation results are given to show the enhanced performance of the developed ALO algorithm based controllers in comparison with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Bat Algorithm (BAT) and conventional PI controller. These results represent that the proposed BAT algorithm tuned PI controller offers better performance over other soft computing algorithms in conditions of settling times and several performance indices.展开更多
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP),which has been widely applied in the conventional automated storage and retri...The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP),which has been widely applied in the conventional automated storage and retrieval system(AS/RS).However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period(SWP) and lift idle period(LIP) during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.展开更多
摘要A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
摘要A designing method of intelligent proportional-integral-derivative(PID) controllers was proposed based on the ant system algorithm and fuzzy inference. This kind of controller is called Fuzzy-ant system PID controller. It consists of an off-line part and an on-line part. In the off-line part, for a given control system with a PID controller,by taking the overshoot, setting time and steady-state error of the system unit step response as the performance indexes and by using the ant system algorithm, a group of optimal PID parameters K*p , Ti* and T*d can be obtained, which are used as the initial values for the on-line tuning of PID parameters. In the on-line part, based on Kp* , Ti*and Td* and according to the current system error e and its time derivative, a specific program is written, which is used to optimize and adjust the PID parameters on-line through a fuzzy inference mechanism to ensure that the system response has optimal transient and steady-state performance. This kind of intelligent PID controller can be used to control the motor of the intelligent bionic artificial leg designed by the authors. The result of computer simulation experiment shows that the controller has less overshoot and shorter setting time.
摘要The ant system algorithm (ASA) has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n + 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.
基金This work was supported by the National Natural Science Foundation of China (No. 50275150)the Foundation of Robotics Laboratory, Chinese Academy of Sciences( No. RL200002).
摘要A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal PID controller parameters K p * , T i * , and T d * can be obtained by taking the overshoot, settling time, and steady-state error of the system's unit step response as the performance indexes and by use of our improved ant system algorithm. K p * , T i * , and T d * can be used in real-time control. This kind of controller is called the ASA-PID controller with incomplete derivation. To verify the performance of the ASA-PID controller, three different typical transfer functions were tested, and three existing typical tuning methods of PID controller parameters, including the Ziegler-Nichols method (ZN),the genetic algorithm (GA),and the simulated annealing (SA), were adopted for comparison. The simulation results showed that the ASA-PID controller can be used to control different objects and has better performance compared with the ZN-PID and GA-PID controllers, and comparable performance compared with the SA-PID controller.
基金the National"973"Basic Research Programof China (2004CB318202)
摘要Dynamic voltage scaling (DVS), supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some with quite good results. However, the previous algorithms either have a large time complexity or obtain results sensitive to the count of the voltage modes. Fine-grained voltage modes lead to optimal results, but coarse-grained voltage modes cause less optimal one. A new algorithm is presented, which is based on ant colony optimization, called ant colony optimization voltage and task scheduling (ACO-VTS) with a low time complexity implemented by parallelizing and its linear time approximation algorithm. Both of them generate quite good results, saving up to 30% more energy than that of the previous ones under coarse-grained modes, and their results don’t depend on the number of modes available.
基金supported by Sub-project of Key National Science and Technology Special Project of China(Grant No.2011ZX05056)
摘要The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints.So far,little research has been carried out in this field.This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes.Three optimization objectives are considered simultaneously: maximum probability of average fault,maximum average importance,and minimum average complexity of test.Under the constraints of both known symptoms and the causal relationship among different components,a multi-objective optimization mathematical model is set up,taking minimizing cost of fault reasoning as the target function.Since the problem is non-deterministic polynomial-hard(NP-hard),a modified multi-objective ant colony algorithm is proposed,in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives.At last,a Pareto optimal set is acquired.Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set,through which the final fault causes can be identified according to decision-making demands,thus realize fault reasoning of the multi-constraint and multi-objective complex system.Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model,which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.
摘要Travelling Salesman Problem(TSP) is a classical optimization problem and it is one of a class of NP-Problem.The purposes of this work is to apply data mining methodologies to explore the patterns in data generated by an Ant Colony Algorithm(ACA) performing a searching operation and to develop a rule set searcher which approximates the ACA′s searcher.An attribute-oriented induction methodology was used to explore the relationship between an operations′ sequence and its attributes and a set of rules has been developed.At the end of this paper,the experimental results have shown that the proposed approach has good performance with respect to the quality of solution and the speed of computation.
摘要This work proposes a novel nature-inspired algorithm called Ant Lion Optimizer (ALO). The ALO algorithm mimics the search mechanism of antlions in nature. A time domain based objective function is established to tune the parameters of the PI controller based LFC, which is solved by the proposed ALO algorithm to reach the most convenient solutions. A three-area interconnected power system is investigated as a test system under various loading conditions to confirm the effectiveness of the suggested algorithm. Simulation results are given to show the enhanced performance of the developed ALO algorithm based controllers in comparison with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Bat Algorithm (BAT) and conventional PI controller. These results represent that the proposed BAT algorithm tuned PI controller offers better performance over other soft computing algorithms in conditions of settling times and several performance indices.
基金Supported by National Natural Science Foundation of China(Grant No.661403234)Shandong Provincial Science and Techhnology Development Plan of China(Grant No.2014GGX106009)
摘要The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP),which has been widely applied in the conventional automated storage and retrieval system(AS/RS).However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period(SWP) and lift idle period(LIP) during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.