LANE ASSIGNMENT ON AUTOMATED HIGHWAY SYSTEMS

The automation of highways as part of the IVHS program is seen as a wa y to alleviate congestion on urban highways, This paper discusses the concept of lane assignment in the contest of automated highway systems (AHS), Lane assignments represent the scheduling of the path taken by the vehicle once it enters an automated multilane corridor, We mill d iscuss the classification of lane assignment strategies into nonpartit ioned (totally unconstrained, general, and constant lane) and partitio ned (destination monotone, origin monotone, and monotone) strategies, Next, an optimization problem is formulated with the performance crite rion being a combination of travel time and maneuver costs, Conditions under which the optimal strategy is partitioned, or nearly so, are di scussed. We present tyro algorithms to determine suboptimal partitione d strategies given an optimal nonpartitioned one, A case study of a hy pothetical automated highway and the strategies obtained for it under the minimization of total travel time criterion is presented.