{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:10:01Z","timestamp":1755861001315,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T00:00:00Z","timestamp":1730160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112390132"],"award-info":[{"award-number":["HR00112390132"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,29]]},"DOI":"10.1145\/3678717.3691224","type":"proceedings-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T06:29:21Z","timestamp":1732256961000},"page":"493-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7024-2476","authenticated-orcid":false,"given":"Fandel","family":"Lin","sequence":"first","affiliation":[{"name":"USC Information Sciences Institute, Marina del Rey, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5265-7659","authenticated-orcid":false,"given":"Han","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8536-3642","authenticated-orcid":false,"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6371-4807","authenticated-orcid":false,"given":"Craig A.","family":"Knoblock","sequence":"additional","affiliation":[{"name":"USC Information Sciences Institute, Marina del Rey, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-017-0437-4"},{"volume-title":"Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, 299--308","author":"Daniel","key":"e_1_3_2_1_2_1","unstructured":"Daniel Ayala et al. 2011. Parking slot assignment games. In Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, 299--308."},{"key":"e_1_3_2_1_3_1","unstructured":"Holger Bast et al. 2006. Transit ultrafast shortest-path queries with linear-time preprocessing. 9th DIMACS Implementation Challenge."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3362693"},{"volume-title":"(SIGSPATIAL '19)","author":"Kevin","key":"e_1_3_2_1_5_1","unstructured":"Kevin Buchin et al. 2019. A sampling-based strategy for distributing taxis in a road network for occupancy maximization (gis cup). In (SIGSPATIAL '19). Association for Computing Machinery, 616--619."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Jingwei Chen et al. 2017. Front-to-end bidirectional heuristic search with near-optimal node expansions. arXiv preprint arXiv:1703.03868.","DOI":"10.24963\/ijcai.2017\/69"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21965"},{"volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 308--322","author":"Jie-Yu","key":"e_1_3_2_1_8_1","unstructured":"Jie-Yu Fang et al. 2020. A multi-criteria system for recommending taxi routes with an advance reservation. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 308--322."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-016-9579-8"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Efficient metaheuristics for the mixed team orienteering problem with time windows","volume":"9","author":"Damianos Gavalas","year":"2016","unstructured":"Damianos Gavalas et al. 2016. Efficient metaheuristics for the mixed team orienteering problem with time windows. Algorithms, 9, 1, 6.","journal-title":"Algorithms"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","volume":"31","author":"Boris","unstructured":"Boris Goldin et al. 2021. Approximate bi-criteria search by efficient representation of subsets of the pareto-optimal frontier. In Proceedings of the International Conference on Automated Planning and Scheduling. Vol. 31, 149--158."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Peter E Hart et al. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4 2 100--107.","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3034800"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2016.09.012"},{"volume-title":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems, 163--174","author":"Fandel","key":"e_1_3_2_1_15_1","unstructured":"Fandel Lin et al. 2021. Conntrans: a two-stage concentric annealing approach for multi-criteria distributed competitive stationary resource searching. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems, 163--174."},{"volume-title":"Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL '23)","author":"Fandel","key":"e_1_3_2_1_16_1","unstructured":"Fandel Lin et al. 2023. Indirect cooperation in distributed stationary-resource searching with predefined destinations. In Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL '23) Article 26, 1--12."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3390\/en12071385"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.05.014"},{"volume-title":"Proceedings of the 13th international conference on intelligent systems application to power systems. IEEE, 84--91","author":"Patrick","key":"e_1_3_2_1_19_1","unstructured":"Patrick Ngatchou et al. 2005. Pareto multi objective optimization. In Proceedings of the 13th international conference on intelligent systems application to power systems. IEEE, 84--91."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.08.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2013.0490"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21856"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","volume":"30","author":"Hern\u00e1ndez Carlos","unstructured":"Carlos Hern\u00e1ndez Ulloa et al. 2020. A simple and fast bi-objective search algorithm. In Proceedings of the International Conference on Automated Planning and Scheduling. Vol. 30, 143--151."},{"key":"e_1_3_2_1_24_1","volume-title":"Journal of Physics: Conference Series number 1.","volume":"1626","author":"Heqing","unstructured":"Heqing Xu et al. 2020. Development and research status of road cleaning vehicle. In Journal of Physics: Conference Series number 1. Vol. 1626. IOP Publishing, 012153."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling, 32","author":"Han","year":"1982","unstructured":"Han Zhang et al. 2022. A*pex: efficient approximate multi-objective search on graphs. Proceedings of the International Conference on Automated Planning and Scheduling, 32, 1, 394--403. https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/19825."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2022.104699"},{"volume-title":"ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2235--2239","author":"Qing-Long","key":"e_1_3_2_1_27_1","unstructured":"Qing-Long Zhang et al. 2021. Sa-net: shuffle attention for deep convolutional neural networks. In ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2235--2239."},{"volume-title":"Proceedings of the Web Conference 2021","author":"Weijia","key":"e_1_3_2_1_28_1","unstructured":"Weijia Zhang et al. 2021. Intelligent electric vehicle charging recommendation based on multi-agent reinforcement learning. In Proceedings of the Web Conference 2021, 1856--1867."}],"event":{"name":"SIGSPATIAL '24: The 32nd ACM International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Atlanta GA USA","acronym":"SIGSPATIAL '24"},"container-title":["Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691224","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3678717.3691224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:39:09Z","timestamp":1755859149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,29]]},"references-count":28,"alternative-id":["10.1145\/3678717.3691224","10.1145\/3678717"],"URL":"https:\/\/doi.org\/10.1145\/3678717.3691224","relation":{},"subject":[],"published":{"date-parts":[[2024,10,29]]},"assertion":[{"value":"2024-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}