阅读说明：本技术 门禁授权方法、装置及存储介质 (Access control authorization method, device and storage medium ) 是由 张科 区宏英 胡正才 于 2021-07-20 设计创作，主要内容包括：本发明公开了门禁授权方法、装置及存储介质,其中方法包括根据地图信息构建有向图；获取出发地和目的地的信息；根据所述出发地和目的地的信息从所述有向图得到目标节点；对所述目标节点所对应的所述门禁授权；能根据出发点和目的地的信息由已经生成的有向图得到所要经过的目标门禁,然后对目标门禁进行自动授权,具有自动、智能、快捷的优点。(The invention discloses a method, a device and a storage medium for access control authorization, wherein the method comprises the steps of constructing a directed graph according to map information; acquiring information of a departure place and a destination; obtaining a target node from the directed graph according to the information of the departure place and the destination; authorizing the entrance guard corresponding to the target node; the target entrance guard to pass through can be obtained through the generated directed graph according to the information of the departure point and the destination, and then the target entrance guard is automatically authorized, so that the method has the advantages of automation, intelligence and quickness.)

1. An access authorization method, comprising:

constructing a directed graph according to map information, wherein the map information comprises position information of each place area, position information of each entrance guard and communication information among all the place areas, and nodes of the directed graph correspond to the entrance guard and the place areas;

acquiring information of a departure place and a destination, wherein the departure place and the destination correspond to the place area;

obtaining target nodes from the directed graph according to the information of the departure place and the destination, wherein the target nodes are all nodes passing through the directed graph from the departure place to the destination;

and authorizing the entrance guard corresponding to the target node.

2. The access authorization method according to claim 1, wherein the constructing a directed graph according to map information comprises:

constructing a plurality of first data lists which are in one-to-one correspondence with the access control in a database, wherein the first data lists comprise first node identification numbers and equipment identification numbers of the access control;

constructing a plurality of second data lists corresponding to the nodes one by one in the database, wherein the second data lists comprise second node identification numbers and node names, the second node identification numbers correspond to the first node identification numbers, and the node names correspond to the location areas;

constructing a plurality of node dependency relationship tables among the nodes in the database according to the map information, wherein the node dependency relationship tables comprise third node identification numbers and dependent node identification numbers, the third node identification numbers correspond to the second node identification numbers, and the dependent node identification numbers correspond to the second node identification numbers;

and constructing the directed graph according to the first data list, the second data list and the node dependency relationship table.

3. The access authorization method according to claim 1, wherein the obtaining of the target node from the directed graph according to the information of the departure place and the destination comprises:

determining an initial node corresponding to the departure place and a terminal node corresponding to the destination according to the information of the departure place and the destination;

and obtaining the target node from the directed graph by utilizing a search algorithm according to the initial node and the terminal node.

4. The access authorization method according to claim 3, characterized in that the search algorithm is a breadth-first algorithm, a depth-first algorithm or a recursive method.

5. The access authorization method according to claim 1, wherein the authorization of the access corresponding to the first node includes:

when the entrance guard adopts the human body biological characteristics to carry out passage verification, the human body biological characteristics of the passage personnel are obtained;

and issuing the human body biological characteristics of the passers to the entrance guard corresponding to the first node for authorization.

6. The access authorization method according to claim 1, wherein the authorization of the access corresponding to the first node includes:

when the entrance guard adopts an integrated circuit card to carry out passage verification, acquiring a first identification number corresponding to the integrated circuit card of a passage person;

and writing the door opening key of the entrance guard corresponding to the first node into the integrated circuit card corresponding to the first identification number through a recording device so as to authorize.

7. The access authorization method according to claim 1, wherein the authorization of the access corresponding to the first node includes:

when the access control adopts an identification card for passing verification, acquiring a second identification number corresponding to the identification card of a passing person;

and issuing the second identification number to the access control corresponding to the first node for authorization.

8. Entrance guard's authorizer, its characterized in that includes:

the system comprises a directed graph construction unit, a storage unit and a control unit, wherein the directed graph construction unit is used for constructing a directed graph according to map information, the map information comprises position information of each place area, position information of each entrance guard and communication information among all the place areas, and nodes of the directed graph correspond to the entrance guard and the place areas;

an information acquisition unit configured to acquire information of a departure place and a destination, both of which correspond to the place area;

a target node obtaining unit, configured to obtain a target node from the directed graph according to the information of the departure point and the destination, where the target node is all nodes that pass through from the departure point to the destination in the directed graph;

and the authorization unit is used for authorizing the entrance guard corresponding to the target node.

9. A door access authorization device, comprising a memory, a processor and a computer program stored on the memory and operable on the processor, wherein the processor executes the computer program to implement the door access authorization method according to any one of claims 1 to 7.

10. Storage medium, characterized in that the storage medium stores executable instructions, and the executable instructions when executed by a processor implement the access authorization method according to any one of claims 1 to 7.

Technical Field

The invention relates to the technical field of access control, in particular to an access authorization method, an access authorization device and a storage medium.

Background

With the development of society, an access control system has become an important component of social security as an important component of building security management.

The entrance guard passage authorization is an important work of passage management, namely, the authorization of the permission of a person passing through the department to enter certain areas, buildings or rooms in a park is realized, and only authorized persons are allowed to enter a specific area. At present, access control passing authorization is mainly carried out in a manual authorization mode, the access control posts needing authorization are judged according to the regions where passers-by need to enter, and authorization efficiency is low.

Disclosure of Invention

The present invention at least solves one of the technical problems in the prior art, and provides a method, an apparatus and a storage medium for access authorization.

The technical scheme adopted by the invention for solving the problems is as follows:

in a first aspect of the present invention, a method for access authorization includes:

constructing a directed graph according to map information, wherein the map information comprises position information of each place area, position information of each entrance guard and communication information among all the place areas, and nodes of the directed graph correspond to the entrance guard and the place areas;

acquiring information of a departure place and a destination, wherein the departure place and the destination correspond to the place area;

obtaining target nodes from the directed graph according to the information of the departure place and the destination, wherein the target nodes are all nodes passing through the directed graph from the departure place to the destination;

and authorizing the entrance guard corresponding to the target node.

According to a first aspect of the invention, said constructing a directed graph from map information comprises:

constructing a plurality of first data lists which are in one-to-one correspondence with the access control in a database, wherein the first data lists comprise first node identification numbers and equipment identification numbers of the access control;

constructing a plurality of second data lists corresponding to the nodes one by one in the database, wherein the second data lists comprise second node identification numbers and node names, the second node identification numbers correspond to the first node identification numbers, and the node names correspond to the location areas;

constructing a plurality of node dependency relationship tables among the nodes in the database according to the map information, wherein the node dependency relationship tables comprise third node identification numbers and dependent node identification numbers, the third node identification numbers correspond to the second node identification numbers, and the dependent node identification numbers correspond to the second node identification numbers;

and constructing the directed graph according to the first data list, the second data list and the node dependency relationship table.

According to the first aspect of the present invention, the obtaining a target node from the directed graph according to the information of the departure place and the destination includes:

determining an initial node corresponding to the departure place and a terminal node corresponding to the destination according to the information of the departure place and the destination;

and obtaining the target node from the directed graph by utilizing a search algorithm according to the initial node and the terminal node.

According to the first aspect of the present invention, the search algorithm is a breadth-first algorithm, a depth-first algorithm, or a recursive method.

According to a first aspect of the present invention, the authorizing the access control corresponding to the first node includes:

when the entrance guard adopts the human body biological characteristics to carry out passage verification, the human body biological characteristics of the passage personnel are obtained;

and issuing the human body biological characteristics of the passers to the entrance guard corresponding to the first node for authorization.

According to a first aspect of the present invention, the authorizing the access control corresponding to the first node includes:

when the entrance guard adopts an integrated circuit card to carry out passage verification, acquiring a first identification number corresponding to the integrated circuit card of a passage person;

and writing the door opening key of the entrance guard corresponding to the first node into the integrated circuit card corresponding to the first identification number through a recording device so as to authorize.

According to a first aspect of the present invention, the authorizing the access control corresponding to the first node includes:

when the access control adopts an identification card for passing verification, acquiring a second identification number corresponding to the identification card of a passing person;

and issuing the second identification number to the access control corresponding to the first node for authorization.

In a second aspect of the present invention, an access authorization apparatus includes:

the system comprises a directed graph construction unit, a storage unit and a control unit, wherein the directed graph construction unit is used for constructing a directed graph according to map information, the map information comprises position information of each place area, position information of each entrance guard and communication information among all the place areas, and nodes of the directed graph correspond to the entrance guard and the place areas;

an information acquisition unit configured to acquire information of a departure place and a destination, both of which correspond to the place area;

a target node obtaining unit, configured to obtain a target node from the directed graph according to the information of the departure point and the destination, where the target node is all nodes that pass through from the departure point to the destination in the directed graph;

and the authorization unit is used for authorizing the entrance guard corresponding to the target node.

In a third aspect of the present invention, a door access authorization apparatus includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the door access authorization method according to the first aspect of the present invention is implemented.

In a fourth aspect of the present invention, a storage medium stores executable instructions, and when executed by a processor, the storage medium implements the access authorization method according to the first aspect of the present invention.

The scheme at least has the following beneficial effects: the method has the advantages of being automatic, intelligent and fast, simplifying operation flow and operation difficulty of access control passing authorization, and improving efficiency of access control passing management.

Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.

Drawings

The invention is further illustrated with reference to the following figures and examples.

FIG. 1 is a flow chart of a method for authorizing access control according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of constructing a directed graph from map information;

fig. 3 is a structural diagram of an access authorization apparatus according to an embodiment of the present invention.

Detailed Description

Reference will now be made in detail to the present preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to like elements throughout.

In the description of the present invention, it should be understood that the orientation or positional relationship referred to in the description of the orientation, such as the upper, lower, front, rear, left, right, etc., is based on the orientation or positional relationship shown in the drawings, and is only for convenience of description and simplification of description, and does not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus, should not be construed as limiting the present invention.

In the description of the present invention, the meaning of a plurality of means is one or more, the meaning of a plurality of means is two or more, and larger, smaller, larger, etc. are understood as excluding the number, and larger, smaller, inner, etc. are understood as including the number. If the first and second are described for the purpose of distinguishing technical features, they are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated.

In the description of the present invention, unless otherwise explicitly limited, terms such as arrangement, installation, connection and the like should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meanings of the above terms in the present invention in combination with the specific contents of the technical solutions.

Referring to fig. 1, an embodiment of a first aspect of the present invention provides a method for access authorization.

The access control authorization method comprises the following steps:

s100, constructing a directed graph according to map information, wherein the map information comprises position information of each place area, position information of each entrance guard and communication information among all the place areas, and nodes of the directed graph correspond to the entrance guard and the place areas.

For example, the map is a grid map, the location areas are a campus area, an area a, an area B, an area a1, and an area a2, the location information of the location areas is coordinates of the entire location area, the location information of the location areas is the coordinates of the entire location area, the campus area includes the area a and the area B, and the area a includes the area a1 and the area a 2. Generally, the range of the site area can be determined by the edge of the site area, and meanwhile, the edge of the site area is provided with an impenetrable obstacle. Generally, the position of the entrance guard is set at the edge of the place area, and then according to the position information of the entrance guard, which place area can be entered through the entrance guard can be known. According to the communication information among all the site areas, for example, the access control MJ001 is needed from the area A to the area A1.

Referring to fig. 2, specifically, for step S100, a directed graph is constructed from map information, including:

constructing a plurality of first data lists which correspond to the access control one by one in a database, wherein the first data lists comprise first node identification numbers and equipment identification numbers of the access control; certainly, the first data list may further include a number, an identification type, and a door opening key of the door control device, and the first data list is used to store relevant information of the door control device;

constructing a plurality of second data lists which are in one-to-one correspondence with the nodes in the database, wherein the second data lists comprise second node identification numbers and node names, and the node names correspond to the location areas; the second data list stores relevant information of the nodes in the graph, the second node identification number corresponds to the first node identification number, namely the second node identification number can determine the access control equipment corresponding to the node;

constructing a plurality of node dependency relationship tables among the nodes in a database according to the map information, wherein the node dependency relationship tables comprise third node identification numbers and dependent node identification numbers, the third node identification numbers correspond to the second node identification numbers, and the dependent node identification numbers correspond to the second node identification numbers; the node corresponding to the third node identification number points to the node corresponding to the dependent node identification number;

and constructing a directed graph according to the first data list, the second data list and the node dependency relationship table.

It should be noted that, an expert may manually read the map information, and then construct the first data list, the second data list, and the node dependency relationship table in the database according to the map information. Or automatically reading the map information through a machine learning algorithm, and then constructing a first data list, a second data list and a node dependency relationship table in a database according to the map information.

For example, for an access control device of an east gate sentry in the area a, the access control device corresponds to the following first data list: the first node identification number is a11 and the device identification number is MJ 006. The access control equipment of the east gate sentry in the area A corresponds to a node A11 in the graph, and a node A11 corresponds to the following second data list: the second node identification number is a11 and the node name is zone a.

For the access control device of the a1 building gate post, the access control device corresponds to the following first data list: the first node identification number is a21 and the device identification number is MJ 001. The access control equipment of the A1 building gate post corresponds to a node A21 in the graph, and the node A21 corresponds to the following second data list: the second node identification is a21, the node name being floor a1 area.

Then, according to the map information, it can be known that the access control MJ006 is communicated with the area a and the area campus, and the access control MJ001 is communicated with the area a1, so that for the node a11 and the node a21, the corresponding node dependency relationship table has a third node identification number of a11 and a dependent node identification number of a21, and the node a21 points to the node a 11.

And step S200, acquiring information of a departure place and a destination, wherein the departure place and the destination correspond to the place area.

For step S200, information of the departure place and destination is input by the authority manager through an input device such as a keyboard.

And step S300, obtaining target nodes from the directed graph according to the information of the departure place and the destination, wherein the target nodes are all nodes passing from the departure place to the destination in the directed graph.

For step S300, obtaining a target node from the directed graph according to the information of the departure point and the destination, including:

determining an initial node corresponding to the departure place and a terminal node corresponding to the destination according to the information of the departure place and the destination; for example, if the starting place is a building area of a1, the initial node is a21, and the destination is a garden area, the destination node is a 01;

and obtaining the target node from the directed graph by utilizing a search algorithm according to the initial node and the terminal node. The target nodes are node a21, node a11, node a12, node a 01. Node a21 corresponds to door forbidden MJ001, node a11 corresponds to door forbidden MJ006, node a12 corresponds to door forbidden MJ005, and node a01 corresponds to door forbidden MJ 007.

Specifically, the search algorithm is a breadth-first algorithm, a depth-first algorithm, or a recursive method.

The breadth-first algorithm will be described as an example.

In the initialization stage, a directed graph is loaded from a database by using a HashMap < NodeId, GateNode >, a target node NodeId is used as a Key of the HashMap, and a second data list GateNode is used as a value of the HashMap. Defining a Queue < NodeId > to store the intermediate result in the searching process, and inserting the target node NodeId into the Queue < NodeId >. Defining an Array < gateway > to store a node result list corresponding to the passing area. Another tuple List < Device > is defined to hold the List of authorized Device results.

In the searching stage, a node is taken out from the Queue < NodeId >, the node is added into the Array < GateNode >, the node dependency relationship table corresponding to the node is read at the same time, and the dependency node corresponding to the node in the node dependency relationship table is added into the Queue < NodeId >. And repeating the steps until the Queue < NodeId > is empty, namely completing the search of all dependent nodes.

In the result processing stage, the Array < GateNode > is subjected to de-duplication processing, so that only one node object with the same Array < GateNode > is provided. The node in the Array < gateway > is the target node.

And traversing the nodes in the Array < gateway >. And acquiring a first data List corresponding to each node, traversing the first data List to obtain the equipment identification number of the access control, and adding the equipment identification number into an array List < Device >.

And S400, authorizing the entrance guard corresponding to the target node.

For step S400, in an embodiment, when the access control adopts the human body biological characteristics to perform the passage verification, the human body biological characteristics of the person who passes the passage are obtained; and issuing the human body biological characteristics of the passers to the entrance guard corresponding to the first node for authorization.

In another embodiment, when the entrance guard adopts an integrated circuit card for passage verification, a first identification number corresponding to the integrated circuit card of a passage person is obtained; and writing the door opening key of the entrance guard corresponding to the first node into the integrated circuit card corresponding to the first identification number through the recording equipment so as to authorize. It should be noted that the integrated circuit card is an IC card.

In another embodiment, when the access control adopts the identification card for passing verification, a second identification number corresponding to the identification card of a passing person is obtained; and issuing the second identification number to the access control corresponding to the first node for authorization. It should be noted that the identification card is an ID card.

By the access control authorization method, the target access control to be passed can be obtained through the generated directed graph according to the information of the departure point and the destination, and then the target access control is automatically authorized.

Referring to fig. 3, an embodiment of a second aspect of the present invention provides an access authorization apparatus. The access control authorization device adopts the embodiment of the first aspect of the invention

The access control authorization device comprises a directed graph construction unit 10, an information acquisition unit 20, a target node acquisition unit 30 and an authorization unit 40.

The directed graph constructing unit 10 is configured to construct a directed graph according to map information, where the map information includes location information of each location area, location information of each access control, and communication information between all the location areas, and nodes of the directed graph correspond to the access controls and the location areas;

the information acquisition unit 20 is configured to acquire information of a departure place and a destination, both of which correspond to a place area;

the target node obtaining unit 30 is configured to obtain a target node from the digraph according to the information of the departure point and the destination, where the target node is all nodes that pass through from the departure point to the destination in the digraph;

the authorization unit 40 is configured to authorize an access control corresponding to the target node.

It should be noted that, each unit of the access authorization apparatus adopted in the embodiment of the second aspect of the present invention corresponds to each step of the access authorization method adopted in the embodiment of the second aspect of the present invention one to one, and the same technical means is adopted, so that the same technical problems are solved, and the same technical effects are achieved.

The embodiment of the third aspect of the invention provides an access authorization device. The access authorization apparatus includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor executes the computer program to implement the access authorization method according to the embodiment of the first aspect of the present invention.

The processor and memory may be connected by a bus or other means.

The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs as well as non-transitory computer executable programs. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory located remotely from the processor, and these remote memories may be connected to the processor through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

An embodiment of a fourth aspect of the invention provides a storage medium. The storage medium stores executable instructions, and when executed by the processor, the executable instructions implement the access authorization method according to the embodiment of the first aspect of the present invention.

One of ordinary skill in the art will appreciate that all or some of the steps, systems, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.

The above description is only a preferred embodiment of the present invention, and the present invention is not limited to the above embodiment, and the present invention shall fall within the protection scope of the present invention as long as the technical effects of the present invention are achieved by the same means.