Path planning and obstacle avoidance are essential for autonomous driving cars. On the base of a self‐constructed smart obstacle avoidance car, which used a LeTMC‐520 depth camera and Jetson controller, this paper established a map of an unknown indoor environment based on depth information via SLAM technology. The Dijkstra algorithm is used as the global path planning algorithm and the dynamic window approach (DWA) as its local path planning algorithm, which are applied to the smart car, enabling it to successfully avoid obstacles from the planned initial position and reach the designated position. The tests on the smart car prove that the system can complete the functions of environment map establishment, path planning and navigation, and obstacle avoidance.

Correctly anticipating PV electricity production may lessen stochastic fluctuations and incentivize energy consumption. To address the intermittent and unpredictable nature of photovoltaic power generation, this article presents an ensemble learning model (MVMD-CLES) based on the whale optimization algorithm (WOA), variational mode decomposition (VMD), convolutional neural network (CNN), long and short-term memory (LSTM), and extreme learning machine (ELM) stacking. Given the variances in the spatiotemporal distribution of photovoltaic data and meteorological features, a multi-branch character extraction iterative mixture learning model is proposed: we apply the MWOA algorithm to find the optimal decomposition times and VMD penalty factor, and then divide the PV power sequences into sub-modes with different frequencies using a two-layer algorithmic structure to reconstruct the obtained power components. The primary learner is CNN–BiLSTM, which is utilized to understand the temporal and spatial correlation of PV power from information about the weather and the output of photovoltaic cells, and the LSTM learns the periodicity and proximity correlation of the power data and obtains the corresponding component predictions. The second level is the secondary learner—the output of the first layer is learned again using the ELM to attenuate noise and achieve short-term prediction. In different case studies, regardless of weather changes, the proposed method is provided with the best group of consistency and constancy, with an average RMSE improvement of 12.08–39.14% over a single-step forecast compared to other models, the average forecast RMSE increased by 5.71–9.47% for the first two steps.

Accurate forecasting of photovoltaic (PV) power generation is crucial for optimizing grid operation and ensuring a reliable power supply. However, the inherent volatility and intermittency of solar energy pose significant challenges to grid stability and energy management. This paper proposes a learning model named CECSVB-LSTM, which integrates several advanced techniques: a bidirectional long short-term memory (BILSTM) network, Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN), variational mode decomposition (VMD), and the Sparrow Search Algorithm (CSSSA) incorporating circle chaos mapping and the Sine Cosine Algorithm. The model first uses CEEMDAN to decompose PV power data into Intrinsic Mode Functions (IMFs), capturing complex nonlinear features. Then, the CSSSA is employed to optimize VMD parameters, particularly the number of modes and the penalty factor, ensuring optimal signal decomposition. Subsequently, BILSTM is used to model time dependencies and predict future PV power output. Empirical tests on a PV dataset from an Australian solar power plant show that the proposed CECSVB-LSTM model significantly outperforms traditional single models and combination models with different decomposition methods, improving R² by more than 7.98% and reducing the root mean square error (RMSE) and mean absolute error (MAE) by at least 60% and 55%, respectively.

To address the anti-swing issue of the payload in bridge cranes, Proportional–Integral–Derivative (PID) control is a commonly used method. However, parameter tuning of the PID controller relies on empirical knowledge and often leads to system overshoot. This paper proposes an Improved Sparrow Search Algorithm (ISSA) to optimize the gains of PID controllers, alleviating adverse effects on payload oscillation and trolley positioning during the operation of overhead cranes. First, tent map chaos mapping is introduced to initialize the sparrow population, enhancing the algorithm’s global search capability. Then, by integrating sine and cosine concepts along with nonlinear learning factors, the updating mechanism of discoverer positions is dynamically adjusted, expediting the solving process. Finally, the Lévy flight strategy is employed to update follower positions, thereby enhancing the algorithm’s local escape capability. Additionally, a fitness function containing overshoot penalties is proposed to address overshoot issues. Simulation results indicate that the overshoot rates of all algorithms remain less than 3%. Moreover, compared with the Sparrow Search Algorithm (SSA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and Whale optimization Algorithm (WOA), the optimized PID control system with the ISSA algorithm exhibits superior control performance and possesses certain robustness and adaptability.

Bridge crane control systems are complex, multivariable, and nonlinear. However, traditional fuzzy PID control methods rely heavily on expert experience for initial parameter tuning and lack adaptive adjustment for the fuzzy universe. To address these issues, we propose a variable universe fuzzy PID controller based on the improved sparrow search algorithm (ISSA-VUFPID). First, tent chaotic mapping is introduced to initialize the sparrow population, enhancing the algorithm’s global search capability. Second, the positioning strategy of the northern goshawk exploration phase is integrated to improve the search thoroughness of sparrow discoverers within the solution space and to accelerate the optimization process. Last, an adaptive t-distribution perturbation strategy is employed to adjust the positions of sparrow followers, enhancing the algorithm’s optimization ability in the early search phase and focusing on local exploitation in the later phase to improve solution accuracy. The improved algorithm is applied to tune the initial parameters of the PID controller. Additionally, system error and its rate of change are introduced as dynamic parameters into the scaling factor, which is used to achieve adaptive adjustment of the fuzzy universe, thereby enhancing the safety and reliability of the control system. Simulation results demonstrate that the proposed ISSA-VUFPID control method outperforms ISSA-FPID and ISSA-PID control methods. It reduces the trolley’s positioning time and minimizes the load’s maximum swing angle, demonstrating strong adaptability and robustness. This approach greatly enhances the robustness and safety of bridge crane operations.

To address the critical limitations of conventional Grey Wolf Optimization (GWO) in path planning scenarios—including insufficient exploration capability during the initial phase, proneness to local optima entrapment, and inherent deficiency in dynamic obstacle avoidance—this paper proposes a multi-strategy enhanced GWO algorithm. Firstly, the Piecewise chaotic mapping is applied to initialize the Grey Wolf population, enhancing the initial population quality. Secondly, the linear convergence factor is modified to a nonlinear one to balance the algorithm’s global and local search capabilities. Thirdly, Evolutionary Population Dynamics (EPD) is incorporated to enhance the algorithm’s ability to escape local optima, and dynamic weights are used to improve convergence speed and accuracy. Finally, the algorithm is integrated with the Improved Dynamic Window Approach (IDWA) to enhance path smoothness and perform dynamic obstacle avoidance. The proposed algorithm is named PAGWO-IDWA. The results demonstrate that, compared to traditional GWO, PAGWO-IDWA reduces the path length, number of turns, and running time by 9.58%, 33.16%, and 30.31%, respectively. PAGWO-IDWA not only overcomes the limitations of traditional GWO but also enables effective path planning in dynamic environments, generating paths that are both safe and smooth, thus validating the effectiveness of the algorithm.