2017
DOI: 10.1109/mits.2017.2743167
|View full text |Cite
|
Sign up to set email alerts
|

Autonomous Vehicle-Intersection Coordination Method in a Connected Vehicle Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 123 publications
(33 citation statements)
references
References 15 publications
0
32
0
1
Order By: Relevance
“…This method can ef-Journal of Transportation Technologies fectively prevent the collision of vehicles in the intersection by assigning a successive level of specific vehicles and avoiding the contradiction between the different vehicle travel trajectories. Some studies established the principle of a buffer allocation scheduling algorithm to provide a guide to vehicles to safely pass the intersections [26]. Figure 1 shows the intersection channelization.…”
Section: Methods Of Cavs Intersection Coordinationmentioning
confidence: 99%
“…This method can ef-Journal of Transportation Technologies fectively prevent the collision of vehicles in the intersection by assigning a successive level of specific vehicles and avoiding the contradiction between the different vehicle travel trajectories. Some studies established the principle of a buffer allocation scheduling algorithm to provide a guide to vehicles to safely pass the intersections [26]. Figure 1 shows the intersection channelization.…”
Section: Methods Of Cavs Intersection Coordinationmentioning
confidence: 99%
“…The first notable study on RIC was done by Dresner and Stone (Dresner and Stone [4], Dresner and Stone [5], Dresner and Stone [6]). This seminal work has been followed up by a number of studies that address similar concepts of RIC, often also called automated intersection control or intersection management (Lee and Park [11], Wu et al [28], Li et al [15], Ahmane et al [1], Hassan and Rakha [7], Lin et al [16], Tian et al [23], Shahriari and Biglarbegian [18], Levin and Boyles [12], Levin et al [14], Sun et al [22], Yang et al [29]). Each of this studies is original on its own way (mostly by introducing a different technique to solve the scheduling problem), but most of them are similar in an attempt to integrate trajectory design into the signal control (Lee and Park [11], Wu et al [28], Li et al [15], Ahmane et al [1], Hassan and Rakha [7], Lin et al [16], Sun et al [22], Yang et al [29]).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Some solutions used to find near-optimal solutions include ant colony algorithm and genetic algorithm. A heuristic based on an ant colony system is proposed in Wu et al 12 Genetic algorithm is used in Lin et al, 13 while active set method and interior point method are used along with genetic algorithm in Lee and Park. 14…”
Section: Related Workmentioning
confidence: 99%
“…As an example, consider the red-black tree T of a cell as shown in Figure 3, and we consider a case where the cell is not available, for example, when rta k = 15 and rtd k = 20, since it will conflict with the values in node D. First, we set x to the root of T; thus, x = node A. rta k .x td , thus x = x r = node C. Then, rtd k = x ta , hence x = x l = node D. Then, rtd k .x ta and rta k \x td , which means there is a conflict between [15, 20] and [13,16]; thus, the cell is not available and node D is returned wherein the conflict occurred. findTime function.…”
Section: Intersection Manager Schedules the Requestsmentioning
confidence: 99%