Next Article in Journal
Modeling and Processing of Smart Point Clouds of Cultural Relics with Complex Geometries
Next Article in Special Issue
Improving Room-Level Location for Indoor Trajectory Tracking with Low IPS Accuracy
Previous Article in Journal
Assessing the Impacts of Hierarchical Healthcare System on the Accessibility and Spatial Equality of Healthcare Services in Shenzhen, China
Previous Article in Special Issue
Visual Positioning in Indoor Environments Using RGB-D Images and Improved Vector of Local Aggregated Descriptors

Indoor Traveling Salesman Problem (ITSP) Path Planning

Qingdao Innovation and Development Center, Harbin Engineering University, Qingdao 266400, China
School of Built Environment, Faculty of Arts, Design and Architecture, University of New South Wales, Kensington, Sydney, NSW 2052, Australia
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Academic Editors: Ihab Hamzi Hijazi, Youness Dehbi and Wolfgang Kainz
ISPRS Int. J. Geo-Inf. 2021, 10(9), 616;
Received: 25 July 2021 / Revised: 22 August 2021 / Accepted: 13 September 2021 / Published: 16 September 2021
(This article belongs to the Special Issue Indoor Positioning and Mapping Based on 3D GIS)
With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance or fastest paths. Such path options might be not always attractive. For instance, pedestrians in a shopping mall may be interested in a path that navigates through multiple places starting from and ending at the same location. Here, we name it as the indoor traveling salesman problem (ITSP) path. As its name implies, this path type is similar to the classical outdoor traveling salesman problem (TSP), namely, the shortest path that visits a number of places exactly once and returns to the original departure place. This paper presents a general solution to the ITSP path based on Dijkstra and branch and bound (B&B) algorithm. We demonstrate and validate the method by applying it to path planning in a large shopping mall with six floors, in which the QR (Quick Response) codes are assumed to be utilized as the indoor positioning approach. The results show that the presented solution can successfully compute the ITSP paths and their potentials to apply to other indoor navigation applications at museums or hospitals. View Full-Text
Keywords: pedestrian; indoor navigation; path planning; traveling salesman problem pedestrian; indoor navigation; path planning; traveling salesman problem
Show Figures

Figure 1

MDPI and ACS Style

Yan, J.; Zlatanova, S.; Lee, J.; Liu, Q. Indoor Traveling Salesman Problem (ITSP) Path Planning. ISPRS Int. J. Geo-Inf. 2021, 10, 616.

AMA Style

Yan J, Zlatanova S, Lee J, Liu Q. Indoor Traveling Salesman Problem (ITSP) Path Planning. ISPRS International Journal of Geo-Information. 2021; 10(9):616.

Chicago/Turabian Style

Yan, Jinjin, Sisi Zlatanova, Jinwoo Lee, and Qingxiang Liu. 2021. "Indoor Traveling Salesman Problem (ITSP) Path Planning" ISPRS International Journal of Geo-Information 10, no. 9: 616.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop