{"id":"https://openalex.org/W4416748184","doi":"https://doi.org/10.1109/iros60139.2025.11245891","title":"Multi-Robot Ergodic Trajectory Optimization with Relaxed Periodic Connectivity","display_name":"Multi-Robot Ergodic Trajectory Optimization with Relaxed Periodic Connectivity","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416748184","doi":"https://doi.org/10.1109/iros60139.2025.11245891"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11245891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11245891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Yongce Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongce Liu","raw_affiliation_strings":["Shanghai Jiao Tong University,Shanghai,China,200240"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Shanghai,China,200240","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Shanghai Jiao Tong University,Shanghai,China,200240"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Shanghai,China,200240","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8652","last_page":"8659"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.45750001072883606,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.45750001072883606,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.24210000038146973,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11133","display_name":"UAV Applications and Optimization","score":0.16899999976158142,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.8910999894142151},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6517999768257141},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4372999966144562},{"id":"https://openalex.org/keywords/stationary-ergodic-process","display_name":"Stationary ergodic process","score":0.4203000068664551},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.4129999876022339},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.39910000562667847}],"concepts":[{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.8910999894142151},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6517999768257141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.524399995803833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5031999945640564},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C151424130","wikidata":"https://www.wikidata.org/wiki/Q17123911","display_name":"Stationary ergodic process","level":4,"score":0.4203000068664551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4171000123023987},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.38519999384880066},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.33399999141693115},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11245891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11245891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309612","display_name":"Natural Science Foundation of Shanghai","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1979426194","https://openalex.org/W2003808711","https://openalex.org/W2026508670","https://openalex.org/W2044079487","https://openalex.org/W2066005785","https://openalex.org/W2070842753","https://openalex.org/W2083245347","https://openalex.org/W2089344586","https://openalex.org/W2108556117","https://openalex.org/W2133099834","https://openalex.org/W2167046788","https://openalex.org/W2396783599","https://openalex.org/W2554009248","https://openalex.org/W2600080636","https://openalex.org/W2758653969","https://openalex.org/W2782792473","https://openalex.org/W2800330536","https://openalex.org/W2807778117","https://openalex.org/W2808371702","https://openalex.org/W2913190903","https://openalex.org/W2962807522","https://openalex.org/W2964664157","https://openalex.org/W3178285930","https://openalex.org/W4280571816","https://openalex.org/W4285102165","https://openalex.org/W4293775970","https://openalex.org/W4381416043","https://openalex.org/W4401416499","https://openalex.org/W4401417418","https://openalex.org/W4402300055","https://openalex.org/W4403225996","https://openalex.org/W4414050424"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1,73,124],"considers":[2,61],"a":[3,23,75,87,138],"multi-robot":[4,82],"trajectory":[5,140],"planning":[6,141],"problem":[7],"with":[8,99],"inter-robot":[9],"connectivity":[10,69,83,115,128,159],"maintenance":[11,84,129,160],"for":[12],"information":[13,17,46],"gathering.":[14],"Given":[15],"an":[16,126],"map":[18],"in":[19,37,47,175],"the":[20,26,34,43,62,104,117,121,132,144,157,173,178],"form":[21],"of":[22,45,177],"distribution":[24],"over":[25],"workspace,":[27],"ergodic":[28,58,100,109,133,179],"search":[29,59,101,134],"plans":[30,164],"trajectories,":[31],"along":[32],"which,":[33],"time":[35],"spent":[36],"any":[38],"region":[39],"is":[40],"proportional":[41],"to":[42,77,113,131],"amount":[44],"that":[48,155,166],"region,":[49],"and":[50,55,71,136,150],"can":[51],"balance":[52],"between":[53],"exploration":[54],"exploitation.":[56],"Existing":[57],"rarely":[60],"limited":[63],"communication":[64],"range":[65],"among":[66,116],"robots":[67],"or":[68,111],"maintenance,":[70],"this":[72,79,123],"takes":[74],"step":[76],"fill":[78],"gap.":[80],"Besides,":[81],"was":[85],"studied":[86],"lot,":[88],"including":[89],"continual,":[90],"periodic,":[91],"intermittent":[92,127],"connectivity,":[93],"etc.":[94],"Naively":[95],"combining":[96],"these":[97],"methods":[98],"may":[102],"prevent":[103],"planner":[105],"from":[106],"finding":[107],"high-quality":[108],"trajectories":[110,165],"lead":[112],"poor":[114],"robots.":[118],"To":[119],"handle":[120],"challenge,":[122],"adapts":[125],"strategy":[130],"framework,":[135],"develops":[137],"two-phase":[139],"approach":[142,163],"utilizing":[143],"augmented":[145],"Lagrangian":[146],"method.":[147],"Our":[148],"simulation":[149],"real":[151],"drone":[152],"experiments":[153],"show":[154],"under":[156],"same":[158],"requirement,":[161],"our":[162],"are":[167],"about":[168],"10":[169],"times":[170],"better":[171],"than":[172],"baselines":[174],"terms":[176],"metric.":[180]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-11-28T00:00:00"}