Indoor Traveling Salesman Problem (ITSP) Path Planning
Bibliographic Data
| ID | 22033265 |
|---|---|
| Authors | Jinjin Yan (0000-0002-9278-3115, Harbin Engineering University, corresponding author), Sisi Zlatanova (0000-0002-8766-0487, UNSW Sydney), Jinwoo Lee (0000-0002-4148-4115, UNSW Sydney), Qingxiang Liu (0000-0001-6100-0221, Harbin Engineering University) |
| Year | 2021 |
| Volume | 10 |
| Issue | 9 |
| Pages | 616 |
| Publication date | 2021-09-16 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | ISPRS International Journal of Geo-Information (JOURNAL) |
| Journal identifiers | ISSN: 2220-9964 • E-ISSN: 2220-9964 |
| Publisher | MDPI AG (PUBLISHER • IT) |
| DOI | 10.3390/ijgi10090616 |
| OpenAlex | W3198926963 |
| Language | EN |
| Citations received | 2 |
| References cited | 40 |
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
Algorithm · Computer network · Dijkstra's algorithm · Graph · Mathematical optimization · Motion planning · Real-time computing · Robot · Shortest path problem · Travelling salesman problem · Computer Science · Evacuation and Crowd Dynamics · Mathematics · Robotic Path Planning Algorithms · Smart Parking Systems Research · Artificial Intelligence · Theoretical Computer Science
| Unique citing works | 2 |
|---|---|
| Citations per year | 0,5 |
| Citation span | 2022 - 2025 (4) |
| Citation velocity | recent |
| Highly cited | No |
| Citation types | Neutral: 2 |