Explore the vast range of titles available.

With growing environmental concerns, the focus on greenhouse gases (GHG) emissions in transportation has increased, and the combination of smart microgrids and electric vehicles (EVs) brings a new opportunity to solve this problem. Electric vehicle routing problem with time windows (EVRPTW) is an extension of the vehicle routing problem (VRP) problem, which can reach the combination of smart microgrids and EVs precisely by scheduling the EVs. However, the current genetic algorithm (GA) for solving this problem can easily fall into the dilemma of local optimization and slow iteration speed. In this paper, we present an integer hybrid planning model that introduces time of use and area price to enhance realism. We propose the GA-A* algorithm, which combines the A* algorithm and GA to improve global search capability and iteration speed. We conducted experiments on 16 benchmark cases, comparing the GA-A* algorithm with traditional GA and other search algorithms, results demonstrate significant enhancements in searchability and optimal solutions. In addition, we measured the grid load, and the model implements the vehicle-to-grid (V2G) mode, which serves as peak shaving and valley filling by integrating EVs into the grid for energy delivery and exchange through battery swapping. This research, ranging from model optimization to algorithm improvement, is an important step towards solving the EVRPTW problem and improving the environment.

Dispatching and cooperative trajectory planning for multiple autonomous forklifts in a warehouse is a widely applied research topic. The conventional methods in this domain regard dispatching and planning as isolated procedures, which render the overall motion quality of the forklift team imperfect. The dispatching and planning problems should be considered simultaneously to achieve optimal cooperative trajectories. However, this approach renders a large-scale nonconvex problem, which is extremely difficult to solve in real time. A joint dispatching and planning method is proposed to balance solution quality and speed. The proposed method is characterized by its fast runtime, light computational burden, and high solution quality. In particular, the candidate goals of each forklift are enumerated. Each candidate dispatch solution is measured after concrete trajectories are generated via an improved hybrid A* search algorithm, which is incorporated with an artificial neural network to improve the cost evaluation process. The proposed joint dispatching and planning method is computationally cheap, kinematically feasible, avoids collisions with obstacles/forklifts, and finds the global optimum quickly. The presented motion planning strategy demonstrates that the integration of a neural network with the dispatching approach leads to a warehouse filling/emptying mission completion time that is 2% shorter than the most efficient strategy lacking machine-learning integration. Notably, the mission completion times across these strategies vary by approximately 15%.

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner.

Facility layout aims to arrange a set of facilities in a site. The main objective function is to minimize the total material handling cost under production-derived constraints. This problem has received much attention during the past decades. However, these works have mainly focused on solving a 2D layout problem, dealing with the footprints of pieces of equipment. The obtained results have been then adapted to the real spatial constraints of a workshop. This research work looks to take account of spatial constraints within a 3D space from the very first steps of problem solving. The authors use a approach by combining a genetic algorithm with A*, 〈GA,A*〉 research. The genetic algorithm generates possible arrangements and A* finds the shortest paths that products must travel in a restricted 3D space. The application allows to converge to a layout minimizing the total material handling cost. This approach is illustrated by its application on an example inspired by a valve assembly workshop in Tunisia and the results are discussed from two points of view. The first one consists in comparing the effect of the choice of the distance measurement technique on the handling cost. For this purpose, the results of the application of 〈GA,A*〉 are compared with those obtained by combining the genetic algorithm and two of the most commonly used distance measurements in the literature of the discipline, namely the Euclidean distance, 〈GA,Euclidean〉, and the rectilinear distance, 〈GA,rectilinear〉. Our results show that the proposed approach offers better results than those of 〈GA,rectilinear〉 whereas they are not as good as those obtained by the 〈GA,Euclidean〉 approach. The effectiveness of the 〈GA,A*〉 approach is then studied from the perspective of the effect of the algorithm used for the generation of candidate arrangements. The final results obtained from the application of 〈GA,A*〉 are then compared with those of the approach combining particle swarm optimization and A*, 〈PSO,A*〉. This comparison shows that the 〈GA,A*〉 approach obtains better results. Nevertheless, its convergence speed is lower than that of 〈PSO,A*〉. The paper ends with some conclusions and perspectives.

Pathfinding algorithms allow for the numerical determination of optimal paths of travel across many applications. These algorithms remain poorly defined for additional consideration of outside parameters, such as fluid flow, while considering contaminant transport problems. We have developed a pathfinding algorithm based on the A* search algorithm which considers the effect of fluid flow behaviors in two dimensions. This search algorithm returns the optimal path between two points in a setting containing impermeable boundaries, allowing for a computational approach to the determination of the most likely path of travel for contaminants or hazards of concern due to fluid flow. This modified A* search algorithm has applications in the statistical modeling of airborne contamination distributions, providing a relative estimate of the statistical relationship between two points in an underground mine’s ventilation system. This method provides a significant improvement to the spatial resolution of minimum-cost path methods currently in use in mine ventilation network software.

Hypersonic morphing vehicles (HMVs), renowned for their adaptive structural reconfiguration and cross-domain maneuverability, confront formidable reentry guidance challenges under multiple no-fly zones, stringent path constraints, and nonlinear dynamics exacerbated by morphing-induced aerodynamic uncertainties. To address these issues, this study proposes a hierarchical framework integrating an A-based energy-optimal waypoint planner, a deep deterministic policy gradient (DDPG)-driven morphing policy network, and a quasi-equilibrium glide condition (QEGC) guidance law with continuous sliding mode control. The A* algorithm generates heuristic trajectories circumventing no-fly zones, reducing the evaluation function by 6.2% compared to greedy methods, while DDPG optimizes sweep angles to minimize velocity loss and terminal errors (0.09 km position, 0.01 m/s velocity). The QEGC law ensures robust longitudinal-lateral tracking via smooth hyperbolic tangent switching. Simulations demonstrate generalization across diverse targets (terminal errors < 0.24 km) and robustness under Monte Carlo deviations (0.263 ± 0.184 km range, −12.7 ± 42.93 m/s velocity). This work bridges global trajectory planning with real-time morphing adaptation, advancing intelligent HMV control. Future research will extend this framework to ascent/dive phases and optimize its computational efficiency for onboard deployment.

To deal with the problem of multitarget tracking with measurement origin uncertainty, the paper presents a multitarget tracking algorithm based on Adaptive Network Graph Segmentation (ANGS). The multitarget tracking is firstly formulated as an Integer Programming problem for finding the maximum a posterior probability in a cost flow network. Then, a network structure is partitioned using an Adaptive Spectral Clustering algorithm based on the Nyström Method. In order to obtain the global optimal solution, the parallel A* search algorithm is used to process each sub-network. Moreover, the trajectory set is extracted by the Track Mosaic technique and Rauch–Tung–Striebel (RTS) smoother. Finally, the simulation results achieved for different clutter intensity indicate that the proposed algorithm has better tracking accuracy and robustness compared with the A* search algorithm, the successive shortest-path (SSP) algorithm and the shortest path faster (SPFA) algorithm.

In recent years, swarm intelligence algorithms have received extensive attention and research. Swarm intelligence algorithms are a biological heuristic method, which is widely used in solving optimization problems. The traditional swarm intelligence algorithms provide new ideas and new ways to solve some practical problems, and they have made positive progress in fields such as combinatorial optimization, task scheduling, process control, engineering prediction, and image processing. In particular, the sparrow search algorithm is a new type of group intelligence optimization algorithm inspired by the group foraging behavior to perform local and global search by imitating the foraging and anti-predation behavior of sparrows. In view of the shortcomings of the original sparrow search algorithm, such as its easy fall into local optimum, slow convergence speed, and low convergence accuracy, scholars at home and abroad have improved the sparrow search algorithm and have made practical applications in various fields. Firstly, this paper introduces the basic principle of sparrow search algorithm, analyzes the factors affecting the performance of the algorithm, further proposes the improvement strategy of the algorithm, and performs function test comparison and performance analysis with particle swarm optimization algorithm, monarch butterfly algorithm, colony spider algorithm, and pigeon swarm optimization algorithm. After that, the application and development of the sparrow search algorithm in power grid load forecasting, image processing, path tracking, wireless sensor network routing performance optimization, wireless location, and fault diagnosis are described. Finally, combined with the performance characteristics and application direction of the sparrow search algorithm, the future research and development direction of the sparrow search algorithm is prospected.

In this paper, a novel swarm optimization approach, namely sparrow search algorithm (SSA), is proposed inspired by the group wisdom, foraging and anti-predation behaviours of sparrows. Experiments on 19 benchmark functions are conducted to test the performance of the SSA and its performance is compared with other algorithms such as grey wolf optimizer (GWO), gravitational search algorithm (GSA), and particle swarm optimization (PSO). Simulation results show that the proposed SSA is superior over GWO, PSO and GSA in terms of accuracy, convergence speed, stability and robustness. Finally, the effectiveness of the proposed SSA is demonstrated in two practical engineering examples.

In this paper, the algorithmic concepts of the Cuckoo-search (CK), Particle swarm optimization (PSO), Differential evolution (DE) and Artificial bee colony (ABC) algorithms have been analyzed. The numerical optimization problem solving successes of the mentioned algorithms have also been compared statistically by testing over 50 different benchmark functions. Empirical results reveal that the problem solving success of the CK algorithm is very close to the DE algorithm. The run-time complexity and the required function-evaluation number for acquiring global minimizer by the DE algorithm is generally smaller than the comparison algorithms. The performances of the CK and PSO algorithms are statistically closer to the performance of the DE algorithm than the ABC algorithm. The CK and DE algorithms supply more robust and precise results than the PSO and ABC algorithms.