In-Store Navigation Graph Routing for Faster Item Picking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Professional shoppers face inefficiencies in locating items within stores due to unordered lists and lack of detailed in-store navigation assistance, leading to lengthy and unoptimized shopping routes.
Innovation Solution
A method and system that utilizes a hierarchical graph to connect item identifiers with nearest endpoints in a store, applying a modified TSP algorithm to generate optimal navigation paths, which are then translated into intuitive instructions for shoppers, eliminating the need for hardware-dependent location tracking.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If professional shoppers use unordered lists and ad-hoc route organization, then they can complete shopping tasks with minimal information, but they experience lengthy shopping routes and reduced efficiency
Solution Approach 1:
The system pre-generates optimized shopping routes by connecting item identifiers with nearest endpoints in a hierarchical graph before the shopper enters the store. This preliminary route optimization eliminates the need for shoppers to ad-hoc organize routes, directly reducing shopping time and improving efficiency.
Solution Approach 2:
The patent introduces a navigation system as an intermediary between the shopping list and the shopper's physical movement. The system uses hierarchical graphs and modified TSP algorithms to compute optimal paths, acting as a mediator that translates unordered item lists into structured navigation instructions with traversed endpoints grouped by unique regions.
2Productivity
If detailed hierarchical graph data and modified TSP algorithms are used to optimize routes, then shopping efficiency improves, but compute time for generating navigation instructions increases
Solution Approach 1:
The patent segments the store layout into a hierarchical graph structure with regions and endpoints, dividing the complex routing problem into manageable segments. This segmentation allows the modified TSP algorithm to process routes more efficiently by working with pre-organized hierarchical data rather than raw coordinate information, reducing overall compute time while maintaining optimization quality.
Solution Approach 2:
The system connects each item identifier only to its nearest endpoint in the hierarchical graph, rather than computing all possible connections. This partial action approach (focusing only on relevant endpoints) significantly reduces the computational complexity of the TSP algorithm while still achieving effective route optimization.
3Measurement precision
If traditional navigation systems with hardware-dependent location tracking are used, then location accuracy is maintained, but hardware costs increase
Solution Approach 1:
The patent replaces hardware-dependent location tracking systems with a software-based navigation approach using hierarchical graphs and algorithmic pathfinding. Instead of relying on physical sensors and hardware components for location tracking, the system uses computational methods to determine optimal routes, eliminating hardware costs while maintaining navigation functionality through domain-specific knowledge of store layouts.
Data Source
AI summary
A list of items to pick for an order at a store is obtained. A hierarchical graph of the store is maintained based on regions within the store, endpoints within the store, and locations of items relative to the regions and endpoints. Each item in the list is connected to its nearest endpoint within the graph and a path is found between the endpoints. An optimized and order list of the items is found based on an optimal path through each endpoint. For each segment within the path a list of traversed endpoints is identified. The endpoints are grouped by region; a new navigation instruction is generated only when a given region is changed. The process is repeated for each pair of items in the list; the list is reduced; and translated into text as an optimal path to pick the items of the order within the store.