{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:28:18Z","timestamp":1792157298885,"version":"4.4.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p>Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., people may prefer to avoid crowded rooms when walking from A to B. This paper studies two types of crowd-aware indoor path planning queries. The Indoor Crowd-Aware Fastest Path Query (FPQ) finds a path with the shortest travel time in the presence of crowds, whereas the Indoor Least Crowded Path Query (LCPQ) finds a path encountering the least objects en route. To process the queries, we design a unified framework with three major components. First, an indoor crowd model organizes indoor topology and captures object flows between rooms. Second, a time-evolving population estimator derives room populations for a future timestamp to support crowd-aware routing cost computations in query processing. Third, two exact and two approximate query processing algorithms process each type of query. All algorithms are based on graph traversal over the indoor crowd model and use the same search framework with different strategies of updating the populations during the search process. All proposals are evaluated experimentally on synthetic and real data. The experimental results demonstrate the efficiency and scalability of our framework and query processing algorithms.<\/jats:p>","DOI":"10.14778\/3457390.3457401","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T22:48:38Z","timestamp":1634856518000},"page":"1365-1377","source":"Crossref","is-referenced-by-count":23,"title":["Towards crowd-aware indoor path planning"],"prefix":"10.14778","volume":"14","author":[{"given":"Tiantian","family":"Liu","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huan","family":"Li","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Lu","sequence":"additional","affiliation":[{"name":"Roskilde University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lidan","family":"Shou","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-016-0276-8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.03.006"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2014.10.014"},{"key":"e_1_2_1_4_1","first-page":"1564","article-title":"Estimating and testing trend in a stochastic process of Poisson type","volume":"37","author":"Boswell Marllyn Tuley","year":"1966","unstructured":"Marllyn Tuley Boswell 1966 . Estimating and testing trend in a stochastic process of Poisson type . AMS 37 , 6 (1966), 1564 -- 1573 . Marllyn Tuley Boswell et al. 1966. Estimating and testing trend in a stochastic process of Poisson type. AMS 37, 6 (1966), 1564--1573.","journal-title":"AMS"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2003.12.019"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2984768"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1973.10489112"},{"key":"e_1_2_1_8_1","first-page":"1014","article-title":"ARIMA models to predict next-day electricity prices","volume":"18","author":"Contreras Javier","year":"2003","unstructured":"Javier Contreras , Rosario Espinola , Francisco J Nogales , and Antonio J Conejo . 2003 . ARIMA models to predict next-day electricity prices . T-PWRS 18 , 3 (2003), 1014 -- 1020 . Javier Contreras, Rosario Espinola, Francisco J Nogales, and Antonio J Conejo. 2003. ARIMA models to predict next-day electricity prices. T-PWRS 18, 3 (2003), 1014--1020.","journal-title":"T-PWRS"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2035253.2035263"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Zijin Feng Tiantian Liu Huan Li Hua Lu Lidan Shou and Jianliang Xu. 2020. Indoor top-k keyword-aware routing query. In ICDE. 1213--1224.  Zijin Feng Tiantian Liu Huan Li Hua Lu Lidan Shou and Jianliang Xu. 2020. Indoor top-k keyword-aware routing query. In ICDE. 1213--1224.","DOI":"10.1109\/ICDE48307.2020.00109"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325942"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2726908.2726912"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1626536.1626538"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254850.1254864"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2009.23"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2872934"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236224"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2875096"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2799215"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304222.3304244"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi8030126"},{"key":"e_1_2_1_24_1","volume-title":"Hong Cheng, and Jianliang Xu.","author":"Liu Tiantian","year":"2020","unstructured":"Tiantian Liu , Zijin Feng , Huan Li , Hua Lu , Muhammad Aamir Cheema , Hong Cheng, and Jianliang Xu. 2020 . Shortest path queries for indoor venues with temporal variations. In ICDE. 2014--2017. Tiantian Liu, Zijin Feng, Huan Li, Hua Lu, Muhammad Aamir Cheema, Hong Cheng, and Jianliang Xu. 2020. Shortest path queries for indoor venues with temporal variations. In ICDE. 2014--2017."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457401"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.44"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Wenyi Luo Peiquan Jin and Lihua Yue. 2016. Time-constrained sequenced route query in indoor spaces. In APWeb. 129--140.  Wenyi Luo Peiquan Jin and Lihua Yue. 2016. Time-constrained sequenced route query in indoor spaces. In APWeb. 129--140.","DOI":"10.1007\/978-3-319-45814-4_11"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)E0349-G"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20438"},{"key":"e_1_2_1_30_1","volume-title":"Torben Bach Pedersen, and Xike Xie","author":"Shang Shuo","year":"2013","unstructured":"Shuo Shang , Hua Lu , Torben Bach Pedersen, and Xike Xie . 2013 . Finding traffic-aware fastest paths in spatial networks. In SSTD. 128--145. Shuo Shang, Hua Lu, Torben Bach Pedersen, and Xike Xie. 2013. Finding traffic-aware fastest paths in spatial networks. In SSTD. 128--145."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/computer_journal\/bxx107"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025115"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3018452"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978113"},{"key":"e_1_2_1_35_1","unstructured":"Mark R Virkler and Sathish Elayadath. 1994. Pedestrian speed-flow-density relationships. Number HS-042 012.  Mark R Virkler and Sathish Elayadath. 1994. Pedestrian speed-flow-density relationships. Number HS-042 012."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749456"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.04.139"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389718"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"e_1_2_1_41_1","unstructured":"Huanhuan Wu Yuzhen Huang James Cheng Jinfeng Li and Yiping Ke. 2016. Reachability and time-based path queries in temporal graphs. In ICDE. 145--156.  Huanhuan Wu Yuzhen Huang James Cheng Jinfeng Li and Yiping Ke. 2016. Reachability and time-based path queries in temporal graphs. In ICDE. 145--156."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544845"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2330834"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339491"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Yan Zhou Hong Chen Yueying Huang Yunxin Luo Yeting Zhang and Xiao Xie. 2018. An indoor route planning method with environment awareness. In IGARSS. 2906--2909.  Yan Zhou Hong Chen Yueying Huang Yunxin Luo Yeting Zhang and Xiao Xie. 2018. An indoor route planning method with environment awareness. In IGARSS. 2906--2909.","DOI":"10.1109\/IGARSS.2018.8518507"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3457390.3457401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:47:48Z","timestamp":1672224468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3457390.3457401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.14778\/3457390.3457401"],"URL":"https:\/\/doi.org\/10.14778\/3457390.3457401","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}