Search Results (27)

High-speed railways (HSRs), with their advantages of safety, energy conservation, and convenience, are increasingly becoming the preferred mode of transportation. Railway operators schedule full-schedule timetables to operate as many trains and serve as many passengers as possible. However, due to the fluctuation in passenger demands, it is not necessary to operate all trains in full-schedule timetable, which results in high operation costs and too much energy consumption. Based on this, we propose an integrated approach to schedule passenger train plans and train timetables by selecting trains to operate from the full-schedule timetable, adjusting their stopping scheme and operation sequence to reduce operation costs and energy consumption and contribute to sustainable development. In the scheduling process, both operation costs and passenger service quality are considered, and a two-objective model is established. An algorithm is designed based on Non-dominated Sorting Genetic Algorithms-II (NSGA-II) to solve the model, containing techniques for acceleration that utilize overtaking patterns, in which overtaking chromosomes are used to illustrate the train operation sequence, and parallel computing, in which the decoding process is computed in parallel. A set of Pareto fronts are obtained to offer a diverse set of results with different operation costs and passenger service quality. The model and algorithm are verified by cases based on the Beijing–Shanghai HSR line. The results indicate that compared to the full-schedule timetable, the operation costs under three sets of passenger demands decreased by 35.4%, 27.7%, and 15.7% on average. Compared to the genetic algorithm with weighting multiple objectives and NSGA-II without acceleration techniques, the algorithm proposed in this paper with the two acceleration techniques of utilizing overtaking patterns and parallel computing can significantly accelerate the solution process, with an average reduction of 42.9% and 38.3% in calculation time, indicating that the approach can handle the integrated scheduling problem economically and efficiently. Full article

With the rapid development of the economy, urban road congestion has become more serious. The travel times for vehicles are becoming more uncontrollable, making it challenging to reach destinations on time. In order to find an optimal route and arrive at the destination with the shortest travel time, this paper proposes a dynamic shortest travel time path planning algorithm with an overtaking function (DSTTPP-OF) based on a vehicular ad hoc network (VANET) environment. Considering the uncertainty of driving vehicles, the target vehicle (vehicle for special tasks) is influenced by surrounding vehicles, leading to possible deadlock or congestion situations that extend travel time. Therefore, overtaking planning should be conducted through V2V communication, enabling surrounding vehicles to coordinate with the target vehicle to avoid deadlock and congestion through lane changing and overtaking. In the proposed DSTTPP-OF, vehicles may queue up at intersections, so we take into account the impact of traffic signals. We classify road segments into congested and non-congested sections, calculating travel times for each section separately. Subsequently, in front of each intersection, the improved Dijkstra algorithm is employed to find the shortest travel time path to the destination, and the overtaking function is used to prevent the target vehicle from entering a deadlocked state. The real-time traffic data essential for dynamic path planning were collected through a VANET of symmetrically deployed roadside units (RSUs) along the roadway. Finally, simulations were conducted using the SUMO simulator. Under different traffic flows, the proposed DSTTPP-OF demonstrates good performance; the target vehicle can travel smoothly without significant interruptions and experiences the fewest stops, thanks to the proposed algorithm. Compared to the shortest distance path planning (SDPP) algorithm, the travel time is reduced by approximately 36.9%, and the waiting time is reduced by about 83.2%. Compared to the dynamic minimum time path planning (DMTPP) algorithm, the travel time is reduced by around 18.2%, and the waiting time is reduced by approximately 65.6%. Full article

In recent years, unmanned surface vehicles (USVs) have gained increasing attention in industry due to their efficiency and versatility in marine operations. Artificial potential field (APF) methods, with their strong adaptability and simplicity of implementation, are widely used in USV path planning tasks. However, the naive APF method struggles in static complex environments, due to the local minima problem. Not to mention that actual navigations may involve other dynamic traffic participants. In this work, an improved APF algorithm integrating the boundary potential field method and the International Regulations for Preventing Collisions at Sea (COLREGs) is proposed. By incorporating the boundary potential field method, this novel approach effectively reduces the computational burden caused by clusters of land obstacles in complex environments, significantly improving computational efficiency. Furthermore, the APF method is refined to ensure the algorithm strictly adheres to COLREGs in head-on, overtaking, and crossing encounters, generating smooth and safe collision avoidance paths. The proposed method was tested in numerous complex scenarios derived from electronic navigational charts. The simulation results demonstrated the robustness and efficiency of the proposed algorithm for collision avoidance within complex maritime environments, providing reliable technical support for autonomous obstacle avoidance in dynamic ocean conditions. Full article

This paper focuses on the spatiotemporal trajectory planning problem faced by autonomous driving with a dynamic on-road situation. To solve the swing problem which is caused by the motions of obstacles, a multi-area sampling method is proposed. The main idea is sampling endpoints in a series of defined areas at a fixed time interval, which will generate suitable trajectories with speed information to deal with complex maneuver tasks. Considering the driving safety and comfort, the cost function is designed deliberately for the generated trajectories in each area to evaluate the behaviors of the automobile. Then, the best trajectory in the whole course is found by the dynamic programming-based approach, which is presented to optimize the problem-solving process and at the same time reduce the computational burden which is brought about by the multi-area sampling method. Finally, the effectiveness of the proposed trajectory planning method is demonstrated in different overtaking scenarios of structured roads. Full article

Overtaking situations are commonly encountered in maritime navigation, and the overtaking process involves various risk factors that significantly contribute to collision incidents. It is crucial to conduct research on the maneuvering behaviors and decision-making processes associated with ship overtaking. This paper proposes a method based on the analysis of ship maneuvering performance to investigate overtaking behaviors in navigational channels. A relative motion model is established for both the overtaking and the overtaken vessels, and the inter-vessel distance is calculated, taking into account the psychological perceptions of the ship’s driver. A decision-making model for ship overtaking is presented to provide a safety protocol for overtaking maneuvers. Applying this method to overtaking data from the South Channel shows that it effectively characterizes both the permissible overtaking space and the driver’s overtaking desire. Additionally, it enables the prediction of optimal overtaking timing and strategies based on short-term trajectory forecasts. Thus, this method not only offers a safe overtaking plan for vessels but also provides auxiliary information for decision making in intelligent ship navigation. Full article

The overtaking process for autonomous vehicles must prioritize both efficiency and safety, with safe distance being a crucial parameter. To address this, we propose an automatic overtaking path planning method based on minimal safe distance, ensuring both maneuvering efficiency and safety. This method combines the steady movement and comfort of the constant velocity offset model with the smoothness of the sine function model, creating a mixed-function model that is effective for planning lateral motion. For precise longitudinal motion planning, the overtaking process is divided into five stages, with each stage’s velocity and travel time calculated. To enhance the control system, the model predictive control (MPC) algorithm is applied, establishing a robust trajectory tracking control system for overtaking. Numerical simulation results demonstrate that the proposed overtaking path planning method can generate smooth and continuous paths. Under the MPC framework, the autonomous vehicle efficiently and safely performs automatic overtaking maneuvers, showcasing the method’s potential to improve the performance and reliability of autonomous driving systems. Full article

Line planning and timetabling play important roles in the design of urban rail transportation services. Due to the complexity of the integrated optimization of entire transportation plans, previous studies have generally considered line planning and timetabling design independently, which cannot ensure the global optimality of transportation services. In this study, the integrated design problem of line planning and timetabling was characterized as an equilibrium space–time network design problem and solved with a bi-objective nonlinear integer programming model. The model, in which train overtaking and passenger path choice behavior were considered, adjusted the network topology and link attributes (time and capacity) of the travel space–time network by optimizing the train service frequency, operation zone, stopping pattern, train formation, and train order to minimize the system life cycle cost and total passenger travel time perception. An algorithm was constructed using the non-dominated sorting genetic algorithm II combined with the self-adaptive gradient projection algorithm to solve the model. A real-world case was considered to evaluate the effectiveness of the proposed model and algorithm. The results showed that the model not only performed well in the trade-off between system cost and passenger travel efficiency, but it could also reduce the imbalance of train and station loads. Pareto front analysis of the model with different parameters showed that more types of trains did not correlate with a better performance, some line-planning strategies had a combination effect, and multi-strategy line planning was more suitable for scenarios with a high imbalance in the temporal and spatial distributions of passenger flow. Full article

The safety of cyclists, e-scooters, and micromobility devices in urban environments remains a critical concern in sustainable urban planning. A primary factor affecting this safety is the lateral passing distance (LPD) or dynamic proximity of motor vehicles overtaking micromobility riders. Minimum passing distance laws, where motorists are required to maintain a minimum distance of 1.5 m when passing a cyclist, are difficult to enforce due to the difficulty in determining the exact distance between a moving vehicle and a cyclist. Existing systems reported in the literature are invariably used for research and require manual intervention to record passing vehicles. Further, due to the dynamic and noisy environment on the road, the collected data also need to be manually post-processed to remove errors and false positives, thus making such systems impractical for use by cyclists. This study aims to address these two concerns by providing an automated and robust framework, integrating a low-cost, small single-board computer with a range sensor and a camera, to measure and analyze vehicle–cyclist passing distance and speed. Preliminary deployments in Singapore have demonstrated the system’s efficacy in capturing high-resolution data under varied traffic conditions. Our setup, using a Raspberry Pi 4, LiDAR distance sensor, a small camera, and an automated data clustering technique, had a high success rate for correctly identifying the number of close vehicle passes for distances between 1 and 1.5 m. The insights garnered from this integrated setup promise not only a deeper understanding of interactions between motor vehicles and micromobility devices, but also a roadmap for data-driven urban safety interventions. Full article

Overtaking on a dual-lane road with the presence of oncoming vehicles poses a considerable challenge in the field of autonomous driving. With the assistance of high-definition maps, autonomous vehicles can plan a relatively safe trajectory for executing overtaking maneuvers. However, the creation of high-definition maps requires extensive preparation, and in rural areas where dual two-lane roads are common, there is little pre-mapping to provide high-definition maps. This paper proposes an end-to-end model called OG-Net (Overtaking Guide Net), which accomplishes overtaking tasks without map generation or communication with other vehicles. OG-Net initially evaluates the likelihood of a successful overtaking maneuver before executing the necessary actions. It incorporates the derived probability value with a set of simple parameters and utilizes a Gaussian differential controller to determine the subsequent vehicle movements. The Gaussian differential controller effectively adapts a fixed geometric curve to various driving scenarios. Unlike conventional autonomous driving models, this approach employs uncomplicated parameters rather than RNN-series networks to integrate contextual information for overtaking guidance. Furthermore, this research curated a new end-to-end overtaking dataset, CarlaLanePass, comprising first-view image sequences, overtaking success rates, and real-time vehicle status during the overtaking process. Extensive experiments conducted on diverse road scenes using the Carla platform support the validity of our model in achieving successful overtaking maneuvers. Full article

Metabolic dysfunction-associated steatotic liver disease (MASLD), formerly termed nonalcoholic fatty liver disease (NAFLD), is a widespread global health concern that affects around 25% of the global population. Its influence is expanding, and it is anticipated to overtake alcohol as the leading cause of liver failure and liver-related death worldwide. Unfortunately, there are no approved therapies for MASLD; as such, national and international regulatory health agencies undertook strategies and action plans designed to expedite the development of drugs for treatment of MASLD. A sedentary lifestyle and an unhealthy diet intake are important risk factors. Western countries have a greater estimated prevalence of MASLD partly due to lifestyle habits. Mitochondrial dysfunction is strongly linked to the development of MASLD. Further, it has been speculated that mitophagy, a type of mitochondrial quality control, may be impaired in MASLD. Thyroid hormone (TH) coordinates signals from the nuclear and mitochondrial genomes to control mitochondrial biogenesis and function in hepatocytes. Mitochondria are known TH targets, and preclinical and clinical studies suggest that TH, thyroid receptor β (TR-β) analogs, and synthetic analogs specific to the liver could be of therapeutic benefit in treating MASLD. In this review, we highlight how mitochondrial dysfunction contributes to development of MASLD, and how understanding the role of TH in improving mitochondrial function paved the way for innovative drug development programs of TH-based therapies targeting MASLD. Full article

Situated local knowledge and co-evolutionary processes overtake certitude and formal planning, challenging the way (cultural) heritage is produced in terms of both space and knowledge. This article contributes to the debate surrounding planning education and research by exploring the potential of inquiry-based learning (IBL) in spatial development and heritage conservation. The main argument is that the IBL format presented herein enables interaction and cooperation between various groups and their diverse sets of knowledge. To that end, the IBL approach was implemented both through project work and by creating a specific learning environment encompassing theory, exhibition, places, and people, and in which a research process was realised by students through iteration and reflection. The contribution systematises the results of a 2021 workshop held in Venice and Rome, including at the Corviale housing complex (Rome). In seeking to respond to the title-theme of the Venice Biennale, How will we live together?, initial evidence shows that educational activities stemming from clear research questions and “embedded” ways of inquiry-based learning present remarkable opportunities for participants to improve their ability to navigate into fragile and uncertain futures of the territory, engaging students in a wider process of knowledge-building. Full article

In motion planning for autonomous racing, the challenge arises in planning smooth trajectories close to the handling limits of the vehicle with a sufficient planning horizon. Graph-based trajectory planning methods can find the global discrete-optimal solution, but they suffer from the curse of dimensionality. Therefore, to achieve low computation times despite a long planning horizon, coarse discretization and simple edges that are efficient to generate must be used. However, the resulting rough trajectories cannot reach the handling limits of the vehicle and are also difficult to track by the controller, which can lead to unstable driving behavior. In this paper, we show that the initial edges connecting the vehicle’s estimated state with the actual graph are crucial for vehicle stability and race performance. We therefore propose a sampling-based approach that relies on jerk-optimal curves to generate these initial edges. The concept is introduced using a layer-based graph, but it can be applied to other graph structures as well. We describe the integration of the curves within the graph and the required adaptation to racing scenarios. Our approach enables stable driving at the handling limits and fully autonomous operation on the race track. While simulations show the comparison of our concept with an alternative approach based on uniform acceleration, we also present experimental results of a dynamic overtake with speeds up to 74 m/s on a full-size vehicle. Full article

Autonomous driving technology in urban environments is a very important avenue of research. Notably, the question of how to plan safe lane-changing trajectories is a challenge in multi-vehicle traffic environments. In our research, three kinds of polynomial lane changing mathematical models were analyzed and compared. It was found that the fifth polynomial is the most suitable for lane changing trajectories; it is defined as a generalized lane-changing trajectory cluster, whereby the minimum lane change time is determined by the vehicle lateral stability threshold. Here, a collision avoidance algorithm is proposed to eliminate unsafe trajectories. Finally, the TOPSIS algorithm is used to solve the multi-objective optimization problem, and the optimal lane-changing expected trajectory is obtained from the safe trajectory cluster. The simulation results showed improvements in lane-changing efficiency of 6.67% and no collisions in the overtaking condition. In general, the proposed method of identifying the optimal lane changing trajectory can achieve safe, efficient and stable lane changing. Full article

Automated vehicles can perceive their environment and control themselves, but how to effectively transfer the information perceived by the vehicles to human drivers through interfaces, or share the awareness of the situation, is a problem to be solved in human–machine co-driving. The four elements of the shared situation awareness (SSA) interface, namely human–machine state, context, current task status, and plan, were analyzed and proposed through an abstraction hierarchy design method to guide the output of the corresponding interface design elements. The four elements were introduced to visualize the interface elements and design the interface prototype in the scenario of “a vehicle overtaking with a dangerous intention from the left rear”, and the design schemes were experimentally evaluated. The results showed that the design with the four elements of an SSA interface could effectively improve the usability of the human–machine interface, increase the levels of human drivers’ situational awareness and prediction of dangerous intentions, and boost trust in the automatic systems, thereby providing ideas for the design of human–machine collaborative interfaces that enhance shared situational awareness in similar scenarios. Full article

Unmanned surface vehicle (USV) path planning is a crucial technology for achieving USV autonomous navigation. Under global path planning, dynamic local obstacle avoidance has become the primary focus for safe USV navigation. In this study, a USV autonomous dynamic obstacle avoidance method based on the enhanced velocity obstacle method is proposed in order to achieve path replanning. Through further analysis of obstacles, the obstacle geometric model set in the conventional velocity obstacle method was redefined. A special triangular obstacle geometric model was proposed to reconstruct the velocity obstacle region. The collision time was predicted by fitting the previously gathered data to the detected obstacle’s distance, azimuth, and other relevant data. Then, it is combined with the collision risk to determine when obstacle avoidance should begin and end. In order to ensure safe driving between path points, the international maritime collision avoidance rules (COLREGs) are incorporated to ensure the accuracy of obstacle avoidance. Finally, through numerical simulations of various collision scenarios, it was determined that, under the assumption of ensuring a safe encounter distance, the maximum change rates of USV heading angle are optimized by 17.54%, 58.16%, and 28.63% when crossing, head-on, and overtaking, respectively. The results indicate that, by optimizing the heading angle, the enhanced velocity obstacle method can avoid the risk of ship rollover caused by an excessive heading angle during high-speed movement and achieve more accurate obstacle avoidance action in the event of a safety encounter. Full article