CN111770447B - Method and device for generating electronic fence and server - Google Patents
Method and device for generating electronic fence and server Download PDFInfo
- Publication number
- CN111770447B CN111770447B CN202010901858.0A CN202010901858A CN111770447B CN 111770447 B CN111770447 B CN 111770447B CN 202010901858 A CN202010901858 A CN 202010901858A CN 111770447 B CN111770447 B CN 111770447B
- Authority
- CN
- China
- Prior art keywords
- type
- electronic fence
- fence
- target
- data
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/35—Services specially adapted for particular environments, situations or purposes for the management of goods or merchandise
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Traffic Control Systems (AREA)
Abstract
The disclosure provides a method, a device and a server for generating an electronic fence, wherein the method comprises the following steps: acquiring first type target data and second type target data in a target area; acquiring a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data; processing the first type of target data according to the first processing rule to obtain a first type of electronic fence, and processing the second type of target data according to the second processing rule to obtain a second type of electronic fence; and generating a target electronic fence of the target area according to the first type electronic fence and the second type electronic fence.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of electronic fences, and in particular relates to a method for generating an electronic fence, a device for generating the electronic fence and a server.
Background
The parking spots refer to the geographical areas where the vehicles are shared and the parking management is standardized, the problem of parking spot location is an important problem in the shared vehicle service, the location directly influences whether the function of the system can be exerted to the maximum extent or not, and whether the system resources can be efficiently utilized or not.
However, although the conventional parking spot planning mainly involves manually drawing a parking spot, that is, planning a parking spot depending on the living experience of a person, it is considered that the range of human cognition is limited, and the efficiency of manually planning a parking spot is low, and thus a parking spot in a county cannot be quickly planned in a short time.
Disclosure of Invention
It is an object of the disclosed embodiments to provide a new technical solution for generating an electronic fence.
According to a first aspect of the present disclosure, there is provided an embodiment of a method of generating an electronic fence, the method comprising:
acquiring first type target data and second type target data in a target area;
acquiring a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data;
processing the first type of target data according to the first processing rule to obtain a first type of electronic fence, and processing the second type of target data according to the second processing rule to obtain a second type of electronic fence;
and generating a target electronic fence of the target area according to the first type electronic fence and the second type electronic fence.
Optionally, the first type of object data comprises order data of a vehicle;
the processing the first type of target data according to the first processing rule to obtain a first type of electronic fence includes:
acquiring position data of the vehicle from the order data of the vehicle;
and clustering the position data based on a preset clustering algorithm to generate the first type of electronic fence in the target area.
Optionally, the second type of target data comprises map data of the target area,
processing the second type of target data according to the second processing rule to obtain a second type of electronic fence, including:
acquiring a preset region of interest in the map data;
filtering the region of interest according to the service type of the region of interest;
and taking the region of interest remained after filtering as the second type of electronic fence in the target region.
Optionally, the second type of target data further comprises manually entered fence data,
processing the second type of target data according to the second processing rule to obtain a second type of electronic fence, further comprising:
an input interface for providing fence data;
acquiring fence data input through the input interface;
and generating the second type of electronic fence in the target area according to the input fence data.
Optionally, the generating a target fence of the target area according to the first type of fence and the second type of fence includes:
acquiring fence priorities of the first type of electronic fence and the second type of electronic fence;
deleting the electronic fence with low priority when the distance between any two electronic fences is less than or equal to a set distance threshold;
and taking the electronic fence reserved after deletion as a target electronic fence in the target area.
Optionally, the generating a target electronic fence of the target area according to the first type electronic fence and the second type electronic fence further includes:
calculating and saving attribute values of the first type of electronic fence and the second type of electronic fence;
providing a selection interface for selecting the attribute value;
and acquiring and displaying the electronic fence under the attribute value selected through the selection interface as the target electronic fence.
Optionally, the method further comprises:
acquiring the similarity between the target area and other selected areas;
acquiring a preset number of regions as reference regions according to the sequence of similarity from large to small;
acquiring position data of a target object in the reference area;
and clustering the position data in the reference area based on the clustering algorithm to generate a first type of electronic fence in the reference area.
Optionally, the method further comprises:
acquiring a first number of the target electronic fences;
acquiring a second number of the first type of electronic fence;
comparing the first quantity with the second quantity to obtain a comparison result;
and under the condition that the comparison result shows that the first number is the same as the second number, clustering the position data in the reference area based on the clustering algorithm to generate the first-class electronic fence in the reference area.
Optionally, the method further comprises:
when the comparison result shows that the first quantity is different from the second quantity, adjusting the parameters of the clustering algorithm until the first quantity is the same as the second quantity; clustering the position data in the reference area according to the adjusted clustering algorithm to generate a first type of electronic fence in the reference area.
There is also provided, in accordance with a second aspect of the present disclosure, an embodiment of an apparatus for generating an electronic fence, the apparatus comprising:
the first acquisition module is used for acquiring first-class target data and second-class target data in a target area;
the second acquisition module is used for acquiring a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data;
the processing module is used for processing the first type of target data according to the first processing rule to obtain a first type of electronic fence, and processing the second type of target data according to the second processing rule to obtain a second type of electronic fence;
and the generating module is used for generating a target electronic fence of the target area according to the first type of electronic fence and the second type of electronic fence.
There is also provided, in accordance with a third aspect of the present specification, an embodiment of a server, comprising:
the apparatus of the second aspect above; alternatively, it comprises:
a memory for storing executable instructions;
and the processor is used for operating the server to execute the method for generating the electronic fence according to the first aspect.
The method, the device and the server have the advantages that according to the method, the device and the server disclosed by the embodiment of the disclosure, the server can collect different types of data in the target area, process the different types of data by using different processing rules to generate different types of candidate electronic fences, and further generate the target electronic fence in the target area according to the different types of candidate electronic fences, namely, the target electronic fence in the target area can be automatically generated according to the different types of data in the target area, and the accuracy and the efficiency of electronic fence generation are improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 is a schematic block diagram showing a hardware configuration of a system for generating an electronic fence that can be used to implement an embodiment of the present disclosure;
fig. 2 is a schematic flow chart diagram of a method of generating an electronic fence according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram of an electronic fence according to an embodiment of the present disclosure;
FIG. 4 is an interface presentation diagram of attribute values according to an embodiment of the present disclosure;
fig. 5 is a functional block diagram of an apparatus for generating an electronic fence according to an embodiment of the present disclosure;
fig. 6 is a flow chart of a method of generating an electronic fence according to an example of the present disclosure;
FIG. 7 is a functional block diagram of a server according to the present disclosure;
fig. 8 is a hardware configuration diagram of a server according to an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
< hardware configuration >
Fig. 1 is a block diagram of a hardware configuration of a system 100 for generating an electronic fence that can be used to implement an embodiment of the present invention.
As shown in fig. 1, the system 100 for generating an electronic fence includes a server 1000, a mobile terminal 2000, and a vehicle 3000.
The server 1000 provides a service point for processes, databases, and communications facilities. The server 1000 may be a unitary server or a distributed server across multiple computers or computer data centers. The server may be of various types, such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interaction server, a database server, or a proxy server. In some embodiments, each server may include hardware, software, or embedded logic components or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server, such as a blade server, a cloud server, etc., or may be a server group consisting of a plurality of servers, which may include one or more of the above types of servers, etc.
In one embodiment, the server 1000 may be as shown in fig. 1, including a processor 1100, a memory 1200, an interface device 1300, a communication device 1400, a display device 1500, an input device 1600.
In other embodiments, the server 1000 may further include a speaker, a microphone, and the like, which are not limited herein.
The processor 1100 may be a dedicated server processor, or may be a desktop processor, a mobile version processor, or the like that meets performance requirements, and is not limited herein. The memory 1200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1300 includes, for example, various bus interfaces such as a serial bus interface (including a USB interface), a parallel bus interface, and the like. Communication device 1400 is capable of wired or wireless communication, for example. The display device 1500 is, for example, a liquid crystal display, an LED display touch panel, or the like. The input device 1600 may include, for example, a touch screen, a keyboard, and the like.
In this embodiment, the memory 1200 of the server 1000 is used for storing instructions for controlling the processor 1100 to operate at least to execute the method for generating the electronic fence according to any embodiment of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.
Although a plurality of devices of the server 1000 are illustrated in fig. 1, the present invention may relate to only some of the devices, for example, the server 1000 relates to only the memory 1200 and the processor 1100.
In this embodiment, the mobile terminal 2000 is, for example, a mobile phone, a laptop, a tablet computer, a palmtop computer, a wearable device, and the like.
As shown in fig. 1, the mobile terminal 2000 may include a processor 2100, a memory 2200, an interface device 2300, a communication device 2400, a display device 2500, an input device 2600, a speaker 2700, a microphone 2800, and the like.
The processor 2100 may be a mobile version processor. The memory 2200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 2300 includes, for example, a USB interface, a headphone interface, and the like. The communication device 2400 can perform wired or wireless communication, for example, the communication device 2400 may include a short-range communication device, such as any device that performs short-range wireless communication based on a short-range wireless communication protocol, such as a Hilink protocol, WiFi (IEEE 802.11 protocol), Mesh, bluetooth, ZigBee, Thread, Z-Wave, NFC, UWB, LiFi, and the like, and the communication device 2400 may also include a remote communication device, such as any device that performs WLAN, GPRS, 2G/3G/4G/5G remote communication. The display device 2500 is, for example, a liquid crystal display panel, a touch panel, or the like. The input device 2600 may include, for example, a touch screen, a keyboard, and the like. A user can input/output voice information through the speaker 2700 and the microphone 2800.
In this embodiment, the mobile terminal 2000 may be configured to receive and display information pushed by the server 1000 to the user using the vehicle 3000.
In this embodiment, the memory 2200 of the mobile terminal 2000 is configured to store instructions for controlling the processor 2100 to operate to perform a method of using the vehicle 3000, for example, including at least: acquiring an identity of a vehicle 3000, forming an unlocking request for a specific vehicle, and sending the unlocking request to a server; and performing bill calculation and the like according to the charge settlement notification sent by the server. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.
Although a plurality of devices of the mobile terminal 2000 are illustrated in fig. 1, the present invention may relate only to some of the devices, for example, the mobile terminal 2000 may relate only to the memory 2200 and the processor 2100, the communication device 2400, and the display device 2500.
The vehicle 3000 may be a bicycle shown in fig. 1, and may be various types such as a tricycle, an electric scooter, a motorcycle, and a four-wheeled passenger vehicle, and is not limited thereto.
As shown in fig. 1, vehicle 3000 may include a processor 3100, a memory 3200, an interface device 3300, a communication device 3400, an output device 3500, and an input device 3600. The processor 3100 may be a microprocessor MCU or the like. The memory 3200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface 3300 includes, for example, a USB interface, a headphone interface, and the like. The communication device 3400 is capable of wired or wireless communication, for example, and also capable of short-range and long-range communication, for example. The output device 3500 may be, for example, a device that outputs a signal, may be a display device such as a liquid crystal display screen or a touch panel, or may be a speaker or the like that outputs voice information or the like. The input device 3600 may include, for example, a touch panel, a keyboard, or the like, and may input voice information through a microphone.
Although a plurality of devices of the vehicle 3000 are shown in fig. 1, the present invention may relate only to some of the devices, for example, the vehicle 3000 relates only to the communication device 3400, the memory 3200, and the processor 3100. Alternatively, a lock mechanism, not shown in fig. 1, controlled by the processor 3100, and a sensor device for detecting a state of the lock mechanism, etc. may also be included.
In this embodiment, the vehicle 3000 may report its own position information to the server 1000, and report its own use state information to the server 1000, for example, when it is detected that the user has completed the lock operation, a lock notification signal may be reported to the server 1000.
In this embodiment, memory 3200 of vehicle 3000 is configured to store instructions configured to control processor 3100 to operate to perform information interaction with server 1000, e.g., to report usage status information of itself to server 1000; for another example, when it is detected that the user completes the locking operation, a locking notification signal is reported to the server 1000; for example, the unlocking is performed according to an unlocking instruction issued by the server. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.
The network 4000 may be a wireless communication network or a wired communication network, and may be a local area network or a wide area network. In the system 100 for generating an electronic fence shown in fig. 1, the vehicle 3000 and the server 1000, and the mobile terminal 2000 and the server 1000 may communicate via the network 4000. The vehicle 3000 may be the same as the server 1000, and the network 4000 through which the mobile terminal 2000 communicates with the server 1000 may be different from each other.
It should be understood that although fig. 1 shows only one server 1000, mobile terminal 2000, vehicle 3000, it is not meant to limit the number of each, and multiple servers 1000, multiple mobile terminals 2000, multiple vehicles 3000 may be included in the system 100 for generating an electronic fence.
The server 1000 is used to provide all the functions necessary to support vehicle use; the mobile terminal 2000 may be a mobile phone on which a vehicle use application is installed, and the vehicle use application may help a user to implement a function of using the vehicle 3000.
< method examples >
Fig. 2 is a flowchart illustrating a method of generating an electronic fence according to an embodiment of the present disclosure, which may be implemented by a server, which may be the server 1000 shown in fig. 1.
In step S2100, first type target data and second type target data in the target area are acquired.
The target area is a predefined area range, and may be defined according to a minimum unit of vehicle operation. For example, if a vehicle is operated in a minimum unit of a city, the target area is a certain city; for another example, if the vehicle operation is performed with the administrative area of a certain city as the minimum unit, the target area is a certain administrative area of a certain city; for another example, if the vehicle operation is performed with the administrative street of an administrative area in a certain city as the minimum unit, the target area may be a certain administrative street, and the like, which is not limited herein.
The above first type of object data may include order data of the vehicle.
Of course, the first type of target data may also include delivery trajectory data of delivery personnel, such as a rider, a network jockey, or other personnel. The delivery trajectory may represent different trajectories according to different application scenarios, for example, in a take-away scenario, the delivery trajectory may be a meal delivery trajectory; also for example, in a network appointment scenario, the target order may be a travel track.
The above second type target data may include map data of the target area, and may also include fence data manually input.
The map data may be data provided by any service party providing map services, and the fence data may be size data of a fence, modification data of a fence, and the like, which is not described herein in detail in this embodiment.
In step S2200, a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data are obtained.
The first processing rule is used for clustering the first type of target data, for example, clustering the position data of the vehicle and the position data of the delivery personnel.
The second processing rule may be used to filter the second type of target data, for example, to filter the map data of the target area. Of course, in the case that the second type target data includes manually input fence data, the second processing rule may also be used for parsing and storing the manually input fence data.
Step S2300, processing the first type target data according to the first processing rule to obtain a first type electronic fence, and processing the second type target data according to the second processing rule to obtain a second type electronic fence.
The electric fence is a parking spot area defined according to a plan, and many electric fences are set based on the need of parking management of different regions, such as a city, an administrative region of the city, a street, a grid, and the like, wherein the grid can be obtained by dividing a vehicle operation range, for example, the vehicle operation range is divided into 100 meters x 100 meters.
In step S2300, different processing rules may be applied to different types of data, so as to obtain different electronic fences. The first type of electronic fence comprises a clustering electronic fence, and the second type of electronic fence comprises a POI (point of information) electronic fence and a manual correction electronic fence.
In one example, in the case that the first type target data includes position data of a target object, such as a vehicle, the processing the first type target data according to the first processing rule in step S2300 to obtain the first type electronic fence may further include the following steps S2311 to S2313:
in step S2311, position data of the vehicle is acquired from the vehicle order data.
The position data of the vehicle comprise at least an initial parking position of the vehicle and a destination parking position of the vehicle, which parking positions may be represented, for example, asThe parking positionIncluding longitude and latitude, e.g. the parking position may be expressed asWherein, in the step (A),is the value of the longitude at the time t,and the latitude value at the time t is the time stamp corresponding to the parking position.
When a user uses the vehicle 3000, the user acquires the identity of the vehicle 3000 through the mobile terminal 2000, an unlocking request for the vehicle 3000 is formed and sent to the server 1000, and the mobile terminal 2000 can carry the geographical position coordinates of the user when sending the unlocking request to the server 1000, that is, the server 1000 can acquire the position of the mobile terminal 2000 from the geographical position coordinates of the unlocking time reported by the mobile terminal 2000 as the initial parking position of the vehicle 3000 according to the unlocking request.
When a user parks the vehicle 3000, the user needs to operate the lock mechanism of the vehicle 3000 to realize locking, when the vehicle 3000 detects that the lock mechanism is changed from an unlocking state to a locking state, a vehicle locking signal can be reported to the server 1000, and the vehicle 3000 can carry the geographical position coordinate of the vehicle 3000 at the locking moment when reporting the vehicle locking signal to the server 1000, that is, the server 1000 can acquire the target parking position of the vehicle 3000 from the geographical position coordinate of the locking moment reported by the vehicle 3000 according to the vehicle locking signal.
It is understood that, in step S2311, the position data of the delivery personnel may be obtained from the delivery track data of the delivery personnel, and generally, the delivery track of the delivery personnel is composed of a plurality of track points, each of which represents the geographical position of the delivery personnel。
Step S2312, clustering the position data based on a preset clustering algorithm to generate a first type of electronic fence in the target area.
The clustering algorithm may be a dbss can algorithm, where the dbss can algorithm includes two parameters, one of which is a radius P, and the other is a designated number Q, and the two parameters divide anchor points into three categories, including a core point, a boundary point, and a noise point, where, for example, in a case where at least Q sample points are included in a P neighborhood of an anchor point, the anchor point is a core point; for another example, when the number of samples included in the P neighborhood of the anchor point is less than the specified number Q, but the sample point is located in the P neighborhoods of other core points, the anchor point is a boundary point, and the remaining other anchor points are all noise points, as shown in fig. 3, the point represented by the square frame is a core point, the point represented by the solid circle is a boundary point, and the point represented by the hollow circle is a noise point, and Q =3, where the noise point, that is, the hollow circle, can be eliminated, and for example, a circle with a radius of P as a center is taken as an electronic fence, as shown in fig. 3, three electronic fences are included, and here, in a case where the three electronic fences intersect, the three electronic fences can be combined into one electronic fence. Of course, the electronic fence may have other regular or irregular shapes as long as the boundary points of the P neighborhood of the core point can be included.
According to the steps S2311-S2313, on one hand, the vehicle usage scenario is combined, the vehicle order data, the rider distribution track data and other positioning data are used as data sources of a clustering algorithm, and a clustering algorithm such as a DBSCAN algorithm can be used for identifying noise points, namely discrete positioning points, namely, the noise points have good robustness on the discrete positioning points. On the other hand, by clustering the positioning points, the area with high enough density can be divided into clusters, each cluster can be a regular or irregular graph, and the clusters can be used as electronic fences, so that the efficiency of generating the electronic fences is improved.
In an example, in the case that the second type of target data includes map data of the target area, the processing the second type of target data according to the second processing rule in step S2300 to obtain the second type of electronic fence may further include the following steps S2321 to S2323:
step S2321, a preset region of interest in the map data is acquired.
The interested region is a geographical position marking region with semantics on the map, a category system of the interested region is more in line with the habitual title of people relative to the classification standard of the national basic geographical information elements, and the category of the interested region can also comprise a category name and a category code. The region of interest categories can be divided into three levels, namely a first level category, a second level category and a third level category, taking the science and education culture service school and elementary school as an example, the first level category is named as science and education culture service school and elementary school, the second level category is named as school, and the third level category is named as elementary school. Wherein, the generalization degree of the category names is from high to low: the method comprises a first-level category, a second-level category and a third-level category, wherein the third-level category is the most and the semantics are the most abundant.
Step S2322, filtering the region of interest according to the service type of the region of interest.
In step S2322, the region of interest obtained in step S2321 is filtered based on the riding usage scenario, for example, when the region of interest is an actual feature and landscape such as a river or a hill, which is a usage scenario that does not relate to a vehicle, and therefore, the actual feature and landscape are deleted, and for example, a region including 12 major categories and 138 minor categories such as a science and education culture service, a shopping service, a transportation facility service, a medical care service, a business residence, a general facility, and a high-density cell can be obtained as the region of interest reserved after filtering.
Step S2323, the region of interest remaining after filtering is used as a second type of electronic fence in the target region.
In step S2323, areas of 12 major categories and 138 minor categories in total, such as science and education culture services, shopping services, transportation facility services, healthcare services, business homes, general facilities, and high-density cells, obtained in step S2323, may be used as the electronic fences in the target area.
According to the steps S2321-S2323, the region of interest obtained by filtering the region of interest acquired from the map can be directly used as the electronic fence by combining with the vehicle use scene, so that the generated electronic fence is prevented from colliding with the landform and the feature, the generation accuracy and the targeting of the electronic fence are improved, and the standardization of electronic fence planning can be obviously and effectively improved compared with the situation that the electronic fence is arbitrarily defined.
In one example, in the case that the second type of target data includes manually input fence data, the step S2300 of processing the second type of target data according to the second processing rule to obtain the second type of electronic fence may further include the following steps S2331-S2333:
in step S2331, an input interface for fence data is provided.
The input interface may be an input box, a drop-down list, a voice input, etc., for example, an operator may input fence data of a desired target area through the input box; for another example, the operator may select the fence data of the desired target area from the drop-down list; as another example, the operator may voice-input the fence data for the desired target area.
In step S2332, fence data input through the input interface is acquired.
For example, after the operator manually plans the electronic fence, the manually planned electronic fence is verified in area and shape.
Step S2333, generating a second type of electronic fence in the target area according to the input fence data.
For example, the area and shape of the manually planned electronic fence according to step S2332 above may be verified and uploaded to generate a corresponding electronic fence.
According to the steps S2331-S2333, the example provides a human-computer interaction interface to support an operator to select the electronic fence of the target area to be determined according to the current actual requirement, so as to realize the customized design.
Step S2400 is performed to generate a target electronic fence in the target area according to the first-type electronic fence and the second-type electronic fence.
In this embodiment, after the first-type electronic fence and the second-type electronic fence are obtained according to the step S2300, the two types of electronic fences may be used as candidate electronic fences in the target area, and since the number of the candidate electronic fences is often large, in this case, in combination with an actual service situation, a final electronic fence, that is, a target electronic fence, in the target area, which is on-line in operation needs to be selected according to the step S2400.
In one example, the step S2400 of generating the target electronic fence of the target area according to the first type electronic fence and the second type electronic fence may further include the following steps S2411 to S2413:
step S2411, obtaining fence priorities of the first-type electronic fence and the second-type electronic fence.
According to the step S2411, the electronic fences may be filtered to obtain the target electronic fence in the target area in combination with the priorities of the electronic fences on the basis of acquiring the first type electronic fence and the second type electronic fence.
The fence priority may be a numerical value directly reflecting the priority of the fence, and the smaller the numerical value is, the higher the corresponding fence priority is; the fence priority may also be a fence level divided according to a specific numerical value, where the numerical value of the fence may be compared with the specific numerical value to obtain a comparison result, and then the priority level of the corresponding fence is determined according to the comparison result, and the specific numerical value may be set according to an actual application and a specific scenario, which is not limited herein.
In step S2411, the priority of the first-type electronic fence may be set to be lower than the priority of the second-type electronic fence, where all electronic fences in the first-type electronic fence may have the same priority or different priorities. All of the electronic fences in the second category of electronic fence can all have the same priority, or can have different priorities, e.g., manually modified electronic fences have a higher priority than POI electronic fences.
Illustratively, it may be that the priority of the manually revised fence is higher than the priority of the POI fence, and the priority of the POI fence is higher than the priority of the clustering fence.
In step S2412, when the distance between any two electronic fences is less than or equal to the set distance threshold, the electronic fence with the low priority is deleted.
The distance threshold may be a setting set according to a specific application scenario and a specific application requirement, and the distance threshold may be 150 meters, that is, in a case that the distance between any two electronic fences is less than or equal to 150 meters, the electronic fence with the low priority is deleted.
Any two electronic fences may include any one first-type electronic fence and any one second-type electronic fence, may also include any two first-type electronic fences, and may also include any two second-type electronic fences, which is not limited herein.
For example, in the case where the distance between two pens, one clustering fence and one POI fence, is less than 150 meters, the clustering fence is deleted.
As another example, a POI electronic fence is deleted in the case where a human corrects the distance between the two fences to be less than 150 meters.
Step S2413, using the electronic fence retained after deletion as a target electronic fence in the target area.
It is understood that if the number of the first type of electronic fence is 100, the number of the second type of electronic fence is 200 (including the number of the manually corrected electronic fence is 100 and the number of the POI electronic fence is 100), that is, the number of the candidate electronic fences of the target area is 300, the number of the electronic fences reserved for the priority processing may be 150, and here, the 150 electronic fences may be directly operated as the target electronic fences in the target area.
According to the above steps S2411 to S2413, the embodiment sets priorities for the electronic fences, which can ensure that the electronic fence with high priority is retained, and deletes the electronic fence with lower priority to automatically implement the optimization adjustment.
In one example, the present step S2400 of generating the target electronic fence of the target area according to the first type electronic fence and the second type electronic fence may further include the following steps S2421 to S2423:
step S2421, calculating and saving the attribute values of the first type electronic fence and the second type electronic fence.
The attribute value is a numerical value describing an attribute of the electronic fence, for example, but not limited to, the attribute includes a road width of 20 meters around the fence, a number of roads of 20 meters around the fence, a highest type of the road within a range of 20 meters around the fence, whether a high-level road barrier exists between the fence and the highest popularity POI, a popularity of the highest popularity POI, a number of core important POI scene POIs of 200 meters around the fence, a core important POI scene POI of 200 meters around the fence, a popularity sum POI of the POIs, and a distance of a gate corresponding to the highest popularity POI.
Taking the attribute as the people flow heat information as an example, the Euclidean distance between the fence and all POIs in the city can be calculated, the POIs in a certain distance threshold value are reserved and bound to the fence, and the people flow heat information of all POIs in the fence is accumulated.
Taking the attribute as the road width of 20 meters around the fence as an example, the distance calculation can be performed by using the center point of the fence and the road network, and the road section with the distance less than 20 meters is selected and the maximum road width is counted.
Taking the attribute as the number of the 20 meters of roads around the fence as an example, the distance calculation can be performed by using the center point of the fence and the road network, and the road sections with the distance less than 20 meters are selected and the total number of the roads is counted.
Taking the highest type of the road with the attribute of 20 meters as an example, the distance calculation can be performed by using the center point of the fence and the road network, and the road section with the distance less than 20 meters is selected and the maximum road grade is counted. The road types are classified according to national roads, provincial roads, urban arterial roads, footpaths and the like, and the grades are gradually decreased.
Taking the attribute as whether a high-grade road separation exists between the parking point and the highest people flow heat POI as an example, whether the coordinates of the center point of the parking point and the line segment corresponding to the highest people flow heat POI intersect with the road above the grade of the urban main road can be calculated.
Taking the attribute as the popularity heat corresponding to the highest popularity heat POI as an example, the popularity heat corresponding to the POI having the highest popularity heat within the range of 200 meters at the center point of the fence can be calculated.
Taking the number of POIs in a scene with an attribute of 200 meters of core importance around the fence as an example, the number of POIs belonging to 12 large classes and 138 sub classes in the POIs in the range of 200 meters can be calculated.
Taking the attribute as the sum of the popularity heat of the POI in the core important POI scene of 200 meters around the fence as an example, the sum of the popularity heat of the POIs belonging to 12 major classes and 138 minor classes in the POI within the range of 200 meters can be calculated.
Taking the attribute as the distance of the gate corresponding to the highest popularity POI as an example, the position of the gate where the highest popularity POI is found can be found, and the distance between the gate and the center point of the fence can be calculated.
In step S2422, a selection interface for selecting attribute values is provided.
A selection box may be provided in the selection interface for selecting attribute values. For example, if the attribute is popularity information, then it may be that >3000, >2000, >1000, >500, >200, >100 and the 7 custom checkboxes are provided as shown in FIG. 4.
And step S2423, acquiring and displaying the electronic fence under the attribute value selected through the selection interface as a target electronic fence.
Continuing with the example above, "> 3000" shown in FIG. 4 is selected, and after clicking "QUERY", an electronic fence with popularity information >3000 can be presented.
It is understood that if the number of the first-type electronic fences is 100, the number of the second-type electronic fences is 200 (including the number of the manually corrected electronic fences is 100 and the number of the POI electronic fences is 100), that is, the number of the candidate electronic fences of the target area is 300, the number of the electronic fences remaining after the selection according to the attribute value may be 150, and here, the 150 electronic fences may be directly operated as the target electronic fences in the target area to go online.
Here, the above steps S2411 to S2413 may be performed first, that is, if the number of the first type of electronic fence is 100 and the number of the second type of electronic fence is 200, the number of the electronic fences retained after the priority processing according to the above steps S2411 to S2413 may be 150, and here, the present steps S2421 to S2423 are continuously performed, the number of the electronic fences selected from the 150 electronic fences according to the attribute value may be 100, and here, the 100 electronic fences are operated online as target electronic fences in the target area.
According to the steps S2421 to S2423, in this embodiment, an attribute value is set for the electronic fence, and the attribute value is selected by using a visualization tool, so that an operator selects the electronic fence according to the attribute value as the electronic fence which is finally operated online, thereby implementing customized design.
After the target electronic fence of the target area is obtained according to the step S2400, the target electronic fence can be displayed in the map of the target area, so that the operator can conveniently search for the corresponding target electronic fence.
According to the method disclosed by the embodiment of the disclosure, the server can collect different types of data in the target area, and process the different types of data by using different processing rules to generate different types of candidate electronic fences, so that the target electronic fence in the target area is generated according to the different types of candidate electronic fences, that is, the server can automatically generate the target electronic fence in the target area according to the different types of data in the target area, and the accuracy and the efficiency of electronic fence generation are improved.
In one embodiment, the method for generating an electronic fence in the reference area may further include the following steps S5100 to S5400:
in step S5100, similarity between the target region and the selected other region is obtained.
Illustratively, the target area is city a, and the other areas may be, for example, city B, city C, and city D.
In step S5100, cosine similarity between the target area, such as city a, and other selected areas, such as city B, city C, and city D, may be calculated by using a cosine similarity function, where two components in the cosine similarity function are vectors constructed by the statistics yearbook and the city portrait, respectively, and for example, when calculating cosine similarity between city a and city B, two components are (the statistics yearbook of city a, the city portrait of city a) and (the statistics yearbook of city B, the city portrait of city B), respectively.
In step S5200, a preset number of regions are acquired as reference regions in the order of decreasing similarity.
The preset number may be a value set according to a specific application scenario and a specific application requirement, and the preset value may be 1, so that another region with the highest similarity to the target region may be selected as the reference region.
Continuing with the example of step S5100 above, for example, the calculated similarity between city a and city B is B1, the similarity between city a and city C is C1, and the similarity between city a and city D is D1, where B1> C1> D1, then city B is selected as the reference area.
In step S5300, position data of the target object within the reference area is acquired.
In step S5300, for example, position data of a vehicle in city B and delivery trajectory data of a delivery person may be acquired.
And step S5400, clustering the position data in the reference area based on a clustering algorithm to generate a first type of electronic fence in the reference area.
In step S5400, for example, the DBSCAN algorithm may be used to cluster the position data in the city B, so as to generate the first-class electronic fence in the city B.
According to the steps S5100-S5400, the clustering algorithm for processing the position data in the target area is directly used as the algorithm for processing the position data in the reference area with the highest similarity to the target area, so that the step of searching the clustering algorithm for the reference area is omitted, and the efficiency of generating the electronic fence in the reference area is improved.
In one embodiment, clustering the position data in the reference area based on a clustering algorithm to generate the first type of electronic fence in the reference area may further include the following steps S5410 to S5450:
in step S5410, a first number of target electronic fences is obtained.
In step S5420, a second number of the first type of electronic fence is obtained.
Step S5430, comparing the first number and the second number to obtain a comparison result.
Step S5440, if the comparison result indicates that the first number is the same as the second number, performing a clustering algorithm to cluster the position data in the reference region, and generating a first type of fence in the reference region.
In step S5440, if the first number is M and the second number is N, when M = N, it indicates that the clustering result is correct, and the position data in the reference area is clustered directly based on the clustering algorithm without adjusting parameters of the clustering algorithm, so as to generate the first-type electronic fence in the reference area.
Step S5450, when the comparison result shows that the first quantity is different from the second quantity, adjusting parameters of the clustering algorithm until the first quantity is the same as the second quantity; and clustering the position data in the reference area according to the adjusted clustering algorithm to generate the first-class electronic fence in the reference area.
In step S5450, if the first number is M and the second number is N, when M > N, it indicates that the clustering result is less, and it is necessary to appropriately relax the radius P in the DBSCAN algorithm; when M < N, the clustering result is too much, and the radius P in the DBSCAN algorithm needs to be properly reduced.
According to the steps S5410-S5450, under the condition that the number of the target electronic fences in the target area is the same as the number of the first electronic fences, clustering is performed on the position data in the reference area based on a clustering algorithm, and under the condition that the number of the target electronic fences in the target area is different from the number of the first electronic fences, parameters of the clustering algorithm are adjusted, and the position data in the reference area is clustered according to the adjusted clustering algorithm, so that the accuracy of generating the electronic fences in the reference area can be improved.
< apparatus embodiment >
Fig. 5 is a schematic framework of an apparatus 5000 for generating an electronic fence according to an embodiment of the present disclosure.
As shown in fig. 5, the apparatus 5000 for generating an electronic fence according to the present embodiment may include a first obtaining module 5100, a second obtaining module 5200, a processing module 5300, and a generating module 5400.
The first obtaining module 5100 is configured to obtain first type target data and second type target data in a target area.
The second obtaining module 5200 is configured to obtain a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data.
The processing module 5300 is configured to process the first type of target data according to the first processing rule to obtain a first type of electronic fence, and process the second type of target data according to the second processing rule to obtain a second type of electronic fence.
The generating module 5400 is configured to generate a target fence of the target area according to the first type of fence and the second type of fence.
In one embodiment, the first type of target data includes order data of a vehicle, and the processing module 5300 is further configured to obtain location data of the vehicle from the order data of the vehicle; and clustering the position data based on a preset clustering algorithm to generate the first type of electronic fence in the target area.
In an embodiment, the second type of target data includes map data of the target area, and the processing module 5300 is further configured to obtain a preset region of interest in the map data; filtering the region of interest according to the service type of the region of interest; and taking the region of interest remained after filtering as the second type of electronic fence in the target region.
In one embodiment, the second type of target data further includes manually entered fence data, the processing module 5300 further configured to provide an input interface for the fence data; acquiring fence data input through the input interface; and generating the second type of electronic fence in the target area according to the input fence data.
In one embodiment, the generating module 5400 is further configured to obtain fence priorities of the first type of electronic fence and the second type of electronic fence; deleting the electronic fence with low priority when the distance between any two electronic fences is less than or equal to a set distance threshold; and taking the electronic fence reserved after deletion as a target electronic fence in the target area.
In one embodiment, the generating module 5400 is further configured to calculate and save attribute values of the first type of electronic fence and the second type of electronic fence; providing a selection interface for selecting the attribute value; and acquiring and displaying the electronic fence under the attribute value selected through the selection interface as the target electronic fence.
In an embodiment, the processing module 5300 is further configured to obtain a similarity between the target area and the selected other areas; acquiring a preset number of regions as reference regions according to the sequence of similarity from large to small; acquiring position data of a target object in the reference area; and clustering the position data in the reference area based on the clustering algorithm to generate a first type of electronic fence in the reference area.
In one embodiment, the processing module 5300 is further configured to obtain a first number of the target electronic fences; acquiring a second number of the first type of electronic fence; comparing the first quantity with the second quantity to obtain a comparison result; and under the condition that the comparison result shows that the first number is the same as the second number, clustering the position data in the reference area based on the clustering algorithm to generate the first-class electronic fence in the reference area.
In an embodiment, the processing module 5300 is further configured to, in a case that the comparison result indicates that the first number is different from the second number, adjust a parameter of the clustering algorithm until the first number is the same as the second number; clustering the position data in the reference area according to the adjusted clustering algorithm to generate a first type of electronic fence in the reference area.
< example >
The method for generating an electronic fence provided in the embodiments of the present disclosure will be further illustrated below.
In this example, the functions corresponding to the processing module 5300 in the apparatus 5000 for generating an electronic fence can be implemented by the clustering module, the core POI module and the artificial fence modification module shown in fig. 6.
Step S611, vehicle order data and user positioning data in the target area are acquired.
In step S611, vehicle order data and dispenser trajectory data (user positioning data) within the history of 1 year in the target area can be acquired.
Step S612, obtaining the position data of the vehicle from the vehicle order data, and obtaining the position data of the user from the user positioning data.
Step S613, clustering the position data based on the clustering algorithm in the clustering module, and generating a clustered electronic fence in the target area.
In step S621, map data of the target area is acquired.
Step S622, based on the core POI module, filtering the region of interest in the map data, and using the remaining region of interest after filtering as a core POI electronic fence in the target region.
Step S631, acquiring the fence data uploaded manually.
And step S632, analyzing the manually uploaded fence data according to the manual fence correction module to generate a manually corrected electronic fence in the target area.
It can be understood that the steps S611 to S613, S621 to S622, and S631 to S632 are not performed in sequence.
In step S641, the fence priorities of the generated electronic fences are obtained, and when the distance between any two electronic fences is smaller than or equal to the set distance threshold, the electronic fence with the lower priority is deleted, and a candidate electronic fence set of the target area is generated.
In step S642, attribute values of the electronic fences in the candidate electronic fence set are calculated.
Step S643, displaying and editing the electronic fence under the attribute value selected through the selection interface, and generating a target electronic fence.
In the editing process of an operator, recording fence editing logs, and calculating the number of target electronic fences in a target area, fence density, rejected fence ID and other information.
In step S644, the edit log is recorded.
In step S651, the similarity between the target region and another region is calculated based on the data such as the statistical yearbook and the city figure, and another region having the highest similarity with the target region is selected as a reference region.
Step S652, under the condition that the number of the target electronic fences is not equal to the number of the clustering electronic fences, adjusting parameters of a clustering algorithm in a clustering module to cluster the position data in the reference area according to the adjusted clustering algorithm to generate the clustering electronic fences in the reference area.
< Server embodiment >
In this embodiment, a server 7000 is also provided.
As shown in fig. 7, the server 7000 may include the apparatus for generating an electronic fence 5000 according to any embodiment of the present invention, for implementing the method for generating an electronic fence according to any embodiment of the present invention. The server 7000 may be the server 1000 shown in fig. 1, which is not limited herein.
In another embodiment, as shown in FIG. 8, the server 7000 may also include a processor 7100 and a memory 7200, the memory 7200 for storing executable instructions; the processor 7100 is configured to control the operation server 7000 according to the instructions to perform the method for generating the electronic fence according to any embodiment of the present invention.
The present invention may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. 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-readable program instructions.
These computer-readable program instructions may be provided to a processor 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 processor 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-readable program instructions 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 readable program instructions may also 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 embodiments of the present invention. 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. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.
Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments 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 embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.
Claims (10)
1. A method of generating an electronic fence, comprising:
acquiring first type target data and second type target data in a target area;
acquiring a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data;
processing the first type of target data according to the first processing rule to obtain a first type of electronic fence, and processing the second type of target data according to the second processing rule to obtain a second type of electronic fence; the electronic fence is a parking spot area defined according to a regulation;
generating a target electronic fence of the target area according to the first type electronic fence and the second type electronic fence;
wherein the generating a target fence for the target area from the first type of fence and the second type of fence comprises:
acquiring fence priorities of the first type of electronic fence and the second type of electronic fence;
deleting the electronic fence with low priority when the distance between any two electronic fences is less than or equal to a set distance threshold;
and taking the electronic fence reserved after deletion as a target electronic fence in the target area.
2. The method of claim 1, wherein the first type of object data comprises order data for a vehicle;
the processing the first type of target data according to the first processing rule to obtain a first type of electronic fence includes:
acquiring position data of the vehicle from the order data of the vehicle;
and clustering the position data based on a preset clustering algorithm to generate the first type of electronic fence in the target area.
3. The method of claim 1, wherein the second type of target data includes map data of the target area,
processing the second type of target data according to the second processing rule to obtain a second type of electronic fence, including:
acquiring a preset region of interest in the map data;
filtering the region of interest according to the service type of the region of interest;
and taking the region of interest remained after filtering as the second type of electronic fence in the target region.
4. The method of claim 1, wherein the second type of target data further comprises manually entered fence data,
processing the second type of target data according to the second processing rule to obtain a second type of electronic fence, further comprising:
an input interface for providing fence data;
acquiring fence data input through the input interface;
and generating the second type of electronic fence in the target area according to the input fence data.
5. The method of any one of claims 1 to 4, wherein said generating a target fence of said target area from said first and second types of fences, further comprises:
calculating and saving attribute values of the first type of electronic fence and the second type of electronic fence;
providing a selection interface for selecting the attribute value;
and acquiring and displaying the electronic fence under the attribute value selected through the selection interface as the target electronic fence.
6. The method of claim 2, wherein the method further comprises:
acquiring the similarity between the target area and other selected areas;
acquiring a preset number of regions as reference regions according to the sequence of similarity from large to small;
acquiring position data of a target object in the reference area;
and clustering the position data in the reference area based on the clustering algorithm to generate a first type of electronic fence in the reference area.
7. The method of claim 6, wherein the method further comprises:
acquiring a first number of the target electronic fences;
acquiring a second number of the first type of electronic fence;
comparing the first quantity with the second quantity to obtain a comparison result;
and under the condition that the comparison result shows that the first number is the same as the second number, clustering the position data in the reference area based on the clustering algorithm to generate the first-class electronic fence in the reference area.
8. The method of claim 7, wherein the method further comprises:
when the comparison result shows that the first quantity is different from the second quantity, adjusting the parameters of the clustering algorithm until the first quantity is the same as the second quantity; clustering the position data in the reference area according to the adjusted clustering algorithm to generate a first type of electronic fence in the reference area.
9. An apparatus for generating an electronic fence, comprising:
the first acquisition module is used for acquiring first-class target data and second-class target data in a target area;
the second acquisition module is used for acquiring a first processing rule for processing the first type of target data and a second processing rule for processing the second type of target data;
the processing module is used for processing the first type of target data according to the first processing rule to obtain a first type of electronic fence, and processing the second type of target data according to the second processing rule to obtain a second type of electronic fence; the electronic fence is a parking spot area defined according to a regulation;
a generating module, configured to generate a target electronic fence of the target area according to the first type of electronic fence and the second type of electronic fence;
the generation module is specifically configured to obtain fence priorities of the first type of electronic fence and the second type of electronic fence; deleting the electronic fence with low priority when the distance between any two electronic fences is less than or equal to a set distance threshold; and taking the electronic fence reserved after deletion as a target electronic fence in the target area.
10. A server comprising the apparatus of claim 9; alternatively, it comprises:
a memory for storing executable instructions;
a processor for operating the server to execute the method for generating the electronic fence according to any one of claims 1 to 8 according to the control of the instruction.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010901858.0A CN111770447B (en) | 2020-09-01 | 2020-09-01 | Method and device for generating electronic fence and server |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010901858.0A CN111770447B (en) | 2020-09-01 | 2020-09-01 | Method and device for generating electronic fence and server |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111770447A CN111770447A (en) | 2020-10-13 |
CN111770447B true CN111770447B (en) | 2021-01-05 |
Family
ID=72729798
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010901858.0A Active CN111770447B (en) | 2020-09-01 | 2020-09-01 | Method and device for generating electronic fence and server |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111770447B (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113378873A (en) * | 2021-01-13 | 2021-09-10 | 杭州小创科技有限公司 | Algorithm for determining attribution or classification of target object |
CN113268678B (en) * | 2021-04-07 | 2023-10-27 | 北京中交兴路信息科技有限公司 | Semantic mining method and device for vehicle stop points, storage medium and terminal |
CN113095406B (en) * | 2021-04-14 | 2022-04-26 | 国能智慧科技发展(江苏)有限公司 | Electronic fence effective time period management and control method based on intelligent Internet of things |
CN113781646A (en) * | 2021-09-14 | 2021-12-10 | 销秘(重庆)云计算科技有限公司 | Electronic fence generation method and device and storage medium |
CN114936944B (en) * | 2022-04-13 | 2023-06-13 | 浙江蓝景科技有限公司 | Fishery management system based on positioning information and electronic fence |
CN116824833A (en) * | 2023-03-02 | 2023-09-29 | 四川国蓝中天环境科技集团有限公司 | Method for optimizing position of shared bicycle electronic fence based on grid division |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101493336A (en) * | 2008-01-25 | 2009-07-29 | 株式会社电装 | Apparatus and method for map data management |
CN107491895A (en) * | 2017-08-30 | 2017-12-19 | 国信优易数据有限公司 | A kind of shared bicycle parks determination method and device a little |
CN109561387A (en) * | 2018-11-23 | 2019-04-02 | 北京摩拜科技有限公司 | Adjust the method, apparatus and server of fence |
CN109658733A (en) * | 2018-12-28 | 2019-04-19 | 北京摩拜科技有限公司 | Acquisition methods, server and the Vehicular system of parking area |
CN109819403A (en) * | 2019-01-28 | 2019-05-28 | 北京摩拜科技有限公司 | Generate the method, apparatus and electronic equipment of fence |
CN110765219A (en) * | 2019-08-05 | 2020-02-07 | 上海晶赞融宣科技有限公司 | Geo-fence generation method and device, computer equipment and storage medium |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8581712B2 (en) * | 2008-12-12 | 2013-11-12 | Gordon * Howard Associates, Inc . | Methods and systems related to establishing geo-fence boundaries |
US9571968B1 (en) * | 2015-07-21 | 2017-02-14 | International Business Machines Corporation | Geo-fence management using a cluster analysis technique |
-
2020
- 2020-09-01 CN CN202010901858.0A patent/CN111770447B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101493336A (en) * | 2008-01-25 | 2009-07-29 | 株式会社电装 | Apparatus and method for map data management |
CN107491895A (en) * | 2017-08-30 | 2017-12-19 | 国信优易数据有限公司 | A kind of shared bicycle parks determination method and device a little |
CN109561387A (en) * | 2018-11-23 | 2019-04-02 | 北京摩拜科技有限公司 | Adjust the method, apparatus and server of fence |
CN109658733A (en) * | 2018-12-28 | 2019-04-19 | 北京摩拜科技有限公司 | Acquisition methods, server and the Vehicular system of parking area |
CN109819403A (en) * | 2019-01-28 | 2019-05-28 | 北京摩拜科技有限公司 | Generate the method, apparatus and electronic equipment of fence |
CN110765219A (en) * | 2019-08-05 | 2020-02-07 | 上海晶赞融宣科技有限公司 | Geo-fence generation method and device, computer equipment and storage medium |
Non-Patent Citations (1)
Title |
---|
共享单车骑行特征分析及布局优化研究——以北京市为例;黄梦雪;《中国优秀硕士学位论文全文数据库 (电子期刊)》;20200215;第5.3.2节 * |
Also Published As
Publication number | Publication date |
---|---|
CN111770447A (en) | 2020-10-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111770447B (en) | Method and device for generating electronic fence and server | |
US20230034863A1 (en) | Warning for Frequently Traveled Trips Based on Traffic | |
Carter et al. | Enhancing pedestrian mobility in smart cities using big data | |
US9671237B1 (en) | Optimized generation of navigation instructions based on computed parking probability values | |
US10691512B1 (en) | Notifying entities of relevant events | |
Zhao et al. | A trajectory clustering approach based on decision graph and data field for detecting hotspots | |
CN104508507B (en) | The self-adaption cluster of position | |
Li et al. | Spatial, temporal, and socioeconomic patterns in the use of Twitter and Flickr | |
US20180129221A1 (en) | System and method for inputting a second taxi-start location parameter for an autonomous vehicle to navigate to whilst reducing distraction | |
US20110291860A1 (en) | In-vehicle display apparatus and display method | |
CN106470216A (en) | A kind of Content Management System based on information sharing, interaction | |
CN102132589A (en) | User defined names for displaying monitored location | |
CN104484462A (en) | Enterprise information acquisition method and system | |
CN110232104B (en) | Data display method and device, storage medium and computer equipment | |
CN110503485B (en) | Geographical region classification method and device, electronic equipment and storage medium | |
US20170103112A1 (en) | Mobile Digital Property Portfolio Management System | |
CN104252495A (en) | Method and system for grading road sections | |
US20200050611A1 (en) | Utilizing satisified rules as input signals | |
Elias et al. | SOMOBIL–improving public transport planning through mobile phone data analysis | |
Tan et al. | Tidal phenomenon of the dockless bike-sharing system and its causes: the case of Beijing | |
CN106850777B (en) | Method and device for pushing information | |
Jannack et al. | Urban Platform Dresden—New Solutions for Collaboration, Knowledge Sharing, and Urban Value Creation | |
Vaccari et al. | Pulse of the city: Visualizing urban dynamics of special events | |
Kopackova et al. | Technology helping citizens to express their needs and improve their neighborhood | |
Appleyard et al. | Designing transportation and land use coordination: frameworks for measuring, understanding, and realizing sustainability, livability, and equity |
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 | ||
GR01 | Patent grant | ||
GR01 | Patent grant |