A motion parameter optimization method based on the objective of minimizing the total energy consumption in segment positioning was proposed for segment erector of shield tunneling machine. The segment positioning pro...A motion parameter optimization method based on the objective of minimizing the total energy consumption in segment positioning was proposed for segment erector of shield tunneling machine. The segment positioning process was decomposed into rotation, lifting and sliding actions in deriving the energy calculation model of segment erection. The work of gravity was taken into account in the mathematical modeling of energy consumed by each actuator. In order to investigate the relationship between the work done by the actuator and the path moved along by the segment, the upward and downward directions as well as the operating quadrant of the segment erector were defined. Piecewise nonlinear function of energy was presented, of which the result is determined by closely coupled components as working parameters and some intermediate variables. Finally, the effectiveness of the optimization method was proved by conducting a case study with a segment erector for the tunnel with a diameter of 3 m and drawing comparisons between different assembling paths. The results show that the energy required by assembling a ring of segments along the optimized moving path can be reduced up to 5%. The method proposed in this work definitely provides an effective energy saving solution for shield tunneling machine.展开更多
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 ...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.展开更多
Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal gu...Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.展开更多
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.展开更多
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.展开更多
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.展开更多
A hardware/software co-synthesis method is presented for SoC designs consisting of both hardware IP cores and software components on a graph-theoretic formulation. Given a SoC integrated with a set of functions and a ...A hardware/software co-synthesis method is presented for SoC designs consisting of both hardware IP cores and software components on a graph-theoretic formulation. Given a SoC integrated with a set of functions and a set of performance factors, a core for each function is selected from a set of alternative IP cores and software components, and optimal partitions is found in a way to evenly balance the performance factors and to ultimately reduce the overall cost, size, power consumption and runtime of the core-based SoC. The algorithm formulates IP cores and components into the corresponding mathematical models, presents a graph-theoretic model for finding the optimal partitions of SoC design and transforms SoC hardware/software co-synthesis problem into finding optimal paths in a weighted, directed graph. Overcoming the three main deficiencies of the traditional methods, this method can work automatically, evaluate more performance factors at the same time and meet the particularity of SoC designs. At last, the approach is illustrated that is practical and effective through partitioning a practical system.展开更多
基金Project(51305328)supported by the National Natural Science Foundation of ChinaProject(2012AA041803)supported by the NationalHigh Technology R&D Program of China+1 种基金Project(GZKF-201210)supported by the Open Fund of State Key Laboratory of Fluid Power Transmission and Control of Zhejiang University,ChinaProject(2013M532031)supported by the China Postdoctoral Science Foundation
文摘A motion parameter optimization method based on the objective of minimizing the total energy consumption in segment positioning was proposed for segment erector of shield tunneling machine. The segment positioning process was decomposed into rotation, lifting and sliding actions in deriving the energy calculation model of segment erection. The work of gravity was taken into account in the mathematical modeling of energy consumed by each actuator. In order to investigate the relationship between the work done by the actuator and the path moved along by the segment, the upward and downward directions as well as the operating quadrant of the segment erector were defined. Piecewise nonlinear function of energy was presented, of which the result is determined by closely coupled components as working parameters and some intermediate variables. Finally, the effectiveness of the optimization method was proved by conducting a case study with a segment erector for the tunnel with a diameter of 3 m and drawing comparisons between different assembling paths. The results show that the energy required by assembling a ring of segments along the optimized moving path can be reduced up to 5%. The method proposed in this work definitely provides an effective energy saving solution for shield tunneling machine.
文摘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.
基金supported by the financial support of the ship segmentation intelligent manufacturing equipment solution and key common technology research,High-tech Ship Research Project of the Chinese Ministry of Science and Technology and the project of Shandong Provincial Key R&D Program(No.2019GGX104035).
文摘Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.
文摘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.
基金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.
基金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.
基金This project was supported by the Defense Pre-Research Project of the ‘Tenth Five-Year-Plan’ of China(41315040106) and the National"863"High Technology Research and Development Programof China (2003AAIZ2210)
文摘A hardware/software co-synthesis method is presented for SoC designs consisting of both hardware IP cores and software components on a graph-theoretic formulation. Given a SoC integrated with a set of functions and a set of performance factors, a core for each function is selected from a set of alternative IP cores and software components, and optimal partitions is found in a way to evenly balance the performance factors and to ultimately reduce the overall cost, size, power consumption and runtime of the core-based SoC. The algorithm formulates IP cores and components into the corresponding mathematical models, presents a graph-theoretic model for finding the optimal partitions of SoC design and transforms SoC hardware/software co-synthesis problem into finding optimal paths in a weighted, directed graph. Overcoming the three main deficiencies of the traditional methods, this method can work automatically, evaluate more performance factors at the same time and meet the particularity of SoC designs. At last, the approach is illustrated that is practical and effective through partitioning a practical system.
