首页|Determining Efficient Routes In A Complex Space Using Hierarchical Information And Sparse Data' in Patent Application Approval Process (USPTO 20240005269)
Determining Efficient Routes In A Complex Space Using Hierarchical Information And Sparse Data' in Patent Application Approval Process (USPTO 20240005269)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
The following quote was obtained by the news editors from the background information supplied by theinventors: “This disclosure relates generally to computer hardware and software for order fulfillment, andmore specifically, to computer-implemented methods of determining efficient sequences for picking ordereditems in a complex item space with sparse data.“When developing and implementing computer hardware and software for fulfilling orders for productslocated at a warehouse, determining the paths or sequences for picking up ordered items can be difficult dueto a lack of data. For example, given a shopping list for a retail store, determining an efficient path/routefor retrieving the items on the list may be difficult without a layout of the physical store. Multidimensionalscaling (MDS), which models a physical layout based on time elapsed from one unique product numberto the next, does not yield an efficient path/route, but merely allows one to infer approximate locations ifgiven an immensely large amount of data, and must be used in conjunction with a traveling salesman-typealgorithm. In addition to requiring a large amount of data and a large compute time, such an approachfails for scenarios where the starting point for picking orders may vary. For example, when some orders arepicked by navigating a warehouse from left to right and others are picked from right to left, MDS predictsa physical layout that is inaccurate, ambiguous, or impossible to interpret, such as predicting the physicallayout of items to be a circle.
NETL
NSTL
