Link a dokumentumra való hivatkozáshoz:
Absztrakt
Considering that the Connected Autonomous Vehicles (CAVs) of the future can choose arbitrary parking lots when being idle, parking lot assignment for CAVs will be a challenging task. Auctions are computationally efficient and distributable assignment mechanisms, hence they may offer a suitable solution. In this paper, a single-unit demand, simultaneous independent auction is presented to solve the CAV parking lot assignment problem. The proposed method takes into account both the financial interests of the CAV operators and ecological or social interests of the community to favor closer alternatives instead of more distant ones.
