基于时序逻辑请求的按需移动性公平规划
Fair Planning for Mobility-on-Demand with Temporal Logic Requests
摘要:
按需移动系统正在改变我们对人员和货物运输的看法。大部分的研究工作已经放在系统的可扩展性问题,大量的代理和简单的接送机/下车的需求。在本文中,我们考虑公平的多车辆路线规划与流的复杂,时序逻辑的运输需求。我们考虑一个近似无嫉妒公平分配的需求,有限容量的车辆代理的累积效用的基础上,在有限的时间范围内,例如货币奖励或利用水平。我们提出了一个可扩展的方法的基础上建设的分配图,代理商的路线和需求,并提出了一个线性规划(ILP)的问题。分配的路线是使用基于自动机的方法为每辆车计算的,并且要求最多车辆容量的大小集,同时考虑到他们的拾取等待时间和延迟容限。此外,我们在分配图和ILP中集成了基于效用的权重,以确保近似的公平分配。我们展示了我们的方法在乘坐共享案例研究中的计算和操作性能,在曼哈顿中部的大环境和随机到达时间的线性时序逻辑需求。我们表明,我们的方法显着降低代理和空置率之间的效用偏差。
英文摘要:
Mobility-on-demand systems are transforming the way we think about the transportation of people and goods. Most research effort has been placed on scalability issues for systems with a large number of agents and simple pick-up/drop-off demands. In this paper, we consider fair multi-vehicle route planning with streams of complex, temporal logic transportation demands. We consider an approximately envy-free fair allocation of demands to limited-capacity vehicles based on agents' accumulated utility over a finite time horizon, representing for example monetary reward or utilization level. We propose a scalable approach based on the construction of assignment graphs that relate agents to routes and demands, and pose the problem as an Integer Linear Program (ILP). Routes for assignments are computed using automata-based methods for each vehicle and demands sets of size at most the capacity of the vehicle while taking into account their pick-up wait time and delay tolerances. In addition, we integrate utility-based weights in the assignment graph and ILP to ensure approximative fair allocation. We demonstrate the computational and operational performance of our methods in ride-sharing case studies over a large environment in mid-Manhattan and Linear Temporal Logic demands with stochastic arrival times. We show that our method significantly decreases the utility deviation between agents and the vacancy rate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。