Intelligent PID controller based on ant system algorithm and fuzzy inference and its application to bionic artificial leg

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.

Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection（NNS） mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm＇s good performance with all these strategies on classic vehicle routing problem with time windows（VRPTW） benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.

Design of PID controller with incomplete derivation based on ant system algorithm

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.

Global optimal path planning for mobile robot based onimproved Dijkstra algorithm and ant system algorithm

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.

Hopfield neural network based on ant system

Hopfield neural network is a single layer feedforward neural network. Hopfield network requires some control parameters to be carefully selected, else the network is apt to converge to local minimum. An ant system is a nature inspired meta heuristic algorithm. It has been applied to several combinatorial optimization problems such as Traveling Salesman Problem, Scheduling Problems, etc. This paper will show an ant system may be used in tuning the network control parameters by a group of cooperated ants. The major advantage of this network is to adjust the network parameters automatically, avoiding a blind search for the set of control parameters. This network was tested on two TSP problems, 5 cities and 10 cities. The results have shown an obvious improvement.

Optimizing Bidders Selection of Multi-Round Procurement Problem in Software Project Management Using Parallel Max-Min Ant System Algorithm

This paper presents a Game-theoretic optimization via Parallel Min-Max Ant System(PMMAS)algorithm is used in practice to determine the Nash equilibrium value to resolve the confusion in choosing appropriate bidders of multi-round procurement problem in software project management.To this end,we introduce an approach that proposes:(i)A Game-theoretic model of multiround procurement problem(ii)A Nash equilibrium strategy corresponds to multi-round strategy bid(iii)An application of PSO for the determination of global Nash equilibrium.The balance point in Nash Equilibrium can help to maintain a sustainable structure not only in terms of project management but also in terms of future cooperation.As an alternative of procuring entities subjectively,a methodology to support decision making has been studied using Nash equilibrium to create a balance point on benefit in procurement where buyers and suppliers need multiple rounds of bidding.Our goal focus on the balance point in Nash Equilibrium to optimizing bidder selection in multi-round procurement which is the most beneficial for both investors and selected tenderers.Our PMMAS algorithm is implemented based on MPI(message passing interface)to find the approximate optimal solution for the question of how to choose bidders and ensure a path for a win-win relationship of all participants in the procurement process.We also evaluate the speedup ratio and parallel efficiency between our algorithm and other proposed algorithms.As the experiment results,the high feasibility and effectiveness of the PMMAS algorithm are verified.

Xive Implant System的临床应用评价

目的:评价XiveImplantSystem的临床效果。方法:应用XiveImplantSystem对失牙区进行即刻或延期种植,部分采用埋入或二次手术方式,部分采用一次手术直接安装愈合基台,对62例患者植入100枚种植体,金属烤瓷冠及8例后牙区因颌龈距过低而采用铸造冠修复。临床随访观察三年六个月。结果:种植体成功率100%,种植体周牙槽骨吸收<0.2mm/年,种植体周围炎2枚,固定螺丝松动2枚。结论:XiveImplantSystem适用于牙列缺损及缺失的延期或即刻修复。

Ant System Algorithm Research and Its Applications

In this paper, systematic review on Ant System (AS) algorithm research and application is made, and the authors works of introducing As algorithm into continuous space application are summarized. Then the applicability characters of AS in continuous space optimization problems are also discussed.

A Pre-Selection-Based Ant Colony System for Integrated Resources Scheduling Problem at Marine Container Terminal

Marine container terminal(MCT)plays a key role in the marine intelligent transportation system and international logistics system.However,the efficiency of resource scheduling significantly influences the operation performance of MCT.To solve the practical resource scheduling problem(RSP)in MCT efficiently,this paper has contributions to both the problem model and the algorithm design.Firstly,in the problem model,different from most of the existing studies that only consider scheduling part of the resources in MCT,we propose a unified mathematical model for formulating an integrated RSP.The new integrated RSP model allocates and schedules multiple MCT resources simultaneously by taking the total cost minimization as the objective.Secondly,in the algorithm design,a pre-selection-based ant colony system(PACS)approach is proposed based on graphic structure solution representation and a pre-selection strategy.On the one hand,as the RSP can be formulated as the shortest path problem on the directed complete graph,the graphic structure is proposed to represent the solution encoding to consider multiple constraints and multiple factors of the RSP,which effectively avoids the generation of infeasible solutions.On the other hand,the pre-selection strategy aims to reduce the computational burden of PACS and to fast obtain a higher-quality solution.To evaluate the performance of the proposed novel PACS in solving the new integrated RSP model,a set of test cases with different sizes is conducted.Experimental results and comparisons show the effectiveness and efficiency of the PACS algorithm,which can significantly outperform other state-of-the-art algorithms.

Path Planning of UAV by Combing Improved Ant Colony System and Dynamic Window Algorithm

A fusion algorithm is proposed to enhance the search speed of an ant colony system(ACS)for the global path planning and overcome the challenges of the local path planning in an unmanned aerial vehicle(UAV).The ACS search efficiency is enhanced by adopting a 16-direction 24-neighborhood search way,a safety grid search way,and an elite hybrid strategy to accelerate global convergence.Quadratic planning is performed using the moving average(MA)method.The fusion algorithm incorporates a dynamic window approach(DWA)to deal with the local path planning,sets a retracement mechanism,and adjusts the evaluation function accordingly.Experimental results in two environments demonstrate that the improved ant colony system(IACS)achieves superior planning efficiency.Additionally,the optimized dynamic window approach(ODWA)demonstrates its ability to handle multiple dynamic situations.Overall,the fusion optimization algorithm can accomplish the mixed path planning effectively.

An Improved Image Steganography Security and Capacity Using Ant Colony Algorithm Optimization

This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,should ideally achieve the dual purposes of maximum data hiding and maintenance of the integrity of the cover media so that it is least suspect.The contemporary methods of steganography are at best a compromise between these two.In this paper,we present our approach,entitled Ant Colony Optimization(ACO)-Least Significant Bit(LSB),which attempts to optimize the capacity in steganographic embedding.The approach makes use of a grayscale cover image to hide the confidential data with an additional bit pair per byte,both for integrity verification and the file checksumof the secret data.This approach encodes confidential information into four pairs of bits and embeds it within uncompressed grayscale images.The ACO algorithm uses adaptive exploration to select some pixels,maximizing the capacity of data embedding whileminimizing the degradation of visual quality.Pheromone evaporation is introduced through iterations to avoid stagnation in solution refinement.The levels of pheromone are modified to reinforce successful pixel choices.Experimental results obtained through the ACO-LSB method reveal that it clearly improves image steganography capabilities by providing an increase of up to 30%in the embedding capacity compared with traditional approaches;the average Peak Signal to Noise Ratio(PSNR)is 40.5 dB with a Structural Index Similarity(SSIM)of 0.98.The approach also demonstrates very high resistance to detection,cutting down the rate by 20%.Implemented in MATLAB R2023a,the model was tested against one thousand publicly available grayscale images,thus providing robust evidence of its effectiveness.

Optical redox imaging of ANT1-de-cient muscles

Adenine nucleotide translocator(ANT)is a mitochondrial protein involved in the exchange of ADP and ATP across the mitochondrial inner membrane.It plays a crucial role in cellular energy metabolism by facilitating the transport of ATP synthesized within the mitochondria to the cytoplasm.The isoform ANT1 predominately expresses in cardiac and skeletal muscles.Mutations or dysregulation in ANT1 have been implicated in various mitochondrial disorders and neuromuscular diseases.We aimed to examine whether ANT1 deletion may affect mitochondrial redox state in our established ANT1-de-cient mice.Hearts and quadriceps resected from age-matched wild type(WT)and ANT1-de-cient mice were snap-frozen in liquid nitrogen.The Chance redox scanner was utilized to perform 3D optical redox imaging.Each sample underwent scanning across 3–5 sections.Global averaging analysis showed no signi-cant differences in the redox indices(NADH,flavin adenine dinucleotide containing-flavoproteins Fp,and the redox ratio Fp/(NADH+Fp)between WT and ANT1-de-cient groups.However,quadriceps had higher Fp than hearts in both groups(p¼0:0004 and 0.01,respectively).Furthermore,the quadriceps were also more oxidized(a higher redox ratio)than hearts in WT group(p¼0:004).NADH levels were similar in all cases.Our data suggest that under non-stressful physical condition,the ANT1-de-cient muscle cells were in the same mitochondrial state as WT ones and that the signi-cant difference in the mitochondrial redox state between quadriceps and hearts found in WT might be diminished in ANT1-de-cient ones.Redox imaging of muscles under physical stress can be conducted in future.

MOALG: A Metaheuristic Hybrid of Multi-Objective Ant Lion Optimizer and Genetic Algorithm for Solving Design Problems

This study proposes a hybridization of two efficient algorithm’s Multi-objective Ant Lion Optimizer Algorithm(MOALO)which is a multi-objective enhanced version of the Ant Lion Optimizer Algorithm(ALO)and the Genetic Algorithm(GA).MOALO version has been employed to address those problems containing many objectives and an archive has been employed for retaining the non-dominated solutions.The uniqueness of the hybrid is that the operators like mutation and crossover of GA are employed in the archive to update the solutions and later those solutions go through the process of MOALO.A first-time hybrid of these algorithms is employed to solve multi-objective problems.The hybrid algorithm overcomes the limitation of ALO of getting caught in the local optimum and the requirement of more computational effort to converge GA.To evaluate the hybridized algorithm’s performance,a set of constrained,unconstrained test problems and engineering design problems were employed and compared with five well-known computational algorithms-MOALO,Multi-objective Crystal Structure Algorithm(MOCryStAl),Multi-objective Particle Swarm Optimization(MOPSO),Multi-objective Multiverse Optimization Algorithm(MOMVO),Multi-objective Salp Swarm Algorithm(MSSA).The outcomes of five performance metrics are statistically analyzed and the most efficient Pareto fronts comparison has been obtained.The proposed hybrid surpasses MOALO based on the results of hypervolume(HV),Spread,and Spacing.So primary objective of developing this hybrid approach has been achieved successfully.The proposed approach demonstrates superior performance on the test functions,showcasing robust convergence and comprehensive coverage that surpasses other existing algorithms.

Multi-Label Feature Selection Based on Improved Ant Colony Optimization Algorithm with Dynamic Redundancy and Label Dependence

The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.

Bio-Inspired Intelligent Routing in WSN: Integrating Mayfly Optimization and Enhanced Ant Colony Optimization for Energy-Efficient Cluster Formation and Maintenance

Wireless Sensor Networks(WSNs)are a collection of sensor nodes distributed in space and connected through wireless communication.The sensor nodes gather and store data about the real world around them.However,the nodes that are dependent on batteries will ultimately suffer an energy loss with time,which affects the lifetime of the network.This research proposes to achieve its primary goal by reducing energy consumption and increasing the network’s lifetime and stability.The present technique employs the hybrid Mayfly Optimization Algorithm-Enhanced Ant Colony Optimization(MFOA-EACO),where the Mayfly Optimization Algorithm(MFOA)is used to select the best cluster head(CH)from a set of nodes,and the Enhanced Ant Colony Optimization(EACO)technique is used to determine an optimal route between the cluster head and base station.The performance evaluation of our suggested hybrid approach is based on many parameters,including the number of active and dead nodes,node degree,distance,and energy usage.Our objective is to integrate MFOA-EACO to enhance energy efficiency and extend the network life of the WSN in the future.The proposed method outcomes proved to be better than traditional approaches such as Hybrid Squirrel-Flying Fox Optimization Algorithm(HSFLBOA),Hybrid Social Reindeer Optimization and Differential Evolution-Firefly Algorithm(HSRODE-FFA),Social Spider Distance Sensitive-Iterative Antlion Butterfly Cockroach Algorithm(SADSS-IABCA),and Energy Efficient Clustering Hierarchy Strategy-Improved Social Spider Algorithm Differential Evolution(EECHS-ISSADE).

基于Ant Design Pro的物流系统前端开发与用户体验优化研究

本文探讨了Ant Design Pro在物流系统开发中的应用,特别是其对用户体验和数据可视化的影响。通过采用案例研究方法,分析Ant Design Pro在构建企业级物流系统中的应用。研究发现,Ant Design Pro的一致性设计和丰富的组件库显著提升了开发效率和用户交互体验。此外,其数据可视化组件有效支持了复杂物流数据的呈现和分析。然而,其在性能优化和定制化需求方面面临着挑战。最终,本文提出了一系列基于Ant Design Pro的物流系统开发最佳实践,并对其潜在的改进方向进行了讨论。研究结果为物流行业的信息系统开发提供了实用的指导,并为Ant Design Pro社区贡献了宝贵的实践经验。

Micro-Arthropods in the Surroundings of Nests of Messor arenarius Ants in the Negev Desert in Israel

The present research investigated a segment of the micro-arthropod populations residing within nests of Messor arenarius ants in the Negev Desert of Israel. The total frequencies of micro-arthropods in the chaff of those ants’ nests were found to be higher than in the surrounding soil of the same nests. Acari (mites) were observed to be more abundant during the spring season, whereas their presence decreased during the summer months. Springtails (Collembola) were found to follow the Acari pattern, commonly found within the nests of those ants during spring but were absent during summer. Psocoptera order inhabiting soil habitats were infrequently encountered during spring, but their prevalence increased significantly during summer, particularly within the chaff of the ants’ nests, suggesting that chaff is their primary food source in the Negev Desert. Our research suggests that shifts in seasonality have important consequences on the distribution of soil invertebrate communities with implications on nutrient cycling.

A Distributed Ant Colony Optimization Applied in Edge Detection

With the rise of image data and increased complexity of tasks in edge detection, conventional artificial intelligence techniques have been severely impacted. To be able to solve even greater problems of the future, learning algorithms must maintain high speed and accuracy through economical means. Traditional edge detection approaches cannot detect edges in images in a timely manner due to memory and computational time constraints. In this work, a novel parallelized ant colony optimization technique in a distributed framework provided by the Hadoop/Map-Reduce infrastructure is proposed to improve the edge detection capabilities. Moreover, a filtering technique is applied to reduce the noisy background of images to achieve significant improvement in the accuracy of edge detection. Close examinations of the implementation of the proposed algorithm are discussed and demonstrated through experiments. Results reveal high classification accuracy and significant improvements in speedup, scaleup and sizeup compared to the standard algorithms.

An Effective Optimization Algorithm for Ant Colony Vehicular Congestion Management

Adaptability and dynamicity are special properties of social insects derived from the decentralized behavior of the insects. Authors have come up with designs for software solution that can regulate traffic congestion in a network transportation environment. The effectiveness of various researches on traffic management has been verified through appropriate metrics. Most of the traffic management systems are centered on using sensors, visual monitoring and neural networks to check for available parking space with the aim of informing drivers beforehand to prevent traffic congestion. There has been limited research on solving ongoing traffic congestion in congestion prone areas like car park with any of the common methods mentioned. This study focus however is on a motor park, as a highly congested area when it comes to traffic. The car park has two entrance gate and three exit gates which is divided into three Isle of parking lot where cars can park. An ant colony optimization algorithm (ACO) was developed as an effective management system for controlling navigation and vehicular traffic congestion problems when cars exit a motor park. The ACO based on the nature and movement of the natural ants, simulates the movement of cars out of the car park through their nearest choice exit. A car park simulation was also used for the mathematical computation of the pheromone. The system was implemented using SIMD because of its dual parallelization ability. The result showed about 95% increase on the number of vehicles that left the motor park in one second. A clear indication that pheromones are large determinants of the shortest route to take as cars followed the closest exit to them. Future researchers may consider monitoring a centralized tally system for cars coming into the park through a censored gate being.

Satellite Constellation Design with Adaptively Continuous Ant System Algorithm

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.