Search Results (703)

In an intelligent driving system, the rationality of driving decisions and the trajectory planning scheme directly determines the safety and stability of the system. Existing research mostly relies on high-definition maps and empirical parameters to estimate road adhesion conditions, ignoring the direct impact of real-time road status changes on the dynamic feasible domain of vehicles. This paper proposes an intelligent driving decision-making and trajectory planning method that comprehensively considers the influence factors of vehicle–road interaction. Firstly, real-time estimation of road adhesion coefficients was achieved based on the recursive least squares method, and a dynamic adhesion perception mechanism was constructed to guide the decision-making module to restrict lateral maneuvering behavior under low-adhesion conditions. A multi-objective lane evaluation function was designed for adaptive lane decision-making. Secondly, a longitudinal and lateral coupled trajectory planning framework was constructed based on the traditional lattice method to achieve smooth switching between lateral trajectory planning and longitudinal speed planning. The planned path is tracked based on a model predictive control algorithm and dual PID algorithm. Finally, the proposed method was verified on a co-simulation platform. The results show that this method has good safety, adaptability, and control stability in complex environments and dynamic adhesion conditions. Full article

The implementation of autonomous rovers in agriculture could be a promising solution to ensure, at the same time, productivity and sustainability. One of the key points of this kind of vehicle concerns their autonomous driving strategy. Generally, the strategy should include the path planning and path following algorithms. In this paper, an autonomous driving strategy assessing both is presented. To evaluate the effectiveness of this strategy, a case study of an agricultural rover is presented. A co-simulation model, including a multibody model of the rover, is developed in Matlab/Simulink and Hexagon Adams environments to virtually test the rover capabilities and the effects of its dynamics on the robustness of the algorithm. Given different orchard configurations, common but critical work scenarios are investigated, namely a 180° turn and an obstacle avoidance manoeuvre. The actual trajectory obtained during simulations are compared to the ideal trajectory defined in the path planning stage. Furthermore, the torque demand at the electric motors is evaluated. To consider a wide range of possible operating conditions, additional tests with different terrains, payloads and road slopes are included. Results showed that the rover managed to accomplish the considered manoeuvres on loam soil with a maximum trajectory deviation of 0.58 m, but a temporary overload of the motors is needed. On the contrary, in case of difficult terrains, such as muddy soil, the rover was not able to perform the manoeuvre. To limit tire slip, a traction control algorithm is developed and implemented, and the results are compared with the case without control. Full article

Accurate forecasting of potential collision risk in dense traffic is addressed by a framework grounded in multi-vehicle trajectory prediction. A spatio-temporal fusion architecture, STGAT-EDGRU, is proposed. A Transformer encoder learns temporal motion patterns from each vehicle’s history; a boundary-aware graph (GAT) attention network models inter-vehicle interactions; and a Gated Multimodal Unit (GMU) adaptively fuses the temporal and spatial streams. Future positions are parameterized as bivariate Gaussians and decoded by a two-layer GRU. Using probabilistic trajectory forecasts for the main vehicle and its surrounding vehicles, collision probability and collision intensity are computed at each prediction instant and integrated via a weighted scheme into a Collision Risk Index (CRI) that characterizes risk over the entire horizon. On HighD, for 3–5 s horizons, average RMSE reductions of 0.02 m, 0.12 m, and 0.26 m over a GAT-Transformer baseline are achieved. In high-risk lane-change scenarios, CRI issues warnings 0.4–0.6 s earlier and maintains a stable response across the high-risk interval. These findings substantiate improved long-horizon accuracy together with earlier and more reliable risk perception, and indicate practical utility for lane-change assistance, where CRI can trigger early deceleration or abort decisions, and for risk-aware motion planning in intelligent driving. Full article

With the development of the maritime Internet of Things (MIoT), a large number of sensors are deployed, generating massive amounts of data. However, due to the limited data processing capabilities of the sensors and the constrained service capacity of maritime communication networks, the local and cloud data processing of MIoT are restricted. Thus, there is a pressing demand for efficient edge-based data processing solutions. In this paper, we investigate unmanned aerial vehicle (UAV)-assisted maritime edge computing networks. Under energy constraints of both UAV and MIoT devices, we propose a Deep Deterministic Policy Gradient (DDPG)-based maritime computation offloading and resource allocation algorithm to efficiently process MIoT tasks current form of UAV. The algorithm jointly optimizes task offloading ratios, UAV trajectory planning, and edge computing resource allocation to minimize total system task latency while satisfying energy consumption constraints. Simulation results validate its effectiveness and robustness in highly dynamic maritime environments. Full article

The large-scale trajectory simulation serves as a fundamental basis for the mission planning of a rocket-powered vehicle swarm. However, the traditional flight trajectory calculation method for a rocket-powered vehicle, which employs strict dynamic and kinematic models, often struggles to meet the temporal requirements of mission planning. To address the challenges of timely computation and intelligent optimization, a segmented training strategy, derived from the domain knowledge of the multi-stage flight characteristics of a rocket-powered vehicle, is integrated into the deep neural network (DNN) method. A high-precision trajectory prediction model that fuses multi-DNN is proposed, which can rapidly generate high-precision trajectory data without depending on accurate dynamic models. Based on the determination of the characteristic parameters derived from rocket-powered trajectory theory, a homemade dataset is constructed through a traditional computation method and utilized to train the DNN model. Extensive and varying numerical simulations are given to substantiate the predictive accuracy, adaptability, and stability of the proposed DNN-based method, and the corresponding comparative tests further demonstrate the effectiveness of the segmented strategy. Additionally, the real-time computational capability is also confirmed by computing the simulation of generating full trajectory data. Full article

This paper addresses the issue of the poor collision avoidance effect of underactuated surface vehicles (USVs) during local path tracking. A virtual ship group control method is suggested by using Freiner coordinates and a model predictive control (MPC) algorithm. We track the planned path using the MPC algorithm according to the known vessel state and build a hierarchical weighted cost function to handle the state of the virtual vessel, to ensure that the vessel avoids obstacles while tracking the path. In addition, the control system incorporates an Extended Kalman Filter (EKF) algorithm to minimize the state estimation error by continuously updating the ship state and providing more accurate state estimation for the system in a timely manner. In order to validate the anti-interference and robustness of the control system, the simulation experiment is carried out with the “Yukun” as the research object by adding the interference of wind and wave of level 6. The outcome shows that the algorithm suggested in this paper can accurately perform the trajectory-tracking task and make collision avoidance decisions under six levels of external interference. Compared with the original MPC algorithm, the improved MPC algorithm reduces the maximum rudder angle output value by 58%, the integral absolute error by 46%, and the root mean square error value by 46%. The control method provides a new technical choice for trajectory tracking and collision avoidance of USVs in complex marine environments, with a reliable theoretical basis and practical application value. Full article

Aiming at the problem of poor autonomy and weak time performance of reentry trajectory planning for Reusable Launch Vehicle (RLV), an online reentry trajectory planning and guidance method based on Twin Delayed Deep Deterministic Policy Gradient (TD3) is proposed. In view of the advantage that the drag acceleration can be quickly measured by the airborne inertial navigation equipment, the reference profile adopts the design of the drag acceleration–velocity profile in the reentry corridor. In order to prevent the problem of trajectory angle jump caused by the unsmooth turning point of the section, the section form adopts the form of four multiple functions to ensure the smooth connection of the turning point. Secondly, considering the advantages of the TD3 dual Critic network structure and delay update mechanism to suppress strategy overestimation, the TD3 algorithm framework is used to train multiple strategy networks offline and output profile parameters. Finally, considering the reentry uncertainty and the guidance error caused by the limitation of the bank angle reversal amplitude during lateral guidance, the networks are invoked online many times to solve the profile parameters in real time and update the profile periodically to ensure the rapidity and autonomy of the guidance command generation. The TD3 strategy networks are trained offline and invoked online many times so that the cumulative error in the previous guidance period can be eliminated when the algorithm is called again each time, and the online rapid generation and update of the reentry trajectory is realized, which effectively improves the accuracy and computational efficiency of the landing point. Full article

Electric Level 4 connected automated vehicles (CAVs) are now allowed to demonstrate their automation capability in shared mobility robotaxi and microtransit services in geofenced areas in several cities around the world. Private and public sector stake-holders need predictions of their adoption without regulatory constraints for personal mobility and use in shared mobility services. In anticipation of the future presence of CAVs in transportation vehicle fleets, governments are planning necessary regulatory and infrastructure changes. Accompanying this need for forecasts is the acknowledgement that CAV adoption decisions must be made under uncertain states of technology and infrastructure readiness. This paper presents a Bayesian predictive modelling framework for electric Level 4 CAV adoption in the 2030–2035 application context. The inputs to the Bayesian model are obtained from effectiveness estimates of CAV applications that are processed with the Monte Carlo method to account for uncertainties in these estimates. Scenarios of CAV adoption in the 2030–2035 period are analyzed using the Bayesian model, including the quantification of the value of new information obtainable from demonstration studies intended to reduce uncertainties in technology and infrastructure readiness. The results show that in the 2030–2035 application context, the CAVs are likely to be adopted, provided that the trajectory of progress in technology and infrastructure readiness continues, and potential adopters are offered opportunities to learn about Level 4 CAV technological capabilities in a real life service environment. The threshold level of the probability of adoption enhances significantly with high-reliability demonstration results that can reduce uncertainties in adoption decisions. The findings of this research can be used by private and public sector interest groups. Full article

Aimed at vehicle trajectory prediction procedures, this survey provides a comprehensive review for intelligent driving from both theoretical and practical perspectives. Vehicle trajectory prediction procedures are explained in terms of the perception layer, core technology of trajectory prediction, decision-making layer, and scenario application. In the perception layer, various sensors, visual-based perception devices, and multimodal fusion perception devices are enumerated. Additionally, the visual-based multimodal perception and pure visual perception techniques employed in the top five intelligent vehicles in China are introduced. Regarding the core technology of trajectory prediction, the methods are categorized into short-term domain and long-term domains, in which the former includes physics-based and machine learning algorithms, whereas the latter involves deep-learning and driving intention-related algorithms. Identically, the core technologies adopted in the top five intelligent vehicles are summarized. As for the decision-making layer, three main categories are summarized theoretically and practically, decision-making and planning for cooperation, super-computing and closed-loop, and real-time and optimization. As for the scenario application, open scenarios and closed scenarios are discussed in theory and practice. Finally, the research outlook on vehicle trajectory prediction is presented from data collection, trajectory prediction methods, generalization and transferability, and real-world application. The results provide some potential insights for researchers and practitioners in the vehicle trajectory prediction field, and guides future advancements in this field. Full article

In three-dimensional (3D) logistics environments, finding optimal paths for unmanned aerial vehicles (UAVs) is challenging due to positioning inaccuracies that require ground-based corrections. These inaccuracies are exacerbated in harsh environments, leading to a significant risk of correction failure. This research proposes a multi-objective mixed integer programming model (MILP) that transforms dynamic uncertainties into binary constraints, utilizing a hierarchical sequencing strategy in the Gurobi optimizer to efficiently identify optimal paths. Our simulations indicate that achieving an 80% mission success probability necessitates an optimal path of 104,946 m with nine corrections. For a 100% success rate, the path length increases to 105,874 m, with corrections remaining constant. These results validate the model’s effectiveness in navigating environments with probabilistic constraints, highlighting its potential for addressing complex logistical challenges. Full article

The primary challenge that robots face in disaster rescue is to precisely and efficiently construct disaster maps and achieve autonomous navigation. This paper proposes a method for air–ground collaborative map construction. It utilizes the flight capability of an unmanned aerial vehicle (UAV) to achieve rapid three-dimensional space coverage and complex terrain crossing for rapid and efficient map construction. Meanwhile, it utilizes the stable operation capability of an unmanned ground vehicle (UGV) and the ground detail survey capability to achieve precise map construction. The maps constructed by the two are accurately integrated to obtain precise disaster environment maps. Among them, the map construction and positioning technology is based on the FAST LiDAR–inertial odometry 2 (FAST-LIO2) framework, enabling the robot to achieve precise positioning even in complex environments, thereby obtaining more accurate point cloud maps. Before conducting map fusion, the point cloud is preprocessed first to reduce the density of the point cloud and also minimize the interference of noise and outliers. Subsequently, the coarse and fine registrations of the point clouds are carried out in sequence. The coarse registration is used to reduce the initial pose difference of the two point clouds, which is conducive to the subsequent rapid and efficient fine registration. The coarse registration uses the improved sample consensus initial alignment (SAC-IA) algorithm, which significantly reduces the registration time compared with the traditional SAC-IA algorithm. The precise registration uses the voxelized generalized iterative closest point (VGICP) algorithm. It has a faster registration speed compared with the generalized iterative closest point (GICP) algorithm while ensuring accuracy. In reinforcement learning navigation, we adopted the deep deterministic policy gradient (DDPG) path planning algorithm. Compared with the deep Q-network (DQN) algorithm and the A* algorithm, the DDPG algorithm is more conducive to the robot choosing a better route in a complex and unknown environment, and at the same time, the motion trajectory is smoother. This paper adopts Gazebo simulation. Compared with physical robot operation, it provides a safe, controllable, and cost-effective environment, supports efficient large-scale experiments and algorithm debugging, and also supports flexible sensor simulation and automated verification, thereby optimizing the overall testing process. Full article

Multi-objective Unmanned Aerial Vehicle (UAV) path planning in complex 3D environments presents a fundamental challenge requiring the simultaneous optimization of conflicting objectives such as path length, safety, altitude constraints, and smoothness. This study proposes a novel hybrid framework, termed QL-MOPSO, that integrates reinforcement learning with metaheuristic optimization through a three-stage hierarchical architecture. The framework employs Q-learning to generate a global guidance path in a discretized 2D grid environment using an eight-directional symmetric action space that embodies rotational symmetry at π/4 intervals, ensuring uniform exploration capabilities and unbiased path planning. A crucial intermediate stage transforms the discrete 2D path into a 3D initial trajectory, bridging the gap between discrete learning and continuous optimization domains. The MOPSO algorithm then performs fine-grained refinement in continuous 3D space, guided by a novel Q-learning path deviation objective that ensures continuous knowledge transfer throughout the optimization process. Experimental results demonstrate that the symmetric action space design yields 20.6% shorter paths compared to asymmetric alternatives, while the complete QL-MOPSO framework achieves 5% path length reduction and significantly faster convergence compared to standard MOPSO. The proposed method successfully generates Pareto-optimal solutions that balance multiple objectives while leveraging the symmetry-aware guidance mechanism to avoid local optima and accelerate convergence, offering a robust solution for complex multi-objective UAV path planning problems. Full article

This paper presents the design and implementation of a SLAM-based online mapping and autonomous trajectory execution system for the Nimbulus-e, a concept vehicle designed for agile maneuvering in confined spaces. The Nimbulus-e uses individual steer-by-wire corner modules with in-wheel motors at all four corners. The associated eight joint variables serve as control inputs, allowing precise trajectory following. These control inputs can be derived from the vehicle’s trajectory using nonholonomic constraints. A LiDAR sensor is used to map the environment and detect obstacles. The system processes LiDAR data in real time, continuously updating the environment map and enabling localization within the environment. The inclusion of vehicle odometry data significantly reduces computation time and improves accuracy compared to a purely visual approach. The A* and Hybrid A* algorithms are used for trajectory planning and optimization, ensuring smooth vehicle movement. The implementation is validated through both full vehicle simulations using an ADAMS Car—MATLAB co-simulation and a scaled physical prototype, demonstrating the effectiveness of the system in navigating complex environments. This work contributes to the field of autonomous systems by demonstrating the potential of combining advanced sensor technologies with innovative control algorithms to achieve reliable and efficient navigation. Future developments will focus on improving the robustness of the system by implementing a robust closed-loop controller and exploring additional applications in dense urban traffic and agricultural operations. Full article

This paper introduces a robust and efficient Localized Spline-based Path-Planning (LSPP) algorithm designed to enhance autonomous vehicle navigation on highways. The LSPP approach prioritizes smooth maneuvering, obstacle avoidance, passenger comfort, and adherence to road constraints, including lane boundaries, through optimized trajectory generation using quintic spline functions and a dynamic speed profile. Leveraging real-time data from the vehicle’s sensor fusion module, the LSPP algorithm accurately interprets the positions of surrounding vehicles and obstacles, creating a safe, dynamically feasible path that is relayed to the Model Predictive Control (MPC) track-following module for precise execution. The theoretical distinction of LSPP lies in its modular integration of: (1) a finite state machine (FSM)-based decision-making layer that selects maneuver-specific goal states (e.g., keep lane, change lane left/right); (2) quintic spline optimization to generate smooth, jerk-minimized, and kinematically consistent trajectories; (3) a multi-objective cost evaluation framework that ranks competing paths according to safety, comfort, and efficiency; and (4) a closed-loop MPC controller to ensure real-time trajectory execution with robustness. Extensive simulations conducted in diverse highway scenarios and traffic conditions demonstrate LSPP’s effectiveness in delivering smooth, safe, and computationally efficient trajectories. Results show consistent improvements in lane-keeping accuracy, collision avoidance, enhanced materials wear performance, and planning responsiveness compared to traditional path-planning methods. These findings confirm LSPP’s potential as a practical and high-performance solution for autonomous highway driving. Full article

The utilization of Unmanned Aerial Vehicles (UAVs) in missions such as reconnaissance and surveillance has grown rapidly, underscoring the need for efficient path planning algorithms that ensure both optimality and collision avoidance. The A-star algorithm is widely used for global path planning due to its ability to generate optimal routes; however, its high computational cost makes it unsuitable for real-time applications, particularly in unknown or dynamic environments. For local path planning, the Artificial Potential Field (APF) algorithm enables real-time navigation by attracting the UAV toward the target while repelling it from obstacles. Despite its efficiency, APF suffers from local minima and limited performance in dynamic settings. To address these challenges, this paper proposes the A-star-Guided Potential Field (AGPF) algorithm, which integrates the strengths of A-star and APF to achieve robust performance in both global and local path planning. The AGPF algorithm was validated through simulations conducted in the Robot Operating System (ROS) environment. Simulation results demonstrate that AGPF produces smoother and more optimal paths than A-star, while avoiding the local minima issues inherent in APF. Furthermore, AGPF effectively handles moving and previously unknown obstacles by generating real-time avoidance trajectories, demonstrating strong adaptability in dynamic and uncertain environments. Full article