# A Deep Coordination Graph Convolution Reinforcement Learning for Multi-Intelligent Vehicle Driving Policy

Authors: Huaiwei Si; Guozhen Tan; Hao Zuo
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

With the growing up of Internet of Things technology, the application of Internet of Things has been popularized in the field of intelligent vehicles. Therefore, more artificial intelligence algorithms, especially DRL methods, are more widely used in autonomous driving. A large number of deep reinforcement learning (RL) technologies are continuously applied to the behavior planning module of single-vehicle autonomous driving in early. However, autonomous driving is an environment where multi-intelligent vehicles coexist, interact with each other, and dynamically change. In this environment, multiagent RL technology is one of the most promising technologies for solving the coordination behavior planning problem of multivehicles. However, the research related to this topic is rare. This paper introduces a dynamic coordination graph (CG) convolution technology for the cooperative learning of multi-intelligent vehicles. This method dynamically constructs a CG model among multiple vehicles, effectively reducing the impact of unrelated intelligent vehicles and simplifying the learning process. The relationship between intelligent vehicles is refined using the attention mechanism, and the graph convolution RL technology is used to simulate the message-passing aggregation algorithm to maximize the local utility and obtain the maximum joint utility to guide coordination learning. Driving samples are used as training data, and the model guided by reward shaping is combined with the model of the free graph convolution RL method, which enables our proposed method to achieve high gradualness and improve its learning efficiency. In addition, as the graph convolutional RL algorithm shares parameters between agents, it can easily build scales that are suitable for large-scale multiagent systems, such as traffic environments. Finally, the proposed algorithm is tested and verified for the multivehicle cooperative lane-changing problem in the simulation environment of autonomous driving. Experimental results show that our proposed method has better value function representation in that it can learn better coordination driving policies than traditional dynamic coordination algorithms.


---

## Body

## 1. Introduction

Autonomous driving, regarded as a cognitive system, is composed of the following three main models: perception, planning, and control [1, 2]. The various models of this cognitive system comprise many methods, each of them describing the subcomponents of those models and the interaction interfaces between the models [3]. The planning model can be divided into route planning, behavior planning, and motion planning [4]. An increasing number of research has used artificial intelligence in recent years to solve the behavior planning problem of autonomous driving [5], especially since the deep reinforcement learning (DRL) method has achieved great success [6], and many researchers have applied DRL to such a problem [7]. Most of the studies have applied the single-agent reinforcement learning (RL) method to the autonomous driving environment [8–10]. For example, the classic deep Q-network (DQN) method is applied to automatic driving to solve the lane-changing problem [11], and the actor–critic method is applied to the behavioral decision-making problem of automatic driving [12]. Most of the work has focused on the behavior decision making of single-intelligent vehicles. Although some of them have considered other road elements to predict their behavior [13], the goal had been to learn a decision-making method of single-intelligent vehicles, and the decision making had not considered the integrated coordinated decision making of multi-intelligent vehicles.However, the future scheme will likely involve intelligent transportation systems with multi-intelligent vehicles. Autonomous vehicles can obtain more information about other vehicles. If such vehicle types can coordinate with other intelligent vehicles; then, they can drive more safely and efficiently. For example, the interaction and coordination between intelligent vehicles and surrounding vehicles can help intelligent vehicles to understand road traffic information, the location of other vehicles, or the different behavior plans of other vehicles. Consequently, intelligent vehicles can make coordinated decisions that are conducive to the overall road situation and ensure a safer and more efficient intelligent transportation system. Multiagent DRLs typify a good method of solving the decision-making problem of multivehicle coordination driving [14]. However, the studies on multi-intelligent vehicle coordination methods at present are few.In the multi-intelligent vehicle environment, the multiagent RL (MARL) [15] method can be used to learn the coordination policy of intelligent vehicles. However, large numbers of intelligent vehicles and dynamically changing environments may both complicate the interaction relationship in the policy learning process. Consequently, simplifying the relationship between agents in the learning process has gradually become a vital research field [16]. In a general multiagent environment, predefined rules are usually used to abstract the relationship between agents [17]. However, with the increasing number of agents and the growing complexity of environments, accurately defining the relationship between agents only by using predesigned rules has become increasingly difficult [16]. Some researchers have used the soft attention mechanism to calculate the importance distribution of each agent to its neighboring agents [18]. Although the attention mechanism can be used to learn the interaction between agents in the graph convolutional RL method, the output value of the softmax function is a relative value [19]. Consequently, cooperative agents unnecessarily obtain important weights, and truly modeling the relationship between agents becomes impossible. In addition, the softmax function usually generates extremely small but nonzero probability values that are assigned to irrelevant agents, thus, weakening the degree of attention that should have been given to cooperative agents. Especially in multi-intelligent vehicle environment, when the driving distance between vehicles is small and the vehicle density is large, as well as because the driving behavior of vehicles affects each other, the coordination between intelligent vehicles is particularly important for improving vehicle safety and traffic efficiency.For traffic environments, such as highways, our previous work proposed a multivehicle coordination method based on a dynamic collaboration graph [20]. We use the safety field model between vehicles to dynamically construct the cooperative relationship between vehicles and use the multiagent learning method to learn the decision-making strategy of multivehicle cooperative driving. However, in the process of learning, we use the variable elimination method (VE) to solve the global utility, which needs to specify some rules artificially, which is contrary to the purpose of agent self-learning. Therefore, we use a graph neural network combined with reinforcement learning, which is a method of autonomous discovery and collaborative utility.Based on the previous multivehicle coordination learning strategy decision [20], we have made the following contributions. (1) Further, the security field model is combined with the attention mechanism of the graph model and graph neural network, and the security field model is used as the hard attention mechanism of the graph model to dynamically construct the collaborative relationship. (2) The attention mechanism is used to learn the interaction weights between the explicit CGs. (3) The graph convolution process is used to simulate the belief propagation algorithm and solve the overall maximum utility, which is subsequently used to guide the intelligent vehicle to learn the coordination policy. (4) Existing expert knowledge is used to initially discover the coordination rules between intelligent vehicles and, on this basis, further learn coordination driving behavior policies. Moreover, in view of determining the effectiveness of the method, a set of scenarios involving 5, 8, and 11 vehicles are verified in a highway simulation environment. We conduct multivehicle training in an open-source simulation environment. Our method can get higher safety rewards and driving speed when multiple vehicles drive together and have scalability.


## 2. Related Work

In the studies about autonomous driving, many research institutions and scientific research teams have used artificial intelligence methods to enable intelligent vehicles to learn autonomously and promote the intelligent development of autonomous vehicles [1]. Among them, RL is an unsupervised learning method that can learn a policy based on real-time feedback, and it is widely used in the field of intelligent vehicle driving policy learning [4]. The RL method treats vehicle as an agent and learns driving policies through interaction with the environment [21]. The interaction process is a Markov decision process (MDP). Loiacono et al. [22] used traditional reinforcement learning to train autonomous vehicles to learn driving strategies in the simulation environment. Guo and Wu [23] used the approximate function combined with the policy gradient method to achieve good results in the racing game environment. In recent years, the DRL method that combines deep learning and RL has greatly promoted the application of RL in more complex driving environments. Some researchers combine driving rules with RL to train driving strategies [24]. Talpaert et al. [25] used DRL to learn in real-world simulation. In a simple autonomous driving scenario, Chae et al. [26] used the DRL method to make the autonomous vehicle learn how to brake. Belletti et al. [27] proposed a multiobjective vehicle merging strategy. Makantasis et al. [28] proposed a Q-mask DRL method to learn highway driving policies. In other studies, the DRL method was used to train autonomous vehicles to learn a safety policy in a variety of scenarios [29]. A hierarchical DRL framework was proposed to help vehicles focus on surrounding vehicles and learn a smooth driving policy [30]. The proximal policy optimization was applied to control autonomous driving and subsequently to actual vehicles [31]. The other studies [32–34] introduced important research aspects pertaining to DRL in autonomous driving.Behavior planning is one of the most concerned fields in automatic driving [35]. This aspect can make autonomous vehicles drive safely and efficiently. Many research on behavior planning has increasingly applied RL technology [36]. Alizadeh et al. [37] trained the DRL agent to control the transformation policy of intelligent vehicles in a simulated environment. Chen et al. [30] designed a hierarchical DRL algorithm to learn the lane-changing behavior in a dense traffic environment. Wang et al. [38] proposed a Q-learning method for automatic lane changes in highway environments. Yuan et al. [39] used various excitation mechanisms to learn different lane-changing policies in highway environments. Wang et al. [40] proposed a Q-learning method based on the dense microsimulation to learn lane changes in highways. Bey et al. [41] learned the tactical behavior planning of intelligent vehicles by predicting the characteristics of other vehicles. Sefati et al. [42] proposed an RL method to learn the tactical behavior planning of intelligent vehicles in urban scenes under uncertain conditions, in which the intentions of surrounding road users are taken into account in this method.The above research shows that artificial intelligence methods, especially DRL, have been widely used in the field of automatic driving, but at present, there are few scenarios in which multivehicle cooperation is considered. These DRL methods mainly study the driving strategy of a single vehicle, while ignoring the interaction and coordination between multiple vehicles [4]. Obviously, the benefits of applying single agent learning method directly to multivehicle environment may be limited. Other methods propose graph theory as an abstract model of vehicle interaction and formation [43], but they mainly focus on formation and signal. Although some researchers have abstracted the cooperative relationship between multiple vehicles by using cooperative graph, they are only based on the relative position or initialization sequence number between vehicles [20, 44]. In the process of learning, they could only consider the local joint utility, but the individual utility is ignored, thus affecting the results of coordination learning.


## 3. Related Technologies

### 3.1. Markov Decision Processes and Reinforcement Learning

The nature of intelligent vehicle decision making is a random process according to the environment. Markov decision processes or MDPs are an important stochastic decision model of sequential decision making [45], which is the basis theoretical of reinforcement learning algorithm.DefineXnn=0,1,2,⋯ is nonnegative integer random values, where n≥0, and nonnegative integer sequence: i0,i1,⋯,in and j, constant has established: PXn+1=jXn=i,Xn−1=in−1,⋯,X1=i1,X0=i0. Where Xnn=0,1,2,⋯ is discrete time Markov chains, for any i and j constant with: PXn+1=jXn=i=PX1=jX0=i. The Markov chains are homogeneous and independent increments. We consider X, it as a random state, and state transition function is independent of the state of history; this property is significant that it should be satisfied when solving the engineering problems; in this paper, the Markov chains are homogeneous chains.The Markov chains, whereXnn=0,1,2,⋯ is state space in S, i and j are belong to S, the states i after n step to the states j the transition probability is pijn=pXn=jX0=i, the probability p represents when n the value is 1. Describe the movement’s influence on the state transition in MDPs. The MDPs are defined as a 5-tuble S,A,r,P,η, where S is discrete or continuous state space, A is discrete or continuous action space, r:S×A⟶R is reward function, η is to be optimistic objective function and satisfied the following Markov property, that is, ∀i,j∈S,a∈A，and n≥0. The Pi,a,j is transition probability where state i after performing an action a turn to state j, ri,a,j is the reward function where state i after performing an action a turn to state j. The decision making objective is η, η=E∑t=0γtrt is total expected return function, where E⋅ is mathematic expectation, γ∈0,1 is the delayed parameter that represents a discount on the rate of return over time, and rt is a immediately reward for performing an action in a state at t moment.Reinforcement learning by optimizing the object of value function or policy to realize the control optimization in finally. SupposeSt and At states and actions set at t moment. πt is a policy at t moment, π=π0,π1,⋯ is MDPs action policy set, the action policy set as a mapping π:S⟶A. The decision objective can be maximized with any initial state. The MDPs state value functions:
(1)Vπs=Eπ∑t=0∞γtrt∣s0=s,where Eπ⋅ is mathematical expectation of strategic π. Vπs is the total expected return of policy π and a discount on the subsequent state.Define the value of a stateS under policy π, V is the expected return when starting in S and following π. The concept of value function is introduced to optimize a policy. The MDP action value function is defined as
(2)Qπs,a=Eπ∑t=0∞γtrts0=s,a0=a,where Eπ. is mathematical expectation π. In our approach, state transition probability and reward return model are unknown, but we can observe completely state information for each of intelligent vehicle. This paper we applied is known as Q-learning [46]. Q-learning makes an expected discount on future rewards. The state s takes an action a at t moment, the R is reward value when the state s at t moment, and they are all observed. The s′ is next state. Synchronization of Q values is updated as Qs,a≔Qs,a+αRs,a+γmaxa′Qs′,a′−Qs,a. Where α∈0,1 is a learning rate, Q-learning converges to an optimal Q∗s,a value, if all state action pairs have been detected with a reasonable exploring strategy.


### 3.2. Single-Intelligent Vehicle MDP and RL

In this paper, we simulated the motorway scenarios. Figure1 shows the surroundings the intelligent vehicle perceived, which is showed how constructing the coordination graph. Take the no. 0 intelligent vehicle as an example, where d1 is the distance between the nearest vehicle and in front of no. 0 intelligent vehicle in carriageway, v1 is velocity, and a1 is acceleration. d2 is distance between the nearest vehicle and in the rear of no. 0 intelligent vehicle in carriageway, and v2 and a2 are, respectively, for velocity and acceleration. d3 is distance between the nearest vehicle and in front of no. 0 intelligent vehicle in overtaking lane. v3 and a3 are, respectively, for velocity and acceleration. d4 is distance between the nearest vehicle and in the rear of no. 0 intelligent vehicle in overtaking lane, and v4 and a4 are, respectively, for velocity and acceleration. We apply the perceptions of intelligent vehicle to represent the state space of each intelligent vehicle, the state set is s, s=l,v0,d1,v1,d2,v2,d3,v3,d4,v4, where l indicates lane occupancy, values can take 1 or 2, respectively, take 1 means take up the carriageway, and 2 means occupied overtaking lane. State space dimensions are too high that will lead to information redundancy and not conducive to solving the problem. According to research literature [20] comprehensive consideration of vehicle states and the process of driving surroundings, take residual reaction time in the driving as state variables, the following calculation:
(3)t1=d1−dm1v0,t2=d2−dm2v2,t3=d3−dm3v0,t4=d4−dm4v4,Figure 1
The state of vehicle.wheret1 is the reaction time where in front of the vehicle decelerate in carriageway, dm1 is minimum safety distance in front of the carriageway which the intelligent vehicle with ‐6m/s2 deceleration driving. t2 is the reaction time where in rear of vehicle in carriageway, dm2 is minimum safety distance in rear of the carriageway which the intelligent vehicle with‐6m/s2 deceleration driving. t3, dm3, t4, and dm4 are overtaking lane parameters. Then, the state space becomes S=l,t1,t2,t3,t4.In order to avoid the decision of intelligent vehicle driving too frequently, when the intelligent vehicle between the two lanes is using the last moment of the decision, the independent decision of intelligent vehicle which is a set of MDPs actions:a1 is velocity limit in carriageway, driving in the carriageway to velocity the task; a2 is accelerated on lane, in the carriageway the velocity accelerate to the maximum safety velocity; a3 is the minimum velocity limit driving in the carriageway; a4 is on the overtaking lane to follow; a5 is the task velocity on overtaking lane; a6 maximum velocity on overtaking lane. The carriageway task velocity in the [60,100] km/h velocity interval is randomly generated, and max velocity 100 km velocity following is in front of vehicle no barrier-free vehicle where velocity to task velocity. If there is in a planned velocity vplane, the calculation method [47] is as follows Table 1. The following distance is the shortest distance required for the intelligent vehicle to follow the vehicle ahead to stop (follow distance). For example, the intelligent vehicle running the carriageway, the dfollow=v02/−2a0+5. Where a0=−6m/s2 is the preset braking acceleration of vehicle deceleration, and 5m is the length of the vehicle.Table 1
Planning velocity calculation method.
d−dfollow>10v1−v0>3.6vplane=v0+0.25d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+0.25d1−dfollow+1.0v1−v0v1−v0≤−3.6vplane=v0+0.25d1−dfollow+1.5v1−v010≥d−dfollow>−4v1−v0>3.6vplane=v0+0.5d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+0.5d1−dfollow+1.5v1−v0v1−v0≤−3.6vplane=v0+0.5d1−dfollow+1.0v1−v0d−dfollow≤−4v1−v0>3.6vplane=v0+1.0d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+1.0d1−dfollow+1.0v1−v0v1−v0≤−3.6vplane=v0+1.0d1−dfollow+1.5v1−v0Each ten seconds to update a task velocity. Overtaking velocity on overtaking lane is 110 km/h. In the process of independent driving of intelligent vehicles, the return rewards as follows:(4)rsafe=−40ifcollision,mint1,t2ifl=1andd1>3andd2>3,mint3,t4ifl=2andd3>3andd4>3,−5else,rspeed=vp−vtifvp>vt,0else.l=1 represents the distance between the intelligent vehicles which is greater than 3 meters in carriageway, in the same, l=2 represents in overtaking lane, in the case of collision the value is -5. The MDP states interval is 10 seconds. When the vehicle driving distance among vehicles results in safety issues of mutual influence among vehicles, according to the shortest distance between the reaction time of the intelligent vehicle, and the intelligent vehicle perceived around context, then on the basis of context coordination among the behaviors of intelligent vehicles to collaborative intelligent vehicle actions.


### 3.3. Multivehicle Relationship Representation in the CG Model

When multi-intelligent vehicles coexist in the same environment and learn the policy at the same time, this scenario can be regarded as a MARL problem for multi-intelligent vehicles. Among them, the instability problem is caused by multi-intelligent vehicle learning in the same environment. However, teaching agents the coordination policies in this nonstationary environment is extremely challenging, especially when the intelligent vehicle still needs to deal with incomplete information caused by communication constraints or local observability constraints. The existing methods rarely focus on the coordination relationship between intelligent vehicles. In the CG [48] models in which the environment of multi-intelligent vehicles presents an undirected graph structure, the points in the graph represent intelligent vehicles, while the edges represent the coordination relationship between agents. This setting provides a modeling basis and a theoretical basis for agents to achieve coordination decisions.CGs are an effective method of solving the abovementioned problems. CGs can use a linear combination of local value functions to represent the global value function and subsequently reduce the influence of the number of intelligent vehicles on the complex computational domain. This approach of decomposition can be described using the undirected graph denoted byG=V,E in which each node i∈V represents an agent, and the edge i,j∈E represents the corresponding agents that must make coordination decisions. On the basis of the CG model representing the coordination relationship of intelligent vehicles, the use of VE or maximum sum and other belief propagation algorithms [49] for solving the global maximum utility can be used to guide the vehicle to learn the coordination policies.


## 3.1. Markov Decision Processes and Reinforcement Learning

The nature of intelligent vehicle decision making is a random process according to the environment. Markov decision processes or MDPs are an important stochastic decision model of sequential decision making [45], which is the basis theoretical of reinforcement learning algorithm.DefineXnn=0,1,2,⋯ is nonnegative integer random values, where n≥0, and nonnegative integer sequence: i0,i1,⋯,in and j, constant has established: PXn+1=jXn=i,Xn−1=in−1,⋯,X1=i1,X0=i0. Where Xnn=0,1,2,⋯ is discrete time Markov chains, for any i and j constant with: PXn+1=jXn=i=PX1=jX0=i. The Markov chains are homogeneous and independent increments. We consider X, it as a random state, and state transition function is independent of the state of history; this property is significant that it should be satisfied when solving the engineering problems; in this paper, the Markov chains are homogeneous chains.The Markov chains, whereXnn=0,1,2,⋯ is state space in S, i and j are belong to S, the states i after n step to the states j the transition probability is pijn=pXn=jX0=i, the probability p represents when n the value is 1. Describe the movement’s influence on the state transition in MDPs. The MDPs are defined as a 5-tuble S,A,r,P,η, where S is discrete or continuous state space, A is discrete or continuous action space, r:S×A⟶R is reward function, η is to be optimistic objective function and satisfied the following Markov property, that is, ∀i,j∈S,a∈A，and n≥0. The Pi,a,j is transition probability where state i after performing an action a turn to state j, ri,a,j is the reward function where state i after performing an action a turn to state j. The decision making objective is η, η=E∑t=0γtrt is total expected return function, where E⋅ is mathematic expectation, γ∈0,1 is the delayed parameter that represents a discount on the rate of return over time, and rt is a immediately reward for performing an action in a state at t moment.Reinforcement learning by optimizing the object of value function or policy to realize the control optimization in finally. SupposeSt and At states and actions set at t moment. πt is a policy at t moment, π=π0,π1,⋯ is MDPs action policy set, the action policy set as a mapping π:S⟶A. The decision objective can be maximized with any initial state. The MDPs state value functions:
(1)Vπs=Eπ∑t=0∞γtrt∣s0=s,where Eπ⋅ is mathematical expectation of strategic π. Vπs is the total expected return of policy π and a discount on the subsequent state.Define the value of a stateS under policy π, V is the expected return when starting in S and following π. The concept of value function is introduced to optimize a policy. The MDP action value function is defined as
(2)Qπs,a=Eπ∑t=0∞γtrts0=s,a0=a,where Eπ. is mathematical expectation π. In our approach, state transition probability and reward return model are unknown, but we can observe completely state information for each of intelligent vehicle. This paper we applied is known as Q-learning [46]. Q-learning makes an expected discount on future rewards. The state s takes an action a at t moment, the R is reward value when the state s at t moment, and they are all observed. The s′ is next state. Synchronization of Q values is updated as Qs,a≔Qs,a+αRs,a+γmaxa′Qs′,a′−Qs,a. Where α∈0,1 is a learning rate, Q-learning converges to an optimal Q∗s,a value, if all state action pairs have been detected with a reasonable exploring strategy.


## 3.2. Single-Intelligent Vehicle MDP and RL

In this paper, we simulated the motorway scenarios. Figure1 shows the surroundings the intelligent vehicle perceived, which is showed how constructing the coordination graph. Take the no. 0 intelligent vehicle as an example, where d1 is the distance between the nearest vehicle and in front of no. 0 intelligent vehicle in carriageway, v1 is velocity, and a1 is acceleration. d2 is distance between the nearest vehicle and in the rear of no. 0 intelligent vehicle in carriageway, and v2 and a2 are, respectively, for velocity and acceleration. d3 is distance between the nearest vehicle and in front of no. 0 intelligent vehicle in overtaking lane. v3 and a3 are, respectively, for velocity and acceleration. d4 is distance between the nearest vehicle and in the rear of no. 0 intelligent vehicle in overtaking lane, and v4 and a4 are, respectively, for velocity and acceleration. We apply the perceptions of intelligent vehicle to represent the state space of each intelligent vehicle, the state set is s, s=l,v0,d1,v1,d2,v2,d3,v3,d4,v4, where l indicates lane occupancy, values can take 1 or 2, respectively, take 1 means take up the carriageway, and 2 means occupied overtaking lane. State space dimensions are too high that will lead to information redundancy and not conducive to solving the problem. According to research literature [20] comprehensive consideration of vehicle states and the process of driving surroundings, take residual reaction time in the driving as state variables, the following calculation:
(3)t1=d1−dm1v0,t2=d2−dm2v2,t3=d3−dm3v0,t4=d4−dm4v4,Figure 1
The state of vehicle.wheret1 is the reaction time where in front of the vehicle decelerate in carriageway, dm1 is minimum safety distance in front of the carriageway which the intelligent vehicle with ‐6m/s2 deceleration driving. t2 is the reaction time where in rear of vehicle in carriageway, dm2 is minimum safety distance in rear of the carriageway which the intelligent vehicle with‐6m/s2 deceleration driving. t3, dm3, t4, and dm4 are overtaking lane parameters. Then, the state space becomes S=l,t1,t2,t3,t4.In order to avoid the decision of intelligent vehicle driving too frequently, when the intelligent vehicle between the two lanes is using the last moment of the decision, the independent decision of intelligent vehicle which is a set of MDPs actions:a1 is velocity limit in carriageway, driving in the carriageway to velocity the task; a2 is accelerated on lane, in the carriageway the velocity accelerate to the maximum safety velocity; a3 is the minimum velocity limit driving in the carriageway; a4 is on the overtaking lane to follow; a5 is the task velocity on overtaking lane; a6 maximum velocity on overtaking lane. The carriageway task velocity in the [60,100] km/h velocity interval is randomly generated, and max velocity 100 km velocity following is in front of vehicle no barrier-free vehicle where velocity to task velocity. If there is in a planned velocity vplane, the calculation method [47] is as follows Table 1. The following distance is the shortest distance required for the intelligent vehicle to follow the vehicle ahead to stop (follow distance). For example, the intelligent vehicle running the carriageway, the dfollow=v02/−2a0+5. Where a0=−6m/s2 is the preset braking acceleration of vehicle deceleration, and 5m is the length of the vehicle.Table 1
Planning velocity calculation method.
d−dfollow>10v1−v0>3.6vplane=v0+0.25d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+0.25d1−dfollow+1.0v1−v0v1−v0≤−3.6vplane=v0+0.25d1−dfollow+1.5v1−v010≥d−dfollow>−4v1−v0>3.6vplane=v0+0.5d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+0.5d1−dfollow+1.5v1−v0v1−v0≤−3.6vplane=v0+0.5d1−dfollow+1.0v1−v0d−dfollow≤−4v1−v0>3.6vplane=v0+1.0d1−dfollow+1.5v1−v03.6≥v1−v0>−3.6vplane=v0+1.0d1−dfollow+1.0v1−v0v1−v0≤−3.6vplane=v0+1.0d1−dfollow+1.5v1−v0Each ten seconds to update a task velocity. Overtaking velocity on overtaking lane is 110 km/h. In the process of independent driving of intelligent vehicles, the return rewards as follows:(4)rsafe=−40ifcollision,mint1,t2ifl=1andd1>3andd2>3,mint3,t4ifl=2andd3>3andd4>3,−5else,rspeed=vp−vtifvp>vt,0else.l=1 represents the distance between the intelligent vehicles which is greater than 3 meters in carriageway, in the same, l=2 represents in overtaking lane, in the case of collision the value is -5. The MDP states interval is 10 seconds. When the vehicle driving distance among vehicles results in safety issues of mutual influence among vehicles, according to the shortest distance between the reaction time of the intelligent vehicle, and the intelligent vehicle perceived around context, then on the basis of context coordination among the behaviors of intelligent vehicles to collaborative intelligent vehicle actions.


## 3.3. Multivehicle Relationship Representation in the CG Model

When multi-intelligent vehicles coexist in the same environment and learn the policy at the same time, this scenario can be regarded as a MARL problem for multi-intelligent vehicles. Among them, the instability problem is caused by multi-intelligent vehicle learning in the same environment. However, teaching agents the coordination policies in this nonstationary environment is extremely challenging, especially when the intelligent vehicle still needs to deal with incomplete information caused by communication constraints or local observability constraints. The existing methods rarely focus on the coordination relationship between intelligent vehicles. In the CG [48] models in which the environment of multi-intelligent vehicles presents an undirected graph structure, the points in the graph represent intelligent vehicles, while the edges represent the coordination relationship between agents. This setting provides a modeling basis and a theoretical basis for agents to achieve coordination decisions.CGs are an effective method of solving the abovementioned problems. CGs can use a linear combination of local value functions to represent the global value function and subsequently reduce the influence of the number of intelligent vehicles on the complex computational domain. This approach of decomposition can be described using the undirected graph denoted byG=V,E in which each node i∈V represents an agent, and the edge i,j∈E represents the corresponding agents that must make coordination decisions. On the basis of the CG model representing the coordination relationship of intelligent vehicles, the use of VE or maximum sum and other belief propagation algorithms [49] for solving the global maximum utility can be used to guide the vehicle to learn the coordination policies.


## 4. Method

First, we use the dynamic CG model to represent the objects that need to cooperate with a vehicle. Our dynamic coordination model uses DSF [50] as a danger relationship representation method of intelligent vehicles for dynamically constructing a CG that can represent the interaction relationship among the vehicles. On this basis, we can further refine the interaction weight by using the attention mechanism. Then, we use the graph convolution to simulate the belief propagation process to learn the driving policy. At the beginning of the training, we use the existing expert samples as a model to guide the policy learning, and we determine the potential coordination policies in the existing rules. After learning a policy under the guidance of the expert samples, we continue to explore new coordination policies. The relationship between models is shown in Figure 2.Figure 2
Structure of the multivehicle coordination learning graph convolutional RL based on dynamic CG.


### 4.1. Dynamic CG Generation Model Based on the Safety Field

We take the DSF model of automatic driving as the dynamic relationship generator of intelligent vehicles and express the interaction relationship between intelligent vehicles as a graph model. Through the DSF, the risk relationship between vehicles can be dynamically calculated to identify which intelligent vehicle needs to undergo cooperation. In using this method, the global policy learning problem can be simplified to a coordination policy learning problem among several small-scale intelligent vehicles, and the simple abstraction of the relationship between intelligent vehicles can be realized.DSF is a kind of “physical field” characterizing the influence of various factors in the vehicle driving environment on the driving risk. As a physical quantity, DSF is calculated using the dynamic changes of various factors in the driving process. This study is aimed at investigating the scene of a two-lane highway where all of the vehicles are moving autonomous vehicles. As the vehicles are assumed to strictly abide by the traffic rules, we only consider the “kinetic energy field” and “behavior field” between vehicles. Figure3 shows the field strength distribution of driving safety that can directly judge the degree of interaction between vehicles. We define the vertex set and edge set to construct the CG denoted by GV,E. The vertex set is composed of vehicle set V=C. Given a group of vehicles denoted by C, we check whether all vehicle pairs need to establish a coordination relationship according to the motion characteristics of the vehicles to avoid possible collision accidents.Figure 3
Driving safety field in highway scene.A general scenario is used to illustrate in detail the analytic method of the coordination relationship between two vehicles. This scheme represents a general vehicle driving scenario on a highway. Among the vehicles, vehicles 1 and 2 are both running in the same lane (vehicle 1 is the leading vehicle, and vehicle 2 is the lagging vehicle). The corresponding speeds arev1 and v2, and the following distance is d. In this scenario, the field strength affecting the driving safety of vehicle 1 is composed of the kinetic energy field formed by vehicle 2 and the behavior field formed by its driving style. The direction of the field strength of these two fields at vehicle 1 is opposite the direction of v1. According to the formula of the DSF model,
(5)EV_21=GR2M2dk1expk2v2ED_21=EV_21Dr2ES_21=EV_21+ED_21F1=ES_21M1R1exp−k2v11+Dr1,where EV_21 is the kinetic field strength of vehicle 1 received by vehicle 2, ED_21 is the behavior field strength of vehicle 1 received by vehicle 2, ES_21 is the total field strength of the safety field received by vehicle 1, F1 is the force received by vehicle 1, R1 and R2 are the road condition factors of vehicles 1 and 2, M1 and M2 are the masses of vehicles 1 and 2, and Dr1 and Dr2 are the risk factors of the driving style of vehicles 1 and 2, respectively. According to Equation (5), we can further derive
(6)F1=GR1R2M1M2rk11+Dr11+Dr2exp−k2v1−v2,where G=0.001, k1=1, k2=0.05, R1=R2=1, M1=M2=5000kg, and Dr1=Dr2=0.2. According to Equation (6), when the distance between the two vehicles decreases and the relative speed increases, the greater force between the two vehicles indicates the degree of driving danger. We set Fsafe to 360 N [32]. If F1>Fsafe; then, the driving risk between the two vehicles is great, and a coordination relationship between the two vehicles should be established. Through the DSF, we can then use the CG to express intelligent vehicles with interactive relationships.


### 4.2. Coordination Relationship Based on the Attention Mechanism

In the process of intelligent vehicle driving, each intelligent vehicle in the region should play a different role in the decision making. The method structure is shown in Figure4. The weight of each edge in the CG should also be different. Therefore, we train an attention model to learn the importance weight of each edge in the CG. In this manner, multi-intelligent vehicles can be constructed as a complete graph structure, in which the intelligent vehicle is only connected with the intelligent vehicle that needs interaction. The weight on the edge describes the importance of each relationship. In our method, the dynamic CG is used to represent the interaction between two intelligent vehicles. The attention mechanism can calculate the importance of the interaction between vehicles and refine the relationship between the intelligent vehicles in the graph model. In the previous section, our dynamic graph model has used the DSF model to dynamically calculate and determine whether an interaction exists between any two intelligent vehicles as a means of preliminarily judging the relationship between agents. In this section, we use the attention mechanism to further determine the relationship weight.Figure 4
Graph convolutional reinforcement learning based on dynamic coordination graph.The attention mechanism is a widely used technology for improving the accuracy of a model, and it can effectively learn the relationship representation between entities. We take each intelligent vehicle as an entity and use the multihead dot product attention as a convolution kernel, as this approach can effectively calculate the coordination relationship between vehicles. For each vehiclei, we calculate the relationship between this vehicle and its k-neighboring vehicles. The input features of each intelligent vehicle are mapped onto the query, key, and value representation of each independent attention head. For the attention head m, the relationship between vehicle i and neighbor vehicle j is calculated as follows:
(7)αij=softmaxeij=expeij∑k∈Νiexpeik,where dk is the dimension of the key (k) vector for preventing the dot product of two vectors from becoming too large. For each attention head, as shown in Equation (8), the value representations of all input features are weighted and aggregated by the learned relationships between vehicles.
(8)h′i=σ1M∑m=1M∑j∈ΝiαijmWmhj.The attention coefficientαij further refines the relationship between agents in the graph model, but the input order of the features is ignored by the kernel. In our proposed scheme, the multihead attention mechanism allows the kernel to simultaneously focus on the different relation representation subspaces by reusing the attention mechanism as a means of further stabilizing the training. The attention mechanism is used in this study to derive the weight of the coordination relationship (edge) between the intelligent vehicle (nodes) in the multivehicle CG.


### 4.3. Graph Convolutional Coordination RL

On the basis of the weighted CG model, we can learn the coordination policy. In traditional methods, belief propagation algorithms, such as VE or maximum sum, are used to solve the global utility problem, but the coordination function needs to be artificially defined in advance. The graph convolution method can function similarly to belief propagation on the graph by means of auto-learning, and it can aggregate messages from local to global to solve the joint utility [18]. In this study, we use the graph convolution method, an automatic learning belief propagation algorithm, to guide the policy learning of intelligent vehicles. In addition, the convolution kernel in the graph convolution network (GCN) [50] can further learn how to refine the relationship representation between agents and aggregate the contributions of neighboring agents with influences on the agents. GCN allows agents to adjust the focus according to the driving state of the vehicle, and it uses the superposition of multiple GCN layers to extract high-order relationship representations. The GCN can effectively capture the interaction between vehicles in a larger-scale domain to promote the coordination decision making among vehicles in a much larger range. For each intelligent vehicle, the generated state and relationship features are connected and inputted into the deep Q network. Then, the deep Q network selects the action to maximize the Q value and executes it through the exploration strategy. Each intelligent vehicle calculates the loss gradient through the global Q value and reward value and then applies the global loss gradient to all intelligent vehicles. This approach allows the intelligent vehicle to not only focus on maximizing its expected return but it can also consider how its decision will affect other intelligent vehicles. As such, the intelligent vehicle can learn the coordination policy. In addition, each intelligent vehicle is connected via the state code of nearby intelligent vehicles, which results in a much more stable environment from the perspective of single-intelligent vehicles. The forward reasoning can be formatted as follows:
(9)hi=Embedoit,hi1=GCN1hi,⋯hiL=GCNLhiL−1,Qoit=QnetworkhiL,where L is the number of GCN layers (each GCN represents a layer graph neural network structure), and Qoit is the Q value of the final output. In the model for control-based graph convolution enhancement learning, the vehicles adopt the centralized training and distributed execution mode, and all vehicles share the weight. At each time step during the training, tuples S,A,S′,R,C are stored in the experience playback buffer B. Then, we randomly take a small batch of s samples from B and minimize the Q loss as follows:
(10)MSEω=1S∑s1N∑i=1Nyi−Qsi,ai,ci;ω2,whereyi=ri+γmaxa′Qo′i,a′i,ci;ω′si∈S is the current state of intelligent vehicle i, ci is the adjacency matrix composed of intelligent vehicle and neighboring intelligent vehicles, γ is the discount factor (the model is parameterized by ω), and R is the immediate reward value of the intelligent vehicle. The Q loss gradients of all intelligent vehicles are accumulated, and the parameters are updated. As each intelligent vehicle only needs information from its k-neighboring intelligent vehicles during the execution of the action, the total number of intelligent vehicles can be ignored. This scheme allows the graph convolution RL method to be easily scaled and applied to large-scale multiagent systems, such as autonomous driving.


### 4.4. Model-Based Dynamic Graph Convolution RL

Although the existing DRL has good performance in many application scenarios, it continues to encounter serious learning efficiency problems when faced with complex tasks, especially sequential decision making. DRL often consumes numerous computing resources to achieve satisfactory results, which is far from the efficiency of humans. The blind trial of DRL in the early stage of learning greatly limits the learning efficiency of agents. The use of prior knowledge or experience to improve the algorithm performance is considered to be important for artificial intelligence. For example, imitation learning uses prior knowledge to directly guide each decision of RL, thus greatly speeding up the process of policy learning. To accelerate the early learning, we use the idea of model-based RL and reward shaping [51] to pretrain the model and introduce the expert samples generated by other excellent coordination algorithms as an additional reward value to guide the agent’s decision making. In this manner, the learning efficiency of the model-free RL algorithm can be further improved.Although some experimental data have shown that the method can significantly improve the learning efficiency of agents, implementing artificial expert rules as model constraints in complex environments is difficult. Especially in the MARL scenario, the coordination decision making between agents is hardly realized by establishing clear expert rules. Most prior knowledge in complex scenes is contained in rich expert samples, such as human driving data in traffic environments or driving data generated by other excellent algorithms. Therefore, we attempt to use an offline guidance method to guide the learning process of the model-free graph convolution RL by using the model constraints learned from the expert samples. In this manner, the intelligent vehicle can fully use the “existing knowledge,” and it has a good learning effect in the early stage of training. In the later stage of learning, in the face of complex multiagent coordination tasks, we can realize exploratory learning through the continuous trial and error of the graph convolution RL, thus ensuring the high gradualness and generalization ability of the algorithm.At the beginning of the training phase, we judge the similarity between the policy we have learned and the expert sample. If the result is consistent with the policy given by the expert sample; then, the reward value functionri=rst,at+rdst,at;φ is adjusted, where rst,at is reward under normal circumstances, and rdst,at;φ is additional rewards, which used to encourage the current policy to act like an expert. Then, the reward value function is fed back to the graph convolution RL and combined with the immediate reward value function of the environment feedback to derive the following formula:
(11)MSEω=1S∑s1N∑i=1Nri+γmaxa′Qsi′,ai′,ci;ω′−Qsi,ai,ci;ω2.We extend this idea to the environment of multi-intelligent vehicles to guide the learning of intelligent vehicles by taking the excellent coordination driving sample data as the prior knowledge.


## 4.1. Dynamic CG Generation Model Based on the Safety Field

We take the DSF model of automatic driving as the dynamic relationship generator of intelligent vehicles and express the interaction relationship between intelligent vehicles as a graph model. Through the DSF, the risk relationship between vehicles can be dynamically calculated to identify which intelligent vehicle needs to undergo cooperation. In using this method, the global policy learning problem can be simplified to a coordination policy learning problem among several small-scale intelligent vehicles, and the simple abstraction of the relationship between intelligent vehicles can be realized.DSF is a kind of “physical field” characterizing the influence of various factors in the vehicle driving environment on the driving risk. As a physical quantity, DSF is calculated using the dynamic changes of various factors in the driving process. This study is aimed at investigating the scene of a two-lane highway where all of the vehicles are moving autonomous vehicles. As the vehicles are assumed to strictly abide by the traffic rules, we only consider the “kinetic energy field” and “behavior field” between vehicles. Figure3 shows the field strength distribution of driving safety that can directly judge the degree of interaction between vehicles. We define the vertex set and edge set to construct the CG denoted by GV,E. The vertex set is composed of vehicle set V=C. Given a group of vehicles denoted by C, we check whether all vehicle pairs need to establish a coordination relationship according to the motion characteristics of the vehicles to avoid possible collision accidents.Figure 3
Driving safety field in highway scene.A general scenario is used to illustrate in detail the analytic method of the coordination relationship between two vehicles. This scheme represents a general vehicle driving scenario on a highway. Among the vehicles, vehicles 1 and 2 are both running in the same lane (vehicle 1 is the leading vehicle, and vehicle 2 is the lagging vehicle). The corresponding speeds arev1 and v2, and the following distance is d. In this scenario, the field strength affecting the driving safety of vehicle 1 is composed of the kinetic energy field formed by vehicle 2 and the behavior field formed by its driving style. The direction of the field strength of these two fields at vehicle 1 is opposite the direction of v1. According to the formula of the DSF model,
(5)EV_21=GR2M2dk1expk2v2ED_21=EV_21Dr2ES_21=EV_21+ED_21F1=ES_21M1R1exp−k2v11+Dr1,where EV_21 is the kinetic field strength of vehicle 1 received by vehicle 2, ED_21 is the behavior field strength of vehicle 1 received by vehicle 2, ES_21 is the total field strength of the safety field received by vehicle 1, F1 is the force received by vehicle 1, R1 and R2 are the road condition factors of vehicles 1 and 2, M1 and M2 are the masses of vehicles 1 and 2, and Dr1 and Dr2 are the risk factors of the driving style of vehicles 1 and 2, respectively. According to Equation (5), we can further derive
(6)F1=GR1R2M1M2rk11+Dr11+Dr2exp−k2v1−v2,where G=0.001, k1=1, k2=0.05, R1=R2=1, M1=M2=5000kg, and Dr1=Dr2=0.2. According to Equation (6), when the distance between the two vehicles decreases and the relative speed increases, the greater force between the two vehicles indicates the degree of driving danger. We set Fsafe to 360 N [32]. If F1>Fsafe; then, the driving risk between the two vehicles is great, and a coordination relationship between the two vehicles should be established. Through the DSF, we can then use the CG to express intelligent vehicles with interactive relationships.


## 4.2. Coordination Relationship Based on the Attention Mechanism

In the process of intelligent vehicle driving, each intelligent vehicle in the region should play a different role in the decision making. The method structure is shown in Figure4. The weight of each edge in the CG should also be different. Therefore, we train an attention model to learn the importance weight of each edge in the CG. In this manner, multi-intelligent vehicles can be constructed as a complete graph structure, in which the intelligent vehicle is only connected with the intelligent vehicle that needs interaction. The weight on the edge describes the importance of each relationship. In our method, the dynamic CG is used to represent the interaction between two intelligent vehicles. The attention mechanism can calculate the importance of the interaction between vehicles and refine the relationship between the intelligent vehicles in the graph model. In the previous section, our dynamic graph model has used the DSF model to dynamically calculate and determine whether an interaction exists between any two intelligent vehicles as a means of preliminarily judging the relationship between agents. In this section, we use the attention mechanism to further determine the relationship weight.Figure 4
Graph convolutional reinforcement learning based on dynamic coordination graph.The attention mechanism is a widely used technology for improving the accuracy of a model, and it can effectively learn the relationship representation between entities. We take each intelligent vehicle as an entity and use the multihead dot product attention as a convolution kernel, as this approach can effectively calculate the coordination relationship between vehicles. For each vehiclei, we calculate the relationship between this vehicle and its k-neighboring vehicles. The input features of each intelligent vehicle are mapped onto the query, key, and value representation of each independent attention head. For the attention head m, the relationship between vehicle i and neighbor vehicle j is calculated as follows:
(7)αij=softmaxeij=expeij∑k∈Νiexpeik,where dk is the dimension of the key (k) vector for preventing the dot product of two vectors from becoming too large. For each attention head, as shown in Equation (8), the value representations of all input features are weighted and aggregated by the learned relationships between vehicles.
(8)h′i=σ1M∑m=1M∑j∈ΝiαijmWmhj.The attention coefficientαij further refines the relationship between agents in the graph model, but the input order of the features is ignored by the kernel. In our proposed scheme, the multihead attention mechanism allows the kernel to simultaneously focus on the different relation representation subspaces by reusing the attention mechanism as a means of further stabilizing the training. The attention mechanism is used in this study to derive the weight of the coordination relationship (edge) between the intelligent vehicle (nodes) in the multivehicle CG.


## 4.3. Graph Convolutional Coordination RL

On the basis of the weighted CG model, we can learn the coordination policy. In traditional methods, belief propagation algorithms, such as VE or maximum sum, are used to solve the global utility problem, but the coordination function needs to be artificially defined in advance. The graph convolution method can function similarly to belief propagation on the graph by means of auto-learning, and it can aggregate messages from local to global to solve the joint utility [18]. In this study, we use the graph convolution method, an automatic learning belief propagation algorithm, to guide the policy learning of intelligent vehicles. In addition, the convolution kernel in the graph convolution network (GCN) [50] can further learn how to refine the relationship representation between agents and aggregate the contributions of neighboring agents with influences on the agents. GCN allows agents to adjust the focus according to the driving state of the vehicle, and it uses the superposition of multiple GCN layers to extract high-order relationship representations. The GCN can effectively capture the interaction between vehicles in a larger-scale domain to promote the coordination decision making among vehicles in a much larger range. For each intelligent vehicle, the generated state and relationship features are connected and inputted into the deep Q network. Then, the deep Q network selects the action to maximize the Q value and executes it through the exploration strategy. Each intelligent vehicle calculates the loss gradient through the global Q value and reward value and then applies the global loss gradient to all intelligent vehicles. This approach allows the intelligent vehicle to not only focus on maximizing its expected return but it can also consider how its decision will affect other intelligent vehicles. As such, the intelligent vehicle can learn the coordination policy. In addition, each intelligent vehicle is connected via the state code of nearby intelligent vehicles, which results in a much more stable environment from the perspective of single-intelligent vehicles. The forward reasoning can be formatted as follows:
(9)hi=Embedoit,hi1=GCN1hi,⋯hiL=GCNLhiL−1,Qoit=QnetworkhiL,where L is the number of GCN layers (each GCN represents a layer graph neural network structure), and Qoit is the Q value of the final output. In the model for control-based graph convolution enhancement learning, the vehicles adopt the centralized training and distributed execution mode, and all vehicles share the weight. At each time step during the training, tuples S,A,S′,R,C are stored in the experience playback buffer B. Then, we randomly take a small batch of s samples from B and minimize the Q loss as follows:
(10)MSEω=1S∑s1N∑i=1Nyi−Qsi,ai,ci;ω2,whereyi=ri+γmaxa′Qo′i,a′i,ci;ω′si∈S is the current state of intelligent vehicle i, ci is the adjacency matrix composed of intelligent vehicle and neighboring intelligent vehicles, γ is the discount factor (the model is parameterized by ω), and R is the immediate reward value of the intelligent vehicle. The Q loss gradients of all intelligent vehicles are accumulated, and the parameters are updated. As each intelligent vehicle only needs information from its k-neighboring intelligent vehicles during the execution of the action, the total number of intelligent vehicles can be ignored. This scheme allows the graph convolution RL method to be easily scaled and applied to large-scale multiagent systems, such as autonomous driving.


## 4.4. Model-Based Dynamic Graph Convolution RL

Although the existing DRL has good performance in many application scenarios, it continues to encounter serious learning efficiency problems when faced with complex tasks, especially sequential decision making. DRL often consumes numerous computing resources to achieve satisfactory results, which is far from the efficiency of humans. The blind trial of DRL in the early stage of learning greatly limits the learning efficiency of agents. The use of prior knowledge or experience to improve the algorithm performance is considered to be important for artificial intelligence. For example, imitation learning uses prior knowledge to directly guide each decision of RL, thus greatly speeding up the process of policy learning. To accelerate the early learning, we use the idea of model-based RL and reward shaping [51] to pretrain the model and introduce the expert samples generated by other excellent coordination algorithms as an additional reward value to guide the agent’s decision making. In this manner, the learning efficiency of the model-free RL algorithm can be further improved.Although some experimental data have shown that the method can significantly improve the learning efficiency of agents, implementing artificial expert rules as model constraints in complex environments is difficult. Especially in the MARL scenario, the coordination decision making between agents is hardly realized by establishing clear expert rules. Most prior knowledge in complex scenes is contained in rich expert samples, such as human driving data in traffic environments or driving data generated by other excellent algorithms. Therefore, we attempt to use an offline guidance method to guide the learning process of the model-free graph convolution RL by using the model constraints learned from the expert samples. In this manner, the intelligent vehicle can fully use the “existing knowledge,” and it has a good learning effect in the early stage of training. In the later stage of learning, in the face of complex multiagent coordination tasks, we can realize exploratory learning through the continuous trial and error of the graph convolution RL, thus ensuring the high gradualness and generalization ability of the algorithm.At the beginning of the training phase, we judge the similarity between the policy we have learned and the expert sample. If the result is consistent with the policy given by the expert sample; then, the reward value functionri=rst,at+rdst,at;φ is adjusted, where rst,at is reward under normal circumstances, and rdst,at;φ is additional rewards, which used to encourage the current policy to act like an expert. Then, the reward value function is fed back to the graph convolution RL and combined with the immediate reward value function of the environment feedback to derive the following formula:
(11)MSEω=1S∑s1N∑i=1Nri+γmaxa′Qsi′,ai′,ci;ω′−Qsi,ai,ci;ω2.We extend this idea to the environment of multi-intelligent vehicles to guide the learning of intelligent vehicles by taking the excellent coordination driving sample data as the prior knowledge.


## 5. Experimental Results and Analysis

In the experimental environment of the highway, we used different methods to learn the driving policy of the vehicle. A total of 5000 rounds of training was utilized for all of the methods. Then, using the average of ten training results, we introduced the model-based (reward shaping) dynamic CG convolutional RL (MB-GCN) method guided by expert rules and the graph convolution RL based on the dynamic CG model of the driving security field (DSF-GCN). Finally, the graph convolutional RL (GCN) was evaluated. At the same time, we adjusted the linear ratio between the safety reward and the rapidity reward in the model to test the diversity of the developed driving policies. We defined the model that was trained by increasing the rapidity reward ratio as DSF-GCN2. To better explain the performance of the model, we used the classic mobility model of Mobil [52] and the expert rules [53]. Then, the two CG methods (I-DCG and P-DCG) [20] were compared with our method. Figure 5(a) shows the learning curve of the different methods with respect to the average rewards. MB-GCN, DSF-GCN, and DSF-GCN2 can finally converge to a higher average reward value and converge faster than all of the other models.Figure 5
The average reward value and vehicle motion characteristics of various methods in 5-vehicle model.As expected, independent learning, mobile models, and expert rules do not consider the coordination relationship between agents; they may also reach the wrong driving decisions and perform poorly. Even though the mobile models and expert rules do not have the ability to relearn, the final result is much worse than those of the other methods. Unexpectedly, the P-DCG method had frequently selected the lane changing (fierce driving) decision because of its excessive pursuit of speed reward. Although this scenario had caused the vehicle to pursue a much higher driving speed, the driving safety of the vehicle was ignored. This finding is reflected in the factors, such as the shortest reaction time and the shortest forward distance.We also compared the effects of the different reward ratios on the diversity of policy learning. Although the differences among DSF, GCN, and DSF-GCN2 are relatively small, the driving policies learned by DSF and GCN were more inclined to safe driving environments, which would quickly return to the driving lane on the premise of ensuring driving safety. DSF-GCN2, which had a more rapid reward, learned a more radical driving policy. Although this scheme could also ensure driving safety, its controlled autonomous driving vehicles tended to choose the advantages of speed and eventually formed a stable vehicle formation on the overtaking lane. This finding is a good simulation of real-life human drivers, as conservative drivers usually drive smoothly on driving lanes, and only in emergency situations will they choose to change to the overtaking lane. By contrast, radical drivers tend to continue occupying the overtaking lane to achieve the purpose of fast driving.In the process of testing the performance of the different algorithms, we not only listed the curve of the final reward value but also a variety of indicators to evaluate the microattributes of the vehicles. The accumulated speed variation difference was included as an important index for evaluating the driving comfort of the vehicles. The cumulative number of the lane changes of the vehicles appeared to be an important indicator for evaluating the accuracy of vehicle decision making. As shown in Figures5(b)–5(f), a variety of model-based GCN methods have a better performance compared with the other methods in terms of the shortest response time, vehicle ride comfort, and number of lane changes. According to the policy that had been finally learned by the autonomous vehicle, we found that the MB-GCN method would eventually form a stable vehicle formation on the driving lane by coordinating the vehicle’s lane-changing decision. More interestingly, the MB-GCN method would immediately change lanes to the overtaking lane when a vehicle was inserted in the rear, thus affecting the driving safety of the vehicle. After accelerating and driving a certain safe distance away from the vehicle behind it, the MB-GCN method would return to the safe driving lane.However, the independent learning method has no coordination mechanism, and it could not learn the coordination policy. Moreover, due to the dynamic changes in the environment caused by the decisions of the surrounding vehicles, the scheme was often sensitive towards the selection of frequent lane-changing decisions. The relationship learning between intelligent vehicles can help intelligent vehicles to generate coordination policies, indicating that all methods in the GCN are better than the independent learning methods. However, the traditional GCN may rely too much on the reward in which an evaluation index brings to the vehicle and drops the policy learning into a local optimum. The DSF-GCN can be used to develop more complex driving policies, as it will hardly focus on conservative driving policies, but it will appropriately increase its driving speed while ensuring driving safety. This approach can greatly help to improve traffic efficiency.To study the influence of vehicle density on the performance of the model, we conducted experiments in an autonomous vehicle environment by using different vehicle densities. As shown in Figures6(a)–6(c), as the density of the vehicles increases, the differences between the various methods become more apparent. Among them, MB-GCN remains to be the method that can obtain the highest reward value. This finding fully proves the benefits of our method in terms of learning efficiency and learning effect. The increase in the number of vehicles had caused an increase in environmental instability, which subsequently caused great obstacles to the GCN for learning the relationship between agents. A good convergence effect can be achieved in a low-density five-car environment. However, with the increase in the number of agents, although a quick convergence can be attained, the final learning results indicate that the values can prematurely fall into the local optimal solution. Especially during traffic congestion, the learning of this policy can hardly solve the coordinated decision making among the multiple vehicles. However, when the traffic density is low, the simple relationship between vehicles is beneficial to the learning of the GCN.Figure 6
Average reward under different vehicle density.
(a)
5 vehicles(b)
8 vehicles(c)
11 vehicles(d)
11 vehicles (untrained)In Figure6(d), we show the results of using the previously trained model parameters directly in the 11 car environment without retraining. It is worth noting that the MB-GCN method without retraining can still get the highest reward value, and the gap with the retraining method is the smallest, which fully proves the scalability of MB-GCN. Interestingly, the reward value of all retrained GCN methods is slightly higher, in which the vehicle speed is reduced, and the number of lane changes is also significantly reduced, but the safety of vehicles is not greatly affected. The reason is that in the case of low density, due to the small number of vehicles, the possibility of collision between vehicles is small. The learning of vehicle driving decision mainly focuses on how to accelerate through the overtaking lane, so as to get rid of traffic congestion quickly and get a better driving environment for vehicles. However, with the increase of vehicle density, vehicles need to walk longer to get a better driving environment, and the increase of collision probability makes vehicles tend to choose more conservative driving decisions, so the driving decisions learned tend to avoid collision accidents.


## 6. Conclusion

We focus on promoting the coordination among multi-intelligent vehicles through the relationship learning of vehicles and propose a dynamic CG convolutional RL method that introduces model constraints. By combining the method of constructing a dynamic CG with the soft attention mechanism, the interference of irrelevant vehicles can be effectively removed, and the learning efficiency of the algorithm can be accelerated while ensuring better progressive performance. The vehicle can adapt to the dynamic changes of the underlying graph, and it can use the potential features of the relational kernel convolution to learn coordination policies from the gradually increasing receptive field. The method of intensive training allows the gradient of an intelligent vehicle to not only counteract itself but also counteract other intelligent vehicles in its receptive domain. In this manner, the intelligent vehicles can learn to be coordinated. At the same time, excellent driving samples have been used as the training data to combine the model guided by the reward value with the graph convolution RL without the model. This approach can reduce the invalid exploration of intelligent vehicles and guide them to ignore certain driving policies resulting from the reduction of their own speed in view of obtaining the driving policy that balances safety and efficiency. In the scene of multivehicle cooperative driving on highways, the convolution RL of the dynamic cooperative graph is significantly better than those of the existing methods.In the future, we will continue the research on multivehicle cooperative driving. At present, our research focuses on fully cooperative automatic driving. In the next step, we will study man-machine hybrid multivehicle cooperative driving. In the man-machine hybrid cooperative driving mode, it is difficult for an autonomous vehicle to drive safely and efficiently with a human driver.



---

*Source: 9665421-2022-06-28.xml*