User interface for presenting multi-level map clusters
US-2024401465-A1 · Dec 5, 2024 · US
US11593384B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11593384-B2 |
| Application number | US-202017021979-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 15, 2020 |
| Priority date | Jan 23, 2020 |
| Publication date | Feb 28, 2023 |
| Grant date | Feb 28, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A parking lot free parking space predicting method, apparatus, electronic device and storage medium are provided. The method comprises: building a parking lot association graph for parking lots in a region to be processed; aggregating environment context features of neighboring parking lots according to weights of edges between the neighboring parking lots and a parking lot i to obtain a representation vector of the parking lot i at a current time; and pre-training a graph attention neural network model using the environment context features of the neighboring parking lots and free parking space information, and a gated recurrent neural model according to the representation vector of the parking lot it at the current time.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented parking lot free parking space predicting method, comprising: building a parking lot association graph for parking lots in a region to be processed, each junction therein representing a parking lot, and connecting any two parking lots meeting a predetermined condition through edges; aggregating, by at least one processor, environment context features of neighboring parking lots according to weights of edges between the neighboring parking lots and a parking lot i to obtain a representation vector of the parking lot i at a current time; pre-training, by the at least one processor, a graph attention neural network model using the environment context features of the neighboring parking lots and free parking space information; pre-training, by the at least one processor, a gated recurrent neural model according to the representation vector of the parking lot i at the current time; for a parking lot, performing the following processing respectively: determining, by the at least one processor, local space correlation information of parking lot i at the current time based on the graph attention neural network model according to environment context features of the parking lot i and neighboring parking lots which are in the parking lot association graph and connected to the parking lot i through edges; determining, by the at least one processor, global space correlation information of the parking lot i at the current time according to a soft allocation matrix built based on the local space correlation information of the parking lots at the current time; determining, by the at least one processor, time correlation information of the parking lot i at the current time based on the gated recurrent neural network model according to the local space correlation information and global space correlation information; and predicting, by the at least one processor, free parking space information of the parking lot i at at least one future time step according to the time correlation information of the parking lot i at the current time; wherein the determining global space correlation information of the parking lot i at the current time according to a soft allocation matrix built based on the local space correlation information of the parking lots at the current time comprises: building the soft allocation matrix according to the local space correlation information of the parking lots at the current time based on a hierarchical graph neural network model, and determining the global space correlation information of the parking lot i at the current time according to the soft allocation matrix; the determining time correlation information of the parking lot i at the current time and predicting free parking space information of the parking lot i at at least one future time step according to the time correlation information of the parking lot i at the current time comprises: determining time correlation information of the parking lot i at the current time based on the gated recurrent neural network model, and predicting the free parking space information of the parking lot i at at least one future time step according to the time correlation information of the parking lot i at the current time, determining local space correlation information of parking lot i at a current time based on a graph attention neural network model comprises: for neighboring parking lots, determining weights of edges between the neighboring parking lots and the parking lot i at the current time according to the environment context features of the neighboring parking lots and parking lot i at the current time, respectively; selecting the representation vector as the local space correlation information of the parking lot i at the current time, wherein a weight α ij of the edge between any neighboring parking lot j and parking lot i is expressed as α i j = exp ( c i j ) ∑ k ∈ N i exp ( c i k ) ; where c ij =Attention(W a x i ,W a x j ); Attention represents a graph attention mechanism; N i represents the number of neighboring parking lots; x i represents the environment context feature of the parking lot i at the current time; x j represents the environment context feature of neighboring parking lot j at the current time; W a represents a model parameter obtained by pre-training, or the representation vector x i ′=σ(Σ jϵN i α ij W a x j ); where N i represents the number of neighboring parking lots; x j represents the environment context feature of any neighboring parking lot j among N i neighboring parking lots at the current time; α ij represents a weight of the edge between the neighboring parking lot j and parking lot i at the current time; W a represents a model parameter obtained by pre-training; σ represents an activation function, wherein the method further enhancing the accuracy of subsequent prediction results comprises: training the graph attention neural network model and the gated recurrent neural network model by selecting N l parking lots with real-time sensors as sample parking lots, building annotation data based on historical free parking space information of the sample parking lots, performing training optimization based on the annotation data, and minimizing an objective function O; where the objective function O = 1 τ N l ∑ i = 1 N l ∑ j = 1 τ (
characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU] · CPC title
Supervised learning · CPC title
Engine management systems · CPC title
Geographical information databases · CPC title
Combinations of networks · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.