FlexPool: A Distributed Model-Free Deep Reinforcement Learning Algorithm
for Joint Passengers & Goods Transportation
- URL: http://arxiv.org/abs/2007.13699v2
- Date: Sun, 20 Sep 2020 19:09:34 GMT
- Title: FlexPool: A Distributed Model-Free Deep Reinforcement Learning Algorithm
for Joint Passengers & Goods Transportation
- Authors: Kaushik Manchella and Abhishek K. Umrawal and Vaneet Aggarwal
- Abstract summary: This paper considers combining passenger transportation with goods delivery to improve vehicle-based transportation.
We propose FlexPool, a distributed model-free deep reinforcement learning algorithm that jointly serves passengers & goods workloads.
We show that FlexPool achieves 30% higher fleet utilization and 35% higher fuel efficiency in comparison to model-free approaches.
- Score: 36.989179280016586
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The growth in online goods delivery is causing a dramatic surge in urban
vehicle traffic from last-mile deliveries. On the other hand, ride-sharing has
been on the rise with the success of ride-sharing platforms and increased
research on using autonomous vehicle technologies for routing and matching. The
future of urban mobility for passengers and goods relies on leveraging new
methods that minimize operational costs and environmental footprints of
transportation systems.
This paper considers combining passenger transportation with goods delivery
to improve vehicle-based transportation. Even though the problem has been
studied with a defined dynamics model of the transportation system environment,
this paper considers a model-free approach that has been demonstrated to be
adaptable to new or erratic environment dynamics. We propose FlexPool, a
distributed model-free deep reinforcement learning algorithm that jointly
serves passengers & goods workloads by learning optimal dispatch policies from
its interaction with the environment. The proposed algorithm pools passengers
for a ride-sharing service and delivers goods using a multi-hop transit method.
These flexibilities decrease the fleet's operational cost and environmental
footprint while maintaining service levels for passengers and goods. Through
simulations on a realistic multi-agent urban mobility platform, we demonstrate
that FlexPool outperforms other model-free settings in serving the demands from
passengers & goods. FlexPool achieves 30% higher fleet utilization and 35%
higher fuel efficiency in comparison to (i) model-free approaches where
vehicles transport a combination of passengers & goods without the use of
multi-hop transit, and (ii) model-free approaches where vehicles exclusively
transport either passengers or goods.
Related papers
- Learning Robust Autonomous Navigation and Locomotion for Wheeled-Legged Robots [50.02055068660255]
Navigating urban environments poses unique challenges for robots, necessitating innovative solutions for locomotion and navigation.
This work introduces a fully integrated system comprising adaptive locomotion control, mobility-aware local navigation planning, and large-scale path planning within the city.
Using model-free reinforcement learning (RL) techniques and privileged learning, we develop a versatile locomotion controller.
Our controllers are integrated into a large-scale urban navigation system and validated by autonomous, kilometer-scale navigation missions conducted in Zurich, Switzerland, and Seville, Spain.
arXiv Detail & Related papers (2024-05-03T00:29:20Z) - Vehicle Dispatching and Routing of On-Demand Intercity Ride-Pooling Services: A Multi-Agent Hierarchical Reinforcement Learning Approach [4.44413304473005]
Intercity ride-pooling service exhibits considerable potential in upgrading traditional intercity bus services.
Online operations suffer the inherent complexities due to the coupling of vehicle resource allocation among cities and pooled-ride vehicle routing.
This study proposes a two-level framework designed to facilitate online fleet management.
arXiv Detail & Related papers (2023-07-13T13:31:01Z) - Safe Model-Based Multi-Agent Mean-Field Reinforcement Learning [48.667697255912614]
Mean-field reinforcement learning addresses the policy of a representative agent interacting with the infinite population of identical agents.
We propose Safe-M$3$-UCRL, the first model-based mean-field reinforcement learning algorithm that attains safe policies even in the case of unknown transitions.
Our algorithm effectively meets the demand in critical areas while ensuring service accessibility in regions with low demand.
arXiv Detail & Related papers (2023-06-29T15:57:07Z) - A greedy approach for increased vehicle utilization in ridesharing
networks [0.3480973072524161]
ridesharing platforms have become a prominent mode of transportation for the residents of urban areas.
We propose a k-hop-based sliding window approximation algorithm that reduces the search space from entire road network to a window.
We evaluate our proposed model on real-world datasets and experimental results demonstrate superior performance by our proposed model.
arXiv Detail & Related papers (2023-04-02T07:25:01Z) - A Bibliometric Analysis and Review on Reinforcement Learning for
Transportation Applications [43.356096302298056]
Transportation is the backbone of the economy and urban development.
Reinforcement Learning (RL) that enables autonomous decision-makers to interact with the complex environment.
This paper conducts a bibliometric analysis to identify the development of RL-based methods for transportation applications.
arXiv Detail & Related papers (2022-10-26T07:34:51Z) - Value Function is All You Need: A Unified Learning Framework for Ride
Hailing Platforms [57.21078336887961]
Large ride-hailing platforms, such as DiDi, Uber and Lyft, connect tens of thousands of vehicles in a city to millions of ride demands throughout the day.
We propose a unified value-based dynamic learning framework (V1D3) for tackling both tasks.
arXiv Detail & Related papers (2021-05-18T19:22:24Z) - Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems
using Multi-objective Reinforcement Learning [79.61517670541863]
How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS)
We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
arXiv Detail & Related papers (2021-01-19T03:09:51Z) - PassGoodPool: Joint Passengers and Goods Fleet Management with
Reinforcement Learning aided Pricing, Matching, and Route Planning [29.73314892749729]
We present a demand aware fleet management framework for combined goods and passenger transportation.
Our proposed model is deployable independently within each vehicle as this minimizes computational costs associated with the growth of distributed systems.
arXiv Detail & Related papers (2020-11-17T23:15:03Z) - A Distributed Model-Free Ride-Sharing Approach for Joint Matching,
Pricing, and Dispatching using Deep Reinforcement Learning [32.0512015286512]
We present a dynamic, demand aware, and pricing-based vehicle-passenger matching and route planning framework.
Our framework is validated using the New York City Taxi dataset.
Experimental results show the effectiveness of our approach in real-time and large scale settings.
arXiv Detail & Related papers (2020-10-05T03:13:47Z) - Real-time and Large-scale Fleet Allocation of Autonomous Taxis: A Case
Study in New York Manhattan Island [14.501650948647324]
Traditional models fail to efficiently allocate the available fleet to deal with the imbalance of supply (autonomous taxis) and demand (trips)
We employ a Constrained Multi-agent Markov Decision Processes (CMMDP) to model fleet allocation decisions.
We also leverage a Column Generation algorithm to guarantee the efficiency and optimality in a large scale.
arXiv Detail & Related papers (2020-09-06T16:00:15Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.