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.展开更多
Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a complicated problem.A planning algorithm capable of negotiating both static and moving obstacles in an unpredictable(on-lin...Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a complicated problem.A planning algorithm capable of negotiating both static and moving obstacles in an unpredictable(on-line)environment is proposed.The proposed incremental algorithm plans the path by considering the quadrants in which the current positions of obstacles as well as target are situated.Also,the governing equations for the shortest path are derived.The proposed mathematical model describes the motion(satisfying constraints of the mobile robot)along a collision-free path.Further,the algorithm is applicable to dynamic environments with fixed or moving targets.Simulation results show the effectiveness of the proposed algorithm.Comparison of results with the improved artificial potential field(iAPF)algorithm shows that the proposed algorithm yields shorter path length with less computation time.展开更多
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.展开更多
The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as...The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.展开更多
Path planning and formation structure forming are two of the most important problems for autonomous underwater vehicles(AUVs) to collaborate with each other.In this work,a dynamic formation model was proposed,in which...Path planning and formation structure forming are two of the most important problems for autonomous underwater vehicles(AUVs) to collaborate with each other.In this work,a dynamic formation model was proposed,in which several algorithms were developed for the complex underwater environment.Dimension changeable particle swarm algorithm was used to find an optimized path by dynamically adjusting the number and the distribution of the path nodes.Position relationship based obstacle avoidance algorithm was designed to detour along the edges of obstacles.Virtual potential point based formation-keeping algorithm was employed by incorporating dynamic strategies which were decided by the current states of the formation.The virtual potential point was used to keep the formation structure when the AUV or the formation was deviated.Simulation results show that an optimal path can be dynamically planned with fewer path nodes and smaller fitness,even with a concave obstacle.It has been also proven that different formation-keeping strategies can be adaptively selected and the formation can change its structure in a narrow area and restore back after passing the obstacle.展开更多
The cumulative prospect theory(CPT) is applied to study travelers' route choice behavior in a degradable transport network. A cumulative prospect theory-based user equilibrium(CPT-UE) model considering stochastic ...The cumulative prospect theory(CPT) is applied to study travelers' route choice behavior in a degradable transport network. A cumulative prospect theory-based user equilibrium(CPT-UE) model considering stochastic perception error(SPE) within travelers' route choice decision process is developed. The SPE is conditionally dependent on the actual travel time distribution, which is different from the deterministic perception error used in the traditional logit-based stochastic user equilibrium. The CPT-UE model is formulated as a variational inequality problem and solved by a heuristic solution algorithm. Numerical examples are provided to illustrate the application of the proposed model and efficiency of the solution algorithm. The effects of SPE on the reference point determination, cumulative prospect value estimation, route choice decision and network performance evaluation are investigated.展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
文摘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.
文摘Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a complicated problem.A planning algorithm capable of negotiating both static and moving obstacles in an unpredictable(on-line)environment is proposed.The proposed incremental algorithm plans the path by considering the quadrants in which the current positions of obstacles as well as target are situated.Also,the governing equations for the shortest path are derived.The proposed mathematical model describes the motion(satisfying constraints of the mobile robot)along a collision-free path.Further,the algorithm is applicable to dynamic environments with fixed or moving targets.Simulation results show the effectiveness of the proposed algorithm.Comparison of results with the improved artificial potential field(iAPF)algorithm shows that the proposed algorithm yields shorter path length with less computation time.
基金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.
基金Project(2011BAG01B01)supported by the Key Technologies Research Development Program,ChinaProject(RCS2012ZZ002)supported by State Key Laboratory of Rail Traffic Control&Safety,China
文摘The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.
基金Project(NS2013091)supported by the Basis Research Fund of Nanjing University of Aeronautics and Astronautics,China
文摘Path planning and formation structure forming are two of the most important problems for autonomous underwater vehicles(AUVs) to collaborate with each other.In this work,a dynamic formation model was proposed,in which several algorithms were developed for the complex underwater environment.Dimension changeable particle swarm algorithm was used to find an optimized path by dynamically adjusting the number and the distribution of the path nodes.Position relationship based obstacle avoidance algorithm was designed to detour along the edges of obstacles.Virtual potential point based formation-keeping algorithm was employed by incorporating dynamic strategies which were decided by the current states of the formation.The virtual potential point was used to keep the formation structure when the AUV or the formation was deviated.Simulation results show that an optimal path can be dynamically planned with fewer path nodes and smaller fitness,even with a concave obstacle.It has been also proven that different formation-keeping strategies can be adaptively selected and the formation can change its structure in a narrow area and restore back after passing the obstacle.
基金Project(2012CB725400)supported by the National Basic Research Program of ChinaProjects(71271023,71322102)supported by the National Science Foundation of ChinaProject(2015JBM053)supported by the Fundamental Research Funds for the Central Universities,China
文摘The cumulative prospect theory(CPT) is applied to study travelers' route choice behavior in a degradable transport network. A cumulative prospect theory-based user equilibrium(CPT-UE) model considering stochastic perception error(SPE) within travelers' route choice decision process is developed. The SPE is conditionally dependent on the actual travel time distribution, which is different from the deterministic perception error used in the traditional logit-based stochastic user equilibrium. The CPT-UE model is formulated as a variational inequality problem and solved by a heuristic solution algorithm. Numerical examples are provided to illustrate the application of the proposed model and efficiency of the solution algorithm. The effects of SPE on the reference point determination, cumulative prospect value estimation, route choice decision and network performance evaluation are investigated.
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
