作者: Daniel A. Lazar , Samuel Coogan , Ramtin Pedarsani
DOI: 10.23919/ACC.2018.8431087
关键词: Bounded function 、 Mathematical optimization 、 Routing (electronic design automation) 、 Price of anarchy 、 Degree (graph theory) 、 Arbitrarily large 、 Computer science 、 Fraction (mathematics)
摘要: We study routing behavior in transportation networks with mixed autonomy, that is, which a fraction of the vehicles on each road are equipped autonomous capabilities such as adaptive cruise control enable reduced headways and increased capacity. Motivated by capacity models developed for roads we consider delay or link is an affine function two quantities: number regular link. particularly price anarchy networks, ratio total experienced selfish to socially optimal policy. Unlike case when all same type, known be bounded, first show can arbitrarily large networks. Next, define notion asymmetry corresponding maximum possible travel time improvement due presence vehicles. degree links network bounded factor less than 4, bounded. also bound bicriteria, cost selfishly traffic compared optimally additional traffic. These bounds depend recover classical bicriteria no exists. Further, examples these tight particular cases.