arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.04972cs.FLcs.GT
收藏

分布式公平分配与再平衡:基于拍卖方法的按需出行系统

Distributed Fair Assignment and Rebalancing for Mobility-on-Demand Systems via an Auction-based Method

Kaier Liang, Cristian-Ioan Vasile

AI总结:

针对按需出行系统的公平分配问题,提出基于分布式拍卖与再平衡的方法,利用效用历史修正和车辆重路由,在曼哈顿地图上验证了公平性提升且服务质量不降。

摘要:

本文考虑按需出行系统中复杂请求的公平分配问题。我们将交通请求建模为必须由车队满足的时序逻辑公式。我们要求车辆之间的请求分配以分布式方式进行,仅基于车辆间的通信,同时确保公平分配。我们解决车辆-请求分配问题的方法基于一种无集中式竞价的分布式拍卖方案,该方案利用出价的效用历史修正来提高公平性。作为补充,我们提出了一种再平衡方案,通过将车辆重新路由到更有回报的区域来增加潜在的未来效用,并确保更公平的效用分配。我们采用最大最小效用和效用偏差作为公平性的两个标准。我们在曼哈顿中部地图上演示了这些方法,并在不同概率设置下生成了大量请求。我们表明,在公平性标准下,我们提高了车辆之间的公平性,而不会降低服务质量。

英文摘要:

In this paper, we consider fair assignment of complex requests for Mobility-On-Demand systems. We model the transportation requests as temporal logic formulas that must be satisfied by a fleet of vehicles. We require that the assignment of requests to vehicles is performed in a distributed manner based only on communication between vehicles while ensuring fair allocation. Our approach to the vehicle-request assignment problem is based on a distributed auction scheme with no centralized bidding that leverages utility history correction of bids to improve fairness. Complementarily, we propose a rebalancing scheme that employs rerouting vehicles to more rewarding areas to increase the potential future utility and ensure a fairer utility distribution. We adopt the max-min and deviation of utility as the two criteria for fairness. We demonstrate the methods in the mid-Manhattan map with a large number of requests generated in different probability settings. We show that we increase the fairness between vehicles based on the fairness criteria without degenerating the servicing quality.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑