Deep Reinforcement Learning Based Dynamic Route Planning for Minimizing Travel Time

• URL: http://arxiv.org/abs/2011.01771v1
• Date: Tue, 3 Nov 2020 15:10:09 GMT
• Title: Deep Reinforcement Learning Based Dynamic Route Planning for Minimizing Travel Time
• Authors: Yuanzhe Geng, Erwu Liu, Rui Wang and Yiming Liu
• Abstract summary: We design a route planning algorithm based on deep reinforcement learning for pedestrians. We propose a dynamically adjustable route planning (DARP) algorithm, where the agent learns strategies through a dueling deep Q network to avoid congested roads. Simulation results show that the DARP algorithm saves 52% of the time under congestion condition when compared with traditional shortest path planning algorithms.
• Score: 8.234463661266169
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Route planning is important in transportation. Existing works focus on finding the shortest path solution or using metrics such as safety and energy consumption to determine the planning. It is noted that most of these studies rely on prior knowledge of road network, which may be not available in certain situations. In this paper, we design a route planning algorithm based on deep reinforcement learning (DRL) for pedestrians. We use travel time consumption as the metric, and plan the route by predicting pedestrian flow in the road network. We put an agent, which is an intelligent robot, on a virtual map. Different from previous studies, our approach assumes that the agent does not need any prior information about road network, but simply relies on the interaction with the environment. We propose a dynamically adjustable route planning (DARP) algorithm, where the agent learns strategies through a dueling deep Q network to avoid congested roads. Simulation results show that the DARP algorithm saves 52% of the time under congestion condition when compared with traditional shortest path planning algorithms.

Related papers

• DynamicRouteGPT: A Real-Time Multi-Vehicle Dynamic Navigation Framework Based on Large Language Models [13.33340860174857]
  Real-time dynamic path planning in complex traffic environments presents challenges, such as varying traffic volumes and signal wait times. Traditional static routing algorithms like Dijkstra and A* compute shortest paths but often fail under dynamic conditions. This paper proposes a novel approach based on causal inference for real-time dynamic path planning, balancing global and local optimality.
  arXiv  Detail & Related papers  (2024-08-26T11:19:58Z)
• Reinforcement learning based local path planning for mobile robot [0.0]
  In the offline scenario, an environment map is created once, and fixed path planning is made on this map to reach the target. In the online scenario, the robot moves dynamically to a given target without using a map by using the perceived data coming from the sensors. Deep neural network powered Q-Learning methods are used as an emerging solution to the aforementioned problems in mobile robot navigation.
  arXiv  Detail & Related papers  (2023-10-24T18:26:25Z)
• POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of a Two-wheeled Robot in Highly Cluttered Environments [53.41594627336511]
  Passable Obstacles Aware (POA) planner is a novel navigation method for two-wheeled robots in a cluttered environment. Our algorithm allows two-wheeled robots to find a path through passable obstacles.
  arXiv  Detail & Related papers  (2023-07-16T19:44:27Z)
• Robust Path Selection in Software-defined WANs using Deep Reinforcement Learning [18.586260468459386]
  We propose a data-driven algorithm that does the path selection in the network considering the overhead of route computation and path updates. Our scheme fares well by a factor of 40% with respect to reducing link utilization compared to traditional TE schemes such as ECMP.
  arXiv  Detail & Related papers  (2022-12-21T16:08:47Z)
• Systematic Comparison of Path Planning Algorithms using PathBench [55.335463666037086]
  Path planning is an essential component of mobile robotics. Development of learning-based path planning algorithms has been experiencing rapid growth. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2022-03-07T01:52:57Z)
• Deep Learning Aided Packet Routing in Aeronautical Ad-Hoc Networks Relying on Real Flight Data: From Single-Objective to Near-Pareto Multi-Objective Optimization [79.96177511319713]
  We invoke deep learning (DL) to assist routing in aeronautical ad-hoc networks (AANETs) A deep neural network (DNN) is conceived for mapping the local geographic information observed by the forwarding node into the information required for determining the optimal next hop. We extend the DL-aided routing algorithm to a multi-objective scenario, where we aim for simultaneously minimizing the delay, maximizing the path capacity, and maximizing the path lifetime.
  arXiv  Detail & Related papers  (2021-10-28T14:18:22Z)
• Road Network Guided Fine-Grained Urban Traffic Flow Inference [108.64631590347352]
  Accurate inference of fine-grained traffic flow from coarse-grained one is an emerging yet crucial problem. We propose a novel Road-Aware Traffic Flow Magnifier (RATFM) that exploits the prior knowledge of road networks. Our method can generate high-quality fine-grained traffic flow maps.
  arXiv  Detail & Related papers  (2021-09-29T07:51:49Z)
• PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms [59.3879573040863]
  Path planning is a key component in mobile robotics. Few attempts have been made to benchmark the algorithms holistically or unify their interface. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2021-05-04T21:48:18Z)
• Waypoint Planning Networks [66.72790309889432]
  We propose a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value networks (VIN) It is shown that WPN's search space is considerably less than A*, while being able to generate near optimal results.
  arXiv  Detail & Related papers  (2021-05-01T18:02:01Z)
• CNN Encoder to Reduce the Dimensionality of Data Image for Motion Planning [1.244705780038575]
  We propose a CNN encoder capable of eliminating useless routes for motion planning problems. In all evaluated scenarios, our solution reduced the number of iterations by more than 60%.
  arXiv  Detail & Related papers  (2020-04-10T15:44:52Z)
• Three Dimensional Route Planning for Multiple Unmanned Aerial Vehicles using Salp Swarm Algorithm [0.0]
  Route planning is a series of translation and rotational steps from a given start location to the destination goal location. The proposed approach improves the average cost and overall time by 1.25% and 6.035% respectively.
  arXiv  Detail & Related papers  (2019-11-24T12:36:18Z)

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.