{"id":"https://openalex.org/W2949788225","doi":"https://doi.org/10.1109/lra.2019.2921695","title":"Multirobot Charging Strategies: A Game-Theoretic Approach","display_name":"Multirobot Charging Strategies: A Game-Theoretic Approach","publication_year":2019,"publication_date":"2019-06-07","ids":{"openalex":"https://openalex.org/W2949788225","doi":"https://doi.org/10.1109/lra.2019.2921695","mag":"2949788225"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2019.2921695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2921695","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/A5036452417","display_name":"Tianshuang Gao","orcid":"https://orcid.org/0000-0001-7330-3510"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tianshuang Gao","raw_affiliation_strings":["Department Computer Science, Iowa State University, Ames, IA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7330-3510","affiliations":[{"raw_affiliation_string":"Department Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021207606","display_name":"Sourabh Bhattacharya","orcid":"https://orcid.org/0000-0002-1306-2775"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sourabh Bhattacharya","raw_affiliation_strings":["Department of Mechanical Engineering, and the Department of Computer Science, Iowa State University, Ames, IA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1306-2775","affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, and the Department of Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036452417"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.4857,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.84002534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"3","first_page":"2823","last_page":"2830"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.5306189060211182},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4997401237487793},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.4315217137336731},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.2645106613636017}],"concepts":[{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.5306189060211182},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4997401237487793},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4315217137336731},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.2645106613636017}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2019.2921695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2019.2921695","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":35,"referenced_works":["https://openalex.org/W139181863","https://openalex.org/W250249669","https://openalex.org/W1532778915","https://openalex.org/W1728210526","https://openalex.org/W1765448048","https://openalex.org/W1792558277","https://openalex.org/W1972221945","https://openalex.org/W1980392184","https://openalex.org/W1987474585","https://openalex.org/W1989343205","https://openalex.org/W2009709627","https://openalex.org/W2035713243","https://openalex.org/W2037605628","https://openalex.org/W2054065841","https://openalex.org/W2060470081","https://openalex.org/W2077787105","https://openalex.org/W2083960593","https://openalex.org/W2108249123","https://openalex.org/W2128525534","https://openalex.org/W2136096971","https://openalex.org/W2140929789","https://openalex.org/W2163639028","https://openalex.org/W2171081201","https://openalex.org/W2413541697","https://openalex.org/W2553734032","https://openalex.org/W2623293810","https://openalex.org/W2808867072","https://openalex.org/W2891230768","https://openalex.org/W2909067415","https://openalex.org/W2964246603","https://openalex.org/W4232907677","https://openalex.org/W4241944903","https://openalex.org/W4297563113","https://openalex.org/W4297904670","https://openalex.org/W6637892682"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"This":[0],"letter":[1],"considers":[2],"the":[3,16,24,31,39,52,58,67,78,98,102,110,113,117],"problem":[4,33,41],"of":[5,57,69,71,77,80,112],"assigning":[6],"multiple":[7],"robots":[8,22,81],"to":[9,14,50,93],"charging":[10,25,40,91,103,118],"stations":[11,92,104,119],"in":[12],"order":[13],"minimize":[15],"total":[17,99],"time":[18],"required":[19],"by":[20],"all":[21],"for":[23,96,116],"operation.":[26],"We":[27,46,65],"first":[28],"show":[29,62],"that":[30],"centralized":[32],"is":[34],"NP-hard.":[35],"Then,":[36],"we":[37,85,108],"formulate":[38],"as":[42,74],"a":[43,75],"non-cooperative":[44,59],"game.":[45],"propose":[47,94],"an":[48],"algorithm":[49],"obtain":[51],"pure":[53],"strategy":[54],"Nash":[55],"equilibrium":[56,73],"game,":[60],"and":[61,82],"its":[63],"uniqueness.":[64],"investigate":[66],"price":[68],"anarchy":[70],"this":[72],"function":[76],"number":[79],"stations.":[83],"Next,":[84],"leverage":[86],"our":[87],"analysis":[88],"on":[89],"static":[90],"strategies":[95,114],"reducing":[97],"cost":[100],"when":[101],"are":[105],"mobile.":[106],"Finally,":[107],"analyze":[109],"performance":[111],"proposed":[115],"through":[120],"extensive":[121],"simulation.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}