IP Library › Granted Patent US 12,659,689
Granted Patent B2
US 12,659,689 · App. 18/061,112 · Granted Jun 16, 2026

Method and apparatus for providing location-based service in dynamic road network

Inventors: Tae-Sun Chung (Seongnam-si, KR); Aavash Bhandari (Suwon-si, KR)
Assignee: Ajou University Industry-Academic Cooperation Foundation
H04W4/021G06F16/29G06F16/9027G06F16/909G06F16/9537G06Q30/0205H04W4/029
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,659,689
App. No.
18/061,112
Granted
Jun 16, 2026
Kind
B2
Abstract

Provided are a method and apparatus for providing a location-based service (LBS) in a dynamic road network, which include, according to an LBS request signal received from at least one user terminal, generating a query object based on location information of the user terminal; searching for at least one data object located within a threshold radius based on the user terminal; generating a cluster including at least one query object based on at least one node; comparing distances between boundary query objects and an inner query object based on the generated cluster and calculating a nearest neighbor for each query object; and identifying the data object associated with the calculated nearest neighbor.

Claims (38)

1 . A method of providing a location-based service (LBS), the method comprising:

according to an LBS request signal received from a plurality of user terminals, generating query objects based on location information of the plurality of user terminals; searching for at least one data object located within a threshold radius of one of the plurality of user terminals;

generating a cluster including the query objects corresponding to a node sequence, wherein the query objects are defined into two classes:

boundary query objects, each of which is located at a boundary, and

an inner query object, which is located between the boundary query objects;

determining first data objects, among the at least one data object, for the boundary query objects based on a nearest neighbor (NN) algorithm;

determining a second data object for the inner query object, the second data object being assigned as one of the first data objects whose corresponding boundary query object is nearest to the inner query object;

calculating a first distance from the inner query object to the assigned second data

object, the first distance being calculated by adding a second distance and a first length for a first condition, wherein the second distance is the shortest-path distance between the second data object and the corresponding boundary query object, and wherein the first length is a distance of a line segment connecting the corresponding boundary query object and the inner query object, wherein the first condition is defined such that the assigned second data object is a member of a set of data objects closest to one of the boundary query objects; and

transmitting the first data objects, the second data object and the first distance to respective user terminals,

wherein determining the second data object comprises:

identifying a number of query objects included in the query object cluster;

when the identified query object includes a plurality of query objects, calculating partial join result sets for each of the plurality of query objects; and performing a union on the calculated partial join result sets to calculate the nearest neighbor, and

wherein generating the query objects comprises:

acquiring a snapshot of a road network within a threshold radius based on a location of one of the plurality of user terminals according to the LBS request signal.

2 . The method of claim 1 , wherein generating the cluster comprises:

searching a road network of a road on which one of the plurality of user terminals is located; and

generating one or more node clusters based on an intermediate node other than an intersection node or an end node according to a result of searching the road network.

3 . The method of claim 2 , wherein generating the cluster further comprises:

grouping the query objects located in the same node cluster among the node clusters, to generate a query object cluster.

4 . The method of claim 1 , wherein each of the first data objects and the second data object corresponds to a vehicle terminal.

5 . An apparatus for providing a location-based service (LBS), the apparatus comprising:

a communication unit configured to receive an LBS request signal from a plurality of user terminals; and

a control unit configured to:

generate query objects based on location information of the plurality of user terminals, search for at least one data object located within a threshold radius of one of the plurality of user terminals,

generate a cluster including the query objects corresponding to a node sequence, wherein the query objects are defined into two classes:

boundary query objects, each of which is located at a boundary, and

an inner query object, which is located between the boundary query objects, determine first data objects, among the at least one data object, for the boundary query objects based on a nearest neighbor (NN) algorithm,

determine a second data object for the inner query object, the second data object being assigned as one of the first data objects whose corresponding boundary query object is nearest to the inner query object,

calculate a first distance from the inner query object to the assigned second data object, the first distance being calculated by adding a second distance and a first length for a first condition, wherein the second distance is the shortest-path distance between the second data object and the corresponding boundary query object, and wherein the first length is a distance of a line segment connecting the corresponding boundary query object and the inner query object wherein the first condition is defined such that the assigned second data object is a member of a set of data objects closest to one of the boundary query objects, and

transmit, through the communication unit, the first data objects, the second data object and the first distance to respective user terminals, wherein the control unit is further configured to,

identify a number of query objects included in the query object cluster,

when the identified query object includes a plurality of query objects, calculate partial join result sets for each of the plurality of query objects; and

perform a union on the calculated partial join result sets to calculate the nearest neighbor, and

wherein the control unit is further configured to acquire a snapshot of a road network within a threshold radius based on a location of one of the plurality of user terminals according to the LBS request signal.

6 . The apparatus of claim 5 , wherein the control unit is further configured to search a road network of a road on which one of the plurality of user terminals is located, and to generate one or more node clusters based on an intermediate node other than an intersection node or an end node.

7 . The apparatus of claim 6 , wherein the control unit is further configured to group the query objects located in the same node cluster among the node clusters, and to generate a query object cluster.

8 . The apparatus of claim 5 , wherein each of the first data objects and the second data object corresponds to a vehicle terminal.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 13, 2026
From: CHUNG, TAE-SUN; BHANDARI, AAVASH
To: AJOU UNIVERSITY INDUSTRY-ACADEMIC COOPERATION FOUNDATION
Reel/Frame 074650/0736 →
Priority Claims (1)
KR 10-2021-0172164 · Dec 3, 2021 · national
Continuity (1)
Related Publication 20230179949A1 · Jun 8, 2023
References Cited (37)
US 7155339B2 · Tu · 2006 [cited by examiner]
US 8015125B2 · Regli · 2011 [cited by examiner]
US 9188985B1 · Hobbs · 2015 [cited by examiner]
US 10331753B1 · Zhang · 2019 [cited by examiner]
US 10710603B2 · Beaurepaire · 2020 [cited by examiner]
US 11194807B2 · Zhang · 2021 [cited by examiner]
US 11729066B2 · Ohlsson · 2023 [cited by examiner]
US 20040151130A1 · Beshai · 2004 [cited by examiner]
US 20100070509A1 · Li · 2010 [cited by examiner]
US 20100305842A1 · Feng · 2010 [cited by examiner]
US 20100332131A1 · Horvitz · 2010 [cited by examiner]
US 20120215806A1 · Pryakhin · 2012 [cited by examiner]
US 20140082062A1 · Bellver · 2014 [cited by examiner]
US 20150377637A1 · Tanizaki · 2015 [cited by examiner]
US 20160069699A1 · Chen · 2016 [cited by examiner]
US 20160342677A1 · Nuchia · 2016 [cited by examiner]
US 20160356608A1 · Dong · 2016 [cited by examiner]
US 20170011091A1 · Chehreghani · 2017 [cited by examiner]
US 20170120928A1 · Ohara · 2017 [cited by examiner]
US 20170255645A1 · Varoglu · 2017 [cited by examiner]
US 20190390972A1 · Jiao · 2019 [cited by examiner]
EP 3674914A1 · 2020 [cited by examiner]
KR 1020200016544A · 2020 [cited by applicant]
KR 1020200086529A · 2020 [cited by applicant]
KR 1020210114381A · 2021 [cited by applicant]
WO WO2009002020A2 · 2008 [cited by examiner]
WO WO2009113385A1 · 2009 [cited by examiner]
WO WO2009121299A1 · 2009 [cited by examiner]
WO WO2010111118A1 · 2010 [cited by examiner]
WO WO2016153435A1 · 2016 [cited by examiner]
WO WO2018126285A1 · 2018 [cited by examiner]
Xiaoxue Zhang et al., “Implementation of smartphone seamless positioning system based on mobile navigation electronic map”, 2016 Fourth International Conference on Ubiquitous Positioning, Indoor Navigation and Location … [cited by examiner]
Jiajia Li et al., “Efficient Multi-Request Route Planning on Road Network”, 2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications,… [cited by examiner]
Hyo-Kyun Kim et al., “All Nearest Neighbors Query Including Scores Road Network”, 2020 International Conference on Computational Science and Computational Intelligence (CSCI) (Dec. 2020, pp. 1423-1424). [cited by examiner]
Office Action dated Jan. 2, 2024 in Korean Application No. 10-2021-0172164, in 6 pages. [cited by applicant]
Office Action dated Mar. 8, 2024 in Korean Application No. 10-2021-0172164, in 4 pages. [cited by applicant]
Bhandari et al., “Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks”, [cited by applicant]