Explore the vast range of titles available.

Uncoordinated driving behavior is one of the main reasons for bottlenecks on freeways. This paper presents a novel cyber-physical framework for optimal coordination of connected and automated vehicles (CAVs) on multi-lane freeways. We consider that all vehicles are connected to a cloud-based computing framework, where a traffic coordination system optimizes the target trajectories of individual vehicles for smooth and safe lane changing or merging. In the proposed framework, the vehicles are coordinated into groups or platoons, and their trajectories are successively optimized in a receding horizon control (RHC) approach. Optimization of the traffic coordination system aims to provide sufficient gaps when a lane change is necessary while minimizing the speed deviation and acceleration of all vehicles. The coordination information is then provided to individual vehicles equipped with local controllers, and each vehicle decides its control acceleration to follow the target trajectories while ensuring a safe distance. Our proposed method guarantees fast optimization and can be used in real-time. The proposed coordination system was evaluated using microscopic traffic simulations and benchmarked with the traditional driving (human-based) system. The results show significant improvement in fuel economy, average velocity, and travel time for various traffic volumes.

Purpose>On-ramp merging areas are typical bottlenecks in the freeway network since merging on-ramp vehicles may cause intensive disturbances on the mainline traffic flow and lead to various negative impacts on traffic efficiency and safety. The connected and autonomous vehicles (CAVs), with their capabilities of real-time communication and precise motion control, hold a great potential to facilitate ramp merging operation through enhanced coordination strategies. This paper aims to present a comprehensive review of the existing ramp merging strategies leveraging CAVs, focusing on the latest trends and developments in the research field.Design/methodology/approach>The review comprehensively covers 44 papers recently published in leading transportation journals. Based on the application context, control strategies are categorized into three categories: merging into sing-lane freeways with total CAVs, merging into sing-lane freeways with mixed traffic flows and merging into multilane freeways.Findings>Relevant literature is reviewed regarding the required technologies, control decision level, applied methods and impacts on traffic performance. More importantly, the authors identify the existing research gaps and provide insightful discussions on the potential and promising directions for future research based on the review, which facilitates further advancement in this research topic.Originality/value>Many strategies based on the communication and automation capabilities of CAVs have been developed over the past decades, devoted to facilitating the merging/lane-changing maneuvers at freeway on-ramps. Despite the significant progress made, an up-to-date review covering these latest developments is missing to the authors’ best knowledge. This paper conducts a thorough review of the cooperation/coordination strategies that facilitate freeway on-ramp merging using CAVs, focusing on the latest developments in this field. Based on the review, the authors identify the existing research gaps in CAV ramp merging and discuss the potential and promising future research directions to address the gaps.

IoT (Internet-of-Things)-powered devices can be exploited to connect vehicles to smart city infrastructure, allowing vehicles to share their intentions while retrieving contextual information about diverse aspects of urban viability. In this paper, we place ourselves in a transient scenario in which next-generation vehicles that are able to communicate with the surrounding infrastructure coexist with traditional vehicles with limited or absent IoT capabilities. We focus on intersection management, in particular on reusing existing traffic lights empowered by a new management system. We propose an auction-based system in which traffic lights are able to exchange contextual information with vehicles and other nearby traffic lights with the aim of reducing average waiting times at intersections and consequently overall trip times. We use bid propagation to improve standard vehicle trip times while allowing emergency vehicles to free up the way ahead without needing ad hoc system for such vehicle, only an increase in their budget. The proposed system is then tested against two baselines: the classical Fixed Time Control system currently adopted for traffic lights, and an auction strategy that does not exploit traffic light coordination. We performed a large set of experiments using the well known MATSim transport simulator on both a synthetic Manhattan map and on a map we built of an urban area located in Modena, Northern Italy. Our results show that the proposed approach performs better than the classical fixed time control system and the auction strategy that does not exploit coordination among traffic lights.

In recent years, the increasing popularity of multi-vehicle missions has been accompanied by a growing interest in the development of control strategies to ensure safety in these scenarios. In this work, we propose a control framework for coordination and collision avoidance in cooperative multi-vehicle missions based on a speed adjustment approach. The overall problem is decoupled in a coordination problem, in order to ensure coordination and inter-vehicle safety among the agents, and a collision-avoidance problem to guarantee the avoidance of non-cooperative moving obstacles. We model the network over which the cooperative vehicles communicate using tools from graph theory, and take communication losses and time delays into account. Finally, through a rigorous Lyapunov analysis, we provide performance bounds and demonstrate the efficacy of the algorithms with numerical and experimental results.

With the gradual popularization of automobiles, it has become a very important means of transportation for people, bringing a lot of convenience to people’s travel. In the field of driving, with the development of intelligent communication technology, intelligent driving vehicles “drive into” people’s field of vision. In contemporary society, intelligence is integrated into all aspects of life and is more and more inseparable from intelligence. In order to research multi-vehicle coordination-enhanced intelligent driving framework based on human–machine hybrid intelligence, from the perspective of human–machine hybrid intelligence, this paper takes multi-vehicle coordination as the starting point, introduces the fish swarm effect and builds a multi-vehicle coordinated, intelligent driving system with strong self-adaptability and scalability, so that it can adapt to more complex and real road environments.

Autonomous vehicles hold the potential to significantly improve traffic efficiency and advance the development of intelligent transportation systems. With the progression of autonomous driving technology, collaborative planning among multiple vehicles in autonomous driving scenarios has emerged as a pivotal challenge in realizing intelligent transportation systems. Serving as the cornerstone of unmanned mission decision-making, collaborative motion planning algorithms have garnered increasing attention in both theoretical exploration and practical application. These methods often follow a similar paradigm: the system initially discerns the driving intentions of each vehicle, subsequently assesses the surrounding environment, engages in path-planning, and formulates specific behavioral decisions. The paper discusses trajectory prediction, game theory, following behavior, and lane merging issues within the paradigm mentioned above. After briefly introducing the background of multi-vehicle autonomous driving, it provides a detailed description of the technological prerequisites for implementing these techniques. It reviews the main algorithms in motion planning, their functionalities, and applications in road environments, as well as current and future challenges and unresolved issues.

With the rapid development of intelligent transportation systems and online ride-hailing platforms, the demand for promptly responding to passenger requests while minimizing vehicle idling and travel costs has grown substantially. This paper addresses the challenges of suboptimal vehicle path planning and partially connected pickup stations by formulating the task as a Capacitated Vehicle Routing Problem (CVRP). We propose an Improved Genetic Algorithm (IGA)-based path planning model designed to minimize total travel distance while respecting vehicle capacity constraints. To handle scenarios where certain pickup points are not directly connected, we integrate graph-theoretic techniques to ensure route continuity. The proposed model incorporates a multi-objective fitness function, a rank-based selection strategy with adjusted weights, and Dijkstra-based path estimation to enhance convergence speed and global optimization performance. Experimental evaluations on four benchmark maps from the Carla simulation platform demonstrate that the proposed approach can rapidly generate optimized multi-vehicle path planning solutions and effectively coordinate pickup tasks, achieving significant improvements in both route quality and computational efficiency compared to traditional methods.

In this paper, a distributed linear MPC approach to solve the trajectory planning problem for rotary-wing UAVs is proposed, where the objective of the UAV system is to form a communication network to multiple targets with given radio communication capacities. The approach explicitly incorporates constraints on radio communication path losses, computed by using SPLAT! that is able to take into account terrain models and antenna locations. In order to enhance the online optimization, at each time sample the terrain below each UAV and the communication path losses are approximated with linear functions of the spatial coordinates. This leads to linear MPC sub-problems, which are solved by using convex quadratic programming. An algorithm for automatic initialization and optimal reconfiguration of the communication topology in case of failures or severe radio path loss due to e.g. channel fading, is proposed. The communication network that is provided by the UAVs is considered to be a payload communication capacity that is normally independent of the command and control datalink used to control the UAVs. The performance of the distributed linear MPC trajectory planning and the reconfiguration algorithm is studied on two simulation cases with four UAVs and two targets.

Numerous approaches have attempted to develop systems that more appropriately manage street crossings in cities in recent years. Solutions range from intelligent traffic lights to complex, centralized protocols that evaluate the policies that vehicles must comply with at intersections. Such works attempt to provide traffic-control strategies at intersections where the complexity of a dynamic environment, with vehicles crossing in different directions and multiple conflict points, pose a significant challenge for city traffic optimization. Traditionally, a traffic-control system at an intersection gives the green light to one lane while keeping the other lanes on red. But there may be situations in which there are different levels of vehicle priority; for example, emergency vehicles may have priority at intersections. Thus, this work proposes a distributed junction-management protocol that pays special attention to emergency vehicles. The proposed algorithm implements rules based on the distributed intersection management (DIM) protocol; such rules are used by vehicles while negotiating their crossing through the intersection. The proposal also seeks to affect the traffic flow of non-priority vehicles minimally. An evaluation and comparison of the proposed algorithm are presented in the paper.

Hybrid Centralised‐Decentralised Electric Vehicle (EV) coordination policy in the urgent charging scenario is presented. First, a robust and complex optimisation problem considering several key features affecting EV coordination is formulated. Then, a solution strategy for the formulated problem is proposed by decomposing the formulated problem into an EV coordination and simple optimisation problem. The decentralised rule‐based EV coordination strategy works on the principle of direct load flattening and utilises practical EV aggregator‐customer interaction, customer behaviour, and temporospatial shifting of the EVs to flatten the load duration curve at the charging station. Then, the centralised optimisation problem is solved to minimise the operation cost, decrease the power loss, and decrease congestion in the grid. A comparison between uncoordinated and coordinated charging in the case study conducted on the IEEE 24 bus system shows that the proposed approach reduces the average EV load by 1283.26 kW/min, average power loss by 2.465 kW/min, and operation cost by 61.99 $/min during the peak hours. The overview of the proposed coordination scheme is shown in Figure 1. The key idea in the proposed coordination scheme is to utilise EV customer‐EV aggregator interaction to guide the charging of EVs. The EV customers submit their charging requirements to the EV aggregator at the charging station, after which the EV aggregator estimates the charging power and charging time requirement to serve the EV customer. The central grid operator receives the charging information from all the aggregators in the grid and chooses the most economical dispatch to meet the power requirements of all the EV aggregators in the system.