Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

No-load taxi path planning method based on discrete randomness dynamic planning

A dynamic planning and path planning technology, applied in mechanical equipment, combustion engines, internal combustion piston engines, etc., can solve the problems of cruise affecting the overall traffic environment in key areas, spending a lot of computing power, waste of road resources, etc., to improve the utilization of time and space resources. efficiency and service quality, improving long-term revenue, and improving stability

Pending Publication Date: 2022-07-08
SOUTHEAST UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] (1) Cause environmental pollution and waste of road resources: Taking Chinese Taipei and Shenzhen as examples, the empty driving mileage of taxis accounted for more than 40%, and the empty driving time of Shenzhen taxis accounted for as high as 49.2%, that is Taxis are cruising aimlessly half the time;
[0004] (2) Exacerbating the shortage of road resources during peak hours in key areas: Taking Hong Kong, China as an example, taxis account for about 25% of urban traffic, and as high as 50%-60% in key areas, playing an important role. Unreasonable cruising of empty taxis will affect the overall traffic environment in key areas
There are still many problems in the existing route planning of empty taxis in terms of aggregated display, GPS data and road network connections. Some route planning methods for empty taxis do not consider long-term benefits, and often It requires a lot of computing power, and there are problems such as missing data. At the same time, a large number of model parameters need to be calibrated, and the effect obtained is average.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • No-load taxi path planning method based on discrete randomness dynamic planning
  • No-load taxi path planning method based on discrete randomness dynamic planning
  • No-load taxi path planning method based on discrete randomness dynamic planning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0053] In order to make the purpose, technical solutions and advantages of the present application more clearly understood, the present application will be described in further detail below with reference to the accompanying drawings and embodiments.

[0054] A method for planning an empty taxi path based on discrete random dynamic programming described in this embodiment, the flow chart is as follows figure 1 shown, including the following steps:

[0055] S10 , grid the target area, collect the GPS historical data of taxis in the target area, and filter the grid of taxi arrivals according to the GPS historical data.

[0056] The target area is gridded in geographic space, a rectangular target area is selected, and the target area is divided into several grids with M rows and N columns on the geographic space level. Each grid is a square with a side length of b meters. The grids are closely connected with each other and have no gaps. The values ​​of M and N are related to the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a no-load taxi path planning method based on discrete randomness dynamic planning, and the method comprises the steps: carrying out the meshing of a target region, collecting the GPS historical data of taxies in the target region, and screening the grids where the taxies arrive according to the GPS historical data; establishing a grid-based discrete randomness dynamic planning model by taking benefit maximization as a target; and calculating parameters in the discrete randomness dynamic programming model by using a strategy iteration method, substituting the obtained parameters into the model, calculating an optimal value corresponding to an optimal strategy, and obtaining a recommended route of the no-load taxi. According to the invention, path planning is carried out on the no-load taxi based on discrete randomness dynamic planning, a mathematical model is established according to a real road network and taxi GPS data, and the long-term income of the no-load taxi is effectively improved; according to the method, the target area is subjected to grid division, the interference of data missing or abnormal values on the path planning result is effectively avoided depending on the data collection model, and the stability of path planning is improved.

Description

technical field [0001] The invention relates to the field of public transportation in transportation planning and management, in particular to an empty taxi path planning method based on discrete random dynamic planning. Background technique [0002] With the rapid development of the urban economy and the steady improvement of the living standards of the residents, the urban transportation methods are becoming more and more diverse, and taxis play an important role in urban road transportation with their flexible characteristics and point-to-point service forms. However, while improving the convenience of residents' travel, a series of operational problems have also emerged, among which the problem of empty taxis is more prominent. There are the following problems with empty taxis cruising aimlessly on city roads: [0003] (1) Causes environmental pollution and waste of road resources: Take Chinese Taipei and Shenzhen as examples, the empty mileage of taxis accounts for mor...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/04G06Q50/30G06F16/9537G06F16/9535
CPCG06Q10/047G06F16/9537G06F16/9535G06Q50/40Y02T10/40
Inventor 程琳张晨皓李昭璇杜明洋李雪峰丁圣轩王世伟赵汗青刘渊雍锐
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products