path planning method

Abstract

The invention discloses a route planning method, and belongs to the technical field of data processing. The route planning method comprises the steps: acquiring an initial route of a vehicle, and determining a driving-through sequence of a second starting point in the initial route and a driving-through sequence of a second terminal point in the initial route according to driving demand carried by a car sharing request of a first user, driving demand carried by a car sharing request of a second user, the second starting point, the second terminal point and a driving distance between two adjacent nodes in the initial route, updating the initial route of the vehicle according to the driving-through sequence of the second starting point and driving-through sequence of the second terminal point, and obtaining a car sharing route. Since the starting point and the terminal point of the user can be screened according to the demand of the user, the location satisfying the condition can be selected, and on the premise of calculating the best car sharing route, the calculation amount can be reduced. The route planning efficiency is relatively high.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a path planning method. Background technique [0002] With the improvement of living standards, more and more users need to take a taxi. In order to save costs and resources, many passengers choose to travel by carpooling. In most carpooling scenarios, the passenger's carpooling request arrives gradually, that is, when the driver receives the passenger's carpooling request, there are usually one or more passengers in the car. The driving route is re-planned. Among them, when re-planning the driving route, the re-planned driving route needs to meet the requirements of the passenger's carpooling fee and travel time, and also need to meet the travel time requirements of existing passengers on the car. [0003] When planning the route of the related technology, the method adopted is: whenever a carpooling request from a passenger is received, all possible driving routes ar...

AI Technical Summary

Problems solved by technology

When calculating the driving route, it will consume a lot of time and resources, so that the optimal driving route cannot be calculated in time, resulting in the failure to respond to the passenger's carpooling request in time

Therefore, the real-time performance of path planning is poor and the efficiency is low

Images