Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning

• URL: http://arxiv.org/abs/2101.07437v1
• Date: Tue, 19 Jan 2021 03:09:51 GMT
• Title: Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning
• Authors: Jianguo Chen and Kenli Li and Keqin Li and Philip S. Yu and Zeng Zeng
• Abstract summary: 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.
• Score: 79.61517670541863
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As a new generation of Public Bicycle-sharing Systems (PBS), the dockless PBS (DL-PBS) is an important application of cyber-physical systems and intelligent transportation. How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for DL-PBS. In this paper, 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. We model the DL-PBS system from the perspective of CPS and use deep learning to predict the layout of bicycle parking spots and the dynamic demand of bicycle dispatching. We define the multi-route bicycle dispatching problem as a multi-objective optimization problem by considering the optimization objectives of dispatching costs, dispatch truck's initial load, workload balance among the trucks, and the dynamic balance of bicycle supply and demand. On this basis, the collaborative multi-route bicycle dispatching problem among multiple dispatch trucks is modeled as a multi-agent MORL model. All dispatch paths between parking spots are defined as state spaces, and the reciprocal of dispatching costs is defined as a reward. Each dispatch truck is equipped with an agent to learn the optimal dispatch path in the dynamic DL-PBS network. We create an elite list to store the Pareto optimal solutions of bicycle dispatch paths found in each action, and finally, get the Pareto frontier. Experimental results on the actual DL-PBS systems show that compared with existing methods, MORL-BD can find a higher quality Pareto frontier with less execution time.

Related papers

• Multi-agent Path Finding for Mixed Autonomy Traffic Coordination [7.857093164418706]
  We propose a Behavior Prediction Kinematic Priority Based Search (BK-PBS) to forecast HDV responses to CAV maneuvers. Our work is directly applicable to many scenarios of multi-human multi-robot coordination.
  arXiv  Detail & Related papers  (2024-09-05T19:37:01Z)
• Path Following and Stabilisation of a Bicycle Model using a Reinforcement Learning Approach [0.0]
  This work introduces an RL approach to do path following with a virtual bicycle model while simultaneously stabilising it laterally. The agent succeeds in both path following and stabilisation of the bicycle model exclusively by outputting steering angles. The performance of the deployed agents is evaluated using different types of paths and measurements.
  arXiv  Detail & Related papers  (2024-07-24T10:54:23Z)
• Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
  We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset. In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
  arXiv  Detail & Related papers  (2022-12-18T21:43:27Z)
• Bike Sharing Demand Prediction based on Knowledge Sharing across Modes: A Graph-based Deep Learning Approach [8.695763084463055]
  This study proposes a graph-based deep learning approach for bike sharing demand prediction (B-MRGNN) with multimodal historical data as input. A multi-relational graph neural network (MRGNN) is introduced to capture correlations between spatial units across modes. Experiments are conducted using real-world bike sharing, subway and ride-hailing data from New York City.
  arXiv  Detail & Related papers  (2022-03-18T06:10:17Z)
• On the Role of Multi-Objective Optimization to the Transit Network Design Problem [0.7734726150561088]
  This work shows that single and multi objective stances can be synergistically combined to better answer the transit network design problem (TNDP) As a guiding case study, the solution is applied to the multimodal public transport network in the city of Lisbon, Portugal. The proposed TNDP optimization proved to improve results, with reductions in objective functions of up to 28.3%.
  arXiv  Detail & Related papers  (2022-01-27T16:22:07Z)
• Optimal transport in multilayer networks [68.8204255655161]
  We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. As an application, we consider transportation networks, where each layer is associated to a different transportation system. We show an example of this result on the real 2-layer network of the city of Bordeaux with bus and tram, where in certain regimes the presence of the tram network significantly unburdens the traffic on the road network.
  arXiv  Detail & Related papers  (2021-06-14T07:33:09Z)
• 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 Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network [79.61517670541863]
  Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries. redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors. We propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network.
  arXiv  Detail & Related papers  (2021-01-19T02:51:12Z)
• Multi-Agent Routing Value Iteration Network [88.38796921838203]
  We propose a graph neural network based model that is able to perform multi-agent routing based on learned value in a sparsely connected graph. We show that our model trained with only two agents on graphs with a maximum of 25 nodes can easily generalize to situations with more agents and/or nodes.
  arXiv  Detail & Related papers  (2020-07-09T22:16:45Z)

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.