2015
DOI: 10.1002/rnc.3469
|View full text |Cite
|
Sign up to set email alerts
|

Eco‐driving in urban traffic networks using traffic signals information

Abstract: The problem of eco-driving is analyzed for an urban traffic network in presence of signalized intersections. It is assumed that the traffic light timings are known and available to the vehicles via infrastructure-to-vehicle communication. This work provides a solution to the energy consumption minimization while traveling through a sequence of signalized intersections and always catching a green light. The optimal-control problem is non-convex because of the constraints coming from the traffic lights; therefor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
53
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 114 publications
(54 citation statements)
references
References 19 publications
1
53
0
Order By: Relevance
“…Mensing utilized the dynamic programming approach to optimize the speed trajectories of vehicles [29]. Nunzio adopted graph discretizing approach to identify the ecological spatial-temporal trajectories of vehicles [30]. Madruga applied the multi-agent system to eco-driving training [31].…”
Section: Introductionmentioning
confidence: 99%
“…Mensing utilized the dynamic programming approach to optimize the speed trajectories of vehicles [29]. Nunzio adopted graph discretizing approach to identify the ecological spatial-temporal trajectories of vehicles [30]. Madruga applied the multi-agent system to eco-driving training [31].…”
Section: Introductionmentioning
confidence: 99%
“…where J u i is the energy cost during the interval [τ i−1 , τ i ], which can be obtained as (17) and (18). The continuous acceleration constraint (6) is ensured by (19) and (20). The constraint (21) is needed to ensure the right order of the intersection crossing times of the autonomous vehicle driven by the optimal acceleration profile.…”
Section: Fig 1 Optimal Acceleration Profile For Two Intersectionsmentioning
confidence: 99%
“…The work in [18] devises the optimal speed profile given the feasible target time, which is within some green light interval. A velocity pruning algorithm is proposed in [19] to identify feasible green windows, and a velocity profile is calculated numerically in terms of energy consumption. Most existing work solves the eco-driving problem with traffic light constraints numerically, such as using dynamic programming [17], [20], and model predictive control [16].…”
Section: Introductionmentioning
confidence: 99%
“…They estimated the queue clearing time and used pseudospectral method to obtain the optimal speed trajectory. In [15], a discretized solution using Dijkstra's algorithm has been obtained for multiple intersections. They assumed the vehicles cross the intersection only at a specific point in time such as at the beginning, middle or end of a green phase window.…”
Section: Introductionmentioning
confidence: 99%