An anchor-free localization algorithm for shopping carts on supermarket Internet of Things

The function and architecture of smart supermarket was studied based on IoT (Internet of Things) technology. An anchor-free localization algorithm for large scale shopping carts was proposed. Specifically, by introducing the procedure of FastMap algorithm, a fast mapping from pairwise proximity matrix between shopping carts to corresponding coordinates was implemented. In this process, location area was divided into different square sub-regions and anchor nodes were placed on the vertex of square as pivot nodes. The output of FastMap algorithm was sent to initialize MDS in order to make stress converge to global minimum quickly. Simulation experiments with 3600 virtual nodes in 600m×600m location area and 10 real shopping carts tests in a supermarket were carried out. All the results show that our algorithm reduces the complexity comparing with classic MDS and random MDS algorithm, also meets the demand of application in supermarket.