Proceedings of 1995 American Control Conference - ACC'95
DOI: 10.1109/acc.1995.533804
|View full text |Cite
|
Sign up to set email alerts
|

Partitioned lane assignment strategies for balancing excess lane capacity on AHS

Abstract: This paper discusses lane assignment on Automated Highway Systems(AHS) done to balance excess lane capacities . The lane assignment is formulated as a constrained optimization problem with the performance criterion being the balanced use of lanes. The optimization is done within the space of partitioned strategies. An algorithm for determining an o timal or suboptimal partitioned strate is developex The features of the developed a l g o r i t E are illustrated on an example of an AHS with 20 entry/exit points.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 3 publications
0
6
0
Order By: Relevance
“…The problem of lane assignment has been considered by several researchers [21]- [26]. Most existing work adopted a static lane assignment approach [22]- [25]. The work by Ramaswamy et al includes lane assignment to vehicles on automated highway systems [22], [23].…”
Section: Related Workmentioning
confidence: 99%
“…The problem of lane assignment has been considered by several researchers [21]- [26]. Most existing work adopted a static lane assignment approach [22]- [25]. The work by Ramaswamy et al includes lane assignment to vehicles on automated highway systems [22], [23].…”
Section: Related Workmentioning
confidence: 99%
“…Medanic et al [6] defined a lane assignment problem using the origin-destination matrix, with the objective of reducing the unnecessary crossings on the highway. Their lane assignment strategy assigned a lane to each vehicle based on its origin and destination.…”
Section: Introductionmentioning
confidence: 99%
“…Then, for the row partitions to remain the same for a different assignment p, the following conditions (a) through (e) must be satisfied, for a segment with K 2 exits. j = i + l 3 Pip, = 0…”
Section: Approachmentioning
confidence: 99%
“…In the formulation of the lane assignment problem, the lane capacities in [I] and [3] were assumed to be fixed. The actual lane capacities are however dependent on the number of maneuvers that occur and hence on the lane assignment.…”
Section: Estimating the Dynamic Capacitymentioning
confidence: 99%
See 1 more Smart Citation