Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Customized bus passable shortest path calculation method based on A*algorithm

A technology of the shortest path and calculation method, applied in the directions of road network navigators, measuring devices, instruments, etc., can solve the problem of not having the ability of the shortest traversable path, not considering the traversable route of public transportation, etc., so as to avoid wasteful calculation. Time, high accuracy and high efficiency

Active Publication Date: 2020-11-03
ZHENGZHOU TIAMAES TECH
View PDF6 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In view of the defects and problems that the current existing schemes do not take into account the routes that can be passed by public transport or do not have the ability to quickly formulate the shortest traversable route from the starting point to the end point, the present invention provides a custom bus traversable shortest route calculation method based on the A* algorithm

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
  • Customized bus passable shortest path calculation method based on A*algorithm
  • Customized bus passable shortest path calculation method based on A*algorithm
  • Customized bus passable shortest path calculation method based on A*algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] Embodiment 1: Due to the particularity of the customized bus, when planning the route of the customized bus, not only the route that the bus can pass, but also the operating cost and the waiting cost of passengers must be considered. Such as figure 2 It can be seen that the planning of the shortest route for customizing public transportation is actually to find out a shortest route with the minimum weight value between designated nodes in a road network graph with weights. According to the habits and policies of different regions, it can be divided into problems with different indicators such as the shortest distance, the shortest time, the least degree of congestion, and the better quality of road passability. The present invention mainly considers the shortest passable path planning, and calculates the shortest path In the process, it is possible to flexibly select the appropriate algorithm to improve the calculation speed, and quickly formulate the shortest passable...

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 belongs to the technical field of customized bus passable shortest path calculation methods, particularly relates to a customized bus passable shortest path calculation method based on ahierarchical algorithm and an A * algorithm, and mainly aims at calculating the shortest path of a starting point and an ending point of an urban road network. Firstly, a road network is layered, andthen a classic A * algorithm and a two-way A * algorithm are flexibly selected according to different levels of the road network where different starting points and end points are located to calculate the shortest distance between the starting points and the end points in an accelerated mode; and the time for calculating the shortest path is shorter than the time for calculating the shortest pathby simply adopting an A * algorithm, so that the method is more accurate, the calculation speed is greatly increased, and the executability is high.

Description

technical field [0001] The invention belongs to the technical field of calculation methods for customizing the shortest passable route of public transport, and in particular relates to a calculation method for calculating the shortest passable route of customized public transport based on the A* algorithm. Background technique [0002] According to expert estimates, the urban population of the country will reach 60% in 2020, which means that 900 million people will move into cities, and the traditional transportation mode will face challenges. In the current traffic era where automatic driving, intelligent network connection and non-network connection, unmanned driving and manned driving are normalized, the development of car networking and electrification, intelligence and sharing has become the main trend at present and in the future, especially People, vehicles, roads, and things are interconnected and shared mobile travel modes, which have become a new field of R&D and i...

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): G01C21/34
CPCG01C21/3446G01C21/3453
Inventor 郭建国渠华赵新潮孙浩普秀霞刘爱姣王中航
Owner ZHENGZHOU TIAMAES TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com