Efficient Route Planning for Real-Time Demand-Responsive Transit

Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.

Saturation attack based route planning and threat avoidance algorithm for cruise missiles

According to the characteristic of cruise missiles,navigation point setting is simplified,and the principle of route planning for saturation attack and a concept of reference route are put forward.With the help of the shortest-tangent idea in route-planning and the algorithm of back reasoning from targets,a reference route algorithm is built on the shortest range and threat avoidance.Then a route-flight-time algorithm is built on navigation points.Based on the conditions of multi-direction saturation attack,a route planning algorithm of multi-direction saturation attack is built on reference route,route-flight-time,and impact azimuth.Simulation results show that the algorithm can realize missiles fired in a salvo launch reaching the target simultaneously from different directions while avoiding threat.

Coordinated Route Planning via Nash Equilibrium and Evolutionary Computation

The coordinated route planning problem for multiple unmanned air vehicles （UAVs）, a cooperative optimization problem, also a non-cooperative game, is addressed in the framework of game theory, A Nash equilibrium based route planner is proposed. The rational is that the structure of UAV subteam usually provides some inherent and implicit preference information, which help to find the optimum coordinated routes and the optimum combination of the various objective functions. The route planner combines the concepts of evolutionary computation with problem-specific chromosome structures and evolutionary operators and handles different kinds of mission constraints in hierarchical style. Cooperation and competition among UAVs are reflected by the definition of fitness function. Simulations validate the feasibility and superiority of the game-theoretic coordinated routes planner.

Multi-objective evolutionary approach for UAV cruise route planning to collect traffic information

Unmanned aerial vehicle(UAV)was introduced as a novel traffic device to collect road traffic information and its cruise route planning problem was considered.Firstly,a multi-objective optimization model was proposed aiming at minimizing the total cruise distance and the number of UAVs used,which used UAV maximum cruise distance,the number of UAVs available and time window of each monitored target as constraints.Then,a novel multi-objective evolutionary algorithm was proposed.Next,a case study with three time window scenarios was implemented.The results show that both the total cruise distance and the number of UAVs used continue to increase with the time window constraint becoming narrower.Compared with the initial optimal solutions,the optimal total cruise distance and the number of UAVs used fall by an average of 30.93% and 31.74%,respectively.Finally,some concerns using UAV to collect road traffic information were discussed.

Three-dimensional multi-constraint route planning of unmanned aerial vehicle low-altitude penetration based on coevolutionary multi-agent genetic algorithm

To address the issue of premature convergence and slow convergence rate in three-dimensional (3D) route planning of unmanned aerial vehicle (UAV) low-altitude penetration,a novel route planning method was proposed.First and foremost,a coevolutionary multi-agent genetic algorithm (CE-MAGA) was formed by introducing coevolutionary mechanism to multi-agent genetic algorithm (MAGA),an efficient global optimization algorithm.A dynamic route representation form was also adopted to improve the flight route accuracy.Moreover,an efficient constraint handling method was used to simplify the treatment of multi-constraint and reduce the time-cost of planning computation.Simulation and corresponding analysis show that the planning results of CE-MAGA have better performance on terrain following,terrain avoidance,threat avoidance (TF/TA2) and lower route costs than other existing algorithms.In addition,feasible flight routes can be acquired within 2 s,and the convergence rate of the whole evolutionary process is very fast.

Big data-driven automatic generation of ship route planning in complex maritime environments

With the rapid development of the global economy, maritime transportation has become much more convenient due to large capacities and low freight. However, this means the sea lanes are becoming more and more crowded,leading to high probabilities of marine accidents in complex maritime environments. According to relevant historical statistics, a large number of accidents have happened in water areas that lack high precision navigation data, which can be utilized to enhance navigation safety. The purpose of this work was to carry out ship route planning automatically, by mining historical big automatic identification system(AIS) data. It is well-known that experiential navigation information hidden in maritime big data could be automatically extracted using advanced data mining techniques;assisting in the generation of safe and reliable ship planning routes for complex maritime environments. In this paper, a novel method is proposed to construct a big data-driven framework for generating ship planning routes automatically, under varying navigation conditions. The method performs density-based spatial clustering of applications with noise first on a large number of ship trajectories to form different trajectory vector clusters. Then, it iteratively calculates its centerline in the trajectory vector cluster, and constructs the waterway network from the node-arc topology relationship among these centerlines. The generation of shipping route could be based on the waterway network and conducted by rasterizing the marine environment risks for the sea area not covered by the waterway network. Numerous experiments have been conducted on different AIS data sets in different water areas, and the experimental results have demonstrated the effectiveness of the framework of the ship route planning proposed in this paper.

Weapon configuration, allocation and route planning with time windows for multiple unmanned combat air vehicles

Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.

Integrated Route Planning and Resource Allocation for Connected Vehicles

Intelligent and connected vehicles have leveraged edge computing paradigm to enhance their environment comprehension and behavior planning capabilities.As the quantity of intelligent vehicles and the demand for edge computing are increasing rapidly,it becomes critical to efficiently orchestrate the communication and computation resources on edge clouds.Existing methods usually perform resource allocation in a fairly effective but still reactive manner,which is subject to the capacity of nearby edge clouds.To deal with the contradiction between the spatiotemporally varying demands for edge computing and the fixed edge cloud capacity,we proactively balance the edge computing demands across edge clouds by appropriate route planning.In this paper,route planning and resource allocation are jointly optimized to enhance intelligent driving.We propose a multi-scale decentralized optimization method to deal with the curse of dimensionality.In large-scale optimization,backpressure algorithm is used to conduct route planning and load balancing across edge clouds.In small-scale optimization,game-theoretic multi-agent learning is exploited to perform regional resource allocation.The experimental results show that the proposed algorithm outperforms the baseline algorithms which optimize route planning and resource allocation separately.

Energy Aware Data Collection with Route Planning for 6G Enabled UAV Communication

With technological advancements in 6G and Internet of Things(IoT), the incorporation of Unmanned Aerial Vehicles (UAVs) and cellularnetworks has become a hot research topic. At present, the proficient evolution of 6G networks allows the UAVs to offer cost-effective and timelysolutions for real-time applications such as medicine, tracking, surveillance,etc. Energy efficiency, data collection, and route planning are crucial processesto improve the network communication. These processes are highly difficultowing to high mobility, presence of non-stationary links, dynamic topology,and energy-restricted UAVs. With this motivation, the current research paperpresents a novel Energy Aware Data Collection with Routing Planning for6G-enabled UAV communication (EADCRP-6G) technique. The goal of theproposed EADCRP-6G technique is to conduct energy-efficient cluster-baseddata collection and optimal route planning for 6G-enabled UAV networks.EADCRP-6G technique deploys Improved Red Deer Algorithm-based Clustering (IRDAC) technique to elect an optimal set of Cluster Heads (CH) andorganize these clusters. Besides, Artificial Fish Swarm-based Route Planning(AFSRP) technique is applied to choose an optimum set of routes for UAVcommunication in 6G networks. In order to validated whether the proposedEADCRP-6G technique enhances the performance, a series of simulationswas performed and the outcomes were investigated under different dimensions.The experimental results showcase that the proposed model outperformed allother existing models under different evaluation parameters.

An Air Route Planning Model of Unmanned Aerial Vehicles Under Constraints of Ground Safety

With the rapid growth of the number and flight time of unmanned aerial vehicles(UAVs),safety accidents caused by UAVs flight risk is increasing gradually.Safe air route planning is an effective means to reduce the operational risk of UAVs at the strategic level.The optimal air route planning model based on ground risk assessment is presented by considering the safety cost of UAV air route.Through the rasterization of the ground surface under the air route,the safety factor of each grid is defined with the probability of fatality on the ground per flight hour as the quantitative index.The air route safety cost function is constructed based on the safety factor of each grid.Then,the total cost function considering both air route safety and flight distance is established.The expected function of the ant colony algorithm is rebuilt and used as the algorithm to plan the air routes.The effectiveness of the new air route planning model is verified through the logistical distribution scenario on urban airspace.The results indicate that the new air route planning model considering safety factor can greatly improve the overall safety of air route under small increase of the total flight time.

An optimization model of UAV route planning for road segment surveillance

Unmanned aerial vehicle(UAV)was introduced to take road segment traffic surveillance.Considering the limited UAV maximum flight distance,UAV route planning problem was studied.First,a multi-objective optimization model of planning UAV route for road segment surveillance was proposed,which aimed to minimize UAV cruise distance and minimize the number of UAVs used.Then,an evolutionary algorithm based on Pareto optimality technique was proposed to solve multi-objective UAV route planning problem.At last,a UAV flight experiment was conducted to test UAV route planning effect,and a case with three scenarios was studied to analyze the impact of different road segment lengths on UAV route planning.The case results show that the optimized cruise distance and the number of UAVs used decrease by an average of 38.43% and 33.33%,respectively.Additionally,shortening or extending the length of road segments has different impacts on UAV route planning.

Multi-objective route planning approach for timely searching tasks of a supervised robot

To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planning is proposed based on the multi-objective genetic algorithm （MOGA） for multiple objectives traveling salesman problem （MOTSP）. Then, the path between two route nodes is generated based on the heuristic path planning method A ＊. A simplified timeliness function for route nodes is proposed to represent the timeliness of each node. Based on the proposed timeliness function, experiments are conducted using the proposed two-stage planning method. The experimental results show that the proposed MOGA with improved fitness function can perform the searching function well when the timeliness of the searching task needs to be taken into consideration.

Research on Route Planning Method Based on Active-Attack Strategy

Aimed at modern high-density,high overlapped and powerful antipersonnel stealthy penetration environment,route planning techniques on active-attack strategy were thoroughly and further studied,in order to get good probability of survival and perfect efficiency of task accomplishment.It provides a new thought for and a new solution to the application of route planning in new era.

Enhancing safety and efficiency in automated container terminals: Route planning for hazardous material AGV using LSTM neural network and Deep Q-Network

As the proliferation and development of automated container terminal continue,the issues of efficiency and safety become increasingly significant.The container yard is one of the most crucial cargo distribution centers in a terminal.Automated Guided Vehicles(AGVs)that carry materials of varying hazard levels through these yards without compromising on the safe transportation of hazardous materials,while also maximizing efficiency,is a complex challenge.This research introduces an algorithm that integrates Long Short-Term Memory(LSTM)neural network with reinforcement learning techniques,specifically Deep Q-Network(DQN),for routing an AGV carrying hazardous materials within a container yard.The objective is to ensure that the AGV carrying hazardous materials efficiently reaches its destination while effectively avoiding AGVs carrying non-hazardous materials.Utilizing real data from the Meishan Port in Ningbo,Zhejiang,China,the actual yard is first abstracted into an undirected graph.Since LSTM neural network can efficiently conveys and represents information in long time sequences and do not causes useful information before long time to be ignored,a two-layer LSTM neural network with 64 neurons per layer was constructed for predicting the motion trajectory of AGVs carrying non-hazardous materials,which are incorporated into the map as background AGVs.Subsequently,DQN is employed to plan the route for an AGV transporting hazardous materials,aiming to reach its destination swiftly while avoiding encounters with other AGVs.Experimental tests have shown that the route planning algorithm proposed in this study improves the level of avoidance of hazardous material AGV in relation to non-hazardous material AGVs.Compared to the method where hazardous material AGV follow the shortest path to their destination,the avoidance efficiency was enhanced by 3.11%.This improvement demonstrates potential strategies for balancing efficiency and safety in automated terminals.Additionally,it provides insights for designing avoidance schemes for autonomous driving AGVs,offering solutions for complex operational environments where safety and efficient navigation are paramount.

Robust global route planning for an autonomous underwater vehicle in a stochastic environment

This paper describes a route planner that enables an autonomous underwater vehicle to selectively complete part of the predetermined tasks in the operating ocean area when the local path cost is stochastic.The problem is formulated as a variant of the orienteering problem.Based on the genetic algorithm(GA),we propose the greedy strategy based GA(GGA)which includes a novel rebirth operator that maps infeasible individuals into the feasible solution space during evolution to improve the efficiency of the optimization,and use a differential evolution planner for providing the deterministic local path cost.The uncertainty of the local path cost comes from unpredictable obstacles,measurement error,and trajectory tracking error.To improve the robustness of the planner in an uncertain environment,a sampling strategy for path evaluation is designed,and the cost of a certain route is obtained by multiple sampling from the probability density functions of local paths.Monte Carlo simulations are used to verify the superiority and effectiveness of the planner.The promising simulation results show that the proposed GGA outperforms its counterparts by 4.7%–24.6%in terms of total profit,and the sampling-based GGA route planner(S-GGARP)improves the average profit by 5.5%compared to the GGA route planner(GGARP).

Route planning of truck and multi-drone rendezvous with available time window constraints of drones

During the scenarios of cooperative tasks performed by a single truck and multiple drones,the route plan is prone to failure due to the unpredictable scenario change.In this situation,it is significant to replan the rendezvous route of the truck and drones as soon as possible,to ensure that all drones in flight can return to the truck before running out of energy.This paper addresses the problem of rendezvous route planning of truck and multi-drone.Due to the available time window constraints of drones,which limit not only the rendezvous time of the truck and drones but also the available period of each drone,there are obvious local optimum phenomena in the investigated problem,so it is difficult to find a feasible solution.A two-echelon heuristic algorithm is proposed.In the algorithm,the strategy jumping out of the local optimum and the heuristic generating the initial solution are introduced,to improve the probability and speed of obtaining a feasible solution for the rendezvous route.Simulation results show that the feasible solution of the truck-drones rendezvous route can be obtained with 88%probability in an average of 77 iterations for the scenario involving up to 25 drones.The influence of algorithm options on planning results is also analyzed.

Landing route planning method for micro drones based on hybrid optimization algorithm

Aiming at the obstacle avoidance trajectory planning problem in the landing process of the micro drone,this paper proposes a swarm optimization algorithm that combines the dragonfly optimization method and the differential evolution method.The orthogonal learning mechanism is adopted to realize the adaptive switch between the two algorithms.In the process of landing route planning,the planning plane is first obtained by making the gliding plane tangent to the obstacle.In the planning plane,the projection of obstacle is transformed into multiple unreachable line segments.By designing an optimization model,the 3D landing route planning problem is transformed into a 2D obstacle avoidance route optimization problem.Taking the shortest route as the optimization objective,the penalty factor is introduced into the cost function to avoid the intersection of the landing route and obstacle.During the optimization process,through the orthogonal learning of the intermediate iterative results,the hybrid algorithm can adaptively select the next iterative algorithm,so it can give full play to the respective advantages of the two algorithms.The optimization results show that,compared with the single optimization algorithm,the hybrid optimization algorithm proposed in this paper can better solve the problem of landing route planning for micro-small UAVs.

Routeview:an intelligent route planning system for ships sailing through Arctic ice zones based on big Earth data

The potential of Arctic routes(ARs)has attracted global attention,and exploiting the Arctic has become an important strategy for many countries.However,there are still some challenges for ships sailing in Arctic ice zones,including harsh marine environments and the insufficient service capacity of sea ice information service systems.To better understand the route changes in the Arctic and extract real-time ship navigation routes,we developed an online interactive route planning system(RouteView)for ships sailing in the Arctic based on big Earth data.RouteView includes two main features:(1)an online calculation interface is provided for optimal routes along the Arctic Northeast Passage(NEP)60 days into the future by utilizing reinforcement learning(RL)based on sea ice and meteorological data,and(2)an online ice-water classification is established based on synthetic aperture radar(SAR)data and deep learning to help users extract the sea ice distribution in real time.This work can potentially enhance the safety of shipping navigation along the NEP and improve information extraction methods for ARs.

Cruise missile multiple routes planning based on hybrid particle swarm optimization

In order to solve cruise missile route planning problem for low-altitude penetration , a hy- brid particle swarm optimization （ HPSO ） algorithm is proposed. Firstly, K-means clustering algo- rithm is applied to divide the particle swarm into multiple isolated sub-populations, then niche algo- rithm is adopted to make all particles independently search for optimal values in their own sub-popu- lations. Finally simulated annealing （SA） algorithm is introduced to avoid the weakness of PSO algo- rithm, which can easily be trapped into the local optimum in the search process. The optimal value obtained by every sub-population search corresponds to an optimal route, multiple different optimal routes are provided for cruise missile. Simulation results show that the HPSO algorithm has a fast convergence rate, and the planned routes have flat ballisticpaths and short ranges which meet the low-altitude penetration requirements.

Planning of Urban Cycling Routes Aiming at Improving Cycling Quality

Urban cycling environment is an important part of urban slow-moving system,and reasonable route planning is beneficial to the health of residents.In order to improve residents’ cycling quality and enrich travel experience,the evaluation system of cycling quality in the main urban area of Handan City was established from the four aspects of convenience,safety,comfort and experience.According to different travel needs,the cycling evaluation index of road sections was calculated and modified to obtain the cycling time of road sections.The shortest route algorithm was used to generate the best riding route for convenience,the best riding route for safety,the best riding route for comfort,and the best riding route for experience.Cycling evaluation indicators were combined with travel route planning to provide residents with a variety of humanized route options,and effectively improve the cycling quality and travel health of residents,which is of great significance to promoting green travel and improving residents’ health.