首页>
外国专利>
PROCESS OF PLANNING THE FASTEST ROUTE FOR ROAD VEHICLES
PROCESS OF PLANNING THE FASTEST ROUTE FOR ROAD VEHICLES
展开▼
机译：道路车辆最快路线的规划过程
展开▼
页面导航
摘要
著录项
相似文献
摘要
The problem that is resolved with this invention is maintaining of the accuracy of route calculation when planning the fastest route for road vehicles from a starting to a destination point, while maintaining the performance of the calculation. The process according to this invention uses a combination of graphs that contain a subset of all major roads with intersections designated as nodes, but without intersections that contain prohibited turns, and two ad hoc graphs that are created in the vicinity of the selected starting point (start) and end point (destination). The process of planning the fastest route for road vehicles comprises that in the vicinity of the starting point and the destination point, two ad hoc graphs Bl and B2 are created. The mentioned graphs Bl and B2 embody roads as nodes and execute calculations using Dijkstra's algorithm, which function perfectly with the subject graphs. Graphs B l and B2 are connected to portals with a CH graph. Each portal has its own corresponding magnitude, which is obtained by calculating the time necessary to arrive from the start to portal a, or from portal b to the destination. Based on the CH graph, the fastest path is then calculated from one of the portals a to one of the portals b, taking into account the initial magnitude of the portals. The final shortest route represents the chain start - a - b - destination, which has the lowest magnitude, i.e. when the sum of the corresponding trajectories from graphs Bl + CH + B2 is the lowest.
展开▼
