The diffusion trajectory of a Brownian particle passing over the saddle point of a two-dimensional quadratic potential energy surface is tracked in detail according to the deep learning strategies.Generative adversari...The diffusion trajectory of a Brownian particle passing over the saddle point of a two-dimensional quadratic potential energy surface is tracked in detail according to the deep learning strategies.Generative adversarial networks(GANs)emanating in the category of machine learning(ML)frameworks are used to generate and assess the rationality of the data.While their optimization is based on the long short-term memory(LSTM)strategies.In addition to drawing a heat map,the optimal path of two-dimensional(2D)diffusion is simultaneously demonstrated in a stereoscopic space.The results of our simulation are completely consistent with the previous theoretical predictions.展开更多
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 an...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.展开更多
A numerical control (NC) tool path of digital CAD model is widely generated as a set of short line segments in machining. However, there are three shortcomings in the linear tool path, such as discontinuities of tange...A numerical control (NC) tool path of digital CAD model is widely generated as a set of short line segments in machining. However, there are three shortcomings in the linear tool path, such as discontinuities of tangency and curvature, huge number of line segments, and short lengths of line segments. These disadvantages hinder the development of high speed machining. To smooth the linear tool path and improve machining efficiency of short line segments, this paper presents an optimal feed interpolator based on G^2 continuous Bézier curves for the linear tool path. First, the areas suitable for fitting are screened out based on the geometric characteristics of continuous short segments (CSSs). CSSs in every area are compressed and fitted into a G^2 Continuous Bézier curve by using the least square method. Then a series of cubic Bézier curves are generated. However, the junction between adjacent Bézier curves is only G^0 continuous. By adjusting the control points and inserting Bézier transition curves between adjacent Bézier curves, the G^2 continuous tool path is constructed. The fitting error is estimated by the second-order Taylor formula. Without iteration, the fitting algorithm can be implemented in real-time environment. Second, the optimal feed interpolator considering the comprehensive constraints (such as the chord error constraint, the maximum normal acceleration, servo capacity of each axis, etc.) is proposed. Simulation and experiment are conducted. The results shows that the proposed method can generate smooth path, decrease the amount of segments and reduce machining time for machining of linear tool path. The proposed research provides an effective method for high-speed machining of complex 2-D/3-D profiles described by short line segments.展开更多
A controller which is locally optimal near the origin and globally inverse optimal for the nonlinear system is proposed for path following of over actuated marine crafts with actuator dynamics. The motivation is the e...A controller which is locally optimal near the origin and globally inverse optimal for the nonlinear system is proposed for path following of over actuated marine crafts with actuator dynamics. The motivation is the existence of undesired signals sent to the actuators, which can result in bad behavior in path following. To attenuate the oscillation of the control signal and obtain smooth thrust outputs, the actuator dynamics are added into the ship maneuvering model. Instead of modifying the Line-of-Sight (LOS) guidance law, this proposed controller can easily adjust the vessel speed to minimize the large cross-track error caused by the high vessel speed when it is turning. Numerical simulations demonstrate the validity of this proposed controller.展开更多
Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the...Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the travel quality of EVs.These limitations should be overcome to promote the use of EVs.In this study,a method for travel path planning considering EV power supply was developed.First,based on real-time road conditions,a dynamic energy model of EVs was established considering the driving energy and accessory energy.Second,a multi-objective travel path planning model of EVs was constructed considering the power supply,taking the distance,time,energy,and charging cost as the optimization objectives.Finally,taking the actual traffic network of 15 km×15 km area in a city as the research object,the model was simulated and verified in MATLAB based on Dijkstra shortest path algorithm.The simulation results show that compared with the traditional route planning method,the total distance in the proposed optimal route planning method increased by 1.18%,but the energy consumption,charging cost,and driving time decreased by 11.62%,41.26%and 11.00%,respectively,thus effectively reducing the travel cost of EVs and improving the driving quality of EVs.展开更多
Coordinated taxiing planning for multiple aircraft on flight deck is of vital importance which can dramatically improve the dispatching efficiency.In this paper,first,the coordinated taxiing path planning problem is t...Coordinated taxiing planning for multiple aircraft on flight deck is of vital importance which can dramatically improve the dispatching efficiency.In this paper,first,the coordinated taxiing path planning problem is transformed into a centralized optimal control problem where collision-free conditions and mechanical limits are considered.Since the formulated optimal control problem is of large state space and highly nonlinear,an efficient hierarchical initialization technique based on the Dubins-curve method is proposed.Then,a model predictive controller is designed to track the obtained reference trajectory in the presence of initial state error and external disturbances.Numerical experiments demonstrate that the proposed“offline planningþonline tracking”framework can achieve efficient and robust coordinated taxiing planning and tracking even in the presence of initial state error and continuous external disturbances.展开更多
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.展开更多
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 ...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.展开更多
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 b...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.展开更多
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 ...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.展开更多
Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved ...Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.展开更多
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...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.展开更多
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 mea...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.展开更多
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...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.展开更多
Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper propose...Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.展开更多
A contour-parallel offset （CPO） tool-path linking algorithm is derived without toolretractions and with the largest practicability. The concept of ＂tool-path loop tree＂ （TPL-tree） providing the information on th...A contour-parallel offset （CPO） tool-path linking algorithm is derived without toolretractions and with the largest practicability. The concept of ＂tool-path loop tree＂ （TPL-tree） providing the information on the parent/child relationships among the tool-path loops （TPLs） is presented. The direction, tool-path loop, leaf/branch, layer number, and the corresponding points of the TPL-tree are introduced. By defining TPL as a vector, and by traveling throughout the tree, a CPO tool-path without tool-retractions can be derived.展开更多
The Report of the 20th National Congress of the Communist Party of China explicitly emphasized the promotion of educational digitalization.The rapid development of new media in the era of network information has not o...The Report of the 20th National Congress of the Communist Party of China explicitly emphasized the promotion of educational digitalization.The rapid development of new media in the era of network information has not only broadened the horizons of college students but also profoundly transformed the content and methods of ideological and political education.As the frontline of ideological work,colleges and universities in Xinjiang are guided by the Party’s strategy for governing Xinjiang in the new era to advance network ideological and political education.This is of great significance in guiding students to develop correct network literacy and promoting ideological and political education to keep pace with the times.Through methods such as text analysis,questionnaire surveys,and interviews,this paper outlines the concept,characteristics,and value of network ideological and political education in colleges and universities in Xinjiang,analyzes its current development status and existing issues,and proposes optimization paths such as adhering to correct political guidance,highlighting regional characteristics,innovating educational methods,and strengthening subject construction.These efforts aim to fulfill the fundamental task of“cultivating talents with moral integrity”and serve the overall goal of social stability and long-term peace in Xinjiang.展开更多
It is well known that the sufficient family of time-optimal paths for both Dubins' as well as Reeds-Shepp' s car models consist of the concatenation of circular arcs with maximum curvature and straight line se...It is well known that the sufficient family of time-optimal paths for both Dubins' as well as Reeds-Shepp' s car models consist of the concatenation of circular arcs with maximum curvature and straight line segments, all tangentially connected. These time-optimal solutions suffer from some drawbacks. Their discontinuous curvature profile, together with the wear and impairment on the control equipment that the bang-bang solutions induce, calls for ' smoother' and more supple reference paths to follow. Avoiding the bang-bang solutions also raises the robustness with respect to any possible uncertainties. In this paper, our main tool for generating these “nearly time-optimal” , but nevertheless continuous-curvature paths, is to use the Pontryagin Maximum Principle (PMP) and make an appropriate and cunning choice of the Lagrangian function. Despite some rewarding simulation results, this concept turns out to be numerically divergent at some instances. Upon a more careful investigation, it can be concluded that the problem at hand is nearly singular. This is seen by applying the PMP to Dubins car and studying the corresponding two point boundary value problem, which turn out to be singular. Realizing this, one is able to contradict the widespread belief that all the information about the motion of a mobile platform lies in the initial values of the auxiliary variables associated with the PMP. Keywords Time-optimal paths - Motion planning - Optimal control - Pontryagin maximum principle - UGV展开更多
It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS...It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality.展开更多
基金supported by the Natural Science Foundation of Shandong Province(Grant No.ZR2020MA092)the Innovation Project for Graduate Students of Ludong University(Grant No.IPGS2024-048).
文摘The diffusion trajectory of a Brownian particle passing over the saddle point of a two-dimensional quadratic potential energy surface is tracked in detail according to the deep learning strategies.Generative adversarial networks(GANs)emanating in the category of machine learning(ML)frameworks are used to generate and assess the rationality of the data.While their optimization is based on the long short-term memory(LSTM)strategies.In addition to drawing a heat map,the optimal path of two-dimensional(2D)diffusion is simultaneously demonstrated in a stereoscopic space.The results of our simulation are completely consistent with the previous theoretical predictions.
基金The National Key Technology R&D Program of China during the 11th Five Year Plan Period(No.2008BAJ11B01)
文摘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.
基金Supported by National Natural Science Foundation of China(Grant No.50875171)National Hi-tech Research and Development Program of China(863 Program,Grant No.2009AA04Z150)
文摘A numerical control (NC) tool path of digital CAD model is widely generated as a set of short line segments in machining. However, there are three shortcomings in the linear tool path, such as discontinuities of tangency and curvature, huge number of line segments, and short lengths of line segments. These disadvantages hinder the development of high speed machining. To smooth the linear tool path and improve machining efficiency of short line segments, this paper presents an optimal feed interpolator based on G^2 continuous Bézier curves for the linear tool path. First, the areas suitable for fitting are screened out based on the geometric characteristics of continuous short segments (CSSs). CSSs in every area are compressed and fitted into a G^2 Continuous Bézier curve by using the least square method. Then a series of cubic Bézier curves are generated. However, the junction between adjacent Bézier curves is only G^0 continuous. By adjusting the control points and inserting Bézier transition curves between adjacent Bézier curves, the G^2 continuous tool path is constructed. The fitting error is estimated by the second-order Taylor formula. Without iteration, the fitting algorithm can be implemented in real-time environment. Second, the optimal feed interpolator considering the comprehensive constraints (such as the chord error constraint, the maximum normal acceleration, servo capacity of each axis, etc.) is proposed. Simulation and experiment are conducted. The results shows that the proposed method can generate smooth path, decrease the amount of segments and reduce machining time for machining of linear tool path. The proposed research provides an effective method for high-speed machining of complex 2-D/3-D profiles described by short line segments.
基金Supported by the National Natural Science Foundation of China under Grant Nos. 61301279, 51479158 and the Fundamental Research Funds for the Central Universities under Grant No. WUT: 163102006
文摘A controller which is locally optimal near the origin and globally inverse optimal for the nonlinear system is proposed for path following of over actuated marine crafts with actuator dynamics. The motivation is the existence of undesired signals sent to the actuators, which can result in bad behavior in path following. To attenuate the oscillation of the control signal and obtain smooth thrust outputs, the actuator dynamics are added into the ship maneuvering model. Instead of modifying the Line-of-Sight (LOS) guidance law, this proposed controller can easily adjust the vessel speed to minimize the large cross-track error caused by the high vessel speed when it is turning. Numerical simulations demonstrate the validity of this proposed controller.
基金Projects(51908388,51508315,51905320)supported by the National Natural Science Foundation of ChinaProject(2019 JZZY 010911)supported by the Key R&D Program of Shandong Province,China+1 种基金Project supported by the Shandong University of Technology&Zibo City Integration Develo pment Project,ChinaProject(ZR 2021 MG 012)supported by Shandong Provincial Natural Science Foundation,China。
文摘Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the travel quality of EVs.These limitations should be overcome to promote the use of EVs.In this study,a method for travel path planning considering EV power supply was developed.First,based on real-time road conditions,a dynamic energy model of EVs was established considering the driving energy and accessory energy.Second,a multi-objective travel path planning model of EVs was constructed considering the power supply,taking the distance,time,energy,and charging cost as the optimization objectives.Finally,taking the actual traffic network of 15 km×15 km area in a city as the research object,the model was simulated and verified in MATLAB based on Dijkstra shortest path algorithm.The simulation results show that compared with the traditional route planning method,the total distance in the proposed optimal route planning method increased by 1.18%,but the energy consumption,charging cost,and driving time decreased by 11.62%,41.26%and 11.00%,respectively,thus effectively reducing the travel cost of EVs and improving the driving quality of EVs.
文摘Coordinated taxiing planning for multiple aircraft on flight deck is of vital importance which can dramatically improve the dispatching efficiency.In this paper,first,the coordinated taxiing path planning problem is transformed into a centralized optimal control problem where collision-free conditions and mechanical limits are considered.Since the formulated optimal control problem is of large state space and highly nonlinear,an efficient hierarchical initialization technique based on the Dubins-curve method is proposed.Then,a model predictive controller is designed to track the obtained reference trajectory in the presence of initial state error and external disturbances.Numerical experiments demonstrate that the proposed“offline planningþonline tracking”framework can achieve efficient and robust coordinated taxiing planning and tracking even in the presence of initial state error and continuous external disturbances.
文摘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.
基金Natural Science Foundation of Gansu Provincial Science&Technology Department(No.1504GKCA018)。
文摘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.
基金Projects(72071202,71671184)supported by the National Natural Science Foundation of ChinaProject(22YJCZH144)supported by Humanities and Social Sciences Youth Foundation,Ministry of Education of China+3 种基金Project(2022M712680)supported by Postdoctoral Research Foundation of ChinaProject(22KJB110027)supported by Natural Science Foundation of Colleges and Universities in Jiangsu Province,ChinaProject(D2019046)supported by Initiation Foundation of Xuzhou Medical University,ChinaProject(2021SJA1079)supported by General Project of Philosophy and Social Science Research in Jiangsu Universities,China。
文摘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.
基金Funding for this work was provided by the Major Project from the National Social Science Foundation of China through research on replacement strategies for overseas oil and gas resources based on the perspective of China’s petroleum security under the project number 11&ZD164
文摘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.
文摘Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.
文摘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.
基金Project(71001079)supported by the National Natural Science Foundation of China
文摘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.
文摘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.
基金Supported by National Natural Science Foundation of P.R.China(50275150)National Research Foundation for the Doctoral Program of Higher Education of P.R.China(20040533035)
基金supported by the Shaanxi Province Natural Science Basic Research Program Project(2024JC-YBMS-572)partially funded by Yan’an University Graduate Education Innovation Program Project(YCX2023032,YCX2023033,YCX2024094,YCX2024097)the“14th Five Year Plan Medium and Long Term Major Scientific Research Project”(2021ZCQ015)of Yan’an University.
文摘Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.
文摘A contour-parallel offset （CPO） tool-path linking algorithm is derived without toolretractions and with the largest practicability. The concept of ＂tool-path loop tree＂ （TPL-tree） providing the information on the parent/child relationships among the tool-path loops （TPLs） is presented. The direction, tool-path loop, leaf/branch, layer number, and the corresponding points of the TPL-tree are introduced. By defining TPL as a vector, and by traveling throughout the tree, a CPO tool-path without tool-retractions can be derived.
基金Social Science Fund Project of the Xinjiang Uygur Autonomous Region“Research on the Construction of Network Ideological Discourse Power in Colleges and Universities in Xinjiang”(2023BKS010)。
文摘The Report of the 20th National Congress of the Communist Party of China explicitly emphasized the promotion of educational digitalization.The rapid development of new media in the era of network information has not only broadened the horizons of college students but also profoundly transformed the content and methods of ideological and political education.As the frontline of ideological work,colleges and universities in Xinjiang are guided by the Party’s strategy for governing Xinjiang in the new era to advance network ideological and political education.This is of great significance in guiding students to develop correct network literacy and promoting ideological and political education to keep pace with the times.Through methods such as text analysis,questionnaire surveys,and interviews,this paper outlines the concept,characteristics,and value of network ideological and political education in colleges and universities in Xinjiang,analyzes its current development status and existing issues,and proposes optimization paths such as adhering to correct political guidance,highlighting regional characteristics,innovating educational methods,and strengthening subject construction.These efforts aim to fulfill the fundamental task of“cultivating talents with moral integrity”and serve the overall goal of social stability and long-term peace in Xinjiang.
文摘It is well known that the sufficient family of time-optimal paths for both Dubins' as well as Reeds-Shepp' s car models consist of the concatenation of circular arcs with maximum curvature and straight line segments, all tangentially connected. These time-optimal solutions suffer from some drawbacks. Their discontinuous curvature profile, together with the wear and impairment on the control equipment that the bang-bang solutions induce, calls for ' smoother' and more supple reference paths to follow. Avoiding the bang-bang solutions also raises the robustness with respect to any possible uncertainties. In this paper, our main tool for generating these “nearly time-optimal” , but nevertheless continuous-curvature paths, is to use the Pontryagin Maximum Principle (PMP) and make an appropriate and cunning choice of the Lagrangian function. Despite some rewarding simulation results, this concept turns out to be numerically divergent at some instances. Upon a more careful investigation, it can be concluded that the problem at hand is nearly singular. This is seen by applying the PMP to Dubins car and studying the corresponding two point boundary value problem, which turn out to be singular. Realizing this, one is able to contradict the widespread belief that all the information about the motion of a mobile platform lies in the initial values of the auxiliary variables associated with the PMP. Keywords Time-optimal paths - Motion planning - Optimal control - Pontryagin maximum principle - UGV
文摘It is a challenging problem to provide quality-of-service （QoS） guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality.
