On-time arrival probability maximum path planning algorithm and system based on fourth-order moment
A technology with maximum probability and path planning, applied in control/regulation systems, two-dimensional position/channel control, vehicle position/route/altitude control, etc.
Active Publication Date: 2022-03-29
成都朴为科技有限公司
View PDF8 Cites 1 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0004] The purpose of the present invention is to provide a path planning algorithm and system based on the fourth-order moment with the maximum probability of on-time arrival, aiming to solve the problems pointed out in the background technology. No matter in terms of effect or time-consuming, the performance of this algorithm is better than other algorithms. excellent
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0037] According to the research of the applicant, the dynamic programming algorithm currently used by many efficient algorithms in large-scale road networks recursively updates the value of the time to reach the end point of each node according to the previously obtained estimated value until convergence, in order to find the shortest path The path of time, the algorithm needs the original road network data as input, the original road network data generally contains the travel time of each road section, variance and assumptions that satisfy various distributions, but the method of dynamic programming involves convolution calculation, calculation The amount is large, and the complete travel time distribution is required as input, and the actual performance in the road network is poor. Based on this, the embodiment of the present invention provides a path planning algorithm with the maximum probability of on-time arrival based on the fourth-order moment, which is better than oth...
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
Login to View More Abstract
The invention provides an on-time arrival probability maximum path planning algorithm and system based on a fourth moment. The algorithm comprises the following steps: obtaining the fourth moment of each path node in a strategy through a Bellman equation; converting the obtained four-order moment to meet the calculation requirement that the node does not reach the upper bound of the probability on time; calculating the upper bound of the inequality obtained by conversion through the fourth moment; and by comparing the upper bound of the non-on-time arrival probability of different path planning strategies, selecting the strategy with the minimum upper bound of the non-on-time arrival probability as the optimal strategy. Along with the gradual increase of the road network size, the time consumption of the algorithm is linearly increased, and the time consumption of other algorithms is exponentially increased; compared with the performance of other algorithms, the performance of the algorithm is better than that of other algorithms in terms of effect and time consumption.
Description
technical field [0001] The invention relates to the technical field of intelligent transportation, in particular to a fourth-order moment-based path planning algorithm and system with maximum probability of on-time arrival. Background technique [0002] In the current intelligent transportation system related applications, uncertainties caused by many weather conditions, vehicle failures, and even natural disasters are very common. Finding the shortest path under uncertainty has become a common research direction. However, the algorithm of finding the shortest path cannot meet the needs of all users. For example, a user catching a plane wants to take the most reliable path with the greatest probability of arriving on time. [0003] The simplest goal to solve this problem is to find a path with the shortest time. This solution has been applied to large-scale road networks by many efficient algorithms, such as recursively updating the value of the time to reach the end point o...
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
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G05D1/02
CPCG05D1/0221Y02D30/70
Inventor 郭宏亮何治陈启明郑鑫
Owner 成都朴为科技有限公司