2013
DOI: 10.2478/amcs-2013-0015
|View full text |Cite
|
Sign up to set email alerts
|

An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach

Abstract: This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection. In this p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(20 citation statements)
references
References 26 publications
0
20
0
Order By: Relevance
“…7 Of course, since DESs are discrete-state, event-driven systems, their state evolution depends entirely on the occurrence of discrete events over time. There are many different modelling techniques for DESs, such as Petri nets, extended state machines, event-graphs, formal languages, generalized semi-Markov processes, non-linear programming, automata and computer simulation models (see, for example, studies [35][36][37] and the references therein). An emerging approach in this area is offered by the max-plus algebra framework.…”
Section: Related Workmentioning
confidence: 99%
“…7 Of course, since DESs are discrete-state, event-driven systems, their state evolution depends entirely on the occurrence of discrete events over time. There are many different modelling techniques for DESs, such as Petri nets, extended state machines, event-graphs, formal languages, generalized semi-Markov processes, non-linear programming, automata and computer simulation models (see, for example, studies [35][36][37] and the references therein). An emerging approach in this area is offered by the max-plus algebra framework.…”
Section: Related Workmentioning
confidence: 99%
“…Reference [23] used permutation encoding scheme and solved the flow shop scheduling problem with an objective of minimizing the makespan. The paper [21] proposed a genetic algorithm to optimize the groups of compatible vehicles in a very short time. References [24,25] reviewed many researches where genetic algorithms can be used to solve job scheduling problems which can meet our requirements.…”
Section: Reactive Dicamentioning
confidence: 99%
“…This optimal sequence aims to make the emergency vehicles cross the intersection in the fastest way. Among many sequence forming approaches [18][19][20][21] in the literature, the authors of [21] proposed the most similar approach to ours, which also proposed a genetic algorithm to form vehicle sequences. However, unlike the approach proposed in this paper, they are essentially not allowing vehicles with conflicting routes to be inside the intersection at the same time.…”
Section: Introductionmentioning
confidence: 99%
“…and the transitions are only observed at the discrete instants in time. There are many different modeling techniques for discrete-event systems, such as Petri nets, extended state machines, event-graphs, formal languages, generalized semi Markov processes, nonlinear programming, automata, computer simulation models and so on (see, e.g., the works of Sahner et al (2012), Abrams et al (1992), Hillion and Proth (1989), Yan et al (2013) and the references therein). It should be underlined that models describing a DES are nonlinear in the conventional algebra.…”
Section: Seybold Et Almentioning
confidence: 99%