{"id":"https://openalex.org/W4404612130","doi":"https://doi.org/10.1145/3678717.3691224","title":"An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives","display_name":"An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives","publication_year":2024,"publication_date":"2024-10-29","ids":{"openalex":"https://openalex.org/W4404612130","doi":"https://doi.org/10.1145/3678717.3691224"},"language":"en","primary_location":{"id":"doi:10.1145/3678717.3691224","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3678717.3691224","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3678717.3691224","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003205350","display_name":"Fandel Lin","orcid":"https://orcid.org/0000-0001-7024-2476"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fandel Lin","raw_affiliation_strings":["USC Information Sciences Institute, Marina del Rey, CA"],"affiliations":[{"raw_affiliation_string":"USC Information Sciences Institute, Marina del Rey, CA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103079514","display_name":"Han Zhang","orcid":"https://orcid.org/0000-0002-5265-7659"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Han Zhang","raw_affiliation_strings":["University of Southern California, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061665608","display_name":"T. K. Satish Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. K. Satish Kumar","raw_affiliation_strings":["University of Southern California, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089542402","display_name":"Craig A. Knoblock","orcid":"https://orcid.org/0000-0002-6371-4807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Craig A. Knoblock","raw_affiliation_strings":["USC Information Sciences Institute, Marina del Rey, CA"],"affiliations":[{"raw_affiliation_string":"USC Information Sciences Institute, Marina del Rey, CA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003205350"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29764142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"493","last_page":"496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6601577997207642},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6275177597999573},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5278981328010559},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4930729568004608},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4681228697299957},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.4656098186969757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3920842707157135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18591323494911194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16531527042388916},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10591742396354675},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.06650981307029724}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6601577997207642},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6275177597999573},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5278981328010559},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4930729568004608},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4681228697299957},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.4656098186969757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3920842707157135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18591323494911194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16531527042388916},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10591742396354675},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.06650981307029724},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3678717.3691224","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3678717.3691224","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3678717.3691224","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3678717.3691224","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4329909706","display_name":null,"funder_award_id":"HR00112390132","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2070349606","https://openalex.org/W2094764575","https://openalex.org/W2225877659","https://openalex.org/W2411650265","https://openalex.org/W2530993208","https://openalex.org/W2586457066","https://openalex.org/W2604948093","https://openalex.org/W2614653677","https://openalex.org/W2886614777","https://openalex.org/W2898326944","https://openalex.org/W2912632897","https://openalex.org/W2913624076","https://openalex.org/W2913683976","https://openalex.org/W2994987435","https://openalex.org/W3040363661","https://openalex.org/W3095315965","https://openalex.org/W4213069590","https://openalex.org/W4311469613"],"related_works":["https://openalex.org/W2128410848","https://openalex.org/W2118368532","https://openalex.org/W2102390841","https://openalex.org/W3047653192","https://openalex.org/W2096289371","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2946406471","https://openalex.org/W2130555437"],"abstract_inverted_index":{"Road":[0],"inspection":[1,70,140],"and":[2,22,71,83,96,135,143,155,170],"cleaning":[3],"are":[4],"crucial":[5],"to":[6,35,55,60,121],"securing":[7],"driving":[8],"safety.":[9],"Deploying":[10],"a":[11,18,41,56,62,157,181],"fleet":[12],"of":[13,68,76,103,128],"robots":[14,37,48,169],"that":[15,185],"run":[16],"through":[17,40],"city":[19],"can":[20,87],"inspect":[21,61],"clean":[23],"pavements":[24],"without":[25],"causing":[26],"road":[27,42,58,114,123,139,166],"closure.":[28],"To":[29],"achieve":[30],"high":[31],"coverage,":[32],"one":[33,53,201],"has":[34],"prevent":[36],"from":[38],"going":[39],"segment":[43,59],"more":[44,51],"than":[45,52],"once.":[46],"However,":[47],"may":[49],"need":[50],"visit":[54],"particular":[57,122],"defect.":[63],"The":[64,109],"uncertain":[65,130],"success":[66],"rate":[67],"defect":[69,126,177],"the":[72,79,101,165,172,189],"unknown":[73],"maximum":[74,113],"number":[75],"defects":[77],"hinder":[78],"efficacy.":[80],"Such":[81],"uncertainty":[82],"constraints":[84],"in":[85,91],"objectives":[86],"also":[88],"be":[89],"seen":[90],"security":[92,147],"patrolling,":[93],"trip":[94],"planning,":[95],"network":[97,115],"maintenance.":[98],"We":[99,149],"target":[100],"problem":[102],"multi-agent":[104],"scheduling":[105,110],"with":[106],"bounded":[107],"objectives.":[108],"aims":[111],"for":[112,125],"coverage":[116,167],"while":[117],"ensuring":[118],"sufficient":[119],"visits":[120],"segments":[124],"identification":[127],"an":[129,151],"subject,":[131],"such":[132],"as":[133],"potholes":[134],"faded":[136],"markings":[137],"during":[138,146],"or":[141],"crimes":[142],"parking":[144],"violations":[145],"patrolling.":[148],"leverage":[150],"approximate":[152],"bi-objective":[153],"algorithm":[154],"propose":[156],"hierarchical":[158],"circular":[159],"route-planning":[160],"algorithm.":[161],"Our":[162],"approach":[163,187],"maximizes":[164],"among":[168,192],"decreases":[171],"search":[173],"space":[174],"when":[175],"maximizing":[176],"identification.":[178],"Evaluation":[179],"on":[180],"real-world":[182],"dataset":[183],"shows":[184],"our":[186],"achieves":[188],"Pareto":[190],"optimal":[191],"comparative":[193],"methods,":[194],"outperforming":[195],"existing":[196],"methods":[197],"by":[198],"at":[199],"least":[200],"optimization":[202],"objective.":[203]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}