Optimal search path planning of UUV in battlefeld ambush scene

Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.

Comparison between 4D robust optimization methods for carbon-ion treatment planning

Intensity-modulated particle therapy(IMPT)with carbon ions is comparatively susceptible to various uncertainties caused by breathing motion,including range,setup,and target positioning uncertainties.To determine relative biological effectiveness-weighted dose(RWD)distributions that are resilient to these uncertainties,the reference phase-based four-dimensional(4D)robust optimization(RP-4DRO)and each phase-based 4D robust optimization(EP-4DRO)method in carbon-ion IMPT treatment planning were evaluated and compared.Based on RWD distributions,4DRO methods were compared with 4D conventional optimization using planning target volume(PTV)margins(PTV-based optimization)to assess the effectiveness of the robust optimization methods.Carbon-ion IMPT treatment planning was conducted in a cohort of five lung cancer patients.The results indicated that the EP-4DRO method provided better robustness(P=0.080)and improved plan quality(P=0.225)for the clinical target volume(CTV)in the individual respiratory phase when compared with the PTV-based optimization.Compared with the PTV-based optimization,the RP-4DRO method ensured the robustness(P=0.022)of the dose distributions in the reference breathing phase,albeit with a slight sacrifice of the target coverage(P=0.450).Both 4DRO methods successfully maintained the doses delivered to the organs at risk(OARs)below tolerable levels,which were lower than the doses in the PTV-based optimization(P<0.05).Furthermore,the RP-4DRO method exhibited significantly superior performance when compared with the EP-4DRO method in enhancing overall OAR sparing in either the individual respiratory phase or reference respiratory phase(P<0.05).In general,both 4DRO methods outperformed the PTV-based optimization in terms of OAR sparing and robustness.

Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

Traffic Management in Internet of Vehicles Using Improved Ant Colony Optimization

The Internet of Vehicles(IoV)is a networking paradigm related to the intercommunication of vehicles using a network.In a dynamic network,one of the key challenges in IoV is traffic management under increasing vehicles to avoid congestion.Therefore,optimal path selection to route traffic between the origin and destination is vital.This research proposed a realistic strategy to reduce traffic management service response time by enabling real-time content distribution in IoV systems using heterogeneous network access.Firstly,this work proposed a novel use of the Ant Colony Optimization(ACO)algorithm and formulated the path planning optimization problem as an Integer Linear Program(ILP).This integrates the future estimation metric to predict the future arrivals of the vehicles,searching the optimal routes.Considering the mobile nature of IOV,fuzzy logic is used for congestion level estimation along with the ACO to determine the optimal path.The model results indicate that the suggested scheme outperforms the existing state-of-the-art methods by identifying the shortest and most cost-effective path.Thus,this work strongly supports its use in applications having stringent Quality of Service(QoS)requirements for the vehicles.

Rotary unmanned aerial vehicles path planning in rough terrain based on multi-objective particle swarm optimization

This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.

Simulation and optimization approach for uncertainty-based short-term planning in open pit mines

Accuracy in predictions leads to better planning with a minimum of opportunity lost. In open pit mining,the complexity of operations, coupled with a highly uncertain and dynamic production environment,limit the accuracy of predictions and force a reactive planning approach to mitigate deviations from original plans. A simulation optimization framework/tool is presented in this paper to account for uncertainties in mining operations for robust short-term production planning and proactive decision making. This framework/tool uses a discrete event simulation model of mine operations, which interacts with a goalprogramming based mine operational optimization tool to develop an uncertainty based short-term schedule. Using scenario analysis, this framework allows the planner to make proactive decisions to achieve the mine's operational and long-term objectives. This paper details the development of simulation and optimization models and presents the implementation of the framework on an iron ore mine case study for verification through scenario analysis.

Path Planning of Continuum Robot Based on a New Improved Particle Swarm Optimization Algorithm

Continuum robot is a new type of biomimetic robot,which realizes the motion by bending some parts of its body.So its path planning becomes more difficult even compared with hyper-redundant robots.In this paper a circular arc spline interpolating method is proposed for the robot shape description,and a new two-stage position-selectable-updating particle swarm optimization(TPPSO)algorithm is put forward to solve this path planning problem.The algorithm decomposes the standard PSO velocity’s single-step updating formula into twostage multi-point updating,specifically adopting three points as candidates and selecting the best one as the updated position in the first half stage,and similarly taking seven points as candidates and selecting the best one as the final position in the last half stage.This scheme refines and widens each particle’s searching trajectory,increases the updating speed of the individual best,and improves the converging speed and precision.Aiming at the optimization objective to minimize the sum of all the motion displacements of every segmental points and all the axial stretching or contracting displacements of every segment,the TPPSO algorithm is used to solve the path planning problem.The detailed solution procedure is presented.Numerical examples of five path planning cases show that the proposed algorithm is simple,robust,and efficient.

Multi-objective evolutionary optimization for geostationary orbit satellite mission planning

In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide. This paper proposes a general working pattern for a GEO optical satellite, as well as a target observation mission planning model. After analyzing the requirements of users and satellite control agencies, two objectives are simultaneously considered: maximization of total profit and minimization of satellite attitude maneuver angle. An NSGA-II based multi-objective optimization algorithm is proposed, which contains some heuristic principles in the initialization phase and mutation operator, and is embedded with a traveling salesman problem (TSP) optimization. The validity and performance of the proposed method are verified by extensive numerical simulations that include several types of point target distributions.

A hybrid particle swarm optimization approach with neural network and set pair analysis for transmission network planning

Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, network reliability and the network loss are the main objective of transmission network planning. Combined with set pair analysis (SPA), particle swarm optimization (PSO), neural network (NN), a hybrid particle swarm optimization model was established with neural network and set pair analysis for transmission network planning (HPNS). Firstly, the contact degree of set pair analysis was introduced, the traditional goal set was converted into the collection of the three indicators including the identity degree, difference agree and contrary degree. On this bases, using shi(H), the three objective optimization problem was converted into single objective optimization problem. Secondly, using the fast and efficient search capabilities of PSO, the transmission network planning model based on set pair analysis was optimized. In the process of optimization, by improving the BP neural network constantly training so that the value of the fitness function of PSO becomes smaller in order to obtain the optimization program fitting the three objectives better. Finally, compared HPNS with PSO algorithm and the classic genetic algorithm, HPNS increased about 23% efficiency than THA, raised about 3.7% than PSO and improved about 2.96% than GA.

Locomotion Optimization and Manipulation Planning of a Tetrahedron-Based Mobile Mechanism with Binary Control

Locomotion and manipulation optimization is essential for the performance of tetrahedron-based mobile mechanism. Most of current optimization methods are constrained to the continuous actuated system with limited degree of freedom(DOF), which is infeasible to the optimization of binary control multi-DOF system. A novel optimization method using for the locomotion and manipulation of an 18 DOFs tetrahedron-based mechanism called 5-TET is proposed. The optimization objective is to realize the required locomotion by executing the least number of struts.Binary control strategy is adopted, and forward kinematic and tipping dynamic analyses are performed, respectively.Based on a developed genetic algorithm(GA), the optimal number of alternative struts between two adjacent steps is obtained as 5. Finally, a potential manipulation function is proposed, and the energy consumption comparison between optimal 5-TET and the traditional wheeled robot is carried out. The presented locomotion optimization and manipulation planning enrich the research of tetrahedron-based mechanisms and provide the instruction to the successive locomotion and operation planning of multi-DOF mechanisms.

Important Issues and Results When Considering the Stochastic Representation of Wind Power Plants in a Generation Optimization Model: An Application to the Large Brazilian Interconnected Power System

Wind power has an increasing share of the Brazilian energy market and may represent 11.6% of total capacity by 2024. For large hydro-thermal systems having high-storage capacity, a complementarity between hydro and wind production could have important effects. The current optimization models are applied to dispatch power plants to meet the market demand and optimize the generation dispatches considering only hydroelectric and thermal power plants. The remaining sources, including wind power, small-hydroelectric plants and biomass plants, are excluded from the optimization model and are included deterministically. This work introduces a general methodology to represent the stochastic behavior of wind production aimed at the planning and operation of large interconnected power systems. In fact, considering the generation of the wind power source stochastically could show the complementarity between the hydro and wind power production, reducing the energy price in the spot market with the reduction of thermal power dispatches. In addition to that, with a reduction in wind power and a simultaneous dry-season occurrence, this model, is able to show the need of thermal power plants dispatches as well as the reduction of the risk of energy shortages.

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization.A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal configurations.The feasibility of the formulated optimization problem is guaranteed under derived conditions.The optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/procedure.Simulation results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.

An Enhanced Equilibrium Optimizer for Solving Optimization Tasks

The equilibrium optimizer(EO)represents a new,physics-inspired metaheuristic optimization approach that draws inspiration from the principles governing the control of volume-based mixing to achieve dynamic mass equilibrium.Despite its innovative foundation,the EO exhibits certain limitations,including imbalances between exploration and exploitation,the tendency to local optima,and the susceptibility to loss of population diversity.To alleviate these drawbacks,this paper introduces an improved EO that adopts three strategies:adaptive inertia weight,Cauchy mutation,and adaptive sine cosine mechanism,called SCEO.Firstly,a new update formula is conceived by incorporating an adaptive inertia weight to reach an appropriate balance between exploration and exploitation.Next,an adaptive sine cosine mechanism is embedded to boost the global exploratory capacity.Finally,the Cauchy mutation is utilized to prevent the loss of population diversity during searching.To validate the efficacy of the proposed SCEO,a comprehensive evaluation is conducted on 15 classical benchmark functions and the CEC2017 test suite.The outcomes are subsequently benchmarked against both the conventional EO,its variants,and other cutting-edge metaheuristic techniques.The comparisons reveal that the SCEO method provides significantly superior results against the standard EO and other competitors.In addition,the developed SCEO is implemented to deal with a mobile robot path planning(MRPP)task,and compared to some classical metaheuristic approaches.The analysis results demonstrate that the SCEO approach provides the best performance and is a prospective tool for MRPP.

Cooperative Optimization of Reconfigurable Machine Tool Configurations and Production Process Plan

The production process plan design and configurations of reconfigurable machine tool （RMT） interact with each other. Reasonable process plans with suitable configurations of RMT help to improve product quality and reduce production cost. Therefore, a cooperative strategy is needed to concurrently solve the above issue. In this paper, the cooperative optimization model for RMT configurations and production process plan is presented. Its objectives take into account both impacts of process and configuration. Moreover, a novel genetic algorithm is also developed to provide optimal or near-optimal solutions： firstly, its chromosome is redesigned which is composed of three parts, operations, process plan and configurations of RMTs, respectively; secondly, its new selection, crossover and mutation operators are also developed to deal with the process constraints from operation processes （OP） graph, otherwise these operators could generate illegal solutions violating the limits; eventually the optimal configurations for RMT under optimal process plan design can be obtained. At last, a manufacturing line case is applied which is composed of three RMTs. It is shown from the case that the optimal process plan and configurations of RMT are concurrently obtained, and the production cost decreases 6.28% and nonmonetary performance increases 22%. The proposed method can figure out both RMT configurations and production process, improve production capacity, functions and equipment utilization for RMT.

Development of Path Planning Algorithm Using Probabilistic Roadmap Based on Modified Ant Colony Optimization

In this paper, a unique combination among probabilistic roadmap, modified ant colony optimization, and third order B-spline curve has been proposed to solve path planning problems?in complex and very complex environments. This proposed approach can be divided into three stages. First stage involves constructing a random roadmap depending on the environment complexity using probabilistic roadmap algorithm. Roadmap can be constructed by distributing N nodes randomly in complex and very complex static environments then pairing these nodes together according to some criteria or conditions. The constructed roadmap contains a huge number of possible random paths that may lead to connecting?the start and the goal points together. Second stage includes finding path within the pre-constructed roadmap. Modified ant colony optimization has been proposed to find or to search the best path between start and goal points, where in addition to the proposed combination, ACO has been modified to increase its ability to find shorter path. Finally, the third stage uses B-spline curve?to smooth and reduce the total length of the found path in the previous stage. The results of the proposed approach ensure?the?feasible?path between start and goal points in complex and very complex environments. Also, the path is guaranteed to be short, smooth, continuous?and safe.

Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two main categories: optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimi2ation algorithms of trajectory planning. In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functions are designed based on the specific weight coefficient method and ' ideal point strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot,the high-quality solutions are found at a lower cost.

Optimization of Path Planning for Construction Robots Based on Multiple Advanced Algorithms

There are many processes involved in construction, it is necessary to optimize the path planning of construction robots. Most researches focused more on optimization algorithms, but less on comparative analysis based on the advantages and shortcomings of these algorithms. Therefore, the innovation of this paper is to analyze three advanced optimization algorithms (genetic algorithm, hybrid particle swarm algorithm and ant colony algorithm) and discuss how these algorithms can improve the optimization performance by adjusting parameters. Finally, the three algorithms are compared and analyzed to find an optimization algorithm that is suitable for path planning optimization of construction robots. The purpose of the optimization is to obtain the maximum benefit with the least cost and complete project in an efficient and economical way.

Online AUV Path Replanning Using Quantum-Behaved Particle Swarm Optimization with Selective Differential Evolution

This paper presents an online AUV(autonomous underwater vehicle)path planner that employs path replanning approach and the SDEQPSO(selective differential evolution-hybridized quantum-behaved particle swarm optimization)algorithm to optimize an AUV mission conducted in an unknown,dynamic and cluttered ocean environment.The proposed path replanner considered the effect of ocean currents in path optimization to generate a Pareto-optimal path that guides the AUV to its target within minimum time.The optimization was based on the onboard sensor data measured from the environment,which consists of a priori unknown dynamic obstacles and spatiotemporal currents.Different sensor arrangements for the forward-looking sonar and horizontal acoustic Doppler current profiler(H-ADCP)were considered in 2D and 3D simulations.Based on the simulation results,the SDEQPSO path replanner was found to be capable of generating a time-optimal path that offered up to 13%reduction in travel time compared to the situation where the vehicle simply followed a path with the shortest distance.The proposed replanning technique also showed consistently better performance over a reactive path planner in terms of solution quality,stability,and computational efficiency.Robustness of the replanner was verified under stochastic process using the Monte Carlo method.The generated path fulfilled the vehicle’s safety and physical constraints,while intelligently exploiting ocean currents to improve the vehicle’s efficiency.

Land development suitability analysis for transport planning evaluation and optimization in mountainous ecological region

Transportation planning is a critical component for creating an orderly,intensive,and sustainable pattern of land development.By comprehensively considering the potential and suitability of transport construction,a comprehensive method combining resources and environmental carrying capacity(RECC)and land development suitability(LDS)was developed by using techniques of GIS,analytic hierarchy process(AHP)and threedimensional magic cube.Taking Aba prefecture in Sichuan Province of Southwest China as a case study,LDS for transportation was analyzed from three aspects,including overall planning layout,different transport modes,and transportation projects.The results showed that the transport planning scales of most counties in Aba were suitable,and the order of LDS of different transport modes was railway>highway=superhighway>tourism track,which already included 42 new transportation projects.We found that two counties(Maoxian County and Jiuzhaigou County)should improve the ecological protection level of transportation,in which the railway network construction should be encouraged,and some transportation projects with low LDS should be postponed or constructed harmlessly.We suggest the combination of RECC and LDS for transportation could enhance the territorial space optimization and sustainable transport construction.

An Optimization Model for the Production Planning of Overall Refinery

这篇文章探讨计划全面精炼厂的优化问题的生产。作者提出了混合了整数的优化问题线性编程。模型为优化与加工设备的跑模式的使用有关的全面精炼厂的生产计划考虑主要因素。这个计划的目的是决定哪个在一根给定的地平线的每个时期在每台工艺设备使用的跑模式，满足需求，例如总数，生产和库存的费用被最小化。产生模型能被认为是一个跑模式能生产并且消费超过一个产品的一个概括缩放许多的问题。产生优化问题大尺寸、 NP 难。作者建议了基于产生的算法为解决感兴趣的优化问题把 branch-and-price (BP ) 称为的列。算法的模型和实现在这篇文章详细被描述。计算结果验证建议模型和答案方法的有效性。