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.

Integrated Clustering and Routing Design and Triangle Path Optimization for UAV-Assisted Wireless Sensor Networks

With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery power.For this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this paper.Specifically,we use UAVs to assist the WSN in collecting data.In the current UAV-assisted WSN,the clustering and routing schemes are determined sequentially.However,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and routing.To efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing together.In the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing scheme.Therefore,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution faster.Unnecessary point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor nodes.To avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are indispensable.An emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of UAVs.Compared with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.

The Existing Problems and Optimization Paths of Digital Textbooks Under Background of Internet

With the rapid development of information technology,the combination of terminal technology,big data and mobile Internet and textbooks has become an irresistible trend in the modern education field.Under the context of the Internet,carrying out education and teaching activities based on digital textbooks can give full play to the rich media,openness and interaction of digital textbooks,broaden students′horizon,enrich students′knowledge,and promote the improvement of students′ability and all-round development.However,in the specific teaching practice,there are also problems such as old compilation ideas,single compilation mode and low efficiency of personalized learning.Therefore,schools and teachers need to constantly innovate the presentation and arrangement of digital textbooks,strengthen technical support,deepen students′understanding of the teaching content of digital textbooks,promote the comprehensive development of students and improve the effectiveness of digital textbook teaching.

Optimal path finding algorithms based on SLSD road network model

A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.

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.

Pattern recognition of optimal traffic path based on HMM

In order to alleviate urban traffic congestion and provide fast vehicle paths,a hidden Markov model(HMM)based on multi-feature data of urban regional roads is constructed to solve the problems of low recognition rate and poor instability of traditional model algorithms.At first,the HHM is obtained by training.Then according to dynamic planning principle,the traffic states of intersections are obtained by the Viterbi algorithm.Finally,the optimal path is selected based on the obtained traffic states of intersections.The experiment results show that the proposed method is superior to other algorithms in road unobstruction rate and recognition rate under complex road conditions.

Rescue vehicle allocation problem based on optimal reliable path under uncertainty

Consideration of the travel time variation for rescue vehicles is significant in the field of emergency management research.Because of uncertain factors,such as the weather or OD(origin-destination)variations caused by traffic accidents,travel time is a random variable.In emergency situations,it is particularly necessary to determine the optimal reliable route of rescue vehicles from the perspective of uncertainty.This paper first proposes an optimal reliable path finding(ORPF)model for rescue vehicles,which considers the uncertainties of travel time,and link correlations.On this basis,it investigates how to optimize rescue vehicle allocation to minimize rescue time,taking into account travel time reliability under uncertain conditions.Because of the non-additive property of the objective function,this paper adopts a heuristic algorithm based on the K-shortest path algorithm,and inequality techniques to tackle the proposed modified integer programming model.Finally,the numerical experiments are presented to verify the accuracy and effectiveness of the proposed model and algorithm.The results show that ignoring travel time reliability may lead to an over-or under-estimation of the effective travel time of rescue vehicles on a particular path,and thereby an incorrect allocation scheme.

Study on Applying Optimal Path to Land Valuation

As an important role in the urban land price system, the basic land price appraisal directs and refleets all kinds of land price in the real estate market. Using geographic information systems （GIS） with algo rithms and powerful analysis functions to valuate land will improve the rationality and convenience of land valu- ation. The objective of the study on basic land price using the optimal path algorithm is to decrease the man made error, enhance automatization, avoid make inconvenience by roadblock object.

Modeling optimal oil production paths under risk service contracts

Due to the rigorous fiscal terms and huge potential risk of risk service contracts,optimizing oil production paths is one of the main challenges in designing oilfield development plans.In this paper,an oil production path optimization model is developed to maximize economic benefits within constraints of technology factors and oil contracts.This analysis describes the effects of risk service contract terms on parameters of inputs and outputs and quantifies the relationships between production and production time,revenues,investment and costs.An oil service development and production project is illustrated in which the optimal production path under its own geological conditions and contract terms is calculated.The influences of oil price,service fees per barrel and operating costs on the optimal production have been examined by sensitivity analysis.The results show that the oil price has the largest impact on the optimal production,which is negatively related to oil price and positively related to service fees per barrel and operating costs.

Optimal paths planning in dynamic transportation networks with random link travel times

A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.

PREDICTIVE CONTROL FOR OPTIMAL PATH TERRAIN FOLLOWING SYSTEM

In this paper output predictive algorithm is applied to the design of predictive controller for an optimal path terrain following system. In this way, the error of path tracking is decreased to a minimum degree simply and efficiently and the computation time for the optimal path is shortened greatly. Therefore, the real-time processing of the optimal path terrain following system is made to be very helpful.

Research on AGV task path planning based on improved A^(*) algorithm

Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.

The Optimal Path Algorithm Analysis of GPS Navigation in Taxi Management System Based on A＊ Algorithm

The optimal path algorithm analysis of GPS navigation in taxi management system based on A＊ algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as ＂time-consuming and low efficiency＂ in Dijkstra algorithm with traversal search for each node, A＊ algorithm could help the taxi find the optimal path and bring convenience for traffic management.

Types and Optimization Paths Between Poverty Alleviation Effectiveness and Rural Revitalization:A Case Study of Hunan Province,China

Exploring the synergy types and optimization paths between Poverty Alleviation Effectiveness and Rural Revitalization is necessary for achieving the two centenary goals.Taking poverty alleviation counties in Hunan Province,China as an example,our study proposed an indicator to measure the synergistic development between Poverty Alleviation Effectiveness and Rural Revitalization using the multi-index integrated evaluation method.Then,the coupling types were classified based on both the proposed indicator and regional characteristics.Besides,the corresponding optimization path for each coupling type was proposed to promote the synergistic development of Poverty Alleviation and Rural Revitalization.Results are as follows:1)Lower synergy focused on the southwestern Hunan,while low synergy is widely distributed(such as the west,southwest,northwest,and midland).Moderate synergy is in the midland,such as Huaihua and Chenzhou cities.High synergy is distributed in Yongzhou,Huaihua,Xiangxi cities,etc.Besides,only Hecheng City belongs to the higher synergy.2)This paper proposes corresponding development paths for different development characteristics and main problems from multiple perspectives of the protection system,industrial planning,and rural market.Continuously consolidate and enhance the effectiveness of Poverty Alleviation and Rural Revitalization to achieve coupled and synergistic development of the two systems.Our research results can provide theoretical support for implementing Poverty Alleviation and Rural Revitalization in Hunan Province,China.

Increasing Undergraduate Student’s Satisfaction in Higher Educa-tion:Optimal Improvement Path Analysis

Undergraduate student’s satisfaction is fundamental to creating and implementing successful higher education.The present study sought to identify the factors and analyses impact on satisfaction and service quality.The research was carried out in Chinese higher education institution,with a sample of 1660 students.Based on the higher education satisfaction questionnaire,the“optimal path”model of problem improvement was constructed by applying the“structural equation model”,satisfaction and importance matrix diagram,improvement effect size and other tools.Eight major areas of three-dimensional improvement of“satisfaction,importance,and improvement effect”were formed.Identify the issues that students have urgent demands,high importance,and strong improvement effects.Scientifically analyze the main attention focus of each subgroup of students.Concentrate superior resources and strengths,formulate targeted measures and make key breakthroughs based on“light”,“heavy”,“slow”,“urgent”and“classified”.Provide suggestions for improving student’s satisfaction and promoting the development of high-quality connotative and characteristic development in higher education.

Multi-Objective Redundancy Optimization of Continuous-Point Robot Milling Path in Shipbuilding

The 6-DOF manipulator provides a new option for traditional shipbuilding for its advantages of vast working space,low power consumption,and excellent flexibility.However,the rotation of the end effector along the tool axis is functionally redundant when using a robotic arm for five-axis machining.In the process of ship construction,the performance of the parts’protective coating needs to bemachined tomeet the Performance Standard of Protective Coatings(PSPC).The arbitrary redundancy configuration in path planning will result in drastic fluctuations in the robot joint angle,greatly reducing machining quality and efficiency.There have been some studies on singleobjective optimization of redundant variables,However,the quality and efficiency of milling are not affected by a single factor,it is usually influenced by several factors,such as the manipulator stiffness,the joint motion smoothness,and the energy consumption.To solve this problem,this paper proposed a new path optimization method for the industrial robot when it is used for five-axis machining.The path smoothness performance index and the energy consumption index are established based on the joint acceleration and the joint velocity,respectively.The path planning issue is formulated as a constrained multi-objective optimization problem by taking into account the constraints of joint limits and singularity avoidance.Then,the path is split into multiple segments for optimization to avoid the slow convergence rate caused by the high dimension.An algorithm combining the non-dominated sorting genetic algorithm(NSGA-II)and the differential evolution(DE)algorithm is employed to solve the above optimization problem.The simulations validate the effectiveness of the algorithm,showing the improvement of smoothness and the reduction of energy consumption.

Research on dual-command operation path optimization based on Flying-V warehouse layout

To enhance the efficiency of warehouse order management,this study investigates a dual-com-mand operation mode in the Flying-V non-traditional warehouse layout.Three dual-command opera-tion strategies are designed,and a dual-command operation path optimization model is established with the shortest path as the optimization goal.Furthermore,a genetic algorithm based on a dynamic decoding strategy is proposed.Simulation results demonstrate that the Flying-V layout warehouse management and access cooperation operation can reduce the operation time by an average of 25%-35%compared with the single access operation path,and by an average of 13%-23%compared with the‘deposit first and then pick’operation path.These findings provide evidence for the effec-tiveness of the optimization model and algorithm.

Construction of Legal System of China's Farmland Protection under the Coexistence of Multiple Objectives:Historical Logic,Practical Problems and Optimization Paths

[Objectives]To explore the evolution of the legal system of farmland protection and explore the rules and characteristics of policy development based on the theory and logic of institutional change since China's reform and opening up,reveal the problems and deep-seated reasons of its legislation,clarify the direction of farmland protection in the new period,and solve the"non-agricultural""non-grain"and ecological problems of farmland.[Methods]Literature analysis and inductive deduction methods were used.[Results]The evolution of the farmland protection legal system has gone through the process of"national consciousness-policy guidelines-institutional system",the change from"single subject to multiple subjects";change from the use of"one-way administrative means to coordinated use of administrative,economic and technical means".The practical problems of the farmland protection legal system are mainly due to the insufficient systematization of the farmland protection legal system itself,the generalization of quantity protection,the transformation of quality protection,and the absence of ecological protection.[Conclusions]It is recommended to improve the existing farmland protection legal system from the establishment of the Farmland Protection Law,the improvement of the farmland protection public participation mechanism and supervision mechanism,the establishment of the farmland quality construction and improvement system,the differentiated farmland occupation and supplementation balance system,and the ecological restoration system.

Research on the Teaching Optimization Path in Children’s Creative Art Curriculum Under the Perspective of“Sanquan Education”

Children’s creative art curriculum is a professional course supported by art materials and techniques and facilitated through creative activities,aiming at cultivating students’ability to organize creative art activities using various art materials and techniques.In light of the evolving focus in China’s colleges and universities from“what to know”to“how to apply,”the pivotal question for educators is how to maximize the value of children’s creative art curriculum.Based on this,this article takes“Sanquan education”as the starting point,combines factual and theoretical arguments,and analyzes the teaching optimization path of children’s creative art curriculum under the perspective of Sanquan education,to improve the quality and efficiency of teaching.

TOOL PATH OPTIMIZATION OF POCKET CORNER

In milling around sharp corners, residual materials are left at sharp corners when the stepover is extremely long in the contour-parallel tool path. Milling force at the sharp corner rises momentarily due to the increase of the cutter contact length, thus shortening the tool life and leading to machine chatter, even cutter breakage. Then a tool path improvement method by inserting biarc transition segments in the contour-parallel tool path is proposed for milling the pocket. Using the method, the cutter moves along the biarc transition tool path. And the corner material is removed. The improved tool path is continuous for clearing residual materials at the sharp corner. Finally, the machining experiment validates the proposed method.