Prosecution Insights
Last updated: July 17, 2026
Application No. 18/700,112

MULTI-POSITIONING METHOD AND DEVICE

Non-Final OA §102§103
Filed
Apr 10, 2024
Priority
Dec 06, 2021 — RE 10-2021-0173008 +1 more
Examiner
WOLDEMARYAM, ASSRES H
Art Unit
Tech Center
Assignee
Neubility Inc.
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
5m
Est. Remaining
95%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
592 granted / 714 resolved
+22.9% vs TC avg
Moderate +12% lift
Without
With
+12.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
27 currently pending
Career history
741
Total Applications
across all art units

Statute-Specific Performance

§101
0.3%
-39.7% vs TC avg
§103
78.8%
+38.8% vs TC avg
§102
6.3%
-33.7% vs TC avg
§112
13.8%
-26.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 714 resolved cases

Office Action

§102 §103
Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . DETAILED ACTION This office action is in regards to application # 18/700,112 that was filed on 04/10/2024. Claims 1-10 are currently pending and are under examination. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 1 is/are rejected under 35 U.S.C. 102(a)(1)/(a)(2) as being anticipated by Alsindi et al. (US 2011/0074569). Regarding Claim 1, broadly interpreted, Alsindi discloses a multiple positioning apparatus, comprising: a node setting part for setting at least three anchor nodes whose positions are known(set of anchors at known locations, anchor m (101), Fig. 3, abstract, Fig. 1) to at least one unknown node whose position is to be obtained (a set of sensors at unknown locations, sensor n (102), Fig. 3, abstract, Fig. 1); an information acquisition part for acquiring distance information between each of unknown nodes and each of anchor nodes (310, Fig. 3), distance information between unknown nodes and coordinate information of each of anchor nodes (Fig. 1-3); and a coordinate calculation part (360, Fig. 3)for calculating coordinates of each of the unknown nodes based on the distance information between each of the unknown nodes and each of the anchor nodes (310, Fig. 3), the distance information between the unknown nodes and the coordinate information of each of the anchor nodes. Claim(s) 1-2 and 10is/are rejected under 35 U.S.C. 102(a)(1)/(a)(2) as being anticipated by Hohl (US2008/0309556). Regarding Claim 1, Hohl discloses a multiple positioning apparatus (para. [0001]-[0005], [0023]-[0025], [0035]), comprising: a node setting part for setting at least three anchor nodes whose positions are known to at least one unknown node whose position is to be obtained (discloses selecting a set of base nodes (anchor/reference nodes with known or reference positions that define the coordinate system) for localizing other unknown nodes in the network; para. [0001]-[0005], [0023]-[0025], [0035]-[0040], [0074]-[0080], [0096]-[0100]) ; an information acquisition part for acquiring distance information between each of unknown nodes and each of anchor nodes, distance information between unknown nodes and coordinate information of each of anchor nodes (discloses nodes (including unknown/sensor nodes) measuring distances/ranges to neighboring exchanging distance reports and acquiring reference coordinate/positions of base/anchor nodes see[0023]-[0025], [0035]-[0040], [0078]-[0080]); and a coordinate calculation part for calculating coordinates of each of the unknown nodes based on the distance information between each of the unknown nodes and each of the anchor nodes, the distance information between the unknown nodes and the coordinate information of each of the anchor nodes (discloses a computing relative 3D/2D coordinates of unknown nodes using the acquired distances (to anchors + peers) and base/anchor coordinates via trilateration, multilateration, bounding boxes, iterative etc. (see[0023]-[0025], [0035]-[0040], [0074]-[0080], [0096]-[0100], Fig. 1-2 and cited algorithms) . Regarding Claim 2, Hohl discloses a multiple positioning apparatus (para. [0001]-[0005], [0023]-[0025], [0035]) wherein each of the unknown nodes is a sensor apparatus (para. [0023]-[0025]). Regarding Claim 10, the method claim 10 is rejected under the same rational as the rejection of the apparatus claim 1 above. Claim(s) 5 is/are rejected under 35 U.S.C. 102(a)(1)/(a)(2) as being anticipated by Beko et al. (US 2018/0100915). Regarding Claim 5, Beko discloses a multiple positioning apparatus (see para. [0001]-[0006], abstract), comprising: a node setting part for setting at least three anchor nodes whose positions are known to at least one unknown node whose position is to be obtained (para. [0019]-[0022], [0030]-[0035], system uses multiple fixed anchor nodes with known positions to localize unknown target nodes/sensors) ; an information acquisition part for acquiring distance and angle information (RSS for distance +AoA, merges RSS and AoA observations; RSS for substance/range and AoA (angle information)) between each of unknown nodes and each of anchor nodes, distance information between unknown nodes and coordinate information of each of anchor nodes (para. [0005], [0023]-[0025], [0036]-[0040], [0050]-[0060]); and a coordinate calculation part for calculating coordinates of each of the unknown nodes based on the distance and angle information between each of the unknown nodes and each of the anchor nodes, the distance information between the unknown nodes and the coordinate information of each of the anchor nodes ((para. [0023]-[0025], [0036]-[0045], [0055]-[0070]; Hybrid RSS/AoA algorithm computes 3D coordinates of the unknown target using combined range(distance from RSS) and angle (AoA) measurements to multiple anchors, plus anchor coordinates). Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 3 is/are rejected under 35 U.S.C. 103 as being unpatentable over Hohl (US2008/0309556) in view of XUEMAI et al. (CN102158956B). Regarding claim 3, Hohl do not explicitly detail assigning different weights to distance information in coordinate calculations. However XUEMAI teaches a weighted trilateration method in wireless sensor networks for improving positioning accuracy by assigning different weights to distance measurement (based on RSS/signal quality) between the unknown node and each anchor node( and implicitly using anchor coordinates),(see para. [0019]-[0022], steps 2-4, claims, the unknown node selects/sequences anchors and applies weight in the trilateral coordinate calculation). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify Hohl’s coordinate calculation part by incorporating the weighting technique taught in XUEMAI with a reasonable expectation of success to improve accuracy and robustness, especially in noisy RF environments where some distance measurements are more reliable than others. Claim(s) 4 is/are rejected under 35 U.S.C. 103 as being unpatentable over Hohl (US2008/0309556) in view of Wu et al. (US 7,821,453). Regarding Claim 4, Hohl discloses the apparatus including coordinate calculations using distance to anchor for unknown nodes (para. [0023]-[0025], [0035]-[0040]). Hohl does not expressly disclose that the coordinates calculation part applies Extended Kalman Filter (EKF) to the distance information. However, Wu teaches a distributed sensor fusion method for target localization that uses Extended Kalman Filter (EKF) to estimate the position of unknown targets/nodes by fusing distance/range measurements from multiple sensors/anchors with known positions (see abstract, col. 3-6, col 8-10). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify Hohl’s coordinate calculation part by incorporating the EKF technique taught in Wu with a reasonable expectation of success to achieve better accuracy and robustness. Hohl already performs position estimation from noisy distance measurements and acknowledges the need for refinement/iteration. EKF provides a well known optimal recursive method for handling nonlinear measurement model and noise in range data. The combination yields predictable results: more accurate and stable coordinate estimate for unknown nodes using the same distance and anchor coordinate inputs. Claim(s) 6-7 is/are rejected under 35 U.S.C. 103 as being unpatentable over Beko et al. (US 2018/0100915) in view of Sinha (US 8,798,357). Regarding Claims 6 and 7, Bako discloses a multiple positioning apparatus with anchors, distance/angle acquisitions and coordinate calculations as rejected in claim 5. Bako is silent, but Sinha teaches the camera based image localization system comprising unknown nodes as a camera or image device as a moving/unknown node whose position is to be determined (see abstract, col. 1 lines 5-15; col. 2, line 50- col. 3, lines 20; col. 5 line 1- col. 6, line 30). modified Bako is also silent, but Sinha teaches the camera based image localization system wherein anchor nodes are specific points in an image captured by the camera (known reference points, landmarks, or points in the image captured by the camera serve as anchors with known #D world positions for computing the camera’s pose/position (see col. 3, lines 30- col. 4, lines 60; col. 6 line 40- col. 8, lines 50; col. 9 line 10- col. 10, lines 40, using image features/points for 3D pose estimation) It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify the positioning apparatus of Beko by incorporating the camera based localization technique of Sinha with a reasonable expectation of success. The Beko system already uses distance and angle information from anchors, replacing or augmenting RF sensors with camera (where anchors are visual points in the captured image) is predictable substitution of known predictable modalities to achieve accurate localization in environments rich in visual features. This yields predictable results of improved or alternative positioning using image based measurements while retaining the core apparatus structure. Regarding Claim 7, modified Bako is silent, but Sinha teaches the camera based image localization system wherein anchor nodes are specific points in an image captured by the camera (known reference points, landmarks, or points in the image captured by the camera serve as anchors with known #D world positions for computing the camera’s pose/position (see col. 3, lines 30- col. 4, lines 60; col. 6 line 40- col. 8, lines 50; col. 9 line 10- col. 10, lines 40, using image features/points for 3D pose estimation) Claim(s) 8 is/are rejected under 35 U.S.C. 103 as being unpatentable over Beko et al. (US 2018/0100915) in view of XUEMAI et al. (CN102158956B). Regarding claim 8, Beko do not explicitly detail assigning different weights to distance information in coordinate calculations. However XUEMAI teaches a weighted trilateration method in wireless sensor networks for improving positioning accuracy by assigning different weights to distance measurement (based on RSS/signal quality) between the unknown node and each anchor node( and implicitly using anchor coordinates),(see para. [0019]-[0022], steps 2-4, claims, the unknown node selects/sequences anchors and applies weight in the trilateral coordinate calculation). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify Beko’s coordinate calculation part by incorporating the weighting technique taught in XUEMAI with a reasonable expectation of success to improve accuracy and robustness, especially in noisy RF environments where some distance measurements are more reliable than others. Claim(s) 9 is/are rejected under 35 U.S.C. 103 as being unpatentable over Beko et al. (US 2018/0100915)in view of Wu et al. (US 7,821,453). Regarding Claim 9, Beko discloses the apparatus including coordinate calculations using distance to anchor for unknown nodes (see para. [0001]-[0006], abstract). Beko does not expressly disclose that the coordinates calculation part applies Extended Kalman Filter (EKF) to the distance and angle information. However, Wu teaches a distributed sensor fusion method for target localization that uses Extended Kalman Filter (EKF) to estimate the position of unknown targets/nodes by fusing distance/range measurements from multiple sensors/anchors with known positions (see abstract, col. 3-6, col 8-10). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify Beko’s coordinate calculation part by incorporating the EKF technique taught in Wu with a reasonable expectation of success to achieve better accuracy and robustness. Beko already performs position estimation from noisy distance and angle measurements and acknowledges the need for refinement/iteration. EKF provides a well-known optimal recursive method for handling nonlinear measurement model and noise in range and angle data. The combination yields predictable results: more accurate and stable coordinate estimate for unknown nodes using the same distance, angle, and anchor coordinate inputs. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: Lou et al. (US 11,536,554) discloses a similar localization and attitude estimation method, but using magnetic fields including the following steps. First, in three-dimensional coordinates, at least three magnetic landmarks arbitrarily disposed around a moving carrier are selected, wherein any two of the at least three magnetic landmarks have different magnetic directions. One set of at least five tri-axes magnetic sensors is used to sense the magnetic fields of the at least three magnetic landmarks. Three magnetic components on three axes of a current position of each of the tri-axes magnetic sensors are respectively generated by a demagnetization method. Five non-linear magnetic equations are solved to obtain position information and magnetic moment information of the at least three magnetic landmarks in the three-dimensional coordinates. Position vectors and attitude vectors of the set of at least five tri-axes magnetic sensors in a three-dimensional space are estimated based on tri-axes magnetic moment vectors of the magnetic landmarks. . Any inquiry concerning this communication or earlier communications from the examiner should be directed to ASSRES H WOLDEMARYAM whose telephone number is (571)272-6607. The examiner can normally be reached Monday-Friday 8AM-5PM. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Joshua Huson can be reached at 571-270-5301. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. Assres H. Woldemaryam Primary Examiner (Aeronautics and Astronautics) Art Unit 3642 /ASSRES H WOLDEMARYAM/Primary Examiner, Art Unit 3642
Read full office action

Prosecution Timeline

Apr 10, 2024
Application Filed
Jul 09, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12654856
SYSTEMS AND METHODS FOR LOADING AND UNLOADING A CARGO AIRCRAFT UTILIZING A CURVED PATH
3y 9m to grant Granted Jun 16, 2026
Patent 12654842
TILT ROTOR SYSTEMS AND METHODS FOR EVTOL AIRCRAFT
2y 8m to grant Granted Jun 16, 2026
Patent 12650335
OPTICAL DEVICE ALLOWING THE ANGULAR EMISSION PATTERN OF A LIGHT SOURCE OF FINITE AREA TO BE RAPIDLY MEASURED
3y 9m to grant Granted Jun 09, 2026
Patent 12644968
LIDAR SYSTEM WITH DYNAMIC SCAN SPEED
3y 6m to grant Granted Jun 02, 2026
Patent 12638587
OBJECT DETECTION DEVICE
3y 6m to grant Granted May 26, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
83%
Grant Probability
95%
With Interview (+12.1%)
2y 8m (~5m remaining)
Median Time to Grant
Low
PTA Risk
Based on 714 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month