GraphSLAM Signal Localization Algorithm

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current signal-strength-based localization and mapping techniques, such as those using Gaussian process latent variable models (GP-LVM), are limited by the assumption of unique signal fingerprints, which restricts their applicability to dense environments and face scalability issues due to O(N3) computational complexity, making them unsuitable for large datasets and sparse signal environments.

Innovation Solution

The GraphSLAM-like algorithm for signal strength SLAM relaxes the fingerprint uniqueness assumption, allowing it to operate in both sparse and dense environments, and reduces computational complexity to O(N2) by using Gaussian weighted interpolation and incorporating low-cost IMU data, making it suitable for a wide range of environments including open spaces.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If Gaussian process latent variable models (GP-LVM) are used for signal-strength-based localization, then localization accuracy can be achieved in dense environments, but the method is limited to very specific predefined shapes and requires O(N3) computational complexity

Engineering Contradiction:
Improvelocalization accuracyVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent changes the mathematical formulation from Gaussian process latent variable models to graph-based SLAM, transforming the computational complexity from O(N3) to O(N2). This parameter change in the underlying algorithm allows the system to handle larger datasets more efficiently while maintaining localization accuracy in diverse environments.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent segments the localization problem into discrete graph nodes and edges, where each node represents a landmark and each edge represents a measurement relationship. This segmentation allows the system to process large amounts of data by breaking it down into manageable components that can be processed through graph optimization techniques.

Inventive Principle:
Principle #1Segmentation

2Reliability

If GP-LVM methods are used, then signal strength data can be modeled, but the method requires special constraints to prevent trivial solutions and assumes unique signal fingerprints

Engineering Contradiction:
Improvemodel fitVSAvoidenvironmental adaptability
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent creates a universal graph-based framework that can handle multiple environment types (dense and sparse signal environments) without requiring separate specialized models. The same graph SLAM algorithm adapts to different environments by naturally handling the variability in signal fingerprints through its inherent flexibility, eliminating the need for environment-specific constraints.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

Instead of imposing constraints to force similar signal strengths to similar locations, the patent inverts the approach by allowing the data to naturally reveal the mapping relationships through graph optimization. This inversion of the constraint application approach enables the system to handle ambiguous signal patterns without requiring artificial restrictions.

Inventive Principle:
Principle #13The other way round (Inversion)

3Manufacturing precision

If traditional signal strength mapping techniques are used, then mapping can be performed, but the process is expensive and time consuming

Engineering Contradiction:
Improvemapping accuracyVSAvoidprocessing time
Core Design Contradiction:
Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent replaces traditional mechanical surveying and manual mapping processes with automated graph-based computational methods. By substituting manual measurement and mapping techniques with algorithmic processing of wireless signal data, the system achieves comparable or superior mapping accuracy significantly faster and at lower cost.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The system performs self-service mapping by automatically processing wireless signal strength measurements to create and update maps without requiring external intervention. The graph SLAM algorithm autonomously optimizes the map and trajectory based on sensor data, eliminating the need for manual surveying or external reference systems.

Inventive Principle:
Principle #25Self-service

4Productivity

If GraphSLAM is used, then computational complexity is reduced to O(N2), but the system requires incorporation of additional data sources like IMU data

Engineering Contradiction:
Improvecomputational efficiencyVSAvoiddata fusion complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent merges multiple data sources (wireless signal strength measurements and IMU data) into a unified graph-based optimization framework. By combining these different sensor modalities in a single graph SLAM system, the approach achieves computational efficiency while leveraging the complementary strengths of each sensor type to improve overall system performance.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS10422849B2Method and system for signal-based localization
Publication Date: 2019.09.24 THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIV
  • US10422849B2 patent drawing
  • US10422849B2 patent drawing
  • US10422849B2 patent drawing

AI summary

In an embodiment of the present invention, a GraphSLAM-like algorithm for signal strength SLAM is presented. This algorithm as an embodiment of the present invention shares many of the benefits of Gaussian processes yet is viable for a broader range of environments since it makes no signature uniqueness assumptions. It is also more tractable to larger map sizes, requiring O(N2) operations per iteration. In the present disclosure, an algorithm according to an embodiment of the present invention is compared to a laser-SLAM ground truth, showing that is produces excellent results in practice.