2019
DOI: 10.1177/1550147719895956
|View full text |Cite
|
Sign up to set email alerts
|

Reservation-based traffic management for autonomous intersection crossing

Abstract: A scheduling scheme for autonomous intersection crossing is proposed and evaluated. The scheduling scheme determines the flow of autonomous vehicles into an intersection without traffic signals. The objective of the scheduling scheme is to schedule the vehicles’ entrances into the intersection such that there will be no collision among vehicles and the intersection is efficiently utilized. Our scheduling scheme uses reservation-based scheduling approach, and the scheduling is formulated as an optimization prob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…Tree search gives a solution to find a near-optimal schedule in feasible time, where the leaf nodes of tree enumerates all the possible schedules and the invalid nodes will be removed based on certain rules. It was first presented in [20], and subsequent studies tried more efficient tree construction and search including red-black tree [21], adaptive belief tree [22], and Monte-Carlo tree search (MCTS) [23]. The graph-based AIM models the problem of passing order as a graph, where the nodes represent vehicles or states of vehicles and the edges represent the precedence [24][25][26][27][28].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Tree search gives a solution to find a near-optimal schedule in feasible time, where the leaf nodes of tree enumerates all the possible schedules and the invalid nodes will be removed based on certain rules. It was first presented in [20], and subsequent studies tried more efficient tree construction and search including red-black tree [21], adaptive belief tree [22], and Monte-Carlo tree search (MCTS) [23]. The graph-based AIM models the problem of passing order as a graph, where the nodes represent vehicles or states of vehicles and the edges represent the precedence [24][25][26][27][28].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Having received the requests, the BATCH algorithm heuristically re-ordered the vehicle's arrival at the interaction after a period of time instead of immediate assignment of the velocity to them in order to achieve safe and more efficient scheduling output. Furthermore, in [198] a heuristic approach was presented introducing a singular entrance scheduling scheme based on the reservation at intersections. To find the optimal sequence of vehicles arrival, a genetic algorithm was used and also vehicles were allowed to approach the intersection with the desired speed.…”
Section: Safety and Efficiencymentioning
confidence: 99%
“…The autonomous intersection management (AIM) of the centralized system follows the server-client scheme, which can be divided into two types: request-based intersection management and release-based intersection management. In [7], [8], a request-based intersection management scheme is proposed. In this scheme, the intersection is divided into the queuing area and acceleration area.…”
Section: A Unsignalized Autonomous Intersection Managementmentioning
confidence: 99%