US11441921B2 - Method of and server for generating parking suggestions to be displayed on an electronic device - Google Patents
Method of and server for generating parking suggestions to be displayed on an electronic device Download PDFInfo
- Publication number
- US11441921B2 US11441921B2 US16/718,144 US201916718144A US11441921B2 US 11441921 B2 US11441921 B2 US 11441921B2 US 201916718144 A US201916718144 A US 201916718144A US 11441921 B2 US11441921 B2 US 11441921B2
- Authority
- US
- United States
- Prior art keywords
- map
- location
- server
- final
- parking
- 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, expires
Links
- 238000000034 method Methods 0.000 title claims abstract description 70
- 238000011156 evaluation Methods 0.000 claims description 13
- 238000005516 engineering process Methods 0.000 description 82
- 230000006870 function Effects 0.000 description 19
- 238000004891 communication Methods 0.000 description 15
- 238000010586 diagram Methods 0.000 description 8
- 238000012986 modification Methods 0.000 description 6
- 230000004048 modification Effects 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 239000012092 media component Substances 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3605—Destination input or retrieval
- G01C21/3617—Destination input or retrieval using user history, behaviour, conditions or preferences, e.g. predicted or inferred from previous use or current movement
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3679—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities
- G01C21/3685—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities the POI's being parking facilities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/04—Inference or reasoning models
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N20/00—Machine learning
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
- G06N5/022—Knowledge engineering; Knowledge acquisition
Definitions
- the present technology relates to map applications executable by an electronic device and, more specifically, to a method of and a server for generating parking suggestions for a given destination location in a map application executed by the electronic device.
- Some of these electronic devices are dedicated to provision of the geo-location and routing information.
- An example of such devices would be a portable GPS navigator, such as those available from TomTom Corporation of Amsterdam, The Netherlands.
- Another example of such devices would be a GPS navigator, built-in into a car.
- many car manufacturers provide an option to include a built-in navigation system into their cars.
- map applications are “native” to the smartphone, i.e. is provided as part of the operating system or the set of pre-installed applications.
- Other of such map applications can be downloaded from application repositories (the so-called “app stores”, such as APPLETM STORE, or the like).
- map applications allow a user to build a “route” from Point A (a starting location) to a Point B (a destination point).
- the user is also provided with additional choices, such as selection of: a fastest route, a shortest route, a route that avoids highway, a route that avoids toll roads, etc.
- the map applications generates one or more suggested routes that would take the user from the Point A to the Point B, taking into account the user-selected preferences for the so-generated route.
- the map application typically displays progress of the user along the route (typically by showing a progression of the user along the route by means of a moving an arrow or another symbol representing the user's position along the suggested route).
- the map application can also provide the user additional information—such as: time remaining to the destination, any obstacles along the route (such as accidents or constructions sites), traffic information along the route, alternative suggested routes (typically, these are shown is a “less emphasized” manner, such as in a grey color or the like), and the like.
- the user needs to find a parking spot to leave her vehicle.
- finding a parking spot may be a nuisance for the user.
- the user may waste significant amount of time finding the parking spot.
- Current implementations of the map application do very little to suggest to the user possible parking spots.
- the most common solution nowadays is the map application showing, on the displayed map, location of parking garages and the like.
- United States Patent Application Publication No. 2016/0155276 A1 published on Dec. 1, 2014 to Institute for Information Industry and titled “Method and Apparatus of Dynamically Assigning Parking Lot” teaches a method for dynamically assigning a parking lot.
- one or a plurality of parking lots located in a set distance is selected according to a destination provided by the car.
- a time of parking space to be available is estimated according a real-time parking data and a historical parking data of the one or the plurality of parking lots.
- a waiting time is estimated according the time of parking space to be available and a car number in a line information of the one or the plurality of parking lots.
- a driving time of the car to the one or the plurality of parking lots according to a position of the car is estimated.
- a total waiting time is estimated according the driving time and the waiting time of the one or the plurality of parking lots.
- U.S. Pat. No. 9,652,986 A1 granted on May 16, 2017 to Bayerische Motoren Werke AG and titled “Method for providing parking information on free parking spaces” teaches a method for providing parking information regarding free parking spaces within at least one city block.
- the method provides for detecting information regarding available, free parking spaces, wherein a knowledge database with historical data is generated from the detected information.
- the historical data for specified city blocks and/or specified times or periods of time respectively comprise statistical data regarding free parking spaces.
- a probability distribution of free parking spaces to be expected for the single or the plurality of city blocks is determined.
- a visualization of the probability distribution is generated that represents the parking information regarding free parking spaces within the single or the plurality of city blocks.
- Embodiments of the present technology have been developed based on developers' appreciation that it is desirable for the map application to generate parking suggestions as the user's vehicle approaches a final destination of the route generated by the map application.
- developer(s) have also recognized that some existing prior art methods do not consider hierarchy of objects on a map when providing parking suggestions, and may provide parking suggestions which may be sometimes inconvenient, expensive or may be always occupied.
- the present technology is based on developer(s) acknowledgement that a minimum spanning tree (MST) algorithm could be modified to hierarchically cluster parking locations, such that parking locations could be provided as suggestion to users for a given destination more efficiently, by considering different features and constraints such as location, presence of obstructions, inaccessible places, parking price, and the like when forming a set of clusters.
- MST minimum spanning tree
- embodiments of the present technology are directed to a method and a server for providing parking suggestions in the form of clusters for a given destination location by using a hierarchical clustering algorithm, the parking suggestions to be displayed on an electronic device.
- a computer-implemented method for determining parking suggestions for a given destination location on a map the parking suggestions being displayable on the map, the map being displayable on an electronic device.
- the method is executable by a server, the server is connectable to the electronic device and to a database, and the server executes a clustering algorithm.
- the method begins by acquiring, from the database, based on the given destination location, a set of past routes having been taken on the map by users associated with respective electronic devices, each respective past route of the set of past routes terminating at the given destination location.
- a set of final locations associated with the set of past routes is determined, each final location being an actual ending location of at least one respective user of a respective electronic device having taken the respective past route to the given destination location on the map, each final location being a candidate parking suggestion.
- a road graph of the map is acquired, the road graph including a set of map objects, each map object having: a respective object location, and a respective object class, the respective object class being indicative of a respective type of structure on the map.
- the set of final locations is clustered to obtain a set of clusters, each cluster including a respective subset of final locations, each cluster of at least a portion of the set of clusters being associated with at least one map object and the associated respective object location, the clustering being based on: the given destination location, the respective final locations, the respective object locations, and the respective classes of the respective map objects.
- a request for a current route to the given destination location is received from the client device, the request including an indication of a starting location, A current route on the map from the starting location to the given destination location is determined, and at least one cluster based on the given destination location, the at least one cluster including a respective subset of final locations as a parking suggestion for the given destination location is determined.
- the current route is transmitted to the electronic device, the current route including the parking suggestion.
- the determining the set of final locations is based on a respective distance between each final location and the given destination location being below a predetermined threshold.
- the respective object class is indicative of a level of hierarchy of the respective map object on the road graph, and the clustering is executed in a hierarchical manner
- each cluster has a respective centroid and a respective size
- the determining the at least one cluster including the respective subset of final locations as the parking suggestion is based on the respective centroid and the respective size of the at least one cluster.
- the clustering is performed by using a heuristic evaluation function.
- the clustering algorithm is based on Kruskal's algorithm.
- the set of clusters has a predetermined number of clusters.
- each past route is associated with a respective period of time spent by the at least one user of the respective electronic device at the final location, and the determining the set of final locations is further based on the period of time being above a predetermined time threshold.
- the method further comprises, prior to the clustering: associating, by the server, each final location of at least a portion of the set of final locations with at least one map object based on a respective distance between the final location and the at least one respective object location associated with each of the at least one map object.
- the respective object class is one of: a road segment, a roadblock, and a known parking location.
- the road segment class includes one of: a freeway, an arterial road, a collector road, and a local road.
- a server for determining parking suggestions for a given destination location on a map, the parking suggestions being displayable on the map, the map being displayable on an electronic device connected to the server, the server being connected to a database, the server comprising: a processor, a non-transitory computer-readable medium comprising instructions.
- the processor upon executing the instructions, is configured to: acquire, from the database, based on the given destination location, a set of past routes having been taken on the map by users associated with respective electronic devices, each respective past route of the set of past routes terminating at the given destination location.
- the processor is configured to determine a set of final locations associated with the set of past routes, each final location being an actual ending location of at least one respective user of a respective electronic device having taken the respective past route to the given destination location on the map, each final location being a candidate parking suggestion.
- the processor is then configured to acquire, from the database, a road graph of the map, the road graph including a set of map objects, each map object having: a respective object location, and a respective object class, the respective object class being indicative of a respective type of structure on the map.
- the processor is configured to cluster the set of final locations to obtain a set of clusters, each cluster including a respective subset of final locations, each cluster f at least a portion of the set of clusters being associated with at least one map object and the associated respective object location, the clustering being based on: the given destination location, the respective final locations, the respective object locations, and the respective classes of the respective map objects.
- the processor is configured to receive, from the electronic device, a request for a current route to the given destination location, the request including an indication of a starting location.
- the processor is configured to determine a current route on the map from the starting location to the given destination location and at least one cluster including a respective subset of final locations as a parking suggestion for the given destination location, and transmit, to the client device, the current route, the current route including the parking suggestion.
- the determining the set of final locations is based on a respective distance between each final location and the given destination location being below a predetermined threshold.
- the respective object class is indicative of a level of hierarchy of the respective map object on the road graph and the clustering is executed in a hierarchical manner.
- each cluster has a respective centroid and a respective size.
- the determining the at least one cluster including the respective subset of final locations as the parking suggestion is based on the respective centroid and the respective size of the at least one cluster.
- the clustering is performed by using a heuristic evaluation function.
- the clustering algorithm is based on Kruskal's algorithm.
- the set of clusters has a predetermined number of clusters.
- each past route is associated with a respective period of time spent by the at least one user of the respective electronic device at the final location.
- the determining the set of final locations is further based on the period of time being above a predetermined time threshold.
- the processor is further configured to, prior to the clustering: associate each final location of at least a portion of the set of final locations with at least one map object based on a respective distance between the final location and the at least one respective object location associated with each of the at least one map object,
- the respective object class is one of: a road segment, a roadblock, and a known parking location.
- the road segment class includes one of: a freeway, an arterial road, a collector road, and a local road.
- a “server” is a computer program that is running on appropriate hardware and is capable of receiving requests (e.g. from client devices) over a network, and carrying out those requests, or causing those requests to be carried out.
- the hardware may be implemented as one physical computer or one physical computer system, but neither is required to be the case with respect to the present technology.
- the use of the expression a “server” is not intended to mean that every task (e.g. received instructions or requests) or any particular task will have been received, carried out, or caused to be carried out, by the same server (i.e.
- electronic device is any computer hardware that is capable of running software appropriate to the relevant task at hand.
- electronic device implies that a device can function as a server for other electronic devices and client devices, however it is not required to be the case with respect to the present technology.
- electronic devices include personal computers (desktops, laptops, netbooks, etc.), smart phones, and tablets, as well as network equipment such as routers, switches, and gateways.
- network equipment such as routers, switches, and gateways.
- an electronic device does not preclude multiple client devices being used in receiving/sending, carrying out or causing to be carried out any task or request, or the consequences of any task or request, or steps of any method described herein.
- client device is any computer hardware that is capable of running software appropriate to the relevant task at hand.
- client device in general the term “client device” is associated with a user of the client device.
- client devices include personal computers (desktops, laptops, netbooks, etc.), smart phones, and tablets, as well as network equipment such as routers, switches, and gateways.
- network equipment such as routers, switches, and gateways.
- a device acting as a client device in the present context is not precluded from acting as a server to other client devices.
- the use of the expression “a client device” does not preclude multiple client devices being used in receiving/sending, carrying out or causing to be carried out any task or request, or the consequences of any task or request, or steps of any method described herein.
- information includes information of any nature or kind whatsoever capable of being stored in a database.
- information includes, but is not limited to audiovisual works (images, movies, sound records, presentations etc.), data (location data, numerical data, etc.), text (opinions, comments, questions, messages, etc.), documents, spreadsheets, etc.
- the expression “software component” is meant to include software (appropriate to a particular hardware context) that is both necessary and sufficient to achieve the specific function(s) being referenced.
- computer information storage media (also referred to as “storage media”) is intended to include media of any nature and kind whatsoever, including without limitation RAM, ROM, disks (CD-ROMs, DVDs, floppy disks, hard drivers, etc.), USB keys, solid state-drives, tape drives, etc.
- a plurality of components may be combined to form the computer information storage media, including two or more media components of a same type and/or two or more media components of different types.
- a “database” is any structured collection of data, irrespective of its particular structure, the database management software, or the computer hardware on which the data is stored, implemented or otherwise rendered available for use.
- a database may reside on the same hardware as the process that stores or makes use of the information stored in the database or it may reside on separate hardware, such as a dedicated server or plurality of servers.
- first”, “second”, “third”, etc. have been used as adjectives only for the purpose of allowing for distinction between the nouns that they modify from one another, and not for the purpose of describing any particular relationship between those nouns.
- first database and “third server” is not intended to imply any particular order, type, chronology, hierarchy or ranking (for example) of/between the server, nor is their use (by itself) intended imply that any “second server” must necessarily exist in any given situation.
- reference to a “first” element and a “second” element does not preclude the two elements from being the same actual real-world element.
- a “first” server and a “second” server may be the same software and/or hardware components, in other cases they may be different software and/or hardware components.
- Implementations of the present technology each have at least one of the above-mentioned object and/or aspects, but do not necessarily have all of them. It should be understood that some aspects of the present technology that have resulted from attempting to attain the above-mentioned object may not satisfy this object and/or may satisfy other objects not specifically recited herein.
- FIG. 1 depicts a schematic diagram of an example computer system for implementing certain embodiments of systems and/or methods of the present technology
- FIG. 2 depicts a schematic diagram networked computing environment being suitable for use in accordance with non-limiting embodiments of the present technology.
- FIG. 3 depicts a set of past routes taken by users to a destination location on a map section in accordance with non-limiting embodiments of the present technology.
- FIG. 4 depicts a schematic diagram of a clustering procedure 400 in accordance with non-limiting embodiments of the present technology.
- FIG. 5 depicts a map section with a set of clusters as parking suggestions in accordance with non-limiting embodiments of the present technology.
- FIG. 6 depicts a flow chart of a method for determining parking suggestions for a given destination location in accordance with non-limiting embodiments of the present technology.
- FIG. 7 depicts a flow chart of a method of providing parking suggestions for a destination location to a user of an electronic device
- processor any functional block labelled as a “processor”
- the functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software.
- the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared.
- processor or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, network processor, application-specific integrated circuit (ASIC), field programmable gate array (FPGA), read-only memory (ROM) for storing software, random access memory (RAM), and non-volatile storage.
- DSP digital signal processor
- ASIC application-specific integrated circuit
- FPGA field programmable gate array
- ROM read-only memory
- RAM random access memory
- non-volatile storage Other hardware, conventional and/or custom, may also be included.
- a computer system 100 suitable for use with some implementations of the present technology, the computer system 100 comprising various hardware components including one or more single or multi-core processors collectively represented by a processor 110 , a solid-state drive 120 , a memory 130 , which may be a random-access memory, a network module 140 , and a GPS module 150 .
- Communication between the various components of the computer system 100 may be enabled by one or more internal and/or external buses (generally depicted at 102 ), e.g. a PCI bus, universal serial bus, IEEE 1394 “Firewire” bus, SCSI bus, Serial-ATA bus, etc., to which the various hardware components are electronically coupled.
- the communication within the computer system 100 is implemented in a “hub and spoke” manner via the processor 110 ; however, in alternative implementations of the present technology, the communication can be implemented differently.
- the solid-state drive 120 stores program instructions suitable for being loaded into the memory 130 and executed by the processor 110 for displaying information to a user of the computer system 100 as will be described in further detail below.
- the program instructions may be part of a map or navigational application executable by the processor 110 .
- the network module 140 and the GPS module 150 allow communication between different computer systems, servers and/or other devices.
- FIG. 2 illustrates a networked computing environment 200 suitable for use with some embodiments of the systems and/or methods of the present technology.
- the networked computing environment 200 comprises a plurality of electronic devices 202 .
- the plurality of electronic devices 202 comprises a first electronic device 204 , a second electronic device 210 , and a third electronic device 216 respectively associated with a first user 206 , a second user 212 , and a third user 218 .
- the first user 206 operates a first vehicle 208
- the second user 212 operates a second vehicle 214
- the third user 218 operates a third vehicle 220 .
- the plurality of electronic devices 202 was depicted as comprising three distinct electronic devices, this may not and does not need to be the case in each and every implementation of the present technology. In fact, the plurality of electronic devices 202 could number in the tens or hundreds of thousands.
- the networked computing environment 200 also comprises a server 230 in communication with the plurality of electronic devices 202 via a communications network 240 .
- the networked computing environment 200 further comprises a GPS satellite 250 transmitting and/or receiving a GPS signal 260 to/from the plurality of electronic devices 202 .
- GPS satellite 250 transmitting and/or receiving a GPS signal 260 to/from the plurality of electronic devices 202 .
- the present technology is not limited to GPS and may employ a positioning technology other than GPS (such as, GLONASS, DORIS, BeiDou, COMPASS, for example).
- the communications network 240 is the Internet.
- the communication network can be implemented as any suitable local area network (LAN), wide area network (WAN), a private communication network or the like. It should be expressly understood that implementations for the communication network are for illustration purposes only. How a communication link (not separately numbered) between a given electronic device and the communications network 240 is implemented will depend inter alia on how the given electronic device is implemented.
- the server 230 is implemented as a conventional computer server.
- the server 230 is implemented as a DellTM PowerEdgeTM Server running the MicrosoftTM Windows ServerTM operating system, but can also be implemented in any other suitable hardware, software, and/or firmware, or a combination thereof.
- the server is a single server.
- the functionality of the server 230 may be distributed and may be implemented via multiple servers.
- the implementation of a given electronic device from the plurality of electronic devices 202 is not particularly limited, but as an example, the given electronic device may be implemented as a wireless communication device such as a mobile telephone (e.g. a smart phone or a radio-phone), a vehicle navigation device (e.g. TomTomTM, GarminTM), a tablet, a personal computer and the like.
- a mobile telephone e.g. a smart phone or a radio-phone
- vehicle navigation device e.g. TomTomTM, GarminTM
- a tablet e.g., a personal computer and the like.
- each given electronic device is depicted as the smart phone (although, they do not need to be implemented the same and a given one of the electronic devices may be implemented from another one of the electronic devices).
- a given electronic device may be integrated to a vehicle in the form an onboard media computer (MCU).
- MCU onboard media computer
- the given electronic device may comprise some or all of the components of the computer system 100 depicted in FIG. 1 .
- the given electronic device comprises the network module 140 for communicating with the server 230 via the communications network 240 , the GPS module 150 for receiving and transmitting the GPS signal 260 to the GPS satellite 250 (i.e., for enabling GPS capabilities of the given electronic device), the processor 110 , the memory 130 , and a display interface such as a touch-screen for example.
- the given electronic device comprises hardware and/or software and/or firmware, or a combination thereof, for executing a map application, only one instance of which is depicted in FIG. 1 at 280 in association with the third electronic device 216 .
- the given electronic device may be configured to augment the GPS information using wireless-network mapping techniques that determine a geographic location based on the presence of certain wireless networks proximate to the user device (e.g., Wi-Fi mapping).
- the map application 280 may be implemented as Yandex.MapsTM or Yandex.NavigatorTM applications made available by Yandex®.
- the map application 280 is configured for a two-way communication with the server 230 .
- the server 230 is configured to execute a server-side map application 282 .
- the map application 280 and the server-side map application 282 are configured for delivering to the user (such as the third user 218 ) map and route information.
- the map application 280 is configured to generate and to send to the server 230 a map request 236 , the map request 236 containing information about map information requested by the third user 218 (such as an address for depicting a particular point of interest or routing information for generating a route).
- the map request 236 can be generated in response to the third user 218 interacting with the map application 280 (such as entering the requested info, etc.).
- the server 230 can generate and transmit to the map application 280 a map information packet 238 , the map information packet 238 containing data required for the map application 280 to generate and display a map view that is responsive to the information requested by the third user 218 and transmitted as part of the map request 236 .
- the map application 280 can store locally (i.e. on the third electronic device 216 ) some map information for so-called offline browsing (i.e. generation of map information without having to send the map request 236 and/or to receive the map information packet 238 ).
- the map application 280 can render the map application based on information received from the server 230 either in real time or in an offline manner.
- FIG. 3 there is depicted a schematic diagram of a map section 300 including a set of past routes 310 , the set of past routes 310 having been taken by a plurality of users (such as the first user 206 , the second user 212 and the third user 218 ) to a destination location 312 in accordance with non-limiting embodiments of the present technology.
- a plurality of users such as the first user 206 , the second user 212 and the third user 218
- server-side map application 282 does not necessarily have a graphical user interface (GUI) and the set of past routes 310 are depicted on the map section 300 for purpose of illustration and ease of understanding.
- GUI graphical user interface
- the server 230 retrieves, from the database 235 , based on a the destination location 312 , a set of past routes 310 , the set of past routes 310 having been taken by plurality of users (such as the first user 206 , the second user 212 , and the third user 218 ) associated with the plurality of electronic devices 202 from respective starting locations 308 to the destination location 312 .
- Each past route 314 of the set of past routes 310 is a respective past route having been requested by a respective user via the map application 280 on the respective electronic device (e.g. the second electronic device 210 ).
- the server-side map application 282 of the server 230 may have transmitted the map information packet 238 and caused to display, on the map application 280 of each respective electronic device (e.g. the second electronic device 210 ), a respective past route 314 to the destination location 312 , based on the respective starting location 308 of the respective electronic device (e.g. the second electronic device 210 ). Each respective user may haven then taken the respective past route 314 from the respective starting location 308 to the destination location 312 with his or her respective vehicle.
- each respective electronic device e.g. the second electronic device 210
- Each respective user may haven then taken the respective past route 314 from the respective starting location 308 to the destination location 312 with his or her respective vehicle.
- the set of past routes 310 may be retrieved for a specific period in time (such as from Monday to Friday between 8 AM and 5 PM for the period of January to August for example), or may be retrieved for a complete period (such as all past routes to the destination location 312 from January to December).
- a number of past routes in the set of past routes 310 is not limited, and may be in the hundreds, thousands, or more.
- the server 230 may only retrieve the set of past routes 310 based on the destination location 312 only if the number of past routes in the set of past routes 310 is over a predetermined threshold (such as at least 2000 past routes, for example).
- the nature of the destination location 312 is not limited.
- the destination location 312 may be a point of interest (POI) having been selected or input on the map application 280 of plurality of electronic devices 202 such as a residence building, a business, a hospital, a park, and the like.
- POI point of interest
- the destination location 312 may have been input by providing an address or geo-location coordinates in the server-side map application 282 .
- the destination location 312 may be a private (single family or the like) house or a private land.
- Each respective past route 314 of the set of past routes 310 may also include respective intermediate locations 316 , the respective intermediate locations 316 being points along the respective past route 314 taken by the respective electronic device (e.g. the second electronic device 210 ) of each user to arrive to the destination location 312 via their respective vehicles (e.g. the first vehicle 208 ).
- the respective starting locations 308 , the destination location 312 , the respective intermediate locations 316 may all be associated with respective timestamps indicating at what time the respective user was at the respective location.
- the server-side map application 282 determines, for each past route 314 of the set of past routes 310 , a respective final location 324 to obtain a set of final locations 320 .
- the respective final location 324 is indicative of an actual ending location of the respective user (e.g. the second user 212 ) of the respective electronic device (e.g. the third electronic device 216 ) having taken the past route 314 with his or her respective vehicle (e.g. the second vehicle 214 ).
- a user e.g. second user 212
- How the server-side map application 282 determines the respective final location 324 is not limited.
- the server-side map application 282 may determine the respective final location 324 based on a predetermined time threshold at and/or predetermined distance threshold from the destination location 312 , e.g. if the respective electronic device (e.g. the third electronic device 216 ) of the user (e.g. the second user 212 ) has been at a location within a threshold of 500 meters of the destination location for more than 4 minutes, the server-side map application 28 may consider the location as the respective final location 324 .
- the predetermined time threshold may be chosen to ensure that the second user 212 hasn't stopped his or her second vehicle 214 only temporarily at the respective final location 324 , as an example at a traffic light.
- a number users associated with past routes having stopped at the location may need to be over a predetermined threshold e.g. at least 10 users having taken respective past routes to the destination location 312 may need to have stopped at the location for the location to be considered a respective final location 324 for the destination location 312 .
- the map application 280 of the third electronic device 216 may transmit an indication of a location to the server-side map application 282 , as an example when the second user 212 closes the map application 280 on the third electronic device 216 and/or switches to another application (not depicted) on the third electronic device 216 , which may indicate that the user (e.g. second user 212 ) has finished driving his second vehicle 214 to the destination location 312 and causes transmission of the map request 236 . Additionally or alternatively, the user (e.g. second user 212 ) may indicate on the map application 280 that he or she has finished driving, which causes the map application 280 to send the last location to the server-side map application 282 .
- the respective final location 324 may thus be located before the destination location 312 on the respective past route 314 (such as at a respective intermediate location of the set of intermediate locations 316 on the respective past route 314 for example), after the destination location 312 on the respective past route 314 (i.e. past the destination location 312 in directions opposite to the respective past route 314 ), or may be located directly at the destination location.
- the respective final location 324 is an “unofficial” parking location i.e. the respective final location 324 is not present in the database 235 of the server 230 as a parking location. However, this does not need to be so in every embodiment of the present technology, and official parking locations such as paid city or private parking locations for example may be considered as respective final locations.
- the respective final location 324 may be a parking place in a street, in a parking lot, in a parking building, an exterior parking space of a building, a house, an abandoned terrain, in a field, in a building garage, and the like.
- FIG. 4 there is depicted a schematic diagram of a clustering procedure 400 in accordance with non-limiting embodiments of the present technology.
- actor in the clustering procedure 400 are: the set of final locations 320 , a road graph 402 , a clustering algorithm 440 and a set of clusters 480
- the server 230 acquires, from the database 235 , based on the destination location 312 , a road graph 402 corresponding to the map section 300 .
- the road graph 402 may correspond to an area surrounding the destination location 312 (e.g. a 10 km 2 area around the destination location 312 ), or may correspond to the entire map of the city or region.
- the road graph 402 is a graph representation of the map section 300 , where all paths that could be taken by motorized vehicles (and/or pedestrians) to the destination location 312 are represented in a form of edges and vertices.
- the road graph 402 includes a set of map objects 405 , each map object 410 being a respective vertex on the road graph 402 , each map object 410 having a respective object class 414 and at least one respective object location 412 .
- the respective object class 414 of a respective map object 410 is indicative of a type of structure of the respective map object 410 on the map section 300 and/or features of the respective map object 410 .
- the type of structure is a structure on the map section 300 adapted to receive a motorized vehicle.
- a respective map object may have one or more object classes. Additionally or alternatively, the respective map object 410 may also have one or more sub-classes for each of the object classes 414 .
- the respective object class 414 of the respective map object may be a road segment.
- the respective map object having the road segment class is indicative that the respective map object is a portion of a given road on the map section 300 .
- one or more map objects having the road segment class may form a road.
- the respective map object 410 having the road segment class may also have as a class or as a subclass that is indicative of a respective type of road of the respective road segment, such as a highway freeway/dual carriageway, an arterial road, a collector road, and a local road for example. Additionally or alternatively, the respective map object having the road segment class may also have as a class or as a subclass that is indicative if the road segment class is a way, a street, an avenue, a boulevard, a lane, a drive, a terrace, a place and a court.
- the respective map object 410 having the road segment class may also have one or more additional class or sub-classes which may based on: efficiency of travel, access points, speed limit, popular times of occupation route spacing, traffic usage, price, and the like.
- the respective object class 414 of the respective map object may be a road block.
- the road block class is indicative of an obstruction on a given road, which may be temporary or permanent, and may prevent a motorized vehicle from travelling on the given road.
- the respective map object having the road block class may have one or more other classes or sub-classes indicative if the road block is a construction site, a presence of debris, a dead end, a security barrier, a no entry sign, a private or forbidden road, and the like.
- the respective object class 414 of the respective map object may be an official parking.
- the official parking class may be generally a city parking or a private parking associated with a price, which has been provided to the server-side map application 282 .
- the parking class may have one or more additional classes or sub-classes which may indicate if it is in a parking facility, if it is a city parking or private parking, a price associated with the parking, a parking pattern (parallel, perpendicular, angle parking or other), parking size, and the like.
- the respective map object 410 has at least one respective object location 412 , which indicates as an example at least one of starting location of the respective map object 410 , an end location of the respective map object 410 , and/or intermediate locations between the starting and end location of the respective map object 410 .
- the road graph 402 allows representing a road network surrounding the destination location 312 via the set of map objects 405 , where each map object 410 is associated with one or more respective object classes.
- each map object is not limited, and may be determined by the developer(s) based as an example on past user interaction data, and official data from the city, region, or country, and the respective classes listed herein above may change depending on the continent, country, region, city or neighbourhood.
- the server-side map application 282 associates the set of final locations 320 with the road graph 402 .
- the server-side map application 282 associates each final location 324 of the set of final locations 320 with a respective map object 410 and its respective object class 414 on the road graph 402 based on the at least one object location 412 associated with the respective map object 410 .
- the server-side map application 282 may associate the final location 324 with the respective map object 410 and the respective object class 414 based on a distance between the final location 324 and the at least one respective object location 412 being below a predetermined distance threshold.
- At least one final location (not depicted) of the set of final locations 320 may not be associated with a map object 410 of the road graph 402 , as an example if the object location 412 is above the predetermined distance threshold and/or there is no map object 410 .
- the set of final locations 320 are thus represented as additional nodes on the road graph 402 , where each final location 324 of at least a portion of the set of final locations 320 is associated with a respective map object 410 and a respective object class 414 via its association with the respective map object 410 .
- the server-side map application 282 is configured to execute clustering of the set of final locations 320 associated with the road graph 402 via a clustering algorithm 440 .
- the server-side map application 282 executes the clustering algorithm 440 .
- the clustering algorithm 440 can be based on Kruskal's algorithm, although, use of other suitable algorithms is envisioned in other non-limiting embodiments of the present technology.
- Kruskal's algorithm is a minimum spanning tree (MST) algorithm which finds an edge of the least possible weight that connects any two trees in a forest.
- a MST is a subset of the edges of a connected, edge-weighted undirected graph connecting all the vertices together, without any cycles and with the minimum possible total edge weight.
- Kruskal's algorithm is a greedy algorithm which finds a MST for a connected weighted graph adding increasing cost arcs at each step.
- a spanning tree of the graph is a subgraph that is a tree and connects all vertices
- a MST or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree.
- Kruskal's algorithm is generally used for network design, as an approximation algorithm for NP-hard problems such as the travelling salesman problem (TSP) and Steiner Tree, and other indirect applications.
- TSP travelling salesman problem
- Kruskal's algorithm has been modified to execute clustering of the set of final locations 320 by implementing an evaluation function when executing the MST algorithm, which allows hierarchical clustering of the set of final locations 320 .
- the evaluation function may be a heuristic function.
- the evaluation function may be applied at every iteration by the clustering algorithm 440 , and penalize some features (i.e. such a distance, or object class) by increasing the weighted distance between a pair of final locations sharing the features.
- the evaluation function may also consider an area size covered by the cluster, a size of the cluster (i.e. number of final locations in the cluster), object classes of nearby objects not associated with final locations, and the like.
- the evaluation function considers hierarchy levels of the object classes and/or sub-classes.
- the weighted distance between a pair of final locations is based on: the respective distances between the final locations 324 and the destination location 312 , a distance between the final locations of the pair, and the respective object classes 414 associated with each of the final locations 324 .
- the set of final locations 320 can be divided into a number of clusters such that a minimum weight between items in different clusters is maximized.
- the clustering is executed in a hierarchical manner, where initially, each final location 324 of the set of final locations 320 is considered as a separate cluster in and of itself, and the clustering algorithm 440 starts by applying the evaluation function and connecting the two final locations having a minimal weighted distance, then repeats the same with the next final location having a minimal distance, etc.
- the clustering stops when only one cluster is left, and selects the one on which the evaluation function is optimal (e.g. minimal or maximal) from all of the intermediate options.
- a number of clusters may be predetermined, and clustering may end when the predetermined number of clusters is reached.
- the clustering algorithm 440 obtains a set of clusters 480 , each cluster 484 having a respective size 486 and a respective centroid 488 , each cluster 484 having a subset of final locations 320 .
- Each cluster 484 of at least a portion of the set of clusters 480 may be associated with a respective map object 410 and a respective object location 412 .
- Remaining clusters of the set of clusters 480 may not be associated with a respective map object 410 , and be associated with a given area of the map section 300 or a final location of the subset of final location 320 .
- the respective centroid 488 may be an average of the distances of the final locations included in the respective cluster 484 , and may be used to suggest the respective cluster 484 to a user depending on the direction he or she comes from. In other words, the location of the respective centroid 488 can be used as a visual proxy for representing the associated respective cluster 484 . In some embodiments of the present technology, the respective centroid 488 may be used to suggest the respective cluster 484 as a parking suggestion based on a distance between the respective centroid 488 and intermediate points of the route of the user (not depicted) for example. The respective size 486 of the may also be used to suggest parking locations as the bigger the size of the associated parking location, the greater the probability of having unoccupied parking locations.
- FIG. 5 depicts the map section 300 with a set of clusters 480 as parking suggestions, the set of clusters 480 having been obtained by executing the clustering algorithm 440 for the destination location 312 in accordance with non-limiting embodiments of the present technology.
- two groups of final locations may be at a short distance from each other, but separated by a two-way road (which may be, as a non-limiting example, an ensemble of map objects having in common the road segment class, the road class, a two-way class, a traffic class).
- a two-way road which may be, as a non-limiting example, an ensemble of map objects having in common the road segment class, the road class, a two-way class, a traffic class.
- One of the plurality of users such as the first user 106 located at a given starting location in his or her first vehicle 208 may select or input the destination location 312 in the map application 280 on the first electronic device 204 , which causes the map application 280 to transmit the map request 236 to the server 230 , the map request 236 including a request for a route from the given starting location to the destination location 312 .
- the server-side map application 282 may generate a current route from the given starting location to the destination location 312 .
- the first user 106 may only be interested in the destination location 312 and surrounding areas, and may zoom on a map section including the destination location 312 or select an interface element to display parking suggestions, which may cause the first electronic device 204 to transmit a request for parking suggestions surrounding the destination location 312 .
- the server-side map application 282 retrieves, from the database 235 , the set of clusters 480 associated with the destination location 312 , at least one cluster of the set of clusters 480 to be provided as a parking suggestion for the destination location 312 .
- the server-side map application 282 may, based on the current route, suggest at least one cluster from the set of clusters 480 associated with the destination location 312 as parking suggestions.
- at least one cluster of the set of cluster 480 may be chosen first, and a current route to the destination location 312 may be suggested based on the selected at least one cluster.
- the at least one cluster from the set of clusters 480 may be suggested based on a current location of the first user 302 . Further, it is contemplated that the at least one cluster may be suggested based on explicit user preferences (i.e. specified by the first user 306 in the map application 280 ) or implicit user preferences (i.e. based on past user interaction data of the user), such as free parking, extra parking space, no street parking, and the like. In alternative embodiments, the set of clusters 480 as a whole may be suggested to the first user 106 . The server-side map application 282 transmits the current route including the at least one cluster from the set of clusters 480 as parking suggestions.
- the server-side map application 282 may receive an indication from the map application 280 , and regenerate a second current route and/or provide another cluster of the set of cluster 480 as parking suggestions.
- FIG. 6 there is depicted a flow chart of a method 600 for determining parking suggestions for a given destination location, the method 600 executable by the server 230 in accordance with non-limiting embodiments of the present technology.
- the method 600 may begin at step 602 .
- STEP 602 acquiring, based on the given destination location, a set of past routes having been taken on the map by users associated with respective electronic devices, each respective past route of the set of past routes terminating at the given destination location
- the server-side map application 282 of the server 230 acquires from the database 235 , based on the destination location 312 , a set of past routes 310 having been taken on the map section 300 by the plurality of users (i.e. the first user 206 , the second user 212 , and the third user 218 ) associated with respective electronic devices (such as the first electronic device 204 , the second electronic device 210 , and the third electronic device 216 ), each respective past route of the set of past routes 310 terminating at the destination location 312 .
- the plurality of users i.e. the first user 206 , the second user 212 , and the third user 218
- respective electronic devices such as the first electronic device 204 , the second electronic device 210 , and the third electronic device 216
- the method 600 then advances to step 604 .
- STEP 604 determining a set of final locations associated with the set of past routes, each final location being an actual ending location of at least one respective user of a respective electronic device having taken the respective past route to the given destination location on the map, each final location being a candidate parking suggestion
- the server-side map application 282 of the server 230 determines a set of final locations 320 associated with the set of past routes 310 , each final location being an actual ending location of at least one respective user of a respective electronic device having taken the respective past route 314 to the destination location 312 on the map section 300 , each final location 324 being a candidate parking suggestion.
- the method 600 then advances to step 606 .
- STEP 606 acquiring, from the database, a road graph of the map, the road graph including a set of map objects, each map object having:
- the server-side map application 282 of the server 230 acquires, from the database 235 , a road graph 402 of the map section 300 , the road graph 402 including a set of map objects 405 , each map object having: a respective object location 412 , and a respective object class 414 , the respective object class 414 being indicative of a respective structure on the map section 300 .
- the respective object class 414 may be one of a road segment, a roadblock, and a known parking location.
- the road segment class includes one of: a freeway, an arterial road, a collector road, and a local road.
- the method 600 then advances to step 608 .
- STEP 608 associating each final location of at least a portion of the set of final locations with at least one map object of the road graph based on a respective distance between the final location and the at least one respective object location associated with each of the at least one map object
- the server-side map application 282 of the server 230 associates each final location 324 of at least a portion the set of final locations 320 with at least one map object 410 of the road graph 402 based on a respective distance between the final location 324 and the at least one respective object location 412 associated with each of the at least one map object 410 being below a predetermined distance.
- At least one given final location (not depicted) of the set of final locations 320 may not be associated with a map object 410 of the road graph 402 , as an example if there is no map object 410 below the predetermined distance, or due to insufficient data.
- the method 600 then advances to step 610 .
- STEP 610 clustering the set of final locations to obtain a set of clusters on the road graph, each cluster including a respective subset of final locations, each cluster of at least a portion of the set of clusters being associated with at least one map object and the associated respective object location, the clustering being based on:
- the server-side map application 282 of the server 230 executes the clustering algorithm 440 to cluster the set of final locations 320 into a set of clusters 480 , each respective cluster 484 including a subset of the set of final locations 320 .
- the clustering is based on: the given destination location 312 , the respective final locations 324 , the respective object class 414 of the respective map objects 410 , and the respective object location 412 .
- each respective cluster 484 of at least a portion of the set of clusters 480 may be associated with the respective map object 410 and its respective object class 414 , and at least remaining cluster (not depicted) of the set of clusters 480 may not necessarily be associated with an object of the set of map objects 405 , as an example if data about the map section 300 is insufficient, and may be “pinned” to a region of the map section 300 or a given location of the set of final locations 320 .
- a number of clusters in the set of clusters 480 may be predetermined.
- the clustering algorithm 440 may be based on a modified version of Kruskal's algorithm and use an evaluation function at each iterative step.
- the clustering algorithm 440 may use a heuristic evaluation function.
- the clustering algorithm 440 may perform the clustering in a hierarchical manner, where initially each final location 324 is considered as a respective cluster.
- Each respective cluster 484 has a respective size 486 and a respective centroid 488 , which may be used to determine at least one of the respective cluster 484 as parking suggestions for the destination location 312 .
- the method 600 then ends.
- the method 600 may then be repeated for a set of destination locations (not depicted) to obtain respective set of clusters (not depicted) to be provided as parking suggestions for each respective destination location in the set of destination locations. How the destination locations in the set of destination are selected is not limited, and the selection may be based on a popularity of the destination location for example.
- the server-side map application 282 of the server 230 may store, in the database 235 , each respective set of clusters for each destination location, at least one cluster of the respective set of clusters to be used as a parking suggestion for the respective destination location in the set of destination locations 312 .
- At least one cluster of a respective set of clusters may be provided by the server-side map application 282 to the map application 280 as a parking suggestion for a respective destination location.
- a user zooming on a map section having the respective destination location and having activated beforehand an option to display parking suggestions, or a user selecting an interface element to display parking suggestions for the respective destination location may cause the map application 280 to send the map request 236 to the server-side map application 282 .
- the server-side map application 282 may retrieve at least one cluster from respective set of clusters from the database 235 and cause to display, on the map application 280 , the at least one cluster as parking suggestions for the respective destination location.
- the at least one cluster of the respective set of clusters may also be provided as parking suggestions to a user requesting a route to the respective destination location.
- FIG. 7 there is depicted a method 700 of providing parking suggestions for a destination location to a user of an electronic device, such as the first user 206 associated with the first electronic device 204 .
- the method 700 is executed by the server-side map application 282 of the server 230 after execution of the method 600 .
- the method 700 begins at step 702 .
- STEP 702 receiving a request for a current route to the given destination location, the request including an indication of a starting location
- the server-side map application 282 of the server 230 receives the map request 236 from the first electronic device 204 for a current route to the destination location 312 , the map request 236 including an indication of a starting location 308 .
- the method 700 advances to step 704 .
- STEP 704 determining a current route on the map from the starting location to the given destination location, and at least one cluster including a respective subset of final location as a parking suggestion for the given destination location
- the server-side map application 282 of the server 230 determines a current route on the map section 300 from the starting location 308 to the destination location 312 , and at least one cluster 484 including a respective subset of the set of final locations 320 as a parking suggestion for the destination location 312
- the manner in which the current route from the starting location to the destination location 312 is determined is not limited, and may be generated by considering distance, traffic, time of the day, and other factors to minimize time of travel of the user in his or her vehicle.
- the server-side map application 282 may first select at least one cluster 484 including a respective subset of the set of final locations 320 as a parking suggestion for the destination location 312 (as an example based on past availability of parking in a similar time period), and generate a current route based on the at least one cluster 484 .
- the method 700 advances to step 706 .
- STEP 706 transmitting, to the electronic device, the current route, the current route including the parking suggestion.
- the server-side map application 282 of the server 230 transmits to the map application 280 of the third electronic device 216 the current route to the destination location 312 , the current route including the at least one cluster 484 including the respective subset of the set of final locations 320 as parking suggestions.
- the method 700 then ends.
- At least some embodiments of the present technology aim to expand a range of technical solutions for addressing a particular technical problem, namely improving determination of parking suggestions for a given destination location based on past user data and by using a minimal spanning tree algorithm as a hierarchical clustering algorithm, which improves time required to generate a set of clusters as parking suggestions on the server, and may provide more satisfactory suggestions to users of client devices.
- Such technical solutions may allow saving resources such as storage space, bandwidth and time on client devices, as well as on the server.
- the signals can be sent-received using optical means (such as a fibre-optic connection), electronic means (such as using wired or wireless connection), and mechanical means (such as pressure-based, temperature based or any other suitable physical parameter based).
- optical means such as a fibre-optic connection
- electronic means such as using wired or wireless connection
- mechanical means such as pressure-based, temperature based or any other suitable physical parameter based
Abstract
Description
-
- a respective object location on the road graph,
- a respective object class, the respective object class being indicative of a respective structure on the map
-
- the given destination location,
- the respective final locations, and
- the respective class of the respective map objects.
Claims (20)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
RURU2018145552 | 2018-12-21 | ||
RU2018145552A RU2749650C1 (en) | 2018-12-21 | 2018-12-21 | Method and server for generating parking recommendations displayed on an electronic device |
RU2018145552 | 2018-12-21 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20200200562A1 US20200200562A1 (en) | 2020-06-25 |
US11441921B2 true US11441921B2 (en) | 2022-09-13 |
Family
ID=71097540
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/718,144 Active 2041-03-24 US11441921B2 (en) | 2018-12-21 | 2019-12-17 | Method of and server for generating parking suggestions to be displayed on an electronic device |
Country Status (2)
Country | Link |
---|---|
US (1) | US11441921B2 (en) |
RU (1) | RU2749650C1 (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20200173808A1 (en) * | 2018-11-30 | 2020-06-04 | Here Global B.V. | Methods and systems for providing recommendations for parking of vehicles |
US20210217311A1 (en) * | 2020-01-13 | 2021-07-15 | Ford Global Technologies, Llc | Crowdsourced navigation systems and methods |
US20210304604A1 (en) * | 2020-02-24 | 2021-09-30 | Schneider Enterprise Resources, LLC | Systems and methods for parking suggestions |
US20220343763A1 (en) * | 2021-04-21 | 2022-10-27 | Waymo Llc | Identifying parkable areas for autonomous vehicles |
US20230084257A1 (en) * | 2021-09-13 | 2023-03-16 | International Business Machines Corporation | Artificially intelligent system for dynamic infrastructure management in edge systems |
WO2024035337A1 (en) * | 2022-08-08 | 2024-02-15 | Grabtaxi Holdings Pte. Ltd. | Method and system for identifying a parking lot relative to a point of interest |
Citations (61)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090024430A1 (en) * | 2007-07-12 | 2009-01-22 | Cooper Marcus | Method for optimizing routes for vehicle parking enforcement |
US7516010B1 (en) | 2006-01-27 | 2009-04-07 | Navteg North America, Llc | Method of operating a navigation system to provide parking availability information |
JP2009092586A (en) | 2007-10-11 | 2009-04-30 | Aisin Aw Co Ltd | Parking lot search system and program |
US7538690B1 (en) | 2006-01-27 | 2009-05-26 | Navteq North America, Llc | Method of collecting parking availability information for a geographic database for use with a navigation system |
WO2010081545A1 (en) | 2009-01-14 | 2010-07-22 | Tomtom International B.V. | Navigation apparatus, server apparatus and method of providing an indication of likelihood of occupancy of a parking location |
US20110133957A1 (en) | 2009-12-03 | 2011-06-09 | Delphi Technologies, Inc. | Vehicle parking locator system and method using connected vehicles |
US20110224899A1 (en) * | 2010-03-12 | 2011-09-15 | Telenav, Inc. | Navigation system with parking space locator mechanism and method of operation thereof |
KR20110105124A (en) | 2010-03-18 | 2011-09-26 | 주식회사 제노프릭스 | Integrated system for parking guidance and parking lot management |
CN102235876A (en) | 2010-04-23 | 2011-11-09 | 环达电脑(上海)有限公司 | Navigation method for parking lot around destination |
WO2012039867A1 (en) | 2010-09-23 | 2012-03-29 | Applied Materials, Inc. | System and method for voltage-based plasma excursion detection |
US20120161986A1 (en) * | 2010-12-27 | 2012-06-28 | Eyal Amir | Providing guidance for locating street parking |
US8217806B2 (en) | 2008-09-09 | 2012-07-10 | Lg Electronics Inc. | Method and apparatus for providing parking information |
US20120262305A1 (en) | 2011-04-14 | 2012-10-18 | Google Inc. | Identifying Parking Spots |
JP2013007674A (en) | 2011-06-24 | 2013-01-10 | Denso Corp | Parking lot information notification device |
JP2013019740A (en) | 2011-07-11 | 2013-01-31 | Nissan Motor Co Ltd | Parking place information providing device and parking place information providing method |
US8484151B1 (en) | 2010-12-29 | 2013-07-09 | Google Inc. | Predicting parking availability |
US8665118B1 (en) | 2011-04-21 | 2014-03-04 | Google Inc. | Parking information aggregation platform |
RU2516575C2 (en) | 2008-06-25 | 2014-05-20 | Томтом Интернэшнл Б.В. | Device and method for determining parking information |
US8797187B2 (en) | 2012-03-30 | 2014-08-05 | Toyota Jidosha Kabushiki Kaisha | Street parking availability estimation |
KR20140109547A (en) | 2013-03-01 | 2014-09-16 | 강명수 | Method and Apparatus for Parking Lot Guidence Service System |
US8843307B1 (en) | 2011-06-07 | 2014-09-23 | Cellco Partnership | Real time parking location navigator |
CN104169990A (en) | 2012-02-01 | 2014-11-26 | 宝马股份公司 | Method for providing parking information on free parking spaces |
US8963740B2 (en) | 2013-03-14 | 2015-02-24 | Microsoft Corporation | Crowd-sourced parking advisory |
US8994560B2 (en) | 2012-01-06 | 2015-03-31 | International Business Machines Corporation | Managing parking space availability |
US9026351B2 (en) | 2007-12-28 | 2015-05-05 | Aisin Aw Co., Ltd. | Navigation devices, methods and programs |
US9151628B1 (en) | 2015-01-30 | 2015-10-06 | Nissan North America, Inc. | Associating parking areas with destinations |
US9200921B2 (en) | 2013-03-13 | 2015-12-01 | Nokia Technologies Oy | Parking information based on destination |
EP2953112A1 (en) | 2014-05-27 | 2015-12-09 | Continental Automotive GmbH | Method and system for providing an occupation probability of vehicle parking spots |
US20160063862A1 (en) | 2014-08-27 | 2016-03-03 | Sparkcity.Com Ltd. | Parking space management system and method |
US20160061618A1 (en) | 2014-08-27 | 2016-03-03 | Parklife Ltd. | Technique for navigating a vehicle to a parking place |
JP5886671B2 (en) | 2012-03-30 | 2016-03-16 | 株式会社ゼンリン | Parking lot fullness judging device, judging method and program therefor |
US9299256B2 (en) | 2013-04-22 | 2016-03-29 | GM Global Technology Operations LLC | Real-time parking assistant application |
US9299257B2 (en) | 2013-04-05 | 2016-03-29 | Here Global B.V. | Method and apparatus for determining parking location based on departure time information |
US20160107646A1 (en) * | 2014-10-17 | 2016-04-21 | Ford Global Technologies, Llc | Vehicle Operation Based On Activity Tracking |
CN105526940A (en) | 2014-09-30 | 2016-04-27 | 高德软件有限公司 | Vehicle navigation method and apparatus, electronic map display method and apparatus thereof |
US20160155276A1 (en) | 2014-12-01 | 2016-06-02 | Institute For Information Industry | Method and Apparatus of Dynamically Assigning Parking Lot |
US20160155332A1 (en) * | 2014-12-02 | 2016-06-02 | Kevin Sunlin Wang | Method and system for avoidance of parking violations |
CN105651296A (en) | 2016-02-02 | 2016-06-08 | 深圳市凯立德科技股份有限公司 | Parking guidance method and device |
CN105987703A (en) | 2015-02-05 | 2016-10-05 | 戴姆勒大中华区投资有限公司 | Navigation method for providing information of parking lot near destination |
US9470540B1 (en) | 2015-04-21 | 2016-10-18 | International Business Machines Corporation | Identifying a parking location with respect to a destination |
CN106251695A (en) | 2016-09-29 | 2016-12-21 | 成都通甲优博科技有限责任公司 | Destination's parking stall intelligent recommendation system and method based on parking space state monitoring |
CN106297392A (en) | 2016-09-28 | 2017-01-04 | 四川锦宸嘉宝科技有限公司 | Parking lot based on Internet of Things Intelligent vehicle-tracing system and method |
US20170046955A1 (en) | 2015-08-11 | 2017-02-16 | Zhixuan Shen | Method and System of Locating and Managing Parking Space |
CN106485943A (en) | 2016-12-05 | 2017-03-08 | 四川恒谦科技有限责任公司 | A kind of motor pool intelligent management system |
US20170098376A1 (en) * | 2014-12-02 | 2017-04-06 | Kevin Sunlin Wang | Method and system for avoidance of parking violations |
CN106652547A (en) | 2015-11-02 | 2017-05-10 | 大陆汽车投资(上海)有限公司 | Parking guidance method |
CN106683485A (en) | 2017-03-22 | 2017-05-17 | 盐城工学院 | Parking space recommendation method and system |
CN106710302A (en) | 2017-02-23 | 2017-05-24 | 京东方科技集团股份有限公司 | Intelligent parking method, intelligent parking system, vehicle-mounted system and terminal |
CN106781669A (en) | 2016-12-30 | 2017-05-31 | 珠海市魅族科技有限公司 | Recommend method and device in a kind of parking stall |
US9671237B1 (en) | 2015-11-16 | 2017-06-06 | Sap Se | Optimized generation of navigation instructions based on computed parking probability values |
WO2017103157A1 (en) | 2015-12-18 | 2017-06-22 | Bayerische Motoren Werke Aktiengesellschaft | Method and system for optimizing the parking space search of a vehicle, and computer program product |
US9747797B1 (en) | 2016-03-25 | 2017-08-29 | Conduent Business Services, Llc | Method and system for predicting availability of parking spot in parking area |
US9778341B2 (en) | 2015-08-25 | 2017-10-03 | International Business Machines Corporation | Automatic indoor parking system using collaborative smartphone sensing |
US9786175B1 (en) | 2016-08-31 | 2017-10-10 | The Florida International University Board Of Trustees | Availability estimation method for parking lots based on incomplete data |
US9805602B2 (en) | 2014-07-21 | 2017-10-31 | Ford Global Technologies, Llc | Parking service |
US9812015B1 (en) | 2014-09-02 | 2017-11-07 | Metromile, Inc. | Systems and methods for determining parking information for a vehicle using vehicle data and external parking data |
US9870707B2 (en) | 2014-06-23 | 2018-01-16 | Hi-Park Solutions Ltd. | Method and system for locating vacant parking places |
US20180053417A1 (en) | 2016-08-18 | 2018-02-22 | Here Global B.V. | Method, apparatus, and computer program product for parking availability estimation based on probe data collection |
US9959761B2 (en) | 2012-12-21 | 2018-05-01 | Parkopedia Limited | System and method for locating available parking spaces |
RU2668361C1 (en) | 2015-06-11 | 2018-09-28 | Ниссан Мотор Ко., Лтд. | Car parking mapping system (options) |
US10089640B2 (en) * | 2015-02-26 | 2018-10-02 | Conduent Business Services, Llc | Methods and systems for interpretable user behavior profiling in off-street parking |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8738283B2 (en) * | 2010-09-24 | 2014-05-27 | Telenav, Inc. | Navigation system with parking lot integrated routing mechanism and method of operation thereof |
-
2018
- 2018-12-21 RU RU2018145552A patent/RU2749650C1/en active
-
2019
- 2019-12-17 US US16/718,144 patent/US11441921B2/en active Active
Patent Citations (70)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7949464B2 (en) | 2006-01-27 | 2011-05-24 | Navteq North America, Llc | Method of operating a navigation system to provide parking availability information |
US7538690B1 (en) | 2006-01-27 | 2009-05-26 | Navteq North America, Llc | Method of collecting parking availability information for a geographic database for use with a navigation system |
US7805239B2 (en) | 2006-01-27 | 2010-09-28 | Navteq North America, Llc | Method of operating a navigation system to provide parking availability information |
US7516010B1 (en) | 2006-01-27 | 2009-04-07 | Navteg North America, Llc | Method of operating a navigation system to provide parking availability information |
US20090024430A1 (en) * | 2007-07-12 | 2009-01-22 | Cooper Marcus | Method for optimizing routes for vehicle parking enforcement |
JP2009092586A (en) | 2007-10-11 | 2009-04-30 | Aisin Aw Co Ltd | Parking lot search system and program |
US9026351B2 (en) | 2007-12-28 | 2015-05-05 | Aisin Aw Co., Ltd. | Navigation devices, methods and programs |
RU2516575C2 (en) | 2008-06-25 | 2014-05-20 | Томтом Интернэшнл Б.В. | Device and method for determining parking information |
US8217806B2 (en) | 2008-09-09 | 2012-07-10 | Lg Electronics Inc. | Method and apparatus for providing parking information |
WO2010081545A1 (en) | 2009-01-14 | 2010-07-22 | Tomtom International B.V. | Navigation apparatus, server apparatus and method of providing an indication of likelihood of occupancy of a parking location |
US20110133957A1 (en) | 2009-12-03 | 2011-06-09 | Delphi Technologies, Inc. | Vehicle parking locator system and method using connected vehicles |
US20110224899A1 (en) * | 2010-03-12 | 2011-09-15 | Telenav, Inc. | Navigation system with parking space locator mechanism and method of operation thereof |
KR20110105124A (en) | 2010-03-18 | 2011-09-26 | 주식회사 제노프릭스 | Integrated system for parking guidance and parking lot management |
CN102235876A (en) | 2010-04-23 | 2011-11-09 | 环达电脑(上海)有限公司 | Navigation method for parking lot around destination |
WO2012039867A1 (en) | 2010-09-23 | 2012-03-29 | Applied Materials, Inc. | System and method for voltage-based plasma excursion detection |
US8779941B2 (en) | 2010-12-27 | 2014-07-15 | Ai Incube, Inc. | Providing guidance for locating street parking |
US9443428B2 (en) | 2010-12-27 | 2016-09-13 | Ai Incube Inc. | Providing guidance for locating street parking |
US8779940B2 (en) | 2010-12-27 | 2014-07-15 | Ai Incube, Inc. | Providing guidance for locating street parking |
US20120161986A1 (en) * | 2010-12-27 | 2012-06-28 | Eyal Amir | Providing guidance for locating street parking |
US8484151B1 (en) | 2010-12-29 | 2013-07-09 | Google Inc. | Predicting parking availability |
US20120262305A1 (en) | 2011-04-14 | 2012-10-18 | Google Inc. | Identifying Parking Spots |
US8947261B1 (en) | 2011-04-21 | 2015-02-03 | Google Inc. | Parking information aggregation platform |
US8665118B1 (en) | 2011-04-21 | 2014-03-04 | Google Inc. | Parking information aggregation platform |
US9754487B1 (en) | 2011-04-21 | 2017-09-05 | Google Inc. | Parking information aggregation platform |
US8843307B1 (en) | 2011-06-07 | 2014-09-23 | Cellco Partnership | Real time parking location navigator |
JP2013007674A (en) | 2011-06-24 | 2013-01-10 | Denso Corp | Parking lot information notification device |
JP2013019740A (en) | 2011-07-11 | 2013-01-31 | Nissan Motor Co Ltd | Parking place information providing device and parking place information providing method |
US8994560B2 (en) | 2012-01-06 | 2015-03-31 | International Business Machines Corporation | Managing parking space availability |
CN104169990A (en) | 2012-02-01 | 2014-11-26 | 宝马股份公司 | Method for providing parking information on free parking spaces |
US9652986B2 (en) | 2012-02-01 | 2017-05-16 | Bayerische Motoren Werke Aktiengesellschaft | Method for providing parking information on free parking spaces |
US8797187B2 (en) | 2012-03-30 | 2014-08-05 | Toyota Jidosha Kabushiki Kaisha | Street parking availability estimation |
JP5886671B2 (en) | 2012-03-30 | 2016-03-16 | 株式会社ゼンリン | Parking lot fullness judging device, judging method and program therefor |
US9959761B2 (en) | 2012-12-21 | 2018-05-01 | Parkopedia Limited | System and method for locating available parking spaces |
KR20140109547A (en) | 2013-03-01 | 2014-09-16 | 강명수 | Method and Apparatus for Parking Lot Guidence Service System |
US9200921B2 (en) | 2013-03-13 | 2015-12-01 | Nokia Technologies Oy | Parking information based on destination |
US8963740B2 (en) | 2013-03-14 | 2015-02-24 | Microsoft Corporation | Crowd-sourced parking advisory |
US9299257B2 (en) | 2013-04-05 | 2016-03-29 | Here Global B.V. | Method and apparatus for determining parking location based on departure time information |
US9299256B2 (en) | 2013-04-22 | 2016-03-29 | GM Global Technology Operations LLC | Real-time parking assistant application |
EP2953112A1 (en) | 2014-05-27 | 2015-12-09 | Continental Automotive GmbH | Method and system for providing an occupation probability of vehicle parking spots |
US9870707B2 (en) | 2014-06-23 | 2018-01-16 | Hi-Park Solutions Ltd. | Method and system for locating vacant parking places |
US9805602B2 (en) | 2014-07-21 | 2017-10-31 | Ford Global Technologies, Llc | Parking service |
US20160063862A1 (en) | 2014-08-27 | 2016-03-03 | Sparkcity.Com Ltd. | Parking space management system and method |
US20160061618A1 (en) | 2014-08-27 | 2016-03-03 | Parklife Ltd. | Technique for navigating a vehicle to a parking place |
US9812015B1 (en) | 2014-09-02 | 2017-11-07 | Metromile, Inc. | Systems and methods for determining parking information for a vehicle using vehicle data and external parking data |
CN105526940A (en) | 2014-09-30 | 2016-04-27 | 高德软件有限公司 | Vehicle navigation method and apparatus, electronic map display method and apparatus thereof |
US20160107646A1 (en) * | 2014-10-17 | 2016-04-21 | Ford Global Technologies, Llc | Vehicle Operation Based On Activity Tracking |
US20160155276A1 (en) | 2014-12-01 | 2016-06-02 | Institute For Information Industry | Method and Apparatus of Dynamically Assigning Parking Lot |
US20170098376A1 (en) * | 2014-12-02 | 2017-04-06 | Kevin Sunlin Wang | Method and system for avoidance of parking violations |
US20160155332A1 (en) * | 2014-12-02 | 2016-06-02 | Kevin Sunlin Wang | Method and system for avoidance of parking violations |
US9151628B1 (en) | 2015-01-30 | 2015-10-06 | Nissan North America, Inc. | Associating parking areas with destinations |
CN105987703A (en) | 2015-02-05 | 2016-10-05 | 戴姆勒大中华区投资有限公司 | Navigation method for providing information of parking lot near destination |
US10089640B2 (en) * | 2015-02-26 | 2018-10-02 | Conduent Business Services, Llc | Methods and systems for interpretable user behavior profiling in off-street parking |
US9939287B2 (en) | 2015-04-21 | 2018-04-10 | International Business Machine Corporation | Identifying a parking location with respect to a destination |
US9470540B1 (en) | 2015-04-21 | 2016-10-18 | International Business Machines Corporation | Identifying a parking location with respect to a destination |
RU2668361C1 (en) | 2015-06-11 | 2018-09-28 | Ниссан Мотор Ко., Лтд. | Car parking mapping system (options) |
US20170046955A1 (en) | 2015-08-11 | 2017-02-16 | Zhixuan Shen | Method and System of Locating and Managing Parking Space |
US9778341B2 (en) | 2015-08-25 | 2017-10-03 | International Business Machines Corporation | Automatic indoor parking system using collaborative smartphone sensing |
CN106652547A (en) | 2015-11-02 | 2017-05-10 | 大陆汽车投资(上海)有限公司 | Parking guidance method |
US9671237B1 (en) | 2015-11-16 | 2017-06-06 | Sap Se | Optimized generation of navigation instructions based on computed parking probability values |
WO2017103157A1 (en) | 2015-12-18 | 2017-06-22 | Bayerische Motoren Werke Aktiengesellschaft | Method and system for optimizing the parking space search of a vehicle, and computer program product |
CN105651296A (en) | 2016-02-02 | 2016-06-08 | 深圳市凯立德科技股份有限公司 | Parking guidance method and device |
US9747797B1 (en) | 2016-03-25 | 2017-08-29 | Conduent Business Services, Llc | Method and system for predicting availability of parking spot in parking area |
US20180053417A1 (en) | 2016-08-18 | 2018-02-22 | Here Global B.V. | Method, apparatus, and computer program product for parking availability estimation based on probe data collection |
US9786175B1 (en) | 2016-08-31 | 2017-10-10 | The Florida International University Board Of Trustees | Availability estimation method for parking lots based on incomplete data |
CN106297392A (en) | 2016-09-28 | 2017-01-04 | 四川锦宸嘉宝科技有限公司 | Parking lot based on Internet of Things Intelligent vehicle-tracing system and method |
CN106251695A (en) | 2016-09-29 | 2016-12-21 | 成都通甲优博科技有限责任公司 | Destination's parking stall intelligent recommendation system and method based on parking space state monitoring |
CN106485943A (en) | 2016-12-05 | 2017-03-08 | 四川恒谦科技有限责任公司 | A kind of motor pool intelligent management system |
CN106781669A (en) | 2016-12-30 | 2017-05-31 | 珠海市魅族科技有限公司 | Recommend method and device in a kind of parking stall |
CN106710302A (en) | 2017-02-23 | 2017-05-24 | 京东方科技集团股份有限公司 | Intelligent parking method, intelligent parking system, vehicle-mounted system and terminal |
CN106683485A (en) | 2017-03-22 | 2017-05-17 | 盐城工学院 | Parking space recommendation method and system |
Non-Patent Citations (1)
Title |
---|
Russian Search Report dated Aug. 20, 2020 issued in respect of the Russian Patent Application No. RU2018145552. |
Also Published As
Publication number | Publication date |
---|---|
US20200200562A1 (en) | 2020-06-25 |
RU2749650C1 (en) | 2021-06-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11441921B2 (en) | Method of and server for generating parking suggestions to be displayed on an electronic device | |
US11562291B2 (en) | Parking availability predictor | |
US10169996B2 (en) | Method and apparatus for estimation of waiting time to park | |
US9719791B2 (en) | Computerized systems and methods for providing travel information and/or content to users | |
RU2681963C1 (en) | System and method for determining parking presence | |
EP3690403B1 (en) | Method and apparatus for providing mobility insight data for points of interest | |
US20170074659A1 (en) | Method and apparatus for providing a location data error map | |
RU2677164C2 (en) | Method and server for creating traffic forecasts | |
US11085778B2 (en) | Method and apparatus for providing opportunistic intermodal routes with shared vehicles | |
EP2541484A1 (en) | Geo-spatial recommendation and discovery system | |
US20210341300A1 (en) | Method, apparatus, and system for providing a personally relevant navigation route comparison | |
US10424202B1 (en) | Parking strategy recommendation based on parking space availability data | |
JP7366104B2 (en) | Landmark-aided navigation | |
US11761772B2 (en) | Method and apparatus for providing speculative navigation routing in incomplete offline maps | |
US20210389152A1 (en) | Method, apparatus, and system for projecting augmented reality navigation cues on user-selected surfaces | |
US11460315B2 (en) | Method and apparatus for computing shared vehicle parking search routes | |
US20210048299A1 (en) | Method and apparatus for generating navigation guidance for an incomplete map | |
US20190376810A1 (en) | Methods and systems for generating route information in map application executed by electronic device | |
US20190392054A1 (en) | System and method for pre-fetching map data | |
US10904705B2 (en) | Method and apparatus for recommending mobility service operators based on user mobility patterns | |
US20210325192A1 (en) | Fine-Tuned Navigation Directions | |
US20210217311A1 (en) | Crowdsourced navigation systems and methods | |
US11881109B2 (en) | Method, apparatus, and system for providing in-parking navigation | |
EP4249851A1 (en) | Autonomous vehicle navigation using map fragments |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: YANDEX.TECHNOLOGIES LLC, RUSSIAN FEDERATION Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VERESHCHAGIN, ALEKSEY IVANOVICH;KALININ, PETR ANDREEVICH;REEL/FRAME:051851/0580 Effective date: 20181218 Owner name: YANDEX EUROPE AG, SWITZERLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YANDEX LLC;REEL/FRAME:051851/0607 Effective date: 20190701 Owner name: YANDEX LLC, RUSSIAN FEDERATION Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YANDEX.TECHNOLOGIES LLC;REEL/FRAME:051851/0596 Effective date: 20190701 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: AWAITING TC RESP, ISSUE FEE PAYMENT VERIFIED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: AWAITING TC RESP, ISSUE FEE PAYMENT VERIFIED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: DIRECT CURSUS TECHNOLOGY L.L.C, UNITED ARAB EMIRATES Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YANDEX EUROPE AG;REEL/FRAME:065692/0720 Effective date: 20230912 |