{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:11Z","timestamp":1750221071800,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T00:00:00Z","timestamp":1536537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2018,12,31]]},"abstract":"<jats:p>Nowadays, people can access location-based services (LBSs) as a group via mobile devices to plan their daily activities with friends and relatives. In this article, we introduce an important class of group-oriented LBSs, group optimal accessible location (GOAL) queries that enable users to identify the location of a point of interest (POI) that has the minimum total distance to a given set of paths. GOAL queries have many applications, such as the selection of an optimal location for group meet-ups or for a mobile facility such as a food truck. In a GOAL query, each trip or path is represented as a set of line segments, and the distance of a POI from a path is computed as the minimum distance of the POI to any line segment of the path. We develop an efficient approach to evaluate GOAL queries. The novelty of our GOAL query processing algorithm in contrast to other spatial query processing algorithms is the reformulation of a GOAL query by considering only a subset of path segments from the given set of paths, which is also the key factor behind the efficiency of our proposed algorithm. We exploit geometric properties and develop pruning techniques to eliminate both POIs and path segments that cannot provide the optimal solution for a GOAL query. Our experimental results demonstrate that we provide a readily deployable solution for real-life applications.<\/jats:p>","DOI":"10.1145\/3239124","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:11:14Z","timestamp":1536581474000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of the Optimal Accessible Location for a Group of Mobile Agents"],"prefix":"10.1145","volume":"4","author":[{"given":"A. K. M. Mustafizur Rahman","family":"Khan","sequence":"first","affiliation":[{"name":"University of Melbourne,VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kulik","sequence":"additional","affiliation":[{"name":"University of Melbourne,VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egemen","family":"Tanin","sequence":"additional","affiliation":[{"name":"University of Melbourne,VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Hua","sequence":"additional","affiliation":[{"name":"University of Melbourne,VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanzima","family":"Hashem","sequence":"additional","affiliation":[{"name":"Bangladesh University of Engineering and Technology, Dhaka, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,9,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/1940062"},{"key":"e_1_2_1_2_1","unstructured":"Sergio Cabello Jos\u00e9 Miguel D\u00edaz-B\u00e1\u00f1ez Stefan Langerman Carlos Seara and Inmaculada Ventura. 2006. Reverse Facility Location Problems. University of Ljubljana Institute of Mathematics Physics and Mechanics Department of Mathematics.  Sergio Cabello Jos\u00e9 Miguel D\u00edaz-B\u00e1\u00f1ez Stefan Langerman Carlos Seara and Inmaculada Ventura. 2006. Reverse Facility Location Problems. University of Ljubljana Institute of Mathematics Physics and Mechanics Department of Mathematics."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007636"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-004-5621-7"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_10"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-011-0149-0"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.81"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806433"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40235-7_15"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739100"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Erik G. Hoel and Hanan Samet. 1991. Efficient processing of spatial queries in line segment databases. In Advances in Spatial Databases. Springer 235--256.   Erik G. Hoel and Hanan Samet. 1991. Efficient processing of spatial queries in line segment databases. In Advances in Spatial Databases. Springer 235--256.","DOI":"10.1007\/3-540-54414-3_41"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130316"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.174"},{"volume-title":"Geographic Information Science","author":"Mustafizur Rahman Khan A. K. M.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820862"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.41"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1997251.1997258"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1890\/0012-9658(2002)083[2248:ESORWD]2.0.CO;2"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85654-2_60"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1006"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"A. F. O\u2019Connell J. D. Nichols and K. U. Karanth. 2010. Camera Traps in Animal Ecology. Springer Science 8 Business Media.  A. F. O\u2019Connell J. D. Nichols and K. U. Karanth. 2010. Camera Traps in Animal Ecology. Springer Science 8 Business Media.","DOI":"10.1007\/978-4-431-99495-4"},{"volume-title":"Proceedings of the ICDE. 301--312","author":"Papadias D.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0223-7"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/282957.282966"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2093999"},{"volume-title":"Proceedings of the VLDB. VLDB Endowment, 790--801","year":"2003","author":"Tao Yufei","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687754"},{"volume-title":"Proceedings of the VLDB. VLDB Endowment, 946--957","year":"2005","author":"Xia Tian","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.87"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"},{"volume-title":"Proceedings of the VLDB. VLDB Endowment, 643--654","year":"2006","author":"Zhang Donghui","key":"e_1_2_1_35_1"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3239124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3239124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:24Z","timestamp":1750208244000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3239124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,10]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3239124"],"URL":"https:\/\/doi.org\/10.1145\/3239124","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2018,9,10]]},"assertion":[{"value":"2016-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}