{"id":"https://openalex.org/W2793302323","doi":"https://doi.org/10.1109/lra.2018.2801467","title":"Optimal Scheduling for Resource-Constrained Multirobot Cooperative Localization","display_name":"Optimal Scheduling for Resource-Constrained Multirobot Cooperative Localization","publication_year":2018,"publication_date":"2018-02-02","ids":{"openalex":"https://openalex.org/W2793302323","doi":"https://doi.org/10.1109/lra.2018.2801467","mag":"2793302323"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2018.2801467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2018.2801467","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091560794","display_name":"Tsang-Kai Chang","orcid":"https://orcid.org/0000-0002-4272-6542"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tsang-Kai Chang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0002-4272-6542","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112712086","display_name":"Ankur Mehta","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur Mehta","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091560794"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":1.178,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.79610305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"3","first_page":"1552","last_page":"1559"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9987000226974487,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.729698896408081},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6859098076820374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6842533349990845},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6239297389984131},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.622701108455658},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5434539318084717},{"id":"https://openalex.org/keywords/covariance","display_name":"Covariance","score":0.5212700366973877},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.49717023968696594},{"id":"https://openalex.org/keywords/minimisation","display_name":"Minimisation (clinical trials)","score":0.4224978983402252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23284786939620972},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09520795941352844}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.729698896408081},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6859098076820374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6842533349990845},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6239297389984131},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.622701108455658},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5434539318084717},{"id":"https://openalex.org/C178650346","wikidata":"https://www.wikidata.org/wiki/Q201984","display_name":"Covariance","level":2,"score":0.5212700366973877},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.49717023968696594},{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.4224978983402252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23284786939620972},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09520795941352844},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2018.2801467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2018.2801467","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1605696759","https://openalex.org/W1964382258","https://openalex.org/W1971194975","https://openalex.org/W1972785301","https://openalex.org/W1994703549","https://openalex.org/W2011753154","https://openalex.org/W2012172283","https://openalex.org/W2109957651","https://openalex.org/W2130597504","https://openalex.org/W2135261995","https://openalex.org/W2138890480","https://openalex.org/W2144859729","https://openalex.org/W2164522996","https://openalex.org/W2410440994","https://openalex.org/W2514477377","https://openalex.org/W2613633893","https://openalex.org/W2962991637","https://openalex.org/W2990702135","https://openalex.org/W4234095850","https://openalex.org/W4241599172","https://openalex.org/W6725910412","https://openalex.org/W6771055092"],"related_works":["https://openalex.org/W2011109452","https://openalex.org/W2077098439","https://openalex.org/W3001177499","https://openalex.org/W2058883719","https://openalex.org/W2086614003","https://openalex.org/W2412912529","https://openalex.org/W2048794281","https://openalex.org/W4238468613","https://openalex.org/W2051185874","https://openalex.org/W2010213412"],"abstract_inverted_index":{"Typically,":[0],"localization":[1,30,58,124,151],"algorithms":[2],"focus":[3],"on":[4,145],"maximizing":[5],"estimation":[6],"accuracy,":[7],"often":[8],"while":[9],"neglecting":[10],"some":[11],"of":[12,16,28,52],"the":[13,33,44,50,66,81,87,92,105,114,120,123,127,136,143,178],"realworld":[14],"costs":[15],"achieving":[17],"such":[18],"performance.":[19,118],"In":[20,149],"this":[21],"letter,":[22],"we":[23,61,78,102,158],"formulate":[24],"optimal":[25,164],"scheduling":[26,70,165],"problems":[27,68],"multirobot":[29,57],"to":[31,47,64,85,109,141],"investigate":[32],"tradeoff":[34],"between":[35,122],"estimate":[36],"accuracy":[37,76],"and":[38,126],"its":[39],"corresponding":[40],"cost.":[41],"We":[42],"derive":[43],"continuous-time":[45],"approximation":[46],"explicitly":[48],"represent":[49],"rates":[51],"distinct":[53],"operations":[54],"in":[55,154],"a":[56,74,98,111,133,150,155],"scheme,":[59],"which":[60],"then":[62],"use":[63],"define":[65],"optimization":[67],"for":[69,97,113],"those":[71],"operations.":[72],"For":[73],"given":[75,99],"requirement,":[77],"can":[79,103,169,182],"solve":[80,104],"cost":[82,89,100,175],"minimization":[83,107],"problem":[84,108],"find":[86,110],"lowest":[88],"schedule":[90,112],"satisfying":[91],"prescribed":[93],"error":[94,117,125],"expectation;":[95],"similarly,":[96],"budget,":[101],"trace":[106,181,188],"best":[115],"achievable":[116],"While":[119],"interplay":[121],"operation":[128],"parameters":[129],"is":[130,139],"described":[131],"by":[132,161,172,185],"Riccati":[134],"equation,":[135],"Frechet":[137],"derivative":[138],"applied":[140],"shed":[142],"light":[144],"their":[146],"implicit":[147],"relationship.":[148],"example":[152],"grounded":[153],"realistic":[156],"setting,":[157],"show":[159],"that":[160],"solving":[162],"these":[163],"problems,":[166],"power":[167],"consumption":[168],"be":[170,183],"reduced":[171,184],"64%":[173],"through":[174,187],"minimization,":[176],"or":[177],"bounding":[179],"covariance":[180],"15%":[186],"minimization.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}