CN117367442A - Path planning method and device - Google Patents

Path planning method and device Download PDF

Info

Publication number
CN117367442A
CN117367442A CN202210763910.XA CN202210763910A CN117367442A CN 117367442 A CN117367442 A CN 117367442A CN 202210763910 A CN202210763910 A CN 202210763910A CN 117367442 A CN117367442 A CN 117367442A
Authority
CN
China
Prior art keywords
user
information
carsickness
path
terminal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210763910.XA
Other languages
Chinese (zh)
Inventor
曹敏伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Beijing Didi Infinity Technology and Development Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Priority to CN202210763910.XA priority Critical patent/CN117367442A/en
Publication of CN117367442A publication Critical patent/CN117367442A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3484Personalized, e.g. from learned user behaviour or user-defined profiles
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Social Psychology (AREA)
  • Traffic Control Systems (AREA)

Abstract

The embodiment of the disclosure relates to a path planning method and equipment. The method comprises the following steps: receiving a taxi taking request sent by a first terminal; wherein, the taxi taking request carries carsickness information and riding information of the first user; planning a target driving path according to the carsickness information and the riding information; and sending the target driving path to a second terminal so that the second terminal displays the target driving path in an electronic map. By adopting the method, the driving path meeting the user requirement can be planned.

Description

Path planning method and device
Technical Field
The embodiment of the disclosure relates to the technical field of network traffic, in particular to a path planning method and equipment.
Background
With the development of the net car-saving technology, the net car-saving technology greatly facilitates daily travel of people.
In the prior art, when a server receives a taxi taking request of a passenger and plans a travel path of a taxi for the passenger, factors such as a travel distance, a travel time and the like are mainly considered, and a travel path with the shortest travel time or the shortest travel distance is planned. However, the conventional route planning method has a problem that the planned travel route is difficult to satisfy the user's demand.
Disclosure of Invention
The embodiment of the disclosure provides a path planning method and equipment, which can be used for planning a driving path meeting the requirements of users.
In a first aspect, an embodiment of the present disclosure provides a path planning method, including:
receiving a taxi taking request sent by a first terminal; wherein, the taxi taking request carries carsickness information and riding information of the first user;
planning a target driving path according to the carsickness information and the riding information;
and sending the target driving path to a second terminal so that the second terminal displays the target driving path in an electronic map.
In a second aspect, an embodiment of the present disclosure provides a path planning method, including:
acquiring carsickness information and riding information of a first user based on a riding interface;
and sending a taxi taking request carrying the carsickness information and the taxi taking information to a server, so that the server plans a target driving path according to the carsickness information and the taxi taking information.
In a third aspect, an embodiment of the present disclosure provides a path planning apparatus, the apparatus including:
the receiving module is used for receiving a taxi taking request sent by the first terminal; wherein, the taxi taking request carries carsickness information and riding information of the first user;
The planning module is used for planning a target driving path according to the carsickness information and the riding information;
and the first sending module is used for sending the target running path to the second terminal so that the second terminal displays the target running path in the electronic map.
In a fourth aspect, an embodiment of the present disclosure provides a path planning apparatus, the apparatus including:
the acquisition module is used for acquiring carsickness information and riding information of the first user based on the riding interface;
and the sending module is used for sending a taxi taking request carrying the carsickness information and the riding information to a server so that the server plans a target driving path according to the carsickness information and the riding information.
In a fifth aspect, an embodiment of the disclosure provides a server, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the method of the first aspect when the processor executes the computer program.
In a sixth aspect, an embodiment of the disclosure provides a terminal, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the method of the second aspect when the processor executes the computer program.
In a seventh aspect, embodiments of the present disclosure provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the methods of the first aspect and the second aspect described above.
In an eighth aspect, embodiments of the present disclosure provide a computer program product comprising a computer program which, when executed by a processor, implements the methods of the first aspect and the second aspect.
According to the path planning method and the path planning device, as the received taxi taking request sent by the first terminal carries the carsickness information and the taxi taking information of the first user, the target running path can be planned according to the carsickness information of the first user and the taxi taking information of the first user, and the planned target running path considers the carsickness information of the first user, so that the planned target running path can meet the requirements of the first user more, and discomfort brought by the first user in the running process due to the planned running path is avoided; in addition, the planned target running path is sent to the second terminal, so that the second terminal can display the target running path in the electronic map, and the planned target running path can be displayed more intuitively and vividly.
Drawings
FIG. 1 is an application environment diagram of a path planning method in one embodiment;
FIG. 2 is a flow diagram of a method of path planning in one embodiment;
FIG. 3 is a flow chart of a method of path planning in another embodiment;
FIG. 4 is a flow chart of a path planning method according to another embodiment;
FIG. 5 is a flow chart of a path planning method according to another embodiment;
FIG. 6 is a flow chart of a method of path planning in another embodiment;
FIG. 7 is a block diagram of a path planning apparatus in one embodiment;
FIG. 8 is a block diagram of a path planning apparatus in one embodiment;
FIG. 9 is an internal block diagram of a server in one embodiment;
fig. 10 is an internal structural view of a terminal in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the disclosed embodiments and are not intended to limit the disclosed embodiments.
First, before the technical solution of the embodiments of the present disclosure is specifically described, a description is given of a technical background or a technical evolution context on which the embodiments of the present disclosure are based. Under the general condition, in the field of network about vehicle travel, the current technical background is: when a server receives a taxi taking request of a passenger, when planning a travel path of a taxi for the passenger, mainly considering factors such as travel distance, travel time and the like, and planning the travel path with the shortest travel time or the shortest travel distance, however, the conventional path planning method does not consider the factor of passenger carsickness, and further the planned travel path is difficult to meet the requirements of the carsickness passengers. Based on the background, the applicant finds out that the influence factors causing the carsickness of passengers mainly include curves, bumpy roads, congestion, driving distances and the like through long-term model simulation research and development and collection, demonstration and verification of experimental data, and how to reduce or avoid the influence factors in the driving paths of the carsickness passengers becomes a difficult problem to be solved urgently at present. In addition, the applicant has made a great deal of creative effort from the standpoint of determining the factors that cause passenger motion sickness and the technical solutions described in the following examples.
The following describes a technical scheme related to an embodiment of the present disclosure in conjunction with a scenario in which the embodiment of the present disclosure is applied. It should be noted that, the technical solution according to the embodiments of the present disclosure is not only suitable for planning a driving path of a passenger with motion sickness, but also suitable for planning a driving path of a passenger with uncomfortable body and a sick passenger.
The path planning method provided by the embodiment of the disclosure can be applied to a system architecture shown in fig. 1. The system architecture comprises a first terminal 101, a second terminal 102 and a server 103. The first terminal 101 and the second terminal 102 may be electronic devices such as a mobile phone, a tablet computer, an IPAD, or the first terminal 101 may be first APP software installed on the first terminal, and the second terminal 102 may be second APP software installed on the second terminal. The server 103 may be a server, which may be a stand-alone server or may be a server cluster. Note that, the first terminal 101, the second terminal 102, and the server 103 may communicate with each other, and the communication manner of the three is not limited in the embodiment of the present disclosure. In addition, the first APP software and the second APP software may be software released by a server, and the two software may be two independent APP software, or may be software presentation of the same software in different modes, for example, the server may release a trip software, where the trip software has two modes, i.e., a driver mode and a passenger mode, and the functions of the software in different modes are implemented differently, and the facing user groups are also different.
In one embodiment, as shown in fig. 2, a path planning method is provided, and the method is applied to the server in fig. 1 for illustration, and includes the following steps:
s201, receiving a taxi taking request sent by a first terminal; the taxi taking request carries carsickness information and riding information of the first user.
Wherein the motion sickness information of the first user can be used for representing whether the first user is motion sickness or not. Alternatively, the riding information of the first user may include the number of persons of the first user, the starting position of the first user, the ending position of the first user, the starting riding time of the first user, the time when the first user arrives at the ending point, whether there is a child in the first user, and so on.
Optionally, the first terminal may package the motion sickness information and the riding information of the first user, and send the packaged data packet to the server in the driving request. Furthermore, the first terminal may encrypt the packaged data packet, and send the encrypted data packet to the server.
Optionally, the server may receive the taxi taking request sent by the first terminal through a bluetooth communication connection between the server and the first terminal, or the server may also receive the taxi taking request sent by the first terminal through a Wi-Fi communication connection between the server and the first terminal.
S202, planning a target driving path according to the carsickness information and the riding information.
Optionally, the server may first plan a candidate travel path according to the riding information of the first user, and then determine a target travel path from the planned candidate travel paths according to the carsickness information of the first user, for example, the server plans A, B, C three travel paths according to the riding information of the first user, and then the server may determine the target travel path from the three travel paths according to the carsickness information of the first user. Alternatively, the server may plan the target travel path by considering both the motion sickness information of the first user and the riding information of the first user at the same time when planning the travel path.
And S203, the target running path is sent to the second terminal, so that the second terminal displays the target running path in the electronic map.
Alternatively, the target travel path transmitted to the first terminal by the server may include a start point position of the first user, an end point position of the first user, the number and position information of traffic lights passing from the start point position of the first user to the end point position of the first user, the number and position information of curves passing from the start point position of the first user to the end point position of the first user, the number and position information of markets passing from the start point position of the first user to the end point position of the first user, the number and position information of bumpy roads passing from the start point position of the first user to the end point position of the first user, and the like. Optionally, after the second terminal receives the target running path sent by the server, the second terminal may first find a position corresponding to a start point of the target running path and a position corresponding to an end point of the target running path in the electronic map, and then display the received target running path in a path formed by the position corresponding to the start point and the position corresponding to the end point. Optionally, the server may send the target travel path to the second terminal through a bluetooth communication connection with the second terminal; alternatively, the server may transmit the target travel path to the second terminal through a Wi-Fi communication connection with the second terminal.
In the path planning method, the taxi taking request sent by the first terminal and received by the server carries the taxi sickness information and the taxi taking information of the first user, so that the server can plan the target running path according to the taxi sickness information of the first user and the taxi taking information of the first user, and the planned target running path considers the taxi sickness information of the first user, so that the planned target running path can meet the requirements of the first user more, and discomfort brought by the first user in the running process due to the planned running path is avoided; in addition, the planned target running path is sent to the second terminal, so that the second terminal can display the target running path in the electronic map, and the planned target running path can be displayed more intuitively and vividly.
In the above scenario of planning the target travel path according to the motion sickness information and the riding information of the first user, at least two candidate travel paths may be determined according to the riding information of the first user, and then the target travel path may be determined from the candidate travel paths according to the motion sickness information of the first user. In one embodiment, as shown in fig. 3, S202 includes:
s301, determining at least two candidate driving paths according to riding information.
Optionally, the server may find a position corresponding to the starting point position of the first user and a position corresponding to the ending point position of the first user in the electronic map according to the starting point position of the first user and the ending point position of the first user in the riding information of the first user, determine all travel paths from the starting point position of the first user to the ending point position of the first user in the electronic map, and determine all determined travel paths as candidate travel paths.
S302, if the carsickness information represents the carsickness of the first user, determining quantized values of candidate driving paths according to preset quantized indexes; the quantization index is an index related to road condition information of the driving path.
The preset quantization index is an index related to road condition information of the driving path, for example, the quantization index may be at least one of a curve, a bumpy road, a congestion index, a driving distance, and the number of traffic lights.
Optionally, if the motion sickness information of the first user represents motion sickness of the first user, the server may determine, for each candidate driving path, a quantized value of each candidate driving path according to a correspondence between the quantized index and a quantized value corresponding to the candidate driving path. Illustratively, when the quantization index is a curve, the correspondence between the quantization index and the quantization value corresponding to the candidate travel path may be as shown in table 1; when the quantization index is a bumpy road, the correspondence between the quantization index and the quantization value corresponding to the candidate travel path may be as shown in table 2; when the quantization index is a congestion index, the correspondence between the quantization index and the quantization value corresponding to the candidate travel path may be as shown in table 3; when the quantization index is a driving distance, the correspondence between the quantization index and the quantization value corresponding to the candidate driving path may be as shown in table 4;
TABLE 1
Radius of curve Quantized value
(20,30]Rice 1
(15,20]Rice 2
(10,15]Rice 3
Less than or equal to 10 meters 4
TABLE 2
Content Quantized value
Non-bumpy road 0
Jolting road 5
Continuous 500 m jolt road 10
TABLE 3 Table 3
Travel time Quantized value
Shortest time 0
Shortest time 1.1 1
Shortest time 1.2 5
Shortest time 1.3 10
TABLE 4 Table 4
Distance travelled Quantized value
Shortest distance 0
Shortest distance 1.1 1
Shortest distance 1.2 5
Shortest distance 1.3 10
S303, determining the candidate driving path corresponding to the minimum quantization value as a target driving path.
For example, if three candidate travel paths A, B, C are determined, the quantized value of the candidate travel path a is 0, the quantized value of the candidate travel path B is 1, and the quantized value of the candidate travel path C is 2, the server may determine the candidate travel path a as the target travel path. It is understood that the candidate travel path corresponding to the minimum quantization value is a candidate travel path having a minimum radius of curvature, a small bump, a shortest travel time, and a shortest travel distance, compared with other candidate travel paths.
In this embodiment, at least two candidate travel paths may be determined according to the riding information of the first user, so that, when the first user motion sickness information characterizes the first user motion sickness, a quantized value of each candidate travel path may be determined according to a preset quantized index, and further, a candidate travel path corresponding to a minimum quantized value may be determined as a target travel path.
In the above scenario of determining the quantized values of the candidate travel paths according to the preset quantization index, the server may determine the quantized values of the candidate travel paths according to the quantization index and the preset path planning function. In one embodiment, as shown in fig. 4, S302 includes:
s401, acquiring initial quantized values of all quantized indexes of the candidate driving paths according to quantized indexes and a preset path planning function for each candidate driving path; the initial quantized value is used for measuring the degree of motion sickness influence of the quantized index of the candidate driving path on the first user.
The preset path planning function may include a correspondence between a quantization index and a quantization value of the candidate driving path. For example, if there are three candidate driving paths A, B, C, the quantization indexes include curve, bumpy road, congestion index and driving distance, the server may obtain, according to the quantization indexes and a preset path planning function, an initial quantization value of the curve quantization index of the candidate driving path a, an initial quantization value of the bumpy road quantization index of the candidate driving path a, an initial quantization value of the congestion index quantization index of the candidate driving path a, and an initial quantization value of the driving distance quantization index of the candidate driving path a; similarly, the same method is adopted to obtain the initial quantized value of the curve quantized index of the candidate driving path B, the initial quantized value of the bump quantized index of the candidate driving path B, the initial quantized value of the congestion index quantized index of the candidate driving path B and the initial quantized value of the driving distance quantized index of the candidate driving path B; the method comprises the steps of initializing quantized values of curve quantized indexes of a candidate running path C, initializing quantized values of bump quantized indexes of the candidate running path C, initializing quantized values of congestion index quantized indexes of the candidate running path C and initializing quantized values of running distance quantized indexes of the candidate running path C.
S402, determining quantized values of candidate driving paths according to the initial quantized values of the quantized indexes and the weight values corresponding to the quantized indexes.
The value of the weight value corresponding to the quantization index is related to the motion sickness influence degree of the quantization index on the first user, for example, if the motion sickness influence degree of the quantization index on the first user is larger, the value of the weight value corresponding to the quantization index is also larger, and if the motion sickness influence degree of the quantization index on the first user is smaller, the value of the weight value corresponding to the quantization index is also smaller.
Continuing taking the example that the quantization indexes include a curve, a bumpy road, a congestion index and a driving distance, assuming that the weight value corresponding to the curve is ia, the weight value corresponding to the bumpy road is ib, the weight value corresponding to the congestion index is ic, and the weight value corresponding to the driving distance is id, the server may be according to the following formula: f=ia+ib f (a) +ic f (c) +id f (d) determining quantized values of each candidate travel path, where f represents quantized values of candidate travel paths, f (a) represents initial quantized values of curve quantized indicators, f (b) represents initial quantized values of bump quantized indicators, f (c) represents initial quantized values of congestion index quantized indicators, and f (d) represents initial quantized values of travel distance quantized indicators.
In this embodiment, the server may quickly obtain, for each candidate travel path, an initial quantization value of each quantization index of the candidate travel path according to the quantization index and a preset path planning function, so that the quantization value of each candidate travel path may be quickly determined according to the initial quantization value of each quantization index and a weight value corresponding to each quantization index, thereby improving efficiency of determining the quantization value of each candidate travel path.
In some scenes, the server can select drivers with more abundant driving experience to dispatch for carsickness passengers. In one embodiment, as shown in fig. 5, the method further includes:
s501, determining a second user matched with the carsickness information from a user database according to the carsickness information.
The user database may include, among other things, the driving experience, driving years, driving style, etc. of the candidate user. Optionally, in this embodiment, if the motion sickness information of the first user indicates motion sickness of the first user, the server may determine, according to the motion sickness information of the first user and driving experiences of candidate users in the user database, a second user that is matched with the motion sickness of the first user from candidate users near the location where the first user is located; or if the carsickness information of the first user indicates that the carsickness of the first user is normal, the server can determine a second user matched with the normal carsickness of the first user from candidate users nearby the position of the first user according to the riding information of the first user and the driving experience of the user in the user database.
S502, determining a second terminal corresponding to the second user according to the corresponding relation between the user and the terminal.
Alternatively, the correspondence between the user and the terminal may include a correspondence between the user and a terminal identifier corresponding to the user, or the correspondence between the user and the terminal may include a correspondence between the user and a MAC address of the terminal corresponding to the user. Optionally, the server may determine, according to a correspondence between the user and the terminal, an identifier of a second terminal corresponding to the first user, and further determine, according to the identifier of the second terminal corresponding to the first user, the second terminal. Or, the server may determine the MAC address value of the second terminal corresponding to the first user according to the correspondence between the user and the terminal, and further determine the second terminal according to the MAC address value of the second terminal corresponding to the first user.
In this embodiment, the server can accurately determine, from the user database, the second user that matches with the motion sickness information of the first user according to the motion sickness information of the first user, so that the second terminal corresponding to the second user can be accurately determined according to the correspondence between the user and the terminal, and the accuracy of the determined second terminal corresponding to the second user is improved.
In some scenarios, if the motion sickness information of the first user characterizes the motion sickness of the first user, the server may also send a prompt message to the second terminal, and prompt the second user for the motion sickness of the first user through the second terminal. In one embodiment, the method further comprises: if the carsickness information represents the carsickness of the first user, sending prompt information to the second terminal so that the second terminal can display the prompt information; the prompt information is used for reminding the second user of the first user carsickness.
Optionally, if the server determines that the motion sickness information of the first user represents the motion sickness of the first user, the server may also send a prompt message to the second terminal through communication connection between the server and the second terminal, so that the second terminal displays the prompt message to the second user, and reminds the second user of the motion sickness of the first user. Optionally, in one embodiment, the second user may also open windows in the vehicle to keep air in circulation before the first user gets on the vehicle, and alert the first user to sit in the front row while the first user gets on the vehicle, so as to alleviate the symptoms of motion sickness of the first user.
Optionally, as another implementation manner, if the first user does not input the motion sickness information of the first user to the first terminal, the first terminal does not carry the motion sickness information of the first user in a motion sickness request and send the motion sickness information to the server, the second user receives a dispatch order from the server, the motion sickness information of the first user can be queried before the first user gets on the vehicle, if the motion sickness information of the first user is determined, the second user can send the motion sickness information of the first user to the server through the second terminal, so that the server plans a target driving path suitable for the motion sickness of the first user, and sends the planned target driving path to the second terminal; or, the server may issue a plurality of travel paths including a target travel path suitable for the first user carsickness to the second terminal, and if the second user determines the first user carsickness by inquiry before the first user gets on the vehicle, the second user may select the target travel path from the plurality of travel paths and travel according to the target travel path.
In this embodiment, if the motion sickness information of the first user characterizes the motion sickness of the first user, the server may send a prompt message for reminding the second user of the motion sickness of the first user to the second terminal, so as to ensure that the second user can timely acquire the motion sickness information of the first user, so as to ensure that the second user can stably drive, and avoid motion sickness reaction of the first user in the riding process.
In some scenarios, the first user also needs to acquire own driving paths, and determine information such as road conditions and surrounding environments in the driving paths. In one embodiment, the method further comprises: and sending the target travel path to the first terminal so that the first terminal displays the target travel path in the electronic map.
Alternatively, the server may send the target travel path to the first terminal through a bluetooth communication connection with the first terminal, or may send the target travel path to the first terminal through a Wi-Fi communication connection with the second terminal. Optionally, the first terminal may find a position corresponding to the start point of the target travel path and a position corresponding to the end point of the target travel path in the electronic map, and then display the received target travel path in a path formed by the position corresponding to the start point and the position corresponding to the end point.
In this embodiment, the server sends the planned target driving path to the first terminal, so that the first terminal can display the target driving path in the electronic map, and thus the first user can determine the road condition, the surrounding environment information and the like in the driving path, and is convenient for the first user to timely master the road condition and the surrounding environment information in the driving path.
In one embodiment, as shown in fig. 6, a path planning method is provided, and the method is applied to the first terminal in fig. 1 for illustration, and includes the following steps:
s601, acquiring carsickness information and riding information of a first user based on a riding interface.
Wherein the motion sickness information of the first user can be used for representing whether the first user is motion sickness or not. Alternatively, the riding information of the first user may include the number of persons of the first user, the starting position of the first user, the ending position of the first user, the starting riding time of the first user, the time when the first user arrives at the ending point, whether there is a child in the first user, and so on.
Optionally, the riding interface may be provided with an option of user carsickness information and an option of user riding information, and the first terminal may obtain the first user carsickness information selected by the first user based on the user carsickness option of the riding interface, and obtain the first user riding information selected by the first user based on the riding information option of the riding interface.
S602, sending a taxi taking request carrying the carsickness information and the taxi taking information to the server so that the server plans a target driving path according to the carsickness information and the taxi taking information.
Optionally, the first terminal may package the acquired motion sickness information and riding information of the first user, and send the packaged data packet to the server in the driving request. Furthermore, the first terminal may encrypt the packaged data packet, and send the encrypted data packet to the server.
Optionally, the first terminal may send the taxi taking request to the server through a bluetooth communication connection with the server, or the first terminal may also send the taxi taking request to the server through a Wi-Fi communication connection with the server.
Optionally, the server may first plan a candidate travel path according to the riding information of the first user, and then determine a target travel path from the planned candidate travel paths according to the carsickness information of the first user, for example, the server plans A, B, C three travel paths according to the riding information of the first user, and then the server may determine the target travel path from the three travel paths according to the carsickness information of the first user. Alternatively, the server may plan the target travel path by considering both the motion sickness information of the first user and the riding information of the first user at the same time when planning the travel path.
In the path planning method, the first terminal can acquire the carsickness information and the riding information of the first user based on the riding interface, so that the first terminal can send a taxi taking request carrying the carsickness information and the riding information of the first user to the server, the server can plan the target running path according to the carsickness information and the riding information of the first user, the planned target running path considers the carsickness information of the first user, the planned target running path can meet the requirements of the first user more, and discomfort caused by the planned running path in the running process of the first user is avoided.
An embodiment of the present disclosure is described below in connection with a specific travel scenario, the method comprising the steps of:
s1, a first terminal obtains carsickness information and riding information of a first user based on a riding interface.
S2, the first terminal sends a taxi taking request carrying the carsickness information and the taxi taking information to the server.
S3, the server receives a taxi taking request sent by the first terminal.
S4, the server determines at least two candidate driving paths according to the riding information.
S5, if the carsickness information represents the carsickness of the first user, the server acquires initial quantized values of all quantized indexes of the candidate driving paths according to preset quantized indexes and preset path planning functions for each candidate driving path; the quantization index is an index related to road condition information of the driving path.
S6, the server determines the quantized value of each candidate driving path according to the initial quantized value of each quantized index and the weight value corresponding to each quantized index.
S7, the server determines the candidate running path corresponding to the minimum quantization value as a target running path.
And S8, the server determines a second user matched with the carsickness information from the user database according to the carsickness information.
And S9, if the carsickness information represents the carsickness of the first user, the server determines the second user according to the riding information and the driving experience of the candidate user in the user database.
S10, the server determines a second terminal corresponding to the second user according to the corresponding relation between the user and the terminal.
S11, if the carsickness information represents the carsickness of the first user, the server sends prompt information to the second terminal so that the second terminal can display the prompt information; the prompt information is used for reminding the second user of the first user carsickness.
S12, the server sends the target travel path to the first terminal so that the first terminal displays the target travel path in the electronic map.
The working principle of the path planning method provided in this embodiment is please refer to the detailed description in the above embodiment, which is not repeated here.
It should be understood that, although the steps in the flowcharts of fig. 2-6 are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 2-6 may include multiple steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor does the order in which the steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of the steps or stages in other steps or other steps.
In one embodiment, as shown in fig. 7, there is provided a path planning apparatus including: the system comprises a receiving module, a planning module and a first sending module, wherein:
the receiving module is used for receiving a taxi taking request sent by the first terminal; the taxi taking request carries carsickness information and riding information of the first user.
And the planning module is used for planning a target driving path according to the carsickness information and the riding information.
And the first sending module is used for sending the target running path to the second terminal so that the second terminal displays the target running path in the electronic map.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the above embodiment, optionally, the planning module includes: a first determination unit, a second determination unit, and a third determination unit, wherein:
and the first determining unit is used for determining at least two candidate driving paths according to the riding information.
The second determining unit is used for determining quantized values of all candidate driving paths according to preset quantized indexes if the carsickness information represents the carsickness of the first user; the quantization index is an index related to road condition information of the driving path.
And a third determining unit configured to determine a candidate travel path corresponding to the minimum quantization value as a target travel path.
Optionally, the quantization index includes at least one of curve, bump road, congestion index, driving distance, and traffic light number.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the foregoing embodiment, optionally, the second determining unit is configured to obtain, for each candidate driving path, an initial quantization value of each quantization index of the candidate driving path according to the quantization index and a preset path planning function; determining the quantized value of each candidate driving path according to the initial quantized value of each quantized index and the weight value corresponding to each quantized index; the initial quantized value is used for measuring the degree of motion sickness influence of the quantized index of the candidate driving path on the first user.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the above embodiment, optionally, the above apparatus further includes: a first determination module and a second determination module, wherein:
and the first determining module is used for determining a second user matched with the carsickness information from the user database according to the carsickness information.
And the second determining module is used for determining a second terminal corresponding to the second user according to the corresponding relation between the user and the terminal.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the foregoing embodiment, optionally, the first determining module includes: a fourth determination unit in which:
and the fourth determining unit is used for determining the second user according to the riding information and the driving experience of the candidate user in the user database if the carsickness information represents the carsickness of the first user.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the above embodiment, optionally, the above apparatus further includes: a second transmitting module, wherein:
the second sending module is used for sending prompt information to the second terminal if the carsickness information represents the carsickness of the first user, so that the second terminal can display the prompt information; the prompt information is used for reminding the second user of the first user carsickness.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
On the basis of the above embodiment, optionally, the above apparatus further includes: a third transmitting module, wherein:
and the third sending module is used for sending the target running path to the first terminal so that the first terminal displays the target running path in the electronic map.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
For specific limitations of the path planning apparatus, reference may be made to the above limitations of the path planning method, and no further description is given here. The various modules in the path planning apparatus described above may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in a server, or may be stored in software in a memory in an electronic device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, as shown in fig. 8, there is provided a path planning apparatus including: the device comprises an acquisition module and a sending module, wherein:
the acquisition module is used for acquiring the carsickness information and the riding information of the first user based on the riding interface.
And the sending module is used for sending a taxi taking request carrying the carsickness information and the taxi taking information to the server so that the server plans a target driving path according to the carsickness information and the taxi taking information.
The path planning device provided in this embodiment may execute the above method embodiment, and its implementation principle and technical effects are similar, and will not be described herein.
For specific limitations of the path planning apparatus, reference may be made to the above limitations of the path planning method, and no further description is given here. The various modules in the path planning apparatus described above may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the first terminal, or may be stored in software in a memory in the electronic device, so that the processor invokes and executes operations corresponding to the above modules.
Fig. 9 is a block diagram of a server 1400 shown in accordance with an exemplary embodiment. With reference to fig. 9, server 1400 includes a processing component 1420 that further includes one or more processors and memory resources, represented by memory 1422, for storing instructions or computer programs, such as application programs, executable by the processing component 1420. The application programs stored in memory 1422 can include one or more modules, each corresponding to a set of instructions. Further, the processing component 1420 is configured to execute instructions to perform the method of path planning described above.
The server 1400 may also include a power component 1424 configured to perform power management of the device 1400, a wired or wireless network interface 1426 configured to connect the device 1400 to a network, and an input/output (I/O) interface 1428. The server 1400 may operate an operating system based on storage 1422, such as Window14 14erverTM,Mac O14 XTM,UnixTM,LinuxTM,FreeB14DTM or the like.
Fig. 10 is a block diagram of a terminal 1300 according to an exemplary embodiment. For example, terminal 1300 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like.
Referring to fig. 10, a terminal 1300 may include one or more of the following components: a processing component 1302, a memory 1304, a power component 1306, a multimedia component 1308, an audio component 1310, an input/output (I/O) interface 1312, a sensor component 1314, and a communication component 1316. Wherein the memory has stored thereon a computer program or instructions that run on the processor.
The processing component 1302 generally controls overall operation of the electronic device 1300, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing component 1302 may include one or more processors 1320 to execute instructions to perform all or part of the steps of the methods described above. Further, the processing component 1302 can include one or more modules that facilitate interactions between the processing component 1302 and other components. For example, the processing component 1302 may include a multimedia module to facilitate interaction between the multimedia component 1308 and the processing component 1302.
The memory 1304 is configured to store various types of data to support operations at the electronic device 1300. Examples of such data include instructions for any application or method operating on the electronic device 1300, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 1304 may be implemented by any type or combination of volatile or nonvolatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.
The power supply assembly 1306 provides power to the various components of the electronic device 1300. The power components 1306 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the electronic device 1300.
The multimedia component 1308 includes a touch-sensitive display screen that provides an output interface between the electronic device 1300 and a user. In some embodiments, the touch display screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). The touch panel includes one or more touch sensors to sense touches, swipes, and gestures on the touch panel. The touch sensor may sense not only the boundary of a touch or slide action, but also the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 1308 includes a front-facing camera and/or a rear-facing camera. When the electronic device 1300 is in an operational mode, such as a shooting mode or a video mode, the front camera and/or the rear camera may receive external multimedia data. Each front camera and rear camera may be a fixed optical lens system or have focal length and optical zoom capabilities.
The audio component 1310 is configured to output and/or input audio signals. For example, the audio component 1310 includes a Microphone (MIC) configured to receive external audio signals when the electronic device 1300 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signals may be further stored in the memory 1304 or transmitted via the communication component 1316. In some embodiments, the audio component 1310 also includes a speaker for outputting audio signals.
The I/O interface 1312 provides an interface between the processing component 1302 and peripheral interface modules, which may be a keyboard, click wheel, buttons, etc. These buttons may include, but are not limited to: homepage button, volume button, start button, and lock button.
The sensor assembly 1314 includes one or more sensors for providing status assessment of various aspects of the electronic device 1300. For example, the sensor assembly 1314 may detect an on/off state of the electronic device 1300, a relative positioning of the components, such as a display and keypad of the electronic device 1300, the sensor assembly 1314 may also detect a change in position of the electronic device 1300 or a component of the electronic device 1300, the presence or absence of a user's contact with the electronic device 1300, an orientation or acceleration/deceleration of the electronic device 1300, and a change in temperature of the electronic device 1300. The sensor assembly 1314 may include a proximity sensor configured to detect the presence of nearby objects in the absence of any physical contact. The sensor assembly 1314 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 1314 may also include an acceleration sensor, a gyroscopic sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
The communication component 1316 is configured to facilitate communication between the electronic device 1300 and other devices, either wired or wireless. The electronic device 1300 may access a wireless network based on a communication standard, such as WiFi,2G, or 3G, or a combination thereof. In one exemplary embodiment, the communication component 1316 receives broadcast signals or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 1316 further includes a Near Field Communication (NFC) module to facilitate short range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, ultra Wideband (UWB) technology, bluetooth (BT) technology, and other technologies.
In an exemplary embodiment, the terminal 1300 may be implemented by one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic elements for performing the path planning methods described above.
In an exemplary embodiment, a storage medium is also provided that includes instructions, such as memory 1422 including instructions, that can be executed by a processor of server 1400 to perform the above-described methods. The storage medium may be a non-transitory computer readable storage medium, which may be, for example, ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.
In an exemplary embodiment, a non-transitory computer readable storage medium is also provided, such as a memory 1304 including instructions, that are executable by the processor 1320 of the terminal 1300 to perform the above-described method. For example, the non-transitory computer readable storage medium may be ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.
In an exemplary embodiment, a computer program product is also provided, which, when being executed by a processor, may implement the above-mentioned method. The computer program product includes one or more computer instructions. When loaded and executed on a computer, these computer instructions may implement some or all of the methods described above, in whole or in part, in accordance with the processes or functions described in embodiments of the present disclosure.
In the case of the personal information processing, the solutions described in the present specification and the embodiments are all processed on the premise of having a legal basis (for example, obtaining agreement of a personal information subject, or being necessary for executing a contract, etc.), and are processed only within a prescribed or contracted range. The user refuses to process the personal information except the necessary information of the basic function, and the basic function is not influenced by the user.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided by the present disclosure may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, or the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples merely represent a few implementations of the disclosed examples, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made to the disclosed embodiments without departing from the spirit of the disclosed embodiments. Accordingly, the protection scope of the disclosed embodiment patent should be subject to the appended claims.

Claims (10)

1. A method of path planning, the method comprising:
receiving a taxi taking request sent by a first terminal; wherein, the taxi taking request carries carsickness information and riding information of the first user;
planning a target driving path according to the carsickness information and the riding information;
and sending the target driving path to a second terminal so that the second terminal displays the target driving path in an electronic map.
2. The method of claim 1, wherein the planning a target travel path based on the motion sickness information and the ride information comprises:
determining at least two candidate driving paths according to the riding information;
If the carsickness information represents the carsickness of the first user, determining quantized values of the candidate driving paths according to preset quantized indexes; wherein the quantization index is an index related to road condition information of a driving path;
and determining the candidate running path corresponding to the minimum quantized value as the target running path.
3. The method according to claim 2, wherein determining the quantized value of each candidate travel path according to the preset quantization index comprises:
for each candidate driving path, acquiring an initial quantized value of each quantized index of the candidate driving path according to the quantized index and a preset path planning function; the initial quantized value is used for measuring the degree of motion sickness influence of the quantized index of the candidate driving path on the first user;
and determining the quantized value of each candidate driving path according to the initial quantized value of each quantized index and the weight value corresponding to each quantized index.
4. A method according to claim 2 or 3, wherein the quantitative indicator comprises at least one of a curve, a bumpy road, a congestion index, a distance travelled, a number of traffic lights.
5. The method according to claim 1, wherein the method further comprises:
determining a second user matched with the carsickness information from a user database according to the carsickness information;
and determining the second terminal corresponding to the second user according to the corresponding relation between the user and the terminal.
6. The method of claim 5, wherein the determining a second user that matches the motion sickness information from a user database based on the motion sickness information comprises:
and if the carsickness information characterizes the carsickness of the first user, determining the second user according to the riding information and the driving experience of the candidate user in the user database.
7. The method of claim 6, wherein the method further comprises:
if the carsickness information characterizes the first user carsickness, sending prompt information to the second terminal so that the second terminal displays the prompt information; the prompt information is used for reminding the second user of the first user carsickness.
8. The method according to claim 1, wherein the method further comprises:
and sending the target travel path to the first terminal so that the first terminal displays the target travel path in an electronic map.
9. A method of path planning, the method comprising:
acquiring carsickness information and riding information of a first user based on a riding interface;
and sending a taxi taking request carrying the carsickness information and the taxi taking information to a server, so that the server plans a target driving path according to the carsickness information and the taxi taking information.
10. An apparatus comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any one of claims 1 to 8 when the computer program is executed.
CN202210763910.XA 2022-06-30 2022-06-30 Path planning method and device Pending CN117367442A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210763910.XA CN117367442A (en) 2022-06-30 2022-06-30 Path planning method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210763910.XA CN117367442A (en) 2022-06-30 2022-06-30 Path planning method and device

Publications (1)

Publication Number Publication Date
CN117367442A true CN117367442A (en) 2024-01-09

Family

ID=89387892

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210763910.XA Pending CN117367442A (en) 2022-06-30 2022-06-30 Path planning method and device

Country Status (1)

Country Link
CN (1) CN117367442A (en)

Similar Documents

Publication Publication Date Title
US9464908B2 (en) Apparatus, system and method for clustering points of interest in a navigation system
US10198489B2 (en) Collaborative location-based search results
JP6338779B2 (en) Method and apparatus for intelligently alerting vehicle traffic restrictions
US20180109915A1 (en) Systems, methods and devices for virtual fencing
KR20150103070A (en) Navigation system application for mobile device
CN111882907B (en) Navigation early warning method, device, equipment and storage medium for vehicle
CN108615140B (en) Travel reminding method and device and storage medium
CN103916473A (en) Travel information processing method and relative device
CN105261209B (en) The volume of the flow of passengers determines method and device
CN107403232B (en) Navigation control method and device and electronic equipment
US10365118B2 (en) Navigation interworking apparatus for mobile terminal and recording medium for mobile device
KR20200094452A (en) Method and electronic device for transmitting group message
CN109241206B (en) Route query method and device
US9247423B2 (en) System and method for protecting private information by using NFC tags
TW201642187A (en) A reminding method and system of a location based memo and an electronic device using the method
KR101746503B1 (en) Mobile terminal and method for controlling the same
CN117367442A (en) Path planning method and device
KR101599372B1 (en) Apparatus and method for outputting car driving associated information
CN114872651A (en) Vehicle control method, device, storage medium and chip
CN115734161A (en) Method and device for detecting parking state, spike device and storage medium
CN111951142A (en) Device returning method, device and storage medium
CN114780870B (en) Order quantity prediction method, system, device, server, terminal and storage medium
CN111457922A (en) Walking navigation route planning method and device, vehicle and storage medium
CN114684124B (en) Method and device for determining vehicle running parameters, electronic equipment and storage medium
CN117928581A (en) Navigation method, related equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination