Route map-based parking methods, parking systems, and electronic devices

Abstract

This disclosure provides a route map-based parking method, comprising: an on-board parking module receiving a start control signal generated and sent by a terminal parking module; the on-board parking module starting based on the start control signal; the terminal parking module generating a path navigation route map; and the on-board parking module executing a parking control process based on the path navigation route map; or, the on-board parking module sending historical trajectory information of the vehicle associated with its current location and including at least one historical parking target location to the terminal parking module; and the on-board parking module executing a parking control process based on a historical parking target location selection instruction received by the terminal parking module. This disclosure also provides a parking system, an electronic device, a readable storage medium, and a computer program product.

Description

Technical Field

[0001] This disclosure relates to the field of automated parking technology, and more particularly to a route map-based parking method, parking system, and electronic device. Background Technology

[0002] Parking is generally a necessary stage in any driving activity, but it is also one of the more complex and challenging. In many public places, designated parking areas often differ from people's final destinations. For example, park parking lots are usually designed in open areas tens to hundreds of meters away from the park gate for reasons such as traffic convenience and fire prevention, which creates an additional walking burden for drivers. Therefore, automated valet parking has always been a research hotspot in the field of autonomous driving technology.

[0003] Currently, several parking methods or technologies applied to the field of autonomous driving have been developed or researched. These can be broadly categorized into four types: first, parking assistance modes where the vehicle parks itself near the target space; second, remote parking modes where the owner controls the vehicle remotely via a mobile device or remote key; third, memory-based autonomous parking modes where the driver manually trains and memorizes the vehicle's route; and fourth, valet-based autonomous parking modes that interact with the parking lot and perform global planning based on a high-definition map of the target parking area.

[0004] However, existing parking methods either require users to be in the car or assist them, preventing them from getting out of the car in their ideal position and placing an extra burden on them, or require users to manually train them in advance to memorize the parking information, thus having significant limitations in unfamiliar environments. Alternatively, parking lots may be equipped with intelligent parking systems that push high-definition maps, but the infrastructure costs for this type of parking method are very high, and it is currently only used in public parking lots of a few large shopping malls, and it is difficult to promote.

[0005] To understand the current state of technological development, this disclosure has searched, compared, and analyzed existing patents and papers, and selected the following existing technical solutions:

[0006] Technical Solution 1: Patent document CN113753030A discloses "A Memory Parking System, Method, Terminal, and Storage Medium." This system generates a local map and reference route from the drop-off point to the parking space by memorizing the parking path pre-trained by the user, enabling the vehicle to autonomously drive to and park. The user activates the memory mode at the starting point of the parking route. The system memorizes the surrounding environment data, location data, and path trajectory of the vehicle from startup until the vehicle stops in the target parking space. The memory system then constructs a local map from the memorized data along the route. When the memory system recognizes the vicinity of the starting position again, the vehicle can mimic the previously learned parking route to complete autonomous parking. This method successfully achieves separation of the user and the vehicle, allowing the user to get off at an ideal drop-off point without having to follow the car to the parking area, greatly liberating the user. However, this method has certain limitations because the system's map requires the user to actively learn it through pre-driving. Therefore, this method can only be effectively applied to parking lots commonly used by users, such as those in companies and residential communities. However, the system cannot be effectively used when users arrive in unfamiliar areas they have not yet learned to drive, such as when traveling for business, visiting relatives or friends, or when users choose a new drop-off point. Furthermore, this method has high requirements for environmental conditions, and in some cases may even require users to repeatedly drive and learn, placing an additional burden on them.

[0007] Technical Solution 2: Patent document CN113085900A discloses "A Method for Summoning a Vehicle to a User's Location." This system allows the vehicle to receive commands from the user and autonomously drive to the user's location based on map planning. The user issues a summoning command to the vehicle via a mobile app. The vehicle plans a route on the map and drives towards the user. During the journey, the user can monitor the vehicle's surroundings in real time and continuously control the vehicle. When the vehicle determines it has reached the user's vicinity, it attempts to identify the user. If identification is successful, the vehicle drives to the user and stops. This method also achieves separation of the user and vehicle and eliminates the need for the user to manually train the vehicle's route. However, this method also has significant limitations. The summoning route planning relies on the onboard map, and route errors are easily caused when the map is inaccurate. Furthermore, this method cannot be used for uncertain destinations, thus greatly limiting its usability.

[0008] Technical Solution 3: Patent document CN113313629B discloses an "Automatic Intersection Recognition Method, System, and Model Saving Method / System." This system collects 3D point cloud data around an unmanned vehicle to construct a 2D grid map, estimates the intersection center based on the grid map, and then segments the road to obtain and analyze each fork in the road. This method has significant limitations because it uses straight lines to simulate the road edges. While this works well for simple, square intersections, it easily leads to serious misjudgments for complex, winding intersections within an area. Therefore, further optimization is needed. Summary of the Invention

[0009] To address at least one of the aforementioned technical problems, this disclosure provides a route map-based parking method, parking system, and electronic device.

[0010] According to one aspect of this disclosure, a route map-based parking method is provided, comprising:

[0011] S1100: The vehicle parking module receives a start control signal generated and sent by the terminal parking module, and starts based on the start control signal;

[0012] S1400: The terminal parking module generates a path navigation route map, and based on the path navigation route map, the vehicle parking module executes a parking control process; or, the vehicle parking module sends the vehicle's historical trajectory information, which is associated with the vehicle's current location and includes at least one historical parking target location, to the terminal parking module, and based on the historical parking target location selection instruction received by the terminal parking module, the vehicle parking module executes a parking control process;

[0013] The route navigation map is a route map drawn by the user through the terminal parking module.

[0014] According to at least one embodiment of the route map-based parking method of this disclosure, between step S1100 and step S1400, the method further includes:

[0015] S1200: The terminal parking module outputs a first voice signal for interaction;

[0016] S1300: The terminal parking module determines whether it has received a first characteristic voice signal in response to the first voice signal (using the parking system).

[0017] According to at least one embodiment of the route map-based parking method of this disclosure, step S1200 further includes:

[0018] The vehicle parking module obtains the current location of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current location, including at least one historical parking target location.

[0019] According to at least one embodiment of the route map-based parking method of this disclosure, the on-board parking module obtains the current position of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current position and including at least one historical parking target position. If the determination result is: there is no historical trajectory information of the vehicle associated with the current position and including at least one historical parking target position, then step S1400 includes:

[0020] S1402: The terminal parking module outputs a drawing interface, which is used to receive the user's drawing operation;

[0021] S1404: The terminal parking module generates and displays a route navigation map containing route map feature elements based on the drawing operation received from the drawing interface for user confirmation.

[0022] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0023] S1406: The terminal parking module receives the confirmation command, and the terminal parking module parses the route map based on the preset route map feature elements, generates a path navigation program execution command, and sends it to the vehicle parking module to execute the parking control process based on the path navigation program command.

[0024] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0025] S1406: If the terminal parking module does not receive a confirmation instruction or receives a denial instruction, it will output the drawing interface again to receive drawing operations (including operations to modify the already drawn route map) to execute step S1404 again.

[0026] According to at least one embodiment of the route map-based parking method of this disclosure, the on-board parking module obtains the current position of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current position and including at least one historical parking target position. If the determination result is: there is historical trajectory information of the vehicle associated with the current position and including at least one historical parking target position, then step S1400 includes:

[0027] S1402: The vehicle parking module outputs the vehicle's historical trajectory information, which is associated with the vehicle's current location and includes at least one historical parking target location, to the terminal parking module for selection.

[0028] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0029] S1404: When the terminal parking module receives a historical parking target location selection instruction, the vehicle parking module executes a parking control process based on the historical parking target location selection instruction.

[0030] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0031] S1404: If the terminal parking module does not receive a historical parking target location selection instruction (including receiving an operation instruction to abandon the historical parking target location), the terminal parking module outputs a drawing interface, which is used to receive the user's drawing operation.

[0032] S1406: The terminal parking module generates and displays a route navigation map containing route map feature elements based on the drawing operation received from the drawing interface for user confirmation.

[0033] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0034] S1408: The terminal parking module receives a confirmation command, and the terminal parking module parses the route map based on preset route map feature elements, generates a path navigation program execution command, and sends it to the vehicle parking module to execute the parking control process based on the path navigation program command.

[0035] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes:

[0036] S1408: If the terminal parking module does not receive a confirmation instruction or receives a denial instruction, it will output the drawing interface again to receive drawing operations (including operations to modify the already drawn route map) to execute step S1406 again.

[0037] A route map-based parking method according to at least one embodiment of the present disclosure, wherein a parking control process is executed based on the route navigation route map, includes:

[0038] The on-board parking module determines whether the vehicle meets the starting conditions. Once the starting conditions are met, the on-board parking module generates a control signal to control the vehicle to start.

[0039] The vehicle parking module obtains the feasible area of ​​the current road, performs local path planning in real time based on road conditions, and generates control signals to control the vehicle to travel along the feasible area.

[0040] When the vehicle parking module executes the parking instruction in the route navigation program, it generates a parking control signal based on the parking instruction to make the vehicle perform a parking action.

[0041] The route map-based parking method according to at least one embodiment of the present disclosure further includes:

[0042] The vehicle parking module acquires the branch road identification results and performs path planning based on the branch road identification results and the branch road information in the path navigation program execution instructions to update the feasible domain.

[0043] A route-map-based parking method according to at least one embodiment of this disclosure, which updates the feasible region based on branch identification results and branch information in the path navigation program execution instructions, includes:

[0044] Construct a two-dimensional grid map for the intersection;

[0045] Based on each edge line of the intersection, all rasters covering that edge line are assigned an initial value. Then, rasters adjacent to all assigned rasters within the feasible region of the 2D raster map are assigned values. Rasteres sharing an edge are assigned a first value, and rasters sharing a corner are assigned a second value. If a raster shares an edge or a corner with multiple rasters, the value with the smallest result after adding the first value to the edge-sharing raster or the second value to the corner-sharing raster is selected for raster assignment. This process continues until all rasters within the feasible region are assigned values, thus completing the raster assignment based on the edge lines of each road at the intersection.

[0046] The raster assignment results based on each edge line are overlaid with raster map values ​​to obtain an initial overlaid assignment map.

[0047] The center point of the grid with the smallest superposition value in the initial superposition assignment map is taken as the center point of the intersection. If there are multiple grids with the smallest superposition values, their geometric center is taken as the center point of the intersection.

[0048] Based on the center point of the intersection, obtain the intersection's traffic area and each sub-path;

[0049] The feasible region is updated based on the intersection access region and each sub-path.

[0050] According to at least one embodiment of the route map-based parking method of this disclosure, a parking control process is executed based on historical parking target location selection instructions, including:

[0051] S1441: Compare the current position of the vehicle with at least one historical trajectory of the vehicle that includes the selected historical parking target position, and obtain the optimal historical trajectory based on the number of times the vehicle's historical trajectory has been driven and the distance between the current position of the vehicle and the historical trajectory of the vehicle.

[0052] S1442: Determine whether the minimum distance between the optimal historical trajectory and the current position of the vehicle exceeds the preset distance. If it exceeds, proceed to step S1443; if it does not exceed, proceed to step S1444.

[0053] S1443: The on-board parking module controls the vehicle to move forward along the current feasible domain and continuously marks the historical trajectory point closest to the vehicle's current position to find the optimal historical trajectory. Whenever the vehicle encounters a fork in the road, the on-board parking module controls the vehicle to turn into the fork in the road that the line connecting the marked point points points in the direction of the fork, until the minimum distance between the vehicle's current position and the optimal historical trajectory is less than or equal to the preset distance, and then proceeds to step S1444.

[0054] S1444: The on-board parking module controls the vehicle to reposition itself in order to move the vehicle to the optimal historical trajectory and align it with the historical pose.

[0055] S1445: Plan the optimal global route from the optimal historical trajectory, and control the vehicle to travel to the target location based on the optimal global route.

[0056] According to at least one embodiment of the route map-based parking method of this disclosure, step S1400 further includes the following parking processing flow: S1431: The on-board parking module executes the parking instruction in the route navigation program execution instruction; S1432: Determine the parking instruction type. If the parking instruction type is roadside parking, proceed to step S1433; if the parking instruction type is parking lot parking, proceed to step S1434; if the parking instruction type is parking in an open space / plaza, proceed to step S1435; S1433: Identify the roadside parking area, and the on-board parking module generates a control signal to control the vehicle to enter the roadside parking area; S1434: Enter the parking lot... S1435: Upon successful identification of the parking area / plaza, the on-board parking module generates a control signal to control the vehicle to enter the parking space; S1436: Upon successful execution of steps S1433 / S1434 / S1435, the on-board parking module generates a control signal to control the vehicle to park and sends parking success information to the user terminal device; If steps S1433 / S1434 / S1435 fail, the on-board parking module generates parking failure information and sends it to the user terminal device.

[0057] According to another aspect of this disclosure, a route map-based parking system is provided, comprising: a terminal parking module that generates and sends a parking control signal; and an on-board parking module that receives the start control signal and starts.

[0058] The terminal parking module includes: a route map generation module, which generates a path navigation route map based on the user's drawing operation; and a route map parsing module, which parses the path navigation route map to generate path navigation program instructions.

[0059] The vehicle parking module includes: a historical trajectory output module, which outputs the vehicle's historical trajectory information associated with the vehicle's current location and including at least one historical parking target location; and a parking processing module, which executes a parking control process based on the path navigation program instructions generated by the terminal parking module or the selected historical parking target location and its corresponding historical trajectory information.

[0060] According to at least one embodiment of the route map-based parking system of this disclosure, the terminal parking module further includes:

[0061] The system includes a voice signal output module, which outputs a first voice signal for interaction (inquiring whether to use the parking system); a voice signal receiving module, which receives the user's voice signal; and a first characteristic voice signal acquisition module, which determines whether a first characteristic voice signal (using the parking system) in response to the first voice signal has been received.

[0062] According to at least one embodiment of the route map-based parking system of this disclosure, the terminal parking module further includes: a touch command receiving module, which is at least used to receive historical parking target location selection commands.

[0063] According to another aspect of this disclosure, an electronic device is provided, comprising: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, causing the processor to perform a parking method according to any embodiment of this disclosure.

[0064] According to another aspect of this disclosure, a readable storage medium is provided, wherein executable instructions are stored therein, which, when executed by a processor, are used to implement a parking method according to any embodiment of this disclosure.

[0065] According to another aspect of this disclosure, a computer program product is provided, including a computer program / instructions that, when executed by a processor, implement a parking method according to any embodiment of this disclosure. Attached Figure Description

[0066] The accompanying drawings illustrate exemplary embodiments of the present disclosure and, together with the description thereof, serve to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification.

[0067] Figure 1 This is a schematic flowchart of a route map-based parking method according to one embodiment of the present disclosure. Figure 2 This is a schematic flowchart of a route map-based parking method, which is yet another embodiment of this disclosure. Figure 3 This is a schematic flowchart of another embodiment of the route map-based parking method disclosed herein. Figure 4 This is a schematic flowchart of another embodiment of the route map-based parking method disclosed herein. Figure 5 This is a schematic flowchart of a route map-based parking method, which is yet another embodiment of this disclosure. Figure 6 This is a schematic diagram of a drawing interface generated by a roadmap generation module according to one embodiment of this disclosure. Figures 7 to 12 This is a schematic diagram illustrating the process of drawing a roadmap for one embodiment of this disclosure. Figure 13 A schematic diagram illustrating post-processing of a user-drawn route map according to one embodiment of this disclosure is shown. Figure 14 A roadmap of one embodiment of this disclosure is shown. Figure 15 This is a schematic diagram of a parking control process based on a path navigation route map, according to one embodiment of this disclosure. Figure 16 This is a route map of one embodiment of the present disclosure, showing the vehicle traveling along the right edge of the road within its field of vision when not encountering an intersection. Figure 17 This is a schematic diagram illustrating the obstacle avoidance and detour of the vehicle when encountering an obstacle, according to one embodiment of this disclosure. Figure 18 This is a schematic diagram of obtaining a new curved path that satisfies the minimum turning radius of the vehicle during a cornering process according to one embodiment of this disclosure. Figure 19 A schematic diagram of a fork in the road is shown, representing one embodiment of this disclosure. Figure 20 A schematic diagram illustrating the isolation zone determination of one embodiment of this disclosure is shown. Figure 21 A schematic flowchart of a fork-in-the-road processing method according to one embodiment of the present disclosure is shown. Figure 22 A two-dimensional grid map constructed for a fork in the road is shown as one embodiment of this disclosure. Figure 23 and Figure 24 An exemplary diagram illustrates grid assignment based on an edge line (the road edge line to the right front of the vehicle). Figures 25 to 27 The grid assignment results for the right-side road edge line, left-side road edge line, and left-front road edge line of this vehicle are shown as an example. Figure 28 An exemplary diagram of the fork intersection assignment of this disclosure is shown. Figure 29 and Figure 30 This is a branching analysis diagram of one embodiment of the present disclosure, which exemplarily illustrates the traffic area and sub-paths. Figure 31 This is a partial planning path diagram of one embodiment of the present disclosure. Figure 32 This illustration shows a left turn at a fork in the road according to one embodiment of the present disclosure. Figure 33 This is a schematic diagram of a roundabout. Figure 34 The terminal parking module of one embodiment of this disclosure shows the vehicle's driving process. Figure 35 This is a schematic flowchart of a parking processing method according to one embodiment of the present disclosure. Figure 36 This is an example image of a parking lot sign. Figure 37 This is an example diagram of an open parking lot. Figure 38 This is an example diagram of parking area signs (area numbers) in a parking lot. Figure 39 This is an example diagram for finding the optimal historical trajectory. Figure 40 It is a repositioning trajectory point matching map. Figure 41 and Figure 42 The schematic block diagrams of the terminal parking module and the vehicle-mounted parking module are shown respectively. Detailed Implementation

[0068] The present disclosure will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the disclosure. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present disclosure are shown in the accompanying drawings.

[0069] It should be noted that, where there is no conflict, the embodiments and features described in this disclosure can be combined with each other. The technical solutions of this disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0070] Unless otherwise stated, the exemplary implementations / embodiments shown are to be understood as providing exemplary features of various details that provide ways in which the technical concepts of this disclosure can be implemented in practice. Therefore, unless otherwise stated, the features of various implementations / embodiments may be additionally combined, separated, interchanged and / or rearranged without departing from the technical concepts of this disclosure.

[0071] The use of crosshairs and / or shading in the accompanying drawings is generally used to clarify the boundaries between adjacent components. Thus, unless otherwise stated, the presence or absence of crosshairs or shading does not convey or indicate any preference or requirement for the specific material, material properties, dimensions, proportions, commonalities between the illustrated components, or any other characteristics, properties, etc., of the components. Furthermore, in the accompanying drawings, the dimensions and relative dimensions of components may be exaggerated for clarity and / or descriptive purposes. When exemplary embodiments can be implemented differently, a specific process sequence may be performed in a different order than that described. For example, two consecutively described processes may be performed substantially simultaneously or in the reverse order of their description. Furthermore, the same reference numerals denote the same components.

[0072] When a component is referred to as being "on" or "above" another component, "connected to," or "joined to" another component, the component may be directly on, directly connected to, or directly joined to the other component, or there may be intermediate components. However, when a component is referred to as being "directly on" another component, "directly connected to," or "directly joined to" another component, there are no intermediate components. Therefore, the term "connection" can refer to a physical connection, an electrical connection, etc., and may or may not have intermediate components.

[0073] The terminology used herein is for the purpose of describing particular embodiments and is not intended to be limiting. As used herein, unless the context clearly indicates otherwise, the singular forms “a” and “the” are intended to include the plural forms as well. Furthermore, when the terms “comprising” and / or “including” and variations thereof are used in this specification, it indicates the presence of the stated features, integrals, steps, operations, parts, components, and / or groups thereof, but does not exclude the presence or addition of one or more other features, integrals, steps, operations, parts, components, and / or groups thereof. It should also be noted that, as used herein, the terms “substantially,” “about,” and other similar terms are used as approximate terms rather than as terms of degree, thus explaining the inherent biases in measurements, calculated values, and / or provided values ​​that would be recognized by one of ordinary skill in the art.

[0074] The following text combines Figures 1 to 42 The parking method and parking system disclosed herein are described in detail.

[0075] Figure 1 This is a schematic flowchart of a route map-based parking method according to one embodiment of the present disclosure.

[0076] refer to Figure 1 The route map-based parking method S1000 disclosed herein includes the following steps:

[0077] S1100: The vehicle parking module receives the start control signal generated and sent by the terminal parking module, and starts the vehicle parking module based on the start control signal;

[0078] S1400: The terminal parking module generates a route navigation map. Based on the route navigation map, the vehicle parking module executes the parking control process; or, the vehicle parking module sends the vehicle's historical trajectory information, which is associated with the vehicle's current location and includes at least one historical parking target location, to the terminal parking module. Based on the historical parking target location selection instruction received by the terminal parking module, the vehicle parking module executes the parking control process.

[0079] The route navigation map is a route map drawn by the user through the terminal parking module.

[0080] The start control signal described in this disclosure is preferably a start control signal sent by the user through a terminal device such as a mobile phone, and the vehicle parking module starts based on the start control signal.

[0081] The terminal device includes the terminal parking module (parking APP, mini program, etc.) described in this disclosure. The start control signal can be generated based on the terminal parking module and sent to the vehicle parking module via the terminal device.

[0082] In some embodiments of this disclosure, a start control signal can be generated and sent at the same time as the terminal parking module is started. In other embodiments of this disclosure, a start control signal is generated and sent based on the user's operation on the terminal parking module (e.g., operation controls displayed on a touch terminal device).

[0083] The route map-based parking method S1000 disclosed herein can generate a user-drawn route navigation map in the terminal parking module, and the vehicle parking module executes the parking control process based on the route navigation map.

[0084] Figure 2 This is a schematic flowchart of a route map-based parking method according to one embodiment of the present disclosure.

[0085] refer to Figure 2 The route map-based parking method S1000 of this embodiment includes the following steps:

[0086] S1100: The vehicle parking module receives the start control signal generated and sent by the terminal parking module, and starts the vehicle parking module based on the start control signal;

[0087] S1200: The vehicle parking module obtains the current position of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current position of the vehicle and including at least one historical parking target position;

[0088] The judgment result is: there is no historical trajectory information of this vehicle that is associated with the current location of this vehicle and includes at least one historical parking target location;

[0089] S1402: The terminal parking module outputs a drawing interface, which is used to receive user drawing operations.

[0090] S1404: The terminal parking module generates and displays a route navigation route map containing route map feature elements based on the drawing operation received from the drawing interface for user confirmation.

[0091] S1406: When the terminal parking module receives the confirmation command, it parses the route map based on the preset route map feature elements, generates a path navigation program execution command, and sends it to the vehicle parking module to execute the parking control process based on the path navigation program command. If the terminal parking module does not receive the confirmation command or receives the denial command, it outputs the drawing interface again to receive drawing operations (including operations to modify the already drawn route map) to execute step S1404 again.

[0092] Among them, the historical trajectory information of the vehicle associated with the current location of the vehicle can be the historical trajectory information of the vehicle that is less than a preset distance from the current location of the vehicle, such as within a circle with a radius of 1000 meters centered on the current location of the vehicle. Any definition of the historical trajectory information of the vehicle associated with the current location of the vehicle by those skilled in the art under the guidance of the technical solution of this disclosure shall fall within the protection scope of this disclosure.

[0093] The current location information of this vehicle described in this disclosure can be obtained based on satellite positioning data (such as GPS positioning system or Beidou positioning system).

[0094] The vehicle's historical trajectory information can be obtained or updated by continuously accumulating the vehicle's map-based navigation journey trajectory, and the navigation destination can be used as the historical parking target location.

[0095] Figure 3 This is a schematic flowchart of another embodiment of the route map-based parking method disclosed herein.

[0096] refer to Figure 3 The route map-based parking method S1000 of this embodiment includes the following steps:

[0097] S1100: The vehicle parking module receives the start control signal generated and sent by the terminal parking module, and starts the vehicle parking module based on the start control signal;

[0098] S1200: The vehicle parking module obtains the current position of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current position of the vehicle and including at least one historical parking target position;

[0099] The judgment result is: There is historical trajectory information of this vehicle that is associated with the current location of this vehicle and includes at least one historical parking target location;

[0100] S1402: The on-board parking module outputs the vehicle's historical trajectory information, which is associated with the vehicle's current location and includes at least one historical parking target location, to the terminal parking module for selection;

[0101] S1404: The terminal parking module receives the historical parking target location selection instruction, and the vehicle parking module executes the parking control process based on the historical parking target location selection instruction.

[0102] Figure 4 This is a schematic flowchart of another embodiment of the route map-based parking method disclosed herein.

[0103] refer to Figure 4 The route map-based parking method S1000 of this embodiment includes the following steps:

[0104] S1100: The vehicle parking module receives the start control signal generated and sent by the terminal parking module, and starts the vehicle parking module based on the start control signal;

[0105] S1200: The vehicle parking module obtains the current position of the vehicle and determines whether there is historical trajectory information of the vehicle associated with the current position of the vehicle and including at least one historical parking target position;

[0106] The judgment result is: There is historical trajectory information of this vehicle that is associated with the current location of this vehicle and includes at least one historical parking target location;

[0107] S1402: The on-board parking module outputs the vehicle's historical trajectory information, which is associated with the vehicle's current location and includes at least one historical parking target location, to the terminal parking module for selection;

[0108] S1404: If the terminal parking module does not receive a historical parking target location selection instruction (including receiving an operation instruction to abandon the historical parking target location), the terminal parking module outputs a drawing interface for receiving user drawing operations.

[0109] S1406: The terminal parking module generates and displays a route navigation route map containing route map feature elements based on the drawing operation received from the drawing interface for user confirmation.

[0110] S1408: When the terminal parking module receives the confirmation command, it parses the route map based on the preset route map feature elements, generates a path navigation program execution command, and sends it to the vehicle parking module to execute the parking control process based on the path navigation program command. If the terminal parking module does not receive the confirmation command or receives the denial command, it outputs the drawing interface again to receive drawing operations (including operations to modify the already drawn route map) to execute step S1406 again.

[0111] Figure 5 This is a schematic flowchart of a route map-based parking method, which is yet another embodiment of this disclosure.

[0112] refer to Figure 5 In some embodiments of this disclosure, the route map-based parking method S1000 of the above embodiments further includes, between step S1100 and step S1400:

[0113] S1200: The terminal parking module outputs the first voice signal for interaction;

[0114] S1300: The terminal parking module determines whether it has received a first characteristic voice signal in response to the first voice signal.

[0115] If the terminal parking module receives a first characteristic voice signal (representing the use of the parking system) in response to the first voice signal, then proceed to step S1400.

[0116] Preferably, in step S1200 described in this disclosure, the vehicle parking module performs the following steps: obtaining the current position of the vehicle and determining whether there is historical trajectory information of the vehicle associated with the current position of the vehicle and including at least one historical parking target position; the terminal parking module outputs a first voice signal for interaction (e.g., asking the user whether to use the parking system).

[0117] The terminal parking module described in this disclosure preferably includes a route map generation module and a route map parsing module. The route map generation module and the route map parsing module generate the path navigation program execution instructions described above and send them to the vehicle parking module.

[0118] Figure 6 This is a schematic diagram of a drawing interface generated by a roadmap generation module according to one embodiment of this disclosure.

[0119] The route navigation route map containing route map feature elements described above in this disclosure is preferably drawn using various operation controls of the drawing interface (pen function control, fork sign control, roundabout sign control, parking space line sign control, parking lot sign control, vacant land sign control, back function control, selection function control, clear function control, exit function control, etc.).

[0120] Route map features include, but are not limited to, intersection signs, roundabout signs, parking space line signs, open space signs, turning signs, and straight-ahead signs.

[0121] Figure 7 The diagram shows the route from the vehicle to the intersection, drawn through the drawing interface.

[0122] Combination Figure 7 Instructions are provided on how to draw a route map.

[0123] For example, when a user selects the drawing function, they draw on the drawing interface using their finger or a stylus.

[0124] The lines drawn by the user are displayed as black straight lines. When the user selects the fork in the road control, clicking (single or double click) in the drawing interface will generate a diamond at the clicked location as a fork in the road sign.

[0125] According to a preferred embodiment of this disclosure, when the drawing interface receives a fork in the road sign, the route map generation module performs the following logical judgments and processing:

[0126] Determine if a user-drawn line exists next to each endpoint of the rhombus used as a fork in the road. If so, connect the corresponding endpoint of the rhombus to the user-drawn line. Preferably, the interior of the rhombus is hollowed out, with one endpoint corresponding to the direction the vehicle is coming from, and the other three endpoints representing left turn, right turn, and straight ahead, respectively. Figure 7 As shown.

[0127] Figure 8 This shows a route map of the vehicle from the intersection to the roundabout, drawn through a drawing interface.

[0128] Combination Figure 8 Instructions are provided on how to draw a route map.

[0129] When a user selects the roundabout marker control, clicking (single or double-click) in the drawing interface will generate a circle at the clicked location as a roundabout marker.

[0130] According to a preferred embodiment of this disclosure, when the drawing interface receives a roundabout sign, the route map generation module performs the following logical judgments and processing:

[0131] Determine whether the boundary of the circle used as a roundabout marker connects to the user-drawn line. If so, place the center of the circle on the line closest to the clicked location, and preferably empty the interior of the circle. Figure 8 As shown.

[0132] Figure 9 This shows a route map for roadside parking drawn through a drawing interface.

[0133] Combination Figure 9 Instructions are provided on how to draw a route map.

[0134] When a user selects the parking space line marker control, the user can draw a line to the left or right of the already drawn line. The result is a solid red line, indicating that the user wants to park on the left, right, or both sides of the road. Figure 9 This shows a parking order for parking on the left side of the road.

[0135] Figure 10 This shows a route map for parking in an open area, drawn through a drawing interface.

[0136] Combination Figure 10 Instructions are provided on how to draw a route map.

[0137] When a user selects the empty space marker control, clicking on it in the drawing interface will generate a dashed rectangle (e.g., a square) at the clicked location as an empty space marker.

[0138] According to a preferred embodiment of this disclosure, when the drawing interface receives an empty space marker, the route map generation module performs the following logical judgments and processing:

[0139] Determine if a user-drawn line exists near the midpoint of the rectangle used as an empty space marker. If so, place the midpoint of the rectangle onto the line. Figure 10 As shown.

[0140] Figure 11 This shows a parking route map drawn through a drawing interface.

[0141] Combination Figure 11 Instructions are provided on how to draw a route map.

[0142] When a user selects the parking sign control, clicking on it in the drawing interface will generate a solid rectangle (e.g., a square) at the clicked location as the parking sign.

[0143] According to a preferred embodiment of this disclosure, when the drawing interface receives a parking lot sign, the route map generation module performs the following logical judgments and processing:

[0144] Determine if a user-drawn line exists near the midpoint of the rectangle used as a parking lot sign. If so, place the midpoint of the rectangle onto the line. Figure 11 As shown.

[0145] In some embodiments of this disclosure,

[0146] When a user chooses to return to the function space, the user's previous action is cleared.

[0147] When the user selects a function control, such as Figure 12 As shown, users can perform further operations on the added signs (intersection signs, roundabout signs, parking signs, etc.) by clicking (single or double-clicking).

[0148] refer to Figure 12 Preferably, when a marker is selected, the route map generation module enlarges the selected marker and makes it editable, allowing the user to write, modify, or delete text / numbers on the selected marker.

[0149] For example, the number 'x' written inside a fork in the road sign indicates that there are x-1 more forks between this fork and the previous fork, and that vehicles must proceed straight through these x-1 forks. The number 'y' written inside a roundabout sign indicates that the user requests the vehicle to exit the roundabout at the nth exit. The number written inside a parking lot sign represents the area number and parking space number requested by the user.

[0150] When the user selects to clear the function controls, the drawing interface is cleared. When the user selects to exit the function controls, the route map generation module exits.

[0151] After the user completes and submits the route map, the route map generation module of the terminal parking module described in this disclosure identifies the user-drawn route map and performs the following processing:

[0152] When a diamond-shaped marker has more than three endpoints connected by lines, or a circular marker has more than three line segments connected on its boundary, an error message and a modification request message are generated. The error message and modification request message are output through the terminal parking module, allowing the user to re-operate the drawing interface to modify the route map.

[0153] In some embodiments of this disclosure, the route map generation module performs post-processing on the drawn route map, including anomaly identification, anomaly removal, local smoothing and noise reduction, unreasonable area identification, and identification of numbers within signs.

[0154] For example, an anomaly can be a point or a small area of ​​drawing that is not connected to other drawing content. An unreasonable area can be an obvious continuous steep inflection point that does not meet the conditions for a vehicle to turn, or an overlapping area of ​​drawing.

[0155] In some embodiments of this disclosure, the route map generation module outlines unreasonable areas and connects the start and end points with a straight line, or deletes overlapping areas.

[0156] The terminal parking module outputs the route map after it has been processed by the route map generation module for user confirmation or modification.

[0157] Figure 13 A schematic diagram illustrating post-processing of a user-drawn route map according to one embodiment of this disclosure is shown.

[0158] After the user confirms the route map generated by the route map generation module, the route map parsing module begins to parse the route map.

[0159] In some embodiments of this disclosure, the roadmap parsing module performs the following parsing process:

[0160] Extract all the fork and roundabout signs from the route map, and extract the numbers within the signs;

[0161] For example, if a road sign contains the number 3, it means there are two roads between the current intersection and the previous intersection (or the starting point), and the vehicle should proceed straight between these two intersections. If a roundabout sign contains the number 2, it means the vehicle should choose the second exit after entering the roundabout. If there is a straight-ahead intersection before the roundabout sign, it should also be marked; if no number is written on the sign, it is assumed to be 1. Between signs, the vehicle should maintain normal, low speed, and drive along the road boundary's passable area.

[0162] Extract parking signs after the last intersection / roundabout sign, including parking space line signs, open space signs, parking lot signs, etc.

[0163] Further attempts were made to extract the area code and parking space number from within the parking lot sign.

[0164] After parsing is complete, the path navigation program execution instructions are generated.

[0165] Figure 14 A roadmap of one embodiment of this disclosure is shown, and the corresponding path navigation program execution instructions are as follows:

[0166] Continue in the current direction, [go straight at the 1st and 2nd intersections], then [turn right at the 3rd intersection], continue in the current direction, [enter the roundabout ahead, and exit the roundabout at the 2nd exit], explore the parking lot ahead along the current road, and park in parking space A03 in area A of the parking lot.

[0167] In some embodiments of this disclosure, left / right turn commands and straight-ahead commands are only executed at intersections; if the road is not at an intersection, the road continues to travel straight along the feasible area without making any judgment.

[0168] For the parking method S1000 of this disclosure, after the terminal parking module generates the path navigation program execution instruction, preferably, the parking control flow S1410 based on the path navigation route map described in this disclosure is executed based on the following control method:

[0169] S1412: The on-board parking module determines whether the vehicle meets the starting conditions. If the starting conditions are met, the on-board parking module generates a control signal to control the vehicle to start.

[0170] S1414: The on-board parking module obtains the feasible area of ​​the current road, performs local path planning in real time according to the road conditions, and generates control signals to control the vehicle to drive along the feasible area.

[0171] S1416: The vehicle parking module acquires the branch road identification results and performs path planning based on the branch road identification results and the branch road information in the path navigation program execution instructions;

[0172] S1418: When the vehicle parking module executes the parking instruction in the path navigation program execution instruction, it generates a parking control signal based on the parking instruction to enable the vehicle to perform a parking action.

[0173] Figure 15 This is a schematic diagram of a parking control process based on a path navigation route map, according to one embodiment of this disclosure.

[0174] The parking control flow based on the route navigation map of this disclosure is illustrated by an example:

[0175] In step S1412, after confirming the program instructions, the vehicle parking module begins to detect whether the vehicle meets the starting conditions. Once the starting conditions are met, the vehicle parking module generates a control signal to control the vehicle to start.

[0176] The following judgment process can be used to determine whether the vehicle meets the starting conditions:

[0177] First, the driver departure judgment is initiated by installing a pressure sensor and multiple sensing probes on the seat of the car chassis. When the overall pressure signal value is lower than the preset pressure value, the photoelectric signal judgment is initiated by installing a photoelectric sensor on the seat back to determine whether the photoelectric signal value is lower than the preset value. If the photoelectric signal value is also lower than the preset value, it is determined that the driver has left the seat.

[0178] Then, the vehicle sensors determine whether the doors are closed. If the doors remain open for an extended period, the vehicle parking module sends a warning signal to the user terminal device. If the door closure time exceeds a certain period (default is 10 seconds, which can be adjusted by the user to, for example, 10 to 60 seconds), the starting conditions are deemed met, and a control signal is generated to start the vehicle.

[0179] In step S1414, the vehicle parking module obtains the feasible region of the current road and generates a control signal to control the vehicle to travel along the feasible region.

[0180] After the vehicle starts, it uses cameras to create a SLAM map of the surrounding environment. Specifically, it can use a combination of visual and IMU methods, such as VINS or ORBSLAM-V3, or a pure visual method, such as ORBSLAM-V2, to reconstruct the scale of the pure visual map based on the vehicle's odometer reading.

[0181] Based on camera recognition of road edges and lane lines, any existing method for identifying lane lines and road edges can be used. For example, one or more fisheye or pinhole cameras can be used to identify lane lines and road edges using commonly used converted top-view images.

[0182] Specifically, based on the intrinsic and extrinsic parameter matrices of a fisheye / pinhole camera, an IPM (Integrated Perspective) is used to obtain a top view. On this top view, lane lines and road edge pixels are obtained using traditional edge detection or deep learning-based methods. Then, through clustering and fitting, vectorized lane lines and road edges are obtained. The top view and the real physical 2D space of vehicle movement have a consistent scale relationship, and the pixel coordinates of the lane lines and road edges specifically represent their positions relative to the vehicle. Alternatively, a BEV (Battery Electric Vehicle) viewpoint feature extraction and recognition technique similar to Tesla's can be used. First, features are extracted from the original camera image. Then, BEV viewpoint features are obtained through cross-attention or neural attention mechanisms, followed by lane line and road edge recognition. The BEV viewpoint recognition results have a consistent scale relationship with the real physical 3D space of vehicle movement.

[0183] After identifying the road edge, the onboard parking module controls the vehicle to explore along the right edge of the road at a speed not exceeding a preset speed, such as 15 km / h. During the journey, it maintains a preset distance (e.g., 50 cm) from the edge or edge obstacles to facilitate vehicle steering and aligns the vehicle's direction of travel horizontally with the road edge. Simultaneously, it marks the primary and secondary feasible zones of the current road: the primary feasible zone is the right lane of a multi-lane road excluding the 50 cm edge, and the secondary feasible zone is the area around both road edges excluding the primary feasible zone.

[0184] S1416: The vehicle parking module acquires the branch road identification results and performs path planning based on the branch road identification results and the branch road information in the path navigation program execution instructions.

[0185] When the vehicle is not encountering an intersection, the onboard parking module performs real-time local route planning, simulating a route map of the vehicle traveling along the right edge of the road within its field of vision. After identifying an intersection, it analyzes the intersection conditions (e.g., whether it is passable) and the intersection information in the route navigation program's execution instructions to plan the route.

[0186] Figure 16This is a route map of one embodiment of the present disclosure, showing the vehicle traveling along the right edge of the road within its field of vision when not encountering an intersection.

[0187] Among them, the thick black solid line represents the actual road edge line, the black dashed line represents the dividing line between the first and second level feasible regions, the blue-gray area represents the second level feasible region, the white area represents the first level feasible region, and the red arrow line represents the preset path trajectory.

[0188] In step S1414 described above, if an obstacle is detected, preferably, the following local path planning process is also included:

[0189] Determine the type of obstacle;

[0190] For static obstacles, a detour path is planned based on the size of the static obstacle, and the on-board parking module generates control signals to control the vehicle to detour around the static obstacle along the detour path;

[0191] If a dynamic obstacle is encountered, the vehicle parking module will remain stationary at a preset distance from the obstacle for a first preset time length. If the dynamic obstacle moves, the vehicle parking module will generate a control signal to allow the vehicle to continue driving. If the dynamic obstacle does not move, the vehicle parking module will generate a control signal to allow the vehicle to issue a warning signal (light or sound). If the dynamic obstacle remains stationary for a second preset time length, it will be converted into a static obstacle.

[0192] In step S1414, when the vehicle's predetermined route is blocked due to an obstacle, it is first determined whether the obstacle is a static obstacle or a dynamic obstacle.

[0193] According to a preferred embodiment of this disclosure, if the obstacle is determined to be a static obstacle, an obstacle avoidance measure of detour is selected. A curved path that meets the maximum turning angle limit of the vehicle is planned on the side of the obstacle. When planning the local path, the curve with the maximum turning radius in the first-level feasible region is preferentially selected as the alternative route. If there is no route that meets the minimum turning radius in the first-level feasible region, the curve with the smallest turning radius in the feasible region (including the first-level and second-level feasible regions) is selected as the alternative route.

[0194] If the obstacle ahead is determined to be a dynamic obstacle of the type of motor vehicle, non-motor vehicle, pedestrian, or animal, the vehicle will stop within a preset distance, such as one meter, for a first preset time length (e.g., 20 seconds). After that, if the dynamic obstacle does not move, the on-board parking module generates a control signal to control the vehicle to give a light signal to indicate the dynamic obstacle. It will then determine whether the dynamic obstacle has moved (this can be determined by the on-board radar signal). If the movement does not affect the vehicle's driving route, the vehicle will continue to drive. If the dynamic obstacle remains stationary for a second preset time length (e.g., 2 seconds), it will be converted into a static obstacle, and the process for handling static obstacles described above will be executed to avoid the obstacle.

[0195] Figure 17 This is a schematic diagram illustrating the obstacle avoidance and detour of the vehicle when encountering an obstacle, according to one embodiment of this disclosure.

[0196] In some embodiments of this disclosure, when a planned driving path curve with a turning angle exceeding the vehicle's maximum turning angle appears within the vehicle's preset route (based on the path navigation program's execution instructions), the normal vector directions of the preceding and following road segments of that curve (the route that does not satisfy vehicle dynamics) are obtained to plan a new curve path that satisfies the vehicle's minimum turning radius. This new curve path replaces the aforementioned route that does not satisfy vehicle dynamics. Figure 18 .

[0197] Figure 18 This is a schematic diagram of obtaining a new curved path that satisfies the minimum turning radius of the vehicle during a cornering process according to one embodiment of this disclosure.

[0198] The red dashed line represents the original preset route, while the red solid line represents the new curved path obtained after considering the maximum turning angle of the car, where r is the minimum turning radius.

[0199] For the parking method S1000 of the above embodiments, step S1416 may further include a junction identification process, preferably including the following junction determination method:

[0200] There are more than two road edge lines that do not intersect in front of this vehicle;

[0201] Extend the endpoints of each road edge line along the tangent direction of the endpoints. If the extended lines of two endpoints intersect within a circle with these two endpoints as its diameter, then the two road edge lines are considered as one road edge line. Based on this determination, if there are no more than two road edge lines in front of the vehicle, then it is not considered a fork in the road (see reference). Figure 19 ).

[0202] Figure 19A schematic diagram illustrating intersection identification according to one embodiment of this disclosure is shown. In this disclosure, intersections are preferably identified based on whether the road edge line is broken (i.e., the continuity of the road edge line).

[0203] Figure 19 In the diagram, the solid black line represents the road edge line perceived by the car. The reason for this road edge break may be due to the presence of an obstacle, or the location of a doorway or entrance to a space, causing the road edge line perceived by the car to break. In this case, it is not considered a fork in the road.

[0204] In some embodiments of this disclosure, to avoid the impact of median strips on intersection identification, it is desirable to temporarily ignore the presence of median strips when identifying intersections. Preferably, the intersection identification method further includes:

[0205] Within the vehicle's field of vision, if the distance between the two endpoints of an edge line is less than a preset distance, or if the edge line is a closed curve and the area divided by the edge line is less than a preset area, then the edge line is determined to be a median strip, and this edge line is ignored when identifying intersections.

[0206] Figure 20 A schematic diagram illustrating the determination of median strips according to one embodiment of this disclosure is shown. The gray area describes the region divided by each boundary line (road edge line), while the blue curve describes a median strip on the current road. This median strip is characterized by a small endpoint distance (less than a preset distance) and a small area of ​​the divided region (less than a preset area). Such median strips are ignored when determining intersections.

[0207] This disclosure also provides a method for handling intersections. Figure 21 A schematic flowchart of a fork-in-the-road processing method S1420 according to one embodiment of the present disclosure is shown.

[0208] refer to Figure 21 This document illustrates a method for processing intersections according to one embodiment of the present disclosure, using an example to explain the method for processing intersections according to the present disclosure.

[0209] S1421: After the vehicle parking module determines that an intersection is ahead, it analyzes the intersection situation and constructs a two-dimensional grid map based on the intersection recognition results. The space is divided into grids, with a preset grid side length of 0.2 meters (adjustable) to reduce the amount of computation while ensuring the algorithm's performance.

[0210] Figure 22 A two-dimensional grid map constructed for a fork in the road is shown as one embodiment of this disclosure.

[0211] S1422: After establishing the two-dimensional grid map, based on each edge line of the intersection, assign a value of 0 to all grids covering that edge line. Then, assign values ​​to the grids adjacent to all assigned grids within the feasible region of the two-dimensional grid map. For grids sharing an edge, add a first value, such as 1; for grids sharing a corner, add a second value, such as 1.5. If a grid shares an edge or a corner with multiple grids, select the value with the smallest result after adding the first value to the grids sharing the edge or the second value to the grids sharing the corner, and assign the grid value until all grids within the feasible region are assigned values.

[0212] Figure 23 and Figure 24 An exemplary diagram illustrates grid assignment based on an edge line (the road edge line to the right front of the vehicle).

[0213] Complete the grid assignment for each road edge line (right road edge line of this vehicle, right front road edge line, left road edge line, left front road edge line) based on the intersection.

[0214] Figures 25 to 27 The grid assignment results for the right-side road edge line, left-side road edge line, and left-front road edge line of this vehicle are shown as an example.

[0215] S1423: Perform raster map-based assignment overlay on the raster assignment results based on each edge line to obtain an initial overlay assignment map.

[0216] Ignore or remove grid values ​​greater than a preset threshold (e.g., 14) in the initial overlay assignment map to obtain the intersection assignment map.

[0217] Figure 28 An exemplary diagram of the fork intersection assignment of this disclosure is shown.

[0218] S1424: Take the center point of the grid with the smallest superimposed value in the intersection assignment map as the intersection center point and obtain its coordinates (x0, y0). If there are multiple grids with the smallest superimposed value, take their geometric center as the intersection center point.

[0219] Preferably, the center point of the intersection is obtained using the following method.

[0220] Get the vertex of the grid with the smallest superposition value (e.g., the top right vertex) or the center point coordinates (x1, y1)...(x n ,y n If ), then their geometric center coordinates are:

[0221]

[0222] S1425: After obtaining the center point of the intersection, obtain the inflection points on the edge lines of each road based on the center point of the intersection.

[0223] The vehicle parking module finds the edge point (u0, v0) on each road edge line that is closest to the center point of the intersection as the inflection point on the edge line.

[0224] For example, this disclosure uses the following method to obtain the inflection point.

[0225] Let the edge line parameter expression be (U n (t),V n (t)), and find t0 through numerical solution such that the function F(t)=(U n (t)-x0) 2 +(U n (t)-x0) 2 Minimum, then (u n ,v n )=(U n (t0),V n (t0)).

[0226] After obtaining the inflection points of each road edge line, compare the distances from the inflection points on each edge line to the center point of the intersection, and take the largest distance as the radius to draw a circle. The intersection area of ​​this circle with the entire feasible region is taken as the travel region. The non-intersecting regions divided by this circle are taken as branches, that is, the sub-paths of the intersection.

[0227] Figure 29 and Figure 30 This is a branching analysis diagram of one embodiment of the present disclosure, which exemplarily illustrates the traffic area and sub-paths.

[0228] After obtaining the traffic area and sub-paths, using the center point of the intersection as the center and the current position of the vehicle as the starting point, search for intersections (i.e., sub-paths) clockwise or counterclockwise. The first intersection passed clockwise is designated as the left-turn lane, and the first intersection passed counterclockwise is designated as the right-turn lane. At the same time, the sub-path with the deflection angle closest to 180 degrees is designated as the straight-ahead lane.

[0229] Based on the intersection processing method S1420 disclosed herein, the intersection traffic domain and each sub-path are obtained.

[0230] Furthermore, the parking method S1000 disclosed herein also includes the following steps:

[0231] S1426: When the vehicle parking module performs a turn at a fork in the road, it takes the vehicle's position before the traffic area as the starting position and the predicted position of the vehicle at the fork (i.e., sub-path) after the traffic area as the target position. It performs path planning through the traffic area and initially plans an arc path as a local planning path to control the vehicle's movement.

[0232] Figure 31This is a partial planning path diagram of one embodiment of the present disclosure. Figure 31 In the diagram, the solid red line represents the planned path for a left turn at a fork in the road, and the dashed red line represents the planned path for a right turn at a fork in the road.

[0233] Considering that cars have a minimum turning radius, when the initial local planning path does not satisfy vehicle dynamics, it is necessary to advance the vehicle's turning start position and delay the vehicle's turning end position.

[0234] Figure 32 This illustration shows a left turn at a fork in the road according to one embodiment of the present disclosure, where the starting position of the turn is advanced and the ending position of the turn is delayed. Figure 32 In the image, the black vehicle represents the initial and final positions of the vehicle's turn, as planned during the preprocessing stage.

[0235] When the distance r between the intersection of the normals of the starting and ending positions of the black vehicle's turn and the starting and ending positions of the turn is less than the vehicle's minimum turning radius R, it is necessary to control the vehicle (red) to start turning earlier and end turning later. The local planned path is shown as the red solid line. In some embodiments of the parking method S1000 of this disclosure, a roundabout junction handling method is also included, comprising the following processing steps:

[0236] The vehicle parking module executes the roundabout instruction in the route navigation program, and identifies the fork in front of the vehicle as a roundabout.

[0237] The on-board parking module generates control signals to control the vehicle to enter the roundabout on the right. Based on the roundabout branch instructions, the vehicle drives on the right at one of the 1st to n-1th branch intersections until the nth branch intersection (exit), at which point it drives off the roundabout on the right (enters a branch road) to end the execution of the roundabout branch instructions.

[0238] Figure 33 This is a diagram of a roundabout. The vehicle will turn right onto the current road to enter the roundabout, and then, according to the roundabout's branch road instructions, turn right at the nth intersection specified by the user to exit the roundabout. While driving within the roundabout, always keep to the right.

[0239] In some embodiments of this disclosure, preferably, the vehicle parking module sends the vehicle's location and the routes / signs it has passed to the terminal parking module in real time in the form of a map for user monitoring.

[0240] In some embodiments of this disclosure, the vehicle parking module assigns a predetermined color, such as blue, to the route / sign that has been passed.

[0241] According to a preferred embodiment of this disclosure, when the vehicle approaches a roundabout or intersection sign, the on-board parking module generates a control signal to the on-board image acquisition device to acquire an image of the front of the vehicle, and associates the acquired image of the front of the vehicle with the roundabout or intersection sign. This image information is then sent to the terminal parking module, allowing the user to click on the intersection or roundabout sign on the map to check whether the vehicle is turning correctly according to the route map.

[0242] Figure 34 The terminal parking module of one embodiment of this disclosure shows the vehicle's driving process.

[0243] exist Figure 34 In the system, users can use the magnifying glass control to click the blue icon to observe the intersections they have already passed. If the user observes an error in the vehicle's movement through the image / photo, they can pause the vehicle by clicking the pause function control. The terminal parking module will generate and send a pause control signal to the onboard parking module. Based on the pause control signal, the vehicle will pull over, activate its hazard lights, and take a 360-degree surround photo, which will then be sent to the terminal parking module on the user's terminal device. At this point, the user can recall the vehicle, and the onboard parking module will generate a parking failure message and send it to the terminal parking module on the user's terminal device. Alternatively, the user can reset the route map based on the terminal parking module, and redraw the route map according to the vehicle's current location.

[0244] The parking control process based on the route navigation map disclosed herein also includes a parking processing method, in which the on-board parking module executes the parking instruction in the route navigation program execution instruction, identifies the parking lot / parking area, and after successful identification, further identifies the target parking space.

[0245] Figure 35 This is a schematic flowchart of a parking processing method according to one embodiment of the present disclosure.

[0246] refer to Figure 35 The parking processing method S1430 of this embodiment includes the following steps.

[0247] S1431: Execute the parking instruction in the path navigation program execution instructions;

[0248] S1432: Determine the parking instruction type. If the parking instruction type is roadside parking, proceed to step S1433. If the parking instruction type is parking lot parking, proceed to step S1434. If the parking instruction type is open space / plaza parking, proceed to step S1435.

[0249] S1433: Identify roadside parking areas, and the on-board parking module generates control signals to control the vehicle to enter the roadside parking area;

[0250] S1434: Identify the parking lot, identify the parking area, identify the parking space number, and generate a control signal to control the vehicle to drive into the parking space.

[0251] S1435: Identify open spaces / plazas, and the on-board parking module generates control signals to control the vehicle to enter the open spaces / plazas;

[0252] S1436: When steps S1433 / S1434 / S1435 are executed successfully, the vehicle parking module generates a control signal to control the vehicle to stop and generates parking success information to send to the user terminal device (e.g., mobile phone); when steps S1433 / S1434 / S1435 fail to execute, the vehicle parking module generates parking failure information and sends it to the user terminal device (e.g., mobile phone).

[0253] During the execution of steps S1433 / S1434 / S1435, if the road in front of the vehicle is blocked, the on-board parking module generates a control signal to control the vehicle to stop.

[0254] In the parking processing method disclosed herein, whether parking is successful or fails, a top-view image of the vehicle can be captured, recorded, and sent to the user terminal device.

[0255] The parking handling method disclosed herein will be explained in detail below with specific examples.

[0256] In step S1433, the vehicle parking module first determines whether the user's parking instruction provides specific parking instructions on both sides of the road. If the parking instruction does not contain specific instructions, the vehicle parking module generates a control signal to make the vehicle attempt to identify whether there are parking lines on the left and right sides of the road. The parking line identification method can use a fisheye camera to generate a top view, and on the top view, a deep neural network model is used to detect and classify parking spaces.

[0257] Once parking space lines are detected, for example via ultrasonic radar, the system will double-check whether the parking space is vacant. If parking space lines are only marked on one side, the nearest vacant parking space on that side will be selected for parking. If parking space lines are marked on both sides, the nearest vacant parking space on the right side will be selected for parking.

[0258] For specific parking techniques, please refer to the document "Development of an automatic parking system for vehicle".

[0259] If there are no parking lines on either side of the road, the camera detects whether there are parked vehicles on either side. If so, ultrasonic ranging is used to locate an empty area exceeding 1 meter (adjustable) in length of the vehicle body in front of the parked vehicle (default is the right side). If an empty area is detected, the vehicle is controlled to drive into the empty area, parking is successful, and the onboard parking module generates parking success information in step S1436. If no empty area is detected or there are no vehicles on either side of the road, parking fails, and the onboard parking module generates parking failure information in step S1436.

[0260] In step S1434, the vehicle parking module generates a control signal to control the vehicle to continue driving forward along the current road feasible region. During the journey, it attempts to identify whether there is a parking lot ahead. Specifically, the identification method is to train the system to recognize parking signs, such as "P" or "parking lot", through deep learning. Figure 36 This is an example image of a parking lot sign.

[0261] If a parking sign is detected, the road intersection ahead is identified as a parking lot entrance. If no parking sign is detected, the vehicle continues forward along the current road, while simultaneously determining whether there is a sudden change in the width of the feasible area ahead. The feasible area width is defined as the length of the feasible area perpendicular to the current driving direction.

[0262] If the vehicle detects a sudden change in the width of the feasible area ahead, and it is not at a fork in the road, and the width change is more than a preset multiple of the current feasible area width of the vehicle, such as more than three times, then it is preliminarily determined that it has arrived at an open parking lot.

[0263] After initially determining the parking lot as an open area, the vehicle further observes whether there are stationary vehicles in the area where the road width changes. If there are more than a preset number of stationary vehicles in the area ahead, such as more than two, that are not on the current road extension line, then it is confirmed as an open parking lot. If there are no such stationary vehicles, then the vehicle captures an image of the area ahead and sends it to the user's terminal device to ask the user whether the parking lot location is correct. Figure 37 This is an example diagram of an open parking lot.

[0264] If a parking lot cannot be identified even at the end of the road or at a fork in the road, the on-board parking module generates parking failure information in step S1436 and sends it to the user terminal device.

[0265] Once the parking lot is successfully identified, it is determined whether the parking instructions in the route navigation program specify the parking area and location.

[0266] If no specific instructions are given, refer to step S1433. First, try to identify the parking space lines and find the nearest empty space to park based on the parking space lines. If there are no parking space lines, find a sufficiently empty area. The specific search method can also be to use ultrasonic radar ranging to find whether there is an empty distance of at least one and a half car lengths between two vehicles parked side by side. If there is, park the vehicle in the empty area.

[0267] If the user provides specific instructions regarding the parking area and location, then the following steps will be executed:

[0268] The vehicle parking module first determines whether the user has given a zone number instruction. If the user has given a specific zone number instruction, it uses deep learning to find and identify English letters or numbers on nearby signs, as well as potential left turn signs, right turn signs, and straight signs. For specific identification methods, please refer to the literature "Signboard Detection and Text Recognition Using Artificial Neural Networks". Figure 38 This is an example diagram of parking area signs (area numbers) in a parking lot.

[0269] refer to Figure 38 The vehicle parking module first identifies the current location, and the English letters can be identified as their corresponding numbers in the English alphabet.

[0270] When the system detects a zone number equal to the user's command, it enters that zone. If no zone number is detected, the onboard parking module attempts to identify nearby zoning signs. If a sign is present, the vehicle moves in the direction indicated by the sign; otherwise, the onboard parking module directs the vehicle to continue along the current road. At intersections, the system attempts to identify the zone number of the area enclosed by the edges of each intersection and veers towards the side closer to the specified zone number. This process continues until the specified zone number is found.

[0271] Once the vehicle enters the designated area number, or if the user does not provide an area number command, the on-board parking module will determine whether the user has provided a specific parking space number.

[0272] If the user only provides the area number instruction but not the parking space number instruction, then refer to step S1433, first try to identify the parking space line, find the nearest empty space to park according to the parking space line, if there is no parking space line, then use ultrasonic radar to measure distance, find at least one and a half car body vacancy between two vehicles parked side by side, and park the vehicle in the vacant area.

[0273] If the user provides a specific parking space number, the system converts the indicated parking space number into a number and simultaneously identifies nearby parking space numbers. It then proceeds forward along the current road, attempting to identify parking space number signs when encountering a fork in the road. If a parking space number sign exists, it determines whether the target parking space number matches the sign's numerical range. If it does, it turns in the direction indicated by the sign. If there is no sign, it identifies the nearest parking space number to the vehicle's current position on each fork in the road and selects the direction with the smaller absolute value of the difference between the target parking space number and the current one. If the system detects that the vehicle has already entered an area, it prioritizes turning in the direction not previously selected. If the target parking space is successfully identified and is available, the system controls the vehicle to enter the parking space. If the above process results in an infinite loop, or if the target parking space is found to be obstructed after successful identification, the onboard parking module generates a parking failure message in step S1436 and sends it to the user terminal device.

[0274] In step S1435, the vehicle parking module controls the vehicle to move forward along the current road, while simultaneously determining whether the width of the feasible area ahead has changed abruptly, as per step S1434. If a sudden change in the width of the feasible area ahead is detected, and it is not at a fork in the road, and the width after the change is more than a preset multiple of the current road width (e.g., more than three times), and there are stationary vehicles in the area after the road width change, then it is determined that the vehicle has arrived at a parking space / parking plaza. Then, referring to S1433, parking space identification is performed and parking is initiated. In step S1400 of this disclosure, based on the historical parking target location selection instruction received by the terminal parking module, the parking control process executed by the vehicle parking module includes the following steps:

[0275] S1441: Compare the current position of the vehicle with at least one historical trajectory of the vehicle that includes the selected historical parking target position, and obtain the optimal historical trajectory based on the number of times the vehicle's historical trajectory has been driven and the distance between the current position of the vehicle and the historical trajectory of the vehicle.

[0276] Preferably, the vehicle parking module initially obtains the vehicle's current location via GPS, and simultaneously retrieves and analyzes the location information of historical trajectory points. When multiple different historical trajectories exist near the vehicle for the same selected historical destination, the historical trajectory with more trips is selected as the optimal historical trajectory; if multiple historical trajectories with the same number of trips exist, the historical trajectory closer to the current location is selected as the optimal historical trajectory.

[0277] S1442: Determine whether the minimum distance between the optimal historical trajectory and the current position of the vehicle exceeds the preset distance (e.g., 5 meters). If it exceeds, proceed to step S1443; if it does not exceed, proceed to step S1444.

[0278] S1443: The on-board parking module controls the vehicle to move forward along the current feasible domain and continuously marks the historical trajectory point closest to the vehicle's current position to find the optimal historical trajectory. Whenever the vehicle encounters a fork in the road, the on-board parking module controls the vehicle to turn into the fork in the road that the line connecting the marked point points points in. This continues until the minimum distance between the vehicle's current position and the optimal historical trajectory is less than or equal to a preset distance, and then proceeds to step S1444.

[0279] Figure 39 This is an example diagram for finding the optimal historical trajectory.

[0280] S1444: The on-board parking module controls the vehicle to reposition itself in order to move the vehicle to the optimal historical trajectory and align it with the historical pose.

[0281] Preferably, repositioning is performed through the following steps. Figure 40 It is a repositioning trajectory point matching map.

[0282] The vehicle's current location is captured by a 360° image of the surrounding environment by the vehicle's camera, and image features are extracted. Then, historical trajectory points within a preset distance range (e.g., 5 meters) of the vehicle's current location are retrieved from historical map data. If multiple historical trajectory points are available for retrieval, a limited number of points, such as 2 to 4 points, that are closest to and furthest from the vehicle are retrieved.

[0283] The mapping information of the retrieved trajectory points is compared with the mapping information of the vehicle's current position. If there are not enough matching feature points, the relocation is determined to be unsuccessful. The vehicle is then controlled to continue driving along the current feasible region, constantly approaching the optimal historical trajectory, and continuously attempting relocation and feature point matching.

[0284] Once the vehicle parking module finds a sufficient number of matching feature points and the relocalization is successful, it can use RANSAC iteration and the PnP algorithm to solve the vehicle's pose. Based on the ranging of the 360° image of the vehicle's current position and surrounding environment, it can correct the vehicle's current position information and control the vehicle to move to the historical trajectory point and align with the historical pose.

[0285] S1445: Plan the optimal global route from the optimal historical trajectory, and control the vehicle to travel to the target location based on the optimal global route.

[0286] After the vehicle arrives at the target location, parking can be processed based on historical parking orders and in accordance with the parking processing methods (S1431 to S1436) described above in this disclosure.

[0287] Preferably, the onboard parking module retrieves the optimal route planned from historical map data and drives at a constant low speed in the direction shown by the optimal route. During driving, local path planning is performed simultaneously, using a positioning system such as GPS for positioning and SLAM mapping of the vehicle's surrounding environment. When the location information contained in the historical trajectory points matching the current location does not match the location information calculated by the vehicle's own inertia, the location information of the previous matching point and the current matching point is updated (detour points taken for obstacle avoidance are ignored here).

[0288] The specific update method is as follows: let the coordinates of the previous matching point be (x0, y0), the historical coordinates of the current matching point be (x1, y1), and the coordinates of the current point calculated based on inertial navigation be (x2, y2). Since the historical point (x1, y1) is based on the location information provided by GPS, its error may be very large. The relative motion vector (x2-x0, y2-y0) calculated based on inertial navigation has negligible error over short distances compared to errors in systems like GPS. Therefore, the updated point coordinates (x′0, y′0) and (x′1, y′1) must satisfy (x2, y2) - (x0, y0) = (x′1, y′1) - (x′0, y′0). The goal is to find (x′0, y′0) and (x′1, y′1) such that when (x′0, y′0) and (x′1, y′1) are the two true coordinates, the probability of observing (x0, y0) and (x1, y1) is maximized.

[0289] More preferably, this disclosure provides an iterative update method. Based on the weak law of large numbers, it is assumed that the observed coordinates of GPS follow an independent two-dimensional Gaussian distribution. Therefore, this disclosure performs L2 optimization on the point coordinates.

[0290] The result of the optimization is the new coordinates of the previous point. New current point coordinates

[0291] This process continuously updates the historical trajectory point location information and surrounding environmental features. After traversing the trajectory multiple times, the resulting trajectory coordinate function will converge to the true trajectory coordinate function. Furthermore, other position coordinate optimization methods and other probabilistic cost functions are also applicable to this step.

[0292] If the planned route is interrupted during the vehicle's journey, the onboard parking module can attempt to retrieve a suboptimal route from historical map data and re-enter along that route. If retrieving the suboptimal route fails or the suboptimal route does not exist, the parking is deemed a failure. If the vehicle successfully enters the historical parking destination area, the module checks whether the parking area number and parking space number are specified in the historical parking command, and controls the vehicle to park in a nearby empty / designated parking space, referring to the content described above.

[0293] In step S1436 described above, post-processing for successful / failed parking is preferably performed based on the following steps.

[0294] A. Parking successful:

[0295] The system collects images of the parking area and generates parking success information, which is then sent to the user's terminal device.

[0296] Received confirmation information from the user's terminal device;

[0297] Record the parking process data into the parking map data and plan at least the optimal route;

[0298] Parking is complete, and the on-board parking module is turned off.

[0299] B. Parking failed:

[0300] The on-board parking module pauses, generates a parking failure message, and sends it to the user terminal device to request further instructions.

[0301] If no further instructions are received, a control signal is generated to control the vehicle to return to its initial parking position.

[0302] Upon receiving further instructions, control signals are generated based on these instructions to control the vehicle.

[0303] In this disclosure, the vehicle parking module has two scenarios: one is that the vehicle arrives at the destination normally and parks successfully, and the other is that the parking fails due to road errors / malfunctions, such as driving into a dead end, failing to identify a parking lot, having no parking space, and various road blockages.

[0304] More specifically, upon successful parking, the vehicle can take 360-degree surround photos of the vehicle body and then send the 360-degree scene images to the user's terminal device. If the user confirms that the parking is correct, the parking process data is processed. If this trip is a new trip without historical memory, the on-board parking module stores the trajectory points of this trip, including the vehicle's position and attitude information with six degrees of freedom, and aligned with the GPS information, along with the environmental features and distance measurements of the environmental features in the SLAM mapping of the trajectory points, into the historical map data, and generates a trajectory curve through clustering.

[0305] Then, the locations and instructions of all intersections are marked and recorded. By analyzing the geometry of the route, all possible routes with an overlap measure of 0 are extracted, and the total length is compared to store these routes as the optimal to the second-best routes in the vehicle's storage system or the cloud storage system. If this trip is a historical parking mode, the current trip is overwritten with the original trip, with overlapping parts completely updated and non-overlapping parts retained.

[0306] If parking fails or a rejection message is received from the user's terminal device, the onboard parking module instructs the vehicle to move to the side of the road within the currently feasible area, stop, activate hazard lights, and send a 360-degree photo of the surrounding environment to the user's terminal device. Simultaneously, the onboard parking module displays the current driving trajectory and GPS navigation location to the user's terminal device. If the current parking trip is a historical parking mode, the historical trajectory map is also displayed to the user's terminal device, with previously traveled historical trajectories marked with solid lines and untraced historical trajectories marked with dashed lines. After an error is reported, the module requests further instructions from the user. If the user does not respond for an extended period, the vehicle will (by default) automatically return to the parking start position; this default setting can be modified by the user. Further instructions received by the onboard parking module from the user include: returning to the parking start point, parking on the side of the road ahead, and new instructions within the parking lot.

[0307] For example, when the user instructs the vehicle to return to the initial parking position, the onboard parking module directs the vehicle to make a U-turn on the current road and return to the initial position along the original route. After returning to the initial parking position and successfully repositioning, parking ends, and the onboard parking module shuts down.

[0308] When the user instructs the vehicle to park on the side of the road ahead, the on-board parking module directs the vehicle to move forward and identifies the current road width. When the feasible road width ahead is more than a preset number, such as four vehicle widths or more, and there is no no-parking sign or parking space lines, the on-board parking module directs the vehicle to park in the vacant area on the right side of the road.

[0309] When parking fails and the vehicle is in the parking lot, the user can provide new instructions within the parking lot, including a new zone number, parking space number, or parking in any location.

[0310] This disclosure also provides a route map-based parking system, including:

[0311] Terminal parking module 1000 generates and sends out parking control signals;

[0312] The vehicle parking module 2000 receives the start control signal and starts.

[0313] The terminal parking module 1000 includes:

[0314] The route map generation module 1002 generates a path navigation route map based on the user's drawing operations.

[0315] The route map parsing module 1004 parses the route navigation route map to generate route navigation program instructions;

[0316] The vehicle parking module 2000 includes:

[0317] The historical trajectory output module 2002 is used to output the historical trajectory information of the vehicle that is associated with the current position of the vehicle and includes at least one historical parking target position.

[0318] The parking processing module 2004 executes the parking control process based on the path navigation program instructions generated by the terminal parking module 1000 or the selected historical parking target location and its corresponding historical trajectory information of the vehicle.

[0319] Preferably, the terminal parking module 1000 further includes:

[0320] The voice signal output module 1006 outputs a first voice signal for interaction (asking whether to use the parking system);

[0321] The voice signal receiving module 1008 is used to receive the user's voice signal.

[0322] The first characteristic speech signal acquisition module 1010 determines whether a first characteristic speech signal in response to a first speech signal is received.

[0323] The touch command receiving module 1012 is used at least to receive historical parking target location selection commands.

[0324] Figure 41 and Figure 42 The structural schematic block diagrams of the terminal parking module 1000 and the vehicle parking module 2000 are shown respectively.

[0325] The terminal parking module 1000 disclosed herein can be installed in a user terminal device (e.g., a mobile phone) through a computer software program architecture, and the vehicle parking module 2000 disclosed herein can be installed in a vehicle processing system with hardware devices such as memory and processor through a computer software program architecture.

[0326] This disclosure also provides an electronic device, including: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, causing the processor to perform a method according to any embodiment of this disclosure.

[0327] This disclosure also provides a readable storage medium storing executable instructions, which, when executed by a processor, are used to implement the method of any embodiment of this disclosure.

[0328] This disclosure also provides a computer program product, including a computer program / instructions, and a method for implementing any embodiment of this disclosure when the computer program / instructions are executed by a processor.

[0329] In the description of this specification, the references to terms such as "one embodiment / mode," "some embodiments / modes," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment / mode or example is included in at least one embodiment / mode or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment / mode or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments / modes or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments / modes or examples described in this specification, as well as the features of different embodiments / modes or examples.

[0330] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0331] Those skilled in the art should understand that the above embodiments are merely for illustrating the present disclosure and are not intended to limit the scope of the disclosure. Those skilled in the art can make other changes or modifications based on the above disclosure, and these changes or modifications still fall within the scope of the present disclosure.

Claims

1. A route map-based parking method characterized by comprising: Comprise: S1100: The vehicle-mounted parking module receives the start control signal generated and sent by the terminal parking module, and starts based on the start control signal; S1200: The terminal parking module outputs a first voice signal for interaction; S1300: The terminal parking module determines whether a first characteristic voice signal in response to the first voice signal is received; And S1400: The terminal parking module generates a path navigation route map, and the vehicle-mounted parking module executes a parking control process based on the path navigation route map; or the vehicle-mounted parking module sends the vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position to the terminal parking module, and executes a parking control process based on the historical parking target position selection instruction received by the terminal parking module; Wherein, the path navigation route map is a route map drawn by the user through the terminal parking module; In step S1200, further comprising: The vehicle-mounted parking module acquires the current position of the vehicle and determines whether there is vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position; The vehicle-mounted parking module acquires the current position of the vehicle and determines whether there is vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position, and the determination result is that there is no vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position, then step S1400 comprises: S1402: The terminal parking module outputs a drawing interface, and the drawing interface is used to receive the drawing operation of the user; S1404: The terminal parking module generates a path navigation route map containing route map characteristic elements based on the drawing operation received by the drawing interface and displays it for the user to confirm; the route map characteristic elements include fork signs, roundabout signs, parking space line signs, empty land signs, turning signs, and straight signs; S1406: The terminal parking module does not receive a confirmation instruction or receives a denial instruction, then outputs the drawing interface again to receive the drawing operation to execute step S1404 again.

2. The route map-based parking method according to claim 1, characterized by, Step S1400 further comprises: S1406: The terminal parking module receives a confirmation instruction, the terminal parking module analyzes the route map based on the preset route map characteristic elements, generates a path navigation program execution instruction and sends it to the vehicle-mounted parking module to execute a parking control process based on the path navigation program instruction.

3. The route map-based parking method according to claim 1, characterized by, The vehicle-mounted parking module acquires the current position of the vehicle and determines whether there is vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position, and the determination result is that there is vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position, then step S1400 comprises: S1402: The vehicle-mounted parking module outputs the vehicle historical trajectory information associated with the current position of the vehicle and including at least one historical parking target position to the terminal parking module for selection.

4. The route map-based parking method according to claim 3, characterized by, The step S1400 further comprises: S1404: the terminal parking module receives the historical parking target position selection instruction, and the vehicle-mounted parking module executes the parking control process based on the historical parking target position selection instruction.

5. The route map-based parking method according to claim 3, wherein, The step S1400 further comprises: S1404: the terminal parking module does not receive the historical parking target position selection instruction, and the terminal parking module outputs a drawing interface, and the drawing interface is used to receive a drawing operation of a user; and S1406: the terminal parking module generates a path navigation route map containing route map feature elements based on the drawing operation received by the drawing interface and displays the path navigation route map for the user to confirm.

6. The route map-based parking method according to claim 5, wherein, The step S1400 further comprises: S1408: the terminal parking module receives a confirmation instruction, the terminal parking module analyzes the route map based on preset route map feature elements, generates a path navigation program execution instruction, and sends the path navigation program execution instruction to the vehicle-mounted parking module to execute the parking control process based on the path navigation program execution instruction.

7. The route map-based parking method according to claim 5, wherein, The step S1400 further comprises: S1408: the terminal parking module does not receive the confirmation instruction or receives a denial instruction, and the drawing interface is output again to receive a drawing operation to execute the step S1406 again.

8. The route map-based parking method according to any one of claims 1 to 7, characterized by, The parking control process based on the path navigation route map comprises: The vehicle-mounted parking module determines whether the vehicle meets a starting condition, and generates a control signal to control the vehicle to start after the starting condition is met; The vehicle-mounted parking module obtains a feasible domain of a current road, performs local path planning in real time according to a road condition, and generates a control signal to control the vehicle to travel along the feasible domain; and The vehicle-mounted parking module executes a parking instruction in the path navigation program execution instruction, and generates a parking control signal based on the parking instruction to make the vehicle perform a parking action.

9. The route map-based parking method according to claim 8, characterized by, Further comprising: The vehicle-mounted parking module obtains a fork recognition result, and performs path planning based on the fork recognition result and fork information in the path navigation program execution instruction to update the feasible domain.

10. The route map-based parking method according to claim 9, characterized by, The path planning based on the fork recognition result and the fork information in the path navigation program execution instruction to update the feasible domain comprises: A two-dimensional grid map is constructed for the fork; Based on each edge line of the fork, all grids covering the edge line are assigned an initial value, and grids adjacent to all the assigned grids in the two-dimensional grid map are assigned values, a first value is added to a common edge grid, and a second value is added to a common corner grid, if a grid is adjacent to multiple grids, a minimum value is selected after a first value is added to a common edge grid or a second value is added to a common corner grid, and the grid is assigned a value, until all grids in the feasible domain are assigned values, and the grid assignment based on each edge line of the fork is completed; The grid assignment result based on the grid assignment based on each edge line is superimposed based on the grid map to obtain an initial superimposed assignment map; A center point of a grid with a minimum superimposed assignment in the initial superimposed assignment map is taken as a center point of the fork, if there are multiple grids with a minimum superimposed assignment, a geometric center of the grids is taken as the center point of the fork; The fork passing domain and each sub-path are obtained based on the center point of the fork; and update the feasible region based on the intersection passing region and each sub-path.

11. The route map-based parking method according to any one of claims 1 to 7, characterized by, based on the historical parking target position selection instruction, execute a parking control flow, including: S1441: compare the current position of the vehicle with at least one historical trajectory of the vehicle containing the selected historical parking target position, and obtain an optimal historical trajectory based on the number of times of traveling along the historical trajectory of the vehicle and the distance between the current position of the vehicle and the historical trajectory of the vehicle; S1442: determine whether the minimum distance between the optimal historical trajectory and the current position of the vehicle exceeds a preset distance, if yes, execute step S1443, and if no, execute step S1444; S1443: the vehicle-mounted parking module controls the vehicle to move forward along the current feasible region, and constantly marks the historical trajectory point closest to the current position of the vehicle to find the optimal historical trajectory, and whenever the vehicle encounters an intersection, the vehicle-mounted parking module controls the vehicle to turn into the branch pointed to by the direction of the line connecting the marked point, until the minimum distance between the current position of the vehicle and the optimal historical trajectory is less than or equal to the preset distance, and enter step S1444; S1444: the vehicle-mounted parking module controls the vehicle to reposition to control the vehicle to move to the optimal historical trajectory and align the historical pose; and S1445: plan an optimal global route from the optimal historical trajectory, and control the vehicle to travel to the target site based on the optimal global route.

12. The route map-based parking method according to any one of claims 1 to 7, characterized by, Step S1400 further includes the following parking processing flow: S1431: the vehicle-mounted parking module executes the parking instruction in the path navigation program execution instruction; S1432: determine the type of the parking instruction, if the type of the parking instruction is roadside parking, execute step S1433, if the type of the parking instruction is parking lot parking, execute step S1434, and if the type of the parking instruction is vacant land / square parking, execute step S1435; S1433: identify the roadside parking area, and the vehicle-mounted parking module generates a control signal to control the vehicle to enter the roadside parking area; S1434: identify the parking lot, and after success, identify the parking area, and after success, identify the parking space number, and after success, the vehicle-mounted parking module generates a control signal to control the vehicle to enter the parking space; S1435: identify the vacant land / square, and the vehicle-mounted parking module generates a control signal to control the vehicle to enter the vacant land / square; and S1436: when step S1433 / S1434 / S1435 is executed successfully, the vehicle-mounted parking module generates a control signal to control the vehicle to park, and generates parking success information and sends it to the user terminal device; when step S1433 / S1434 / S1435 fails, the vehicle-mounted parking module generates parking failure information and sends it to the mobile device.

13. A route map based parking system characterized by, including: a terminal parking module, which generates and sends a start control signal; and a vehicle-mounted parking module, which receives the start control signal and starts; wherein the terminal parking module includes: a route map generation module, which generates a path navigation route map based on the user's drawing operation; and a route map analysis module, which analyzes the path navigation route map to generate path navigation program instructions; The vehicle-mounted parking module comprises: a historical trajectory output module configured to output historical trajectory information of the vehicle associated with a current position of the vehicle and comprising at least one historical parking target position; a parking processing module configured to execute a parking control process based on a path navigation program instruction generated by the terminal parking module or a selected historical parking target position and corresponding historical trajectory information of the vehicle; the terminal parking module further comprises: a voice signal output module configured to output a first voice signal for interaction; a voice signal receiving module configured to receive a voice signal of a user; a first characteristic voice signal obtaining module configured to determine whether a first characteristic voice signal responsive to the first voice signal is received; the terminal parking module further comprises: a touch instruction receiving module configured to receive at least a historical parking target position selection instruction; the vehicle-mounted parking module obtains a current position of the vehicle and determines whether historical trajectory information of the vehicle associated with the current position of the vehicle and comprising at least one historical parking target position exists; the vehicle-mounted parking module obtains a current position of the vehicle and determines whether historical trajectory information of the vehicle associated with the current position of the vehicle and comprising at least one historical parking target position exists, and if the determination result is that no historical trajectory information of the vehicle associated with the current position of the vehicle and comprising at least one historical parking target position exists, then: S1402: the terminal parking module outputs a drawing interface, and the drawing interface is configured to receive a drawing operation of a user; S1404: the terminal parking module generates and displays a path navigation route map comprising route map characteristic elements based on the drawing operation received by the drawing interface, for confirmation by the user; the route map characteristic elements comprise a fork sign, a roundabout sign, a parking space line sign, a vacant land sign, a turning sign and a straight sign; S1406: the terminal parking module does not receive a confirmation instruction or receives a denial instruction, and then outputs the drawing interface again to receive a drawing operation again to execute step S1404 again.

14. An electronic device, comprising: comprise: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, so that the processor executes the parking method in any one of claims 1 to 12.

15. A readable storage medium, characterized by, The readable storage medium stores execution instructions, and the execution instructions are executed by the processor to implement the parking method in any one of claims 1 to 12.

16. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the parking method in any one of claims 1 to 12.

Images