skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 10:00 PM to 12:00 PM ET on Tuesday, March 25 due to maintenance. We apologize for the inconvenience.


Title: Flocking Control of Multi-agent Automated Vehicles for Curved Driving: A Polyline Leader Approach
Flocking control for multi-agent automated vehicles has attracted more research interest recently. However, one significant challenge is that the common use of point-shaped virtual leaders giving uniform navigations is unsuitable for vehicle motions with varying relative positions and orientations on multi-lane roads, particularly on curved sections. Considering the practical movements of multi-agent ground vehicles, this paper proposes a novel type of polyline-shaped leader(s) that aligns with multi-lane roads. Specifically, the polyline-shaped leader is composed of line segments that consider road curvatures, different lanes, and the flocking lattice configuration. Moreover, an artificial flow guidance method is applied to provide the direction of velocity references to ensure vehicles move within their respective lanes during the formed flocking. Simulation results demonstrate that the proposed approach can successfully regulate vehicles to drive in their lanes in coordinated motion, which gives fewer structural deviations on curved roads compared to the case with the point-shaped leader.  more » « less
Award ID(s):
1828010
PAR ID:
10514440
Author(s) / Creator(s):
;
Publisher / Repository:
Elsevier
Date Published:
Journal Name:
IFAC-PapersOnLine
Volume:
56
Issue:
3
ISSN:
2405-8963
Page Range / eLocation ID:
253 to 258
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Different types of lane-changing assistance systems are usually developed separately by different automotive makers or suppliers. A lane-changing model can meet its own requirements, but it may be incompatible with another lane-changing model. In this paper, we verify if two lane-changing models are compatible so that the two corresponding vehicles on different lanes can exchange their lanes successfully. We propose a methodology and an algorithm to perform the verification on the combinations of four lane-changing models. Experimental results demonstrate the compatibility (or incompatibility) between the models. The verification results can be utilized during runtime to prevent incompatible vehicles from entering a lane-changing road segment. To the best of our knowledge, this is the first work considering the compatibility issue for lane-changing models. 
    more » « less
  2. We analyze the effect of a bicycle lane on traffic speeds. Computer vision techniques are used to detect and classify the speed and trajectory of over 9,000 motor-vehicles at an intersection that was part of a pilot demonstration in which a bicycle lane was temporarily implemented. After controlling for direction, hourly traffic flow, and the behavior of the vehicle (i.e., free-flowing or stopped at a red light), we found that the effect of the delineator-protected bicycle lane (marked with traffic cones and plastic delineators) was associated with a 28 % reduction in average maximum speeds and a 21 % decrease in average speeds for vehicles turning right. For those going straight, a smaller reduction of up to 8 % was observed. Traffic moving perpendicular to the bicycle lane experienced no decrease in speeds. Painted-only bike lanes were also associated with a small speed reduction of 11–15 %, but solely for vehicles turning right. These findings suggest an important secondary benefit of bicycle lanes: by having a traffic calming effect, delineated bicycle lanes may decrease the risk and severity of crashes for pedestrians and other road users. 
    more » « less
  3. This letter aims to develop a new learning-based flocking control framework that ensures inter-agent free collision. To achieve this goal, a leader-following flocking control based on a deep Q-network (DQN) is designed to comply with the three Reynolds’ flocking rules. However, due to the inherent conflict between the navigation attraction and inter-agent repulsion in the leader-following flocking scenario, there exists a potential risk of inter-agent collisions, particularly with limited training episodes. Failure to prevent such collision not only caused penalties in training but could lead to damage when the proposed control framework is executed on hardware. To address this issue, a control barrier function (CBF) is incorporated into the learning strategy to ensure collision-free flocking behavior. Moreover, the proposed learning framework with CBF enhances training efficiency and reduces the complexity of reward function design and tuning. Simulation results demonstrate the effectiveness and benefits of the proposed learning methodology and control framework. 
    more » « less
  4. This high-resolution (1 meter) raster represents road surface area for streets (including alleys) in the seven-county Minneapolis-St. Paul Metropolitan area. Minnesota roads data contributing to this layer is compiled from several state and county agencies and accessed through the Minnesota Geospatial Commons. The Minnesota Transportation Department (MNDOT) Lane Information dataset was spatially joined with MNDOT centerlines from 2012 in order to link the Transportation Information System (TIS) ID codes for road segments with the lane information on number of through transit lanes and width of lanes. The resulting layer was then joined on the TIS code attribute with the Geospatial Advisory Council Schema road centerlines shapefile from MetroGIS. To avoid a many-to-one join, MNDOT road segments were grouped by their TIS code and the average lane width and number were summarized to make the layer compatible with the MetroGIS centerlines shapefile. Once the centerline route segment IDs were linked to the MNDOT transit lane information, the centerlines were buffered based on their average width attribute, multiplied by the number of lanes. Alleys were identified and assigned a width of 5 meters based on typical alley width measurements using satellite imagery. Due to transportation identification system scope, confidence in accuracy of private road surface area is diminished. The resulting buffered road segment vectors were rasterized and cropped to the seven-county metro area (Hennepin, Ramsey, Anoka, Washington, Dakota, Scott, and Carver County). 
    more » « less
  5. Meng, Meng (Ed.)
    Managed lanes, such as a dedicated lane for connected and automated vehicles (CAVs), can provide not only technological accommodation but also desired market incentives for road users to adopt CAVs in the near future. In this paper, we investigate traffic flow characteristics with two configurations of the managed lane across different market penetration rates and quantify the benefits from the perspectives of lane-level headway distribution, fuel consumption, communication density, and overall network performance. The results highlight the benefits of implementing managed lane strategies for CAVs: (1) A dedicated CAV lane significantly extends the stable region of the speed-flow diagram and yields a greater road capacity. As the result shows, the highest flow rate is 3400 vehicles per hour per lane at 90% market penetration rate with one CAV lane. (2) The concentration of CAVs in one lane results in a narrower headway distribution (with smaller standard deviation) even with partial market penetration. (3) A dedicated CAV lane is also able to eliminate duel-bell-shape distribution that is caused by the heterogeneous traffic flow. (4) A dedicated CAV lane creates a more consistent CAV density, which facilitates communication activity and decreases the probability of packet dropping. 
    more » « less