CN112735133A - Method and device for identifying forbidden parking road sections - Google Patents
Method and device for identifying forbidden parking road sections Download PDFInfo
- Publication number
- CN112735133A CN112735133A CN202011612947.XA CN202011612947A CN112735133A CN 112735133 A CN112735133 A CN 112735133A CN 202011612947 A CN202011612947 A CN 202011612947A CN 112735133 A CN112735133 A CN 112735133A
- Authority
- CN
- China
- Prior art keywords
- road
- parking
- road segment
- segment
- violation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
Landscapes
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
According to an embodiment of the present disclosure, a method, an apparatus, a device, a storage medium, and a program product for identifying a no-parking section are provided. The method proposed herein comprises: acquiring a violation position where a violation parking behavior occurs; determining a target road section corresponding to the violation position from the group of road sections, wherein the violation position is matched with the position range indicated by the target road section; and associating the target road segment with a first marker indicating that the target road segment belongs to the no-parking segment. In this way, it is possible to effectively determine which road segments are likely to be parking-prohibited road segments based on the specific location where the illegal parking activity occurred.
Description
Technical Field
Embodiments of the present disclosure relate generally to the field of intelligent transportation and, more particularly, relate to a method, apparatus, device, storage medium, and program product for identifying a no-parking segment.
Background
With the progress of society, people increasingly utilize transportation to go out. In the process of traveling by means of vehicles, how to stop the vehicle has become a focus of increasing attention of drivers. Some road segments may prohibit temporary stops (also referred to as prohibited road segments), some road segments may prohibit long-term stops (also referred to as restricted road segments), and some road segments may allow long-term stops.
During driving, it may be difficult for the driver to effectively distinguish the road segments, and thus may cause illegal parking behavior. Accordingly, it is desirable to efficiently identify which road segments are no-stop road segments (no-stop road segments and/or no-stop road segments).
Disclosure of Invention
According to some embodiments of the present disclosure, a scheme for identifying a no-parking segment is provided.
In a first aspect of the disclosure, a method of identifying a no-parking segment is provided. The method comprises the following steps: acquiring a violation position where a violation parking behavior occurs; determining a target road section corresponding to the violation position from the group of road sections, wherein the violation position is matched with the position range indicated by the target road section; and associating the target road segment with a first marker indicating that the target road segment belongs to the no-parking segment.
In a second aspect of the disclosure, an apparatus for identifying a no-parking segment is provided. The device includes: the position acquisition module is configured to acquire a violation position where the violation parking behavior occurs; a road segment matching module configured to determine a target road segment corresponding to a violation location from a set of road segments, the violation location matching a location range indicated by the target road segment; and a first marking module configured to associate the target road segment with a first marking indicating that the target road segment belongs to a no-parking segment.
In a third aspect of the present disclosure, there is provided an electronic device comprising one or more processors and memory for storing computer-executable instructions for execution by the one or more processors to implement a method according to the first aspect of the present disclosure.
In a fourth aspect of the present disclosure, a computer-readable storage medium is provided having computer-executable instructions stored thereon, wherein the computer-executable instructions, when executed by a processor, implement a method according to the first aspect of the present disclosure.
In a fifth aspect of the present disclosure, a computer program product is provided comprising computer executable instructions, wherein the computer executable instructions, when executed by a processor, implement the method according to the first aspect of the present disclosure.
According to the embodiment of the disclosure, which road sections are possible to be the forbidden parking road sections can be effectively determined based on the specific position where the illegal parking behavior occurs.
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the disclosure, nor is it intended to be used to limit the scope of the disclosure.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, like or similar reference characters designate like or similar elements, and wherein:
FIG. 1 illustrates a block diagram of an example environment in which embodiments of the present disclosure can be implemented;
FIG. 2 illustrates a flow diagram of a process of identifying a no-go segment in accordance with some embodiments of the present disclosure;
FIGS. 3A and 3B illustrate schematic diagrams of determining a target road segment according to embodiments of the present disclosure;
FIG. 4 illustrates a flow diagram of a process of processing a first request to specify a parking location, according to some embodiments of the present disclosure;
FIGS. 5A and 5B illustrate schematic diagrams of processing a first request according to some embodiments of the present disclosure;
FIG. 6 illustrates a flow diagram of a process of processing a second request to specify a parking location, according to some embodiments of the present disclosure;
FIG. 7 illustrates a schematic diagram of processing a second request, according to some embodiments of the present disclosure;
FIG. 8 illustrates a block diagram of an apparatus to identify a no-go segment in accordance with some embodiments of the present disclosure; and
FIG. 9 illustrates a block diagram of an electronic device in which one or more embodiments of the disclosure may be implemented.
Detailed Description
Some example embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The term "include" and variations thereof as used herein is meant to be inclusive in an open-ended manner, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.
As discussed above, people may experience illegal parking behavior during the course of driving a vehicle, and may be penalized by the traffic management component, because the driver does not notice that certain road segments are no-parking segments. In some cases, one may obtain specific locations, e.g., coordinate information, where the parking violation occurred. However, such specific location information may be of limited assistance to a person.
In view of this, embodiments of the present disclosure provide a scheme for identifying a no-parking section. In the scheme, firstly, the violation position where the illegal parking behavior occurs is obtained, and the target road section corresponding to the violation position is determined from a group of road sections, wherein the violation position is matched with the position range indicated by the target road section. The determined target road segment may be set to be associated with a first flag to indicate that the target road segment belongs to a no-parking segment.
According to such a scheme, the embodiment of the disclosure determines that the corresponding road section is the parking prohibition road section by using the specific position where the illegal parking occurs. By extending specific coordinate points to road segments, embodiments of the present disclosure can better provide support for stop point recommendation, navigation reminders, and the like.
Some example embodiments of the disclosure will now be described with continued reference to the accompanying drawings.
FIG. 1 illustrates a block diagram of an example environment 100 in which embodiments of the present disclosure can be implemented. As shown in fig. 1, the environment 100 includes a computing device 150 configured to obtain a violation location 140 at which the parking violation occurred.
In some implementations, the violation location 140 may be actively reported by the user. For example, a driver may receive a paper ticket issued by the traffic management section during parking of a vehicle at the side road portion 120 in the road 110 as shown in fig. 1.
In an example where the computing device 150 is a server device, the driver may upload the ticket information to the computing device 150 through a terminal device, for example. Accordingly, the location of the terminal device uploading the ticket information may be determined by the computing device 150 as the violation location 140.
In examples where the computing device 150 is a terminal device associated with the driver, the driver may report violation penalty information, for example, through an application installed on the terminal device. For example, the driver may click on the "report violation in real time" function provided by the application to record the current ticket information received, and accordingly, the computing device 150 may determine the current location as the violation location 140.
In other implementations, the violation location 140 may be determined by a roadside device, for example. For example, a roadside monitoring device with a parking violation snapshot may determine that the vehicle generated a parking violation at the secondary portion 120 based on the image information, for example, and may determine the violation location 140 of the vehicle for the parking violation based on an appropriate roadside location technique (e.g., based on visual location).
Accordingly, the roadside device may, for example, transmit the violation location 140 directly to the computing device 150. Alternatively, the roadside device may, for example, also upload the violation information to a remote storage device (e.g., at a violation query server) that can provide the violation location 140 in response to a query by the computing device 150.
In still other implementations, the violation location 140 may be determined by other suitable terminal devices, for example. For example, other users may report parking violations to the traffic management department by taking images of violations with the intelligent terminal. Accordingly, the location of the terminal device taking the violation image may be determined as the violation location 140. Alternatively, the violation location 140 may be determined by further optimizing the location of the terminal device based on the violation image. It should be understood that the violation image may also be captured by other suitable devices, such as a tachograph or the like, for example.
In some implementations, the violation location 140 may also be determined by the computing device 150 based on the violation information reported by the user and the target trip associated with the violation information. The process of determining the violation location 140 based on the violation information and the target trip will be described in detail in conjunction with fig. 2 and will not be described in detail herein.
As shown in fig. 1, the computing device 150 may determine a target road segment 132-1 corresponding to the violation location 140 from a set of road segments (e.g., road segments 132-1, 132-2, 132-3, 134-1, 134-2, and 134-3) and associate the target road segment 132-1 with a first marker to indicate that the target road segment 132-1 belongs to a no-stop road segment. It should be understood that "a restricted parking segment" means that a parking violation may occur because a vehicle (e.g., a car, an electric vehicle, or a bicycle, etc.) is parked on the segment.
In some implementations, the road segments may have a predetermined length to indicate a corresponding location range. It should be understood that "length" herein means a distance along the extending direction of the road. It should be appreciated that the road segments may be set to an appropriate distance to balance the potential missed-report no-go road segments and the potential false-report no-go road segments.
The process of obtaining a set of road segments and determining a target road segment 132-1 from the set of road segments will be described in detail below in conjunction with fig. 2 and will not be described in detail here.
A process of identifying a no-parking section according to an embodiment of the present disclosure will be described in detail below with reference to fig. 2 to 7. Fig. 2 illustrates a schematic diagram of a process 200 for identifying a no-parking segment in accordance with some embodiments of the present disclosure. For ease of discussion, the process of identifying a no-parking segment is discussed with reference to FIG. 1. Process 200 may be performed, for example, at computing device 150 shown in fig. 1. It should be understood that process 200 may also include blocks not shown and/or may omit blocks shown. The scope of the present disclosure is not limited in this respect.
As shown in fig. 2, at block 202, the computing device 150 obtains the violation location 140 where the parking violation occurred.
As discussed above with reference to fig. 1, the computing device 150 may obtain the violation location 140 in a suitable manner.
In some implementations, the computing device 150 may also determine the violation location 140 based on the parking violation penalty information. In particular, the computing device 150 may obtain parking violation penalty information for parking violations. In some implementations, such parking violation penalty information may be actively uploaded by the driver or obtained from a traffic violation querying platform, for example.
Additionally, the computing device 150 may determine the violation location 140 at which the parking violation occurred based on the trajectory information for the target trip corresponding to the parking violation and the parking violation penalty information, wherein the trajectory information includes a set of locations associated with the target trip.
In some implementations, when a driver and/or user is making a particular trip, a terminal device associated with the driver and/or user (e.g., a smart terminal installed with a travel or navigation application, or an in-vehicle computing device) may periodically record location information and upload violation information to the computing device 150 as trajectory information associated with the particular trip.
Additionally, the computing device 150 may utilize appropriate means to correlate the violation penalty information to the corresponding target trip and determine the specific coordinates to send the violation parking based on the trajectory information as the violation location 140. For example, the computing device 150 may determine a target trip corresponding to the violation penalty information based on the violation time information and/or the violation location information. The computing device 150 may also determine the violation location 140 from the trajectory information for the target trip based on a match between the violation time information and/or the violation location information and the time and/or location corresponding to the trajectory information.
At block 204, the computing device 150 determines a target road segment 132-1 from a set of road segments that corresponds to the violation location 140, where the violation location matches the range of locations indicated by the target road segment 132-1.
In some implementations, the computing device 150 can determine a set of road units from the road network data based on the violation location 140. For example, the road network data may organize roads into road units (also referred to as links) based on a predetermined length.
As shown in FIG. 1, the computing device 150 may determine, for example, based on road network data, that the road units within a predetermined range of distance from the violation location 140 include road unit 130-1 and road unit 130-2.
In some implementations, the computing device 150 may determine the set of road units 130-1 and 130-2 directly as a set of road segments to filter.
In some implementations, the computing device 150 may also segment a set of road elements 130-1 and 130-2 to obtain a set of road segments (e.g., road segments 132-1, 132-2, 132-3, 134-1, 134-2, and 134-3) in view of a balance between potential missed and potential mislabeled forbidden parking segments, where the road segments have a shorter length than the road elements.
As discussed above, the road segment may have a predetermined length (in the direction of road extension) and may be capable of indicating a corresponding location range. The process of determining the target road segment will be described below with reference to fig. 3A and 3B.
In some implementations, the computing device 150 may determine the target road segment 132-1 from a set of road segments based on a range of locations indicated by the set of road segments, where the violation location 140 is within the range of locations indicated by the target road segment 132-1. As shown in fig. 3A, the violation location 315 may fall directly into the location range 310 indicated by the target road segment 132-1. Accordingly, the computing device 150 may determine the target road segment 132-1 based on the matching of the violation location 315 to the violation range 310.
In some cases, the determined violation location 140 may not be accurate enough to drift outside of the road segment, as the positioning data may drift. In some implementations, to address the issue of the violation location 140 drifting, the computing device 150 may also determine the target road segment 132-1 based on the distance between the violation location 140 and the end point locations of a set of road segments.
In particular, the computing device 150 may determine the target road segment 132-1 from a set of road segments based on end point locations of the set of road segments, wherein the distance of the violation location 140 from the end point location of the target road segment 132-1 is less than a predetermined threshold.
As shown in fig. 3B, the violation location 325 may not fall within the location range indicated by the set of road segments, and the computing device 150 may then calculate the distance of the violation location 325 from one or more endpoints of the road segments to determine the target road segment.
Illustratively, the computing device 150 may consider only 2 endpoints, e.g., endpoint 320-1 and endpoint 320-2, on the side adjacent to the violation location 325 and determine the target road segment 132-1 based on the violation location 325-1 being less than a predetermined threshold from both the endpoint 320-1 and the endpoint 320-2.
With continued reference to FIG. 2, at block 206, the computing device 150 associates the target road segment 132-1 with a first tag, wherein the first tag indicates that the target road segment 132-1 belongs to a no-go segment. In some implementations, the computing device 150 may, for example, mark the target road segment 132-1 as a no-stop road segment. Alternatively, the computing device 150 may mark the target road segment 132-1 as a high risk road segment.
Based on the methods discussed above, embodiments of the present disclosure are able to map discrete parking violations information to corresponding road segments. Unlike discrete locations, road segmentation will be able to more effectively assist in alerting drivers, assisting with trip planning, optimizing traffic management, and the like.
In some implementations, after determining the target road segment, the computing device 150 may also extend to extend the marked no-parking segment based on the target road segment.
In some implementations, the computing device 150 may determine a first adjacent road segment that is adjacent to the target road segment 132-1, where the first adjacent road segment is located in the same road unit 130-1 as the target road segment 132-1.
Continuing with the example of fig. 1, consider that there are generally similar traffic attributes in the same road unit. Accordingly, the computing device 150 may determine the road segment 132-2 in the road unit 130-1 that is adjacent to the target road segment 132-1.
Additionally, the computing device 150 may associate the first adjacent road segment with the first label. In particular, the computing device 150 may also mark the road segment 132-2 as a no-parking segment. Alternatively, the computing device 150 may mark the road segment 132-2 as a high risk road segment.
In some implementations, the computing device 150 may also extend the no-go road segment based on an adjacent road segment that is not in the same road unit as the target road segment 132-1. In particular, the computing device 150 may determine a second adjacent road segment that is adjacent to the target road segment 132-1, where the second adjacent road segment is located in a different road unit than the target road segment 132-1. In the example of FIG. 1, the computing device 150 may determine that the road segment 134-3 is adjacent to the target road segment 132-1 and located in a different road unit 130-2.
Additionally, the computing device 150 may associate a second adjacent road segment with a second marker, where the second marker indicates that the second adjacent road segment belongs to a possible forbidden road segment. In the example of fig. 1, the computing device 150 may, for example, mark the road segment 134-3 as a potential proscribed road segment. Alternatively, the computing device 150 may mark the road segment 134-3 as a medium risk segment.
In this way, the embodiments of the present disclosure may perform extended labeling on possible forbidden road segments, and determine different risk levels by using road network information.
In some implementations, different annotation information can be associated with different control policies. For example, in a navigated scenario, the user may not be allowed to set the destination on the road segment associated with the first marker. Conversely, if the destination is located on a road segment associated with the second marker, the navigation application may simply generate a possible risk alert without prohibiting the user from selecting that location as the end point.
In the shared trip scenario, when the user desires to end the trip on the road segment associated with the first marker, for example, to end the order of a shared car and stop, or to end the order of a shared car or a shared electric vehicle and lock, the shared vehicle may be set to fail to end the trip in view of the location being on a restricted stop segment to force the user to drive the vehicle to another location to end the order. Conversely, when the user desires to end the trip on the road segment associated with the second indicia, the user may end the order normally, but the user may be provided with a reminder that the location may belong to a restricted parking segment and ask the user to confirm and then end the trip to avoid creating illegal parking activity.
In some implementations, the above information can also assist in the selection of a docking location in the travel application. A flow diagram of a process 400 of processing a first request to specify a parking location according to some embodiments of the present disclosure will be described below in conjunction with FIG. 4.
As shown in fig. 4, at block 402, the computing device 150 may receive a first request to specify a first stop location in a trip. In some implementations, in a travel application, a user may actively specify possible stop locations in a trip, for example, through a terminal device, including but not limited to: an upper parking position, a midway parking position, a lower parking position and the like. Alternatively, the computing device 150 may automatically recommend the first parking location based on the user's historical travel.
At block 404, the computing device 150 may deny the first request in response to determining that the first stopping location corresponds to the road segment associated with the first marker. In particular, the computing device 150 may determine the road segment corresponding to the first parking location according to the process described above with respect to block 204.
Fig. 5A and 5B illustrate diagrams 500A and 500B of processing a first request according to some embodiments of the present disclosure. For example, in FIG. 5A, the computing device 150 may determine that the road segment 132-1 corresponds to the parking location 510 based on the parking location 510 being within the range of locations indicated by the road segment 132-1. Similarly, in FIG. 5B, the computing device 150 may determine that the road segment 132-2 corresponds to a parking location 520.
Additionally, the computing device 150 may deny the first request to specify the first parking location because the road segment 132-1 and the road segment 132-2 are marked as either the no-parking road segment or the high risk road segment according to the methods discussed above. For example, the user may not be able to move the visual marker (e.g., a pushpin) at the terminal device that selects the location of the waypoint to the road segment associated with the first marker. Alternatively, the terminal device may display a visual marker (e.g., a pin) indicating the location of the waypoint in a particular manner (e.g., gray, dashed box, or increased transparency) to indicate that the location cannot be designated as a waypoint. It should be appreciated that the terminal device may also alert the user in an appropriate manner that the location cannot be designated as a stop point because it is located on a no-stop road segment.
Alternatively, the process 400 also includes block 406, and the computing device 150 may also provide at least one candidate docking location, wherein the risk of the at least one candidate docking location being located on the forbidden parking segment is less than a predetermined threshold.
As shown in FIG. 5A, the computing device 150 may also provide, for example, candidate parking locations 515-1 and 515-2 that are associated with, for example, road segments that are not marked as a no-parking segment or a possible no-parking segment. In the example of fig. 5B, the computing device 150 may provide the candidate docking locations 525 accordingly.
In some implementations, in determining the candidate docking location, the computing device 150 may also consider a distance between the candidate docking location and the first docking location that is desired to be specified to avoid impacting the user experience. For example, the distance between the provided candidate parking position and the first parking position desired to be specified is not greater than a predetermined distance threshold.
Based on the mode, the embodiment of the disclosure can effectively intervene in the selection of the parking point position, and further avoid possible illegal parking behaviors.
In some implementations, the computing device 150 may employ a weaker constraint policy for the road segments associated with the second indicia. FIG. 6 depicts a flowchart of a process 600 for processing a second request to specify a parking location, according to some embodiments of the present disclosure.
As shown in fig. 6, at block 602, the computing device 150 may receive a second request to specify a second parking location in the trip. Fig. 7 illustrates a schematic diagram 700 of processing a second request, according to some embodiments of the present disclosure. In the example of FIG. 7, the user may, for example, designate location 710 as a stop location in the trip.
At block 604, in response to determining that the second parking location corresponds to the road segment associated with the second marker, the computing device 150 may generate an alert that the second parking location may be located on the forbidden road segment.
Continuing with the example of FIG. 7, the computing device 150 may determine, for example, that the parking location 710 corresponds to the road segment 134-3 and that the road segment 134-3 is associated with the second marker. Accordingly, the computing device 150 can provide a reminder 720 to the user to indicate that the parking location 710 is located on a possible proscribed parking segment before confirming the second request.
In some implementations, the computing device 150 may not acknowledge the second request to set the docking location 710 as the in-flight docking location after receiving the second acknowledgement by the user.
In some implementations, the computing device 150 can also provide at least one candidate parking location, wherein the risk of the at least one candidate parking location being located on the forbidden road segment is less than a predetermined threshold. For example, in fig. 7, the computing device 150 may provide the candidate docking location 715 to the user for selection by the user as the docking location.
Based on the mode, the embodiment of the disclosure can further give consideration to balance between reduction of illegal parking risks and guarantee of user experience.
Fig. 8 illustrates a schematic block diagram of an apparatus 800 for identifying a no-parking segment in accordance with certain embodiments of the present disclosure. The apparatus 800 may be embodied as or included in the computing device 150 or other device that implements the processes of the present disclosure for identifying a no-parking segment.
As shown in fig. 8, the apparatus 800 includes: a location acquisition module 810 configured to acquire a violation location where the parking violation occurred. The apparatus 800 further includes a road segment matching module 820 configured to determine a target road segment from the set of road segments corresponding to a violation location that matches the location range indicated by the target road segment. Furthermore, the apparatus 800 further comprises a first marking module 830 configured to associate the target road segment with a first marking indicating that the target road segment belongs to a no-go segment
In some implementations, the location acquisition module 810 includes: the penalty information acquisition module is configured to acquire illegal parking penalty information aiming at the illegal parking behaviors; and a violation location determination module configured to determine a violation location where the violation parking act occurs based on trajectory information of the target trip corresponding to the violation parking act and the violation parking penalty information, the trajectory information including a set of locations associated with the target trip.
In some implementations, the road segment matching module 820 includes: a first matching module configured to determine a target road segment from a set of road segments based on a range of locations indicated by the set of road segments, wherein the violation location is within the range of locations indicated by the target road segment.
In some implementations, the road segment matching module 820 includes: a second matching module configured to determine a target road segment from the set of road segments based on an end point location of the set of road segments, wherein a distance of the violation location from the end point location of the target road segment is less than a predetermined threshold.
In some implementations, the road segment matching module 820 includes: the road network data acquisition module is configured to acquire a group of road units from the road network data; and a segmentation module configured to segment a set of road elements to obtain a set of road segments, the road segments having a shorter length than the road elements.
In some implementations, the apparatus 800 further includes: a first extension module configured to determine a first adjacent road segment adjacent to the target road segment, the first adjacent road segment being located in the same road unit as the target road segment; and a second marking module configured to associate the first adjacent road segment with the first marking.
In some implementations, the apparatus 800 further includes: a first request receiving module configured to receive a first request specifying a first parking position in a course; and a first processing module configured to reject the first request in response to determining that the first stopping location corresponds to a road segment associated with the first marker.
In some implementations, the apparatus 800 further includes: a candidate location providing module configured to provide at least one candidate parking location with a risk of being located on the forbidden parking segment being less than a predetermined threshold.
In some implementations, the apparatus 800 further includes: a second extension module configured to determine a second adjacent road segment adjacent to the target road segment, the second adjacent road segment being located in a different road unit than the target road segment; and a third tagging module configured to associate a second adjacent road segment with a second tag indicating that the second adjacent road segment belongs to a possible no-parking segment.
In some implementations, the apparatus 800 further includes: a second request receiving module configured to receive a second request specifying a second parking position in the course; a second processing module configured to generate a reminder that the second parking location is likely to be located on the forbidden road segment in response to determining that the second parking location corresponds to the road segment associated with the second marker.
FIG. 9 illustrates a block diagram that shows an electronic device 900 in which one or more embodiments of the disclosure may be implemented. It should be understood that the electronic device 900 illustrated in FIG. 9 is merely exemplary and should not be construed as limiting in any way the functionality and scope of the embodiments described herein. The electronic device 900 shown in fig. 9 may be included in or implemented as the computing device 190 of fig. 1 or other device for identifying a no-parking segment that implements the present disclosure.
As shown in fig. 9, the electronic device 900 is in the form of a general purpose computing device. The electronic device 900 may also be any type of computing device or server. Components of electronic device 900 may include, but are not limited to, one or more processors or processing units 910, memory 920, storage 930, one or more communication units 940, one or more input devices 950, and one or more output devices 960. The processing unit 910 may be a real or virtual processor and can perform various processes according to programs stored in the memory 920. In a multi-processor system, multiple processing units execute computer-executable instructions in parallel to improve the parallel processing capabilities of electronic device 900.
The electronic device 900 may further include additional removable/non-removable, volatile/nonvolatile storage media. Although not shown in FIG. 9, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, non-volatile optical disk may be provided. In these cases, each drive may be connected to a bus (not shown) by one or more data media interfaces. Memory 920 may include a computer program product 925 having one or more program modules configured to perform the various methods or acts of the various embodiments of the disclosure.
The communication unit 940 enables communication with other computing devices over a communication medium. Additionally, the functionality of the components of the electronic device 900 may be implemented in a single computing cluster or multiple computing machines, which are capable of communicating over a communications connection. Thus, the electronic device 900 may operate in a networked environment using logical connections to one or more other servers, network Personal Computers (PCs), or another network node.
The input device 950 may be one or more input devices such as a mouse, keyboard, trackball, or the like. Output device 960 may be one or more output devices such as a display, speakers, printer, etc. Electronic device 900 may also communicate with one or more external devices (not shown), such as storage devices, display devices, etc., communication devices with one or more devices that enable a user to interact with electronic device 900, or communication devices (e.g., network cards, modems, etc.) that enable electronic device 900 to communicate with one or more other computing devices, via communication unit 940, as desired. Such communication may be performed via input/output (I/O) interfaces (not shown).
According to an exemplary implementation of the present disclosure, a computer-readable storage medium is provided, on which computer-executable instructions or a program are stored, wherein the computer-executable instructions or the program are executed by a processor to implement the above-described method or function. The computer-readable storage medium may include a non-transitory computer-readable medium. According to an exemplary implementation of the present disclosure, there is also provided a computer program product comprising computer executable instructions or a program, which are executed by a processor to implement the above described method or function. The computer program product may be tangibly embodied on a non-transitory computer-readable medium.
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus, devices and computer program products implemented in accordance with the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-executable instructions or programs.
These computer-executable instructions or programs may be provided to a processing unit of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processing unit of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-executable instructions or programs may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer-executable instructions or programs may be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer-implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various implementations of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The foregoing has described implementations of the present disclosure, and the above description is illustrative, not exhaustive, and not limited to the implementations disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described implementations. The terminology used herein was chosen in order to best explain the principles of various implementations, the practical application, or improvements to the technology in the marketplace, or to enable others of ordinary skill in the art to understand various implementations disclosed herein.
Claims (14)
1. A method of identifying a no-parking segment, comprising:
acquiring a violation position where a violation parking behavior occurs;
determining a target road section corresponding to the violation position from a group of road sections, wherein the violation position is matched with the position range indicated by the target road section; and
associating the target road segment with a first marker indicating that the target road segment belongs to a no-parking segment.
2. The method of claim 1 wherein obtaining the violation location comprises:
acquiring illegal parking penalty information aiming at the illegal parking behavior; and
and determining a violation position of the illegal parking behavior based on the track information of the target travel corresponding to the illegal parking behavior and the illegal parking penalty information, wherein the track information comprises a group of positions associated with the target travel.
3. The method of claim 1, wherein determining a target road segment comprises:
determining the target road segment from the set of road segments based on the indicated location range of the set of road segments, wherein the violation location is within the indicated location range of the target road segment.
4. The method of claim 1, wherein determining a target road segment comprises:
determining the target road segment from the set of road segments based on end point locations of the set of road segments, wherein the distance of the violation location from the end point location of the target road segment is less than a predetermined threshold.
5. The method of claim 1, further comprising:
acquiring a group of road units from road network data; and
segmenting the set of road elements to obtain the set of road segments, the road segments having a shorter length than the road elements.
6. The method of claim 5, further comprising:
determining a first adjacent road segment adjacent to the target road segment, the first adjacent road segment being located in the same road unit as the target road segment; and
associating the first adjacent road segment with the first marker.
7. The method of any of claims 1 to 6, further comprising:
receiving a first request to specify a first stop position in the trip; and
in response to determining that the first stop location corresponds to a road segment associated with the first marker, denying the first request.
8. The method of claim 7, further comprising:
providing at least one candidate parking location with a risk of being located on a no-parking segment that is less than a predetermined threshold.
9. The method of claim 5, further comprising:
determining a second adjacent road segment adjacent to the target road segment, the second adjacent road segment being located in a different road unit than the target road segment; and
associating the second adjacent road segment with a second marker indicating that the second adjacent road segment belongs to a possible proscribed stopped road segment.
10. The method of claim 9, further comprising:
receiving a second request to specify a second parking position in the trip;
in response to determining that the second parking location corresponds to the road segment associated with the second marker, generating an alert that the second parking location is likely located on a forbidden road segment.
11. An apparatus for identifying a no-parking segment, comprising:
the position acquisition module is configured to acquire a violation position where the violation parking behavior occurs;
a road section matching module configured to determine a target road section corresponding to the violation location from a group of road sections, the violation location matching a location range indicated by the target road section; and
a first marking module configured to associate the target road segment with a first marking indicating that the target road segment belongs to a no-parking segment.
12. An electronic device, comprising:
a memory and a processor;
wherein the memory is to store one or more computer instructions, wherein the one or more computer instructions are to be executed by the processor to implement the method of any one of claims 1 to 10.
13. A computer readable storage medium having one or more computer instructions stored thereon, wherein the one or more computer instructions are executed by a processor to implement the method of any one of claims 1 to 10.
14. A computer program product comprising computer executable instructions, wherein the computer executable instructions, when executed by a processor, implement the method of any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011612947.XA CN112735133A (en) | 2020-12-30 | 2020-12-30 | Method and device for identifying forbidden parking road sections |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011612947.XA CN112735133A (en) | 2020-12-30 | 2020-12-30 | Method and device for identifying forbidden parking road sections |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112735133A true CN112735133A (en) | 2021-04-30 |
Family
ID=75611800
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011612947.XA Pending CN112735133A (en) | 2020-12-30 | 2020-12-30 | Method and device for identifying forbidden parking road sections |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112735133A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117765727A (en) * | 2023-12-12 | 2024-03-26 | 佛山职业技术学院 | Intelligent control system for automobile road surface planning |
| CN117765727B (en) * | 2023-12-12 | 2024-06-07 | 佛山职业技术学院 | Intelligent control system for automobile road surface planning |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180105174A1 (en) * | 2016-10-14 | 2018-04-19 | Waymo Llc | Planning stopping locations for autonomous vehicles |
| CN108847033A (en) * | 2018-08-22 | 2018-11-20 | 河南弋之众合信息科技有限公司 | Section matching process, device and the server violating the regulations of vehicle |
| CN111179578A (en) * | 2018-11-09 | 2020-05-19 | 北京嘀嘀无限科技发展有限公司 | Method and system for determining parking place limitation |
| CN111831369A (en) * | 2020-06-03 | 2020-10-27 | 北京嘀嘀无限科技发展有限公司 | Interaction method and device based on map interface, electronic equipment and storage medium |
| CN111881713A (en) * | 2020-05-21 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method, system, device and storage medium for identifying parking place |
| CN111951144A (en) * | 2020-08-26 | 2020-11-17 | 腾讯科技（深圳）有限公司 | Method and device for determining violation road section and computer readable storage medium |
-
2020
- 2020-12-30 CN CN202011612947.XA patent/CN112735133A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180105174A1 (en) * | 2016-10-14 | 2018-04-19 | Waymo Llc | Planning stopping locations for autonomous vehicles |
| CN108847033A (en) * | 2018-08-22 | 2018-11-20 | 河南弋之众合信息科技有限公司 | Section matching process, device and the server violating the regulations of vehicle |
| CN111179578A (en) * | 2018-11-09 | 2020-05-19 | 北京嘀嘀无限科技发展有限公司 | Method and system for determining parking place limitation |
| CN111881713A (en) * | 2020-05-21 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Method, system, device and storage medium for identifying parking place |
| CN111831369A (en) * | 2020-06-03 | 2020-10-27 | 北京嘀嘀无限科技发展有限公司 | Interaction method and device based on map interface, electronic equipment and storage medium |
| CN111951144A (en) * | 2020-08-26 | 2020-11-17 | 腾讯科技（深圳）有限公司 | Method and device for determining violation road section and computer readable storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117765727A (en) * | 2023-12-12 | 2024-03-26 | 佛山职业技术学院 | Intelligent control system for automobile road surface planning |
| CN117765727B (en) * | 2023-12-12 | 2024-06-07 | 佛山职业技术学院 | Intelligent control system for automobile road surface planning |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN207022040U (en) | Mobile unit and service provider computer | |
| US9256995B2 (en) | Apparatus for diagnosing driving behavior, method for diagnosing driving behavior, and program thereof | |
| CN107389085B (en) | Method and device for determining road traffic attributes, computer and storage medium | |
| US20150166069A1 (en) | Autonomous driving style learning | |
| CN112885145B (en) | Crossing risk early warning method and device | |
| US20180285663A1 (en) | Method and apparatus for augmenting a training data set | |
| CN106228848B (en) | A kind of parking navigation method and apparatus | |
| CN111158359B (en) | Obstacle processing method and device | |
| CN109284801B (en) | Traffic indicator lamp state identification method and device, electronic equipment and storage medium | |
| CN111380546A (en) | Vehicle positioning method and device based on parallel road, electronic equipment and medium | |
| CN112885130B (en) | Method and device for presenting road information | |
| CN109118797B (en) | Information sharing method, device, equipment and storage medium | |
| CN110491127A (en) | A kind of current bootstrap technique, device and readable storage medium storing program for executing | |
| CN109658721A (en) | Traffic sign display device, recognition methods, device, equipment and medium | |
| CN112257652A (en) | Method, device, equipment and storage medium for determining travelable area | |
| CN104724121B (en) | The device and method in the traveling field of vehicle for identification | |
| CN110869867B (en) | Method, apparatus and storage medium for verifying digital map of vehicle | |
| DE102021119012A1 (en) | PLATOONING CONTROL DEVICE, SERVER AND METHOD | |
| CN112735133A (en) | Method and device for identifying forbidden parking road sections | |
| CN112700648B (en) | Method and device for determining traffic violation position | |
| US20230112009A1 (en) | Data structures, storage media, storage device and receiver | |
| CN111605481A (en) | Congestion car following system and terminal based on look around | |
| CN110539748A (en) | congestion car following system and terminal based on look around | |
| CN115597578A (en) | Self-positioning of a vehicle in a parking facility with selective sensor activation | |
| CN112712696A (en) | Method and device for determining road section with illegal parking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210430 |