{"id":"https://openalex.org/W3131097093","doi":"https://doi.org/10.1109/iros45743.2020.9340747","title":"Multi-Agent Path Planning Under Observation Schedule Constraints","display_name":"Multi-Agent Path Planning Under Observation Schedule Constraints","publication_year":2020,"publication_date":"2020-10-24","ids":{"openalex":"https://openalex.org/W3131097093","doi":"https://doi.org/10.1109/iros45743.2020.9340747","mag":"3131097093"},"language":"en","primary_location":{"id":"doi:10.1109/iros45743.2020.9340747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9340747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-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/A5103236198","display_name":"Ziqi Yang","orcid":"https://orcid.org/0000-0002-1364-9234"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ziqi Yang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031884953","display_name":"Roberto Tron","orcid":"https://orcid.org/0000-0002-6676-8595"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roberto Tron","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103236198"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2931,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.588862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"6990","last_page":"6997"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.998199999332428,"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.6953251361846924},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6767152547836304},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6722221970558167},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.662044882774353},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.637657880783081},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6319632530212402},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5960506200790405},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5430724620819092},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45850640535354614},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4342869818210602},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41361871361732483},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2643856406211853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14690178632736206}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953251361846924},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6767152547836304},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6722221970558167},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.662044882774353},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.637657880783081},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6319632530212402},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5960506200790405},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5430724620819092},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45850640535354614},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4342869818210602},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41361871361732483},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2643856406211853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14690178632736206},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros45743.2020.9340747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9340747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W177987302","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1551562380","https://openalex.org/W1966185282","https://openalex.org/W1996183429","https://openalex.org/W2012807278","https://openalex.org/W2044079487","https://openalex.org/W2053407718","https://openalex.org/W2112271657","https://openalex.org/W2136207702","https://openalex.org/W2142224528","https://openalex.org/W2158334497","https://openalex.org/W2164278908","https://openalex.org/W2251608823","https://openalex.org/W2520459424","https://openalex.org/W2522978412","https://openalex.org/W2735610391","https://openalex.org/W2898899222","https://openalex.org/W2950295088","https://openalex.org/W2962853966","https://openalex.org/W2978125157","https://openalex.org/W6607293951","https://openalex.org/W6683633988","https://openalex.org/W6684379799","https://openalex.org/W6926394813"],"related_works":["https://openalex.org/W3204184292","https://openalex.org/W3176564347","https://openalex.org/W1985458517","https://openalex.org/W2355833770","https://openalex.org/W3031039437","https://openalex.org/W804484174","https://openalex.org/W1568779110","https://openalex.org/W3095877357","https://openalex.org/W183202219","https://openalex.org/W4386821099"],"abstract_inverted_index":{"We":[0,24,192],"consider":[1],"the":[2,22,33,38,45,55,59,85,111,159],"problem":[3],"of":[4,7,16,37,48,54,72,132,163,169,179],"enhanced":[5],"security":[6],"multi-robot":[8],"systems":[9],"to":[10,40,78,127,174],"prevent":[11],"cyber-attackers":[12],"from":[13,84],"taking":[14,103],"control":[15],"one":[17],"or":[18],"more":[19,115],"robots":[20,39,80],"in":[21,137],"group.":[23,56],"build":[25],"upon":[26],"a":[27,70,93,155],"recently":[28],"proposed":[29,60,195],"solution":[30,61],"that":[31,95,118],"utilizes":[32],"physical":[34],"measurement":[35],"capabilities":[36],"perform":[41],"introspection,":[42],"i.e.,":[43],"detect":[44,79],"malicious":[46],"actions":[47],"compromised":[49],"agents":[50],"using":[51],"other":[52],"members":[53],"In":[57,88,109],"particular,":[58],"finds":[62],"multi-agent":[63,198],"paths":[64],"on":[65,97,158,197],"discrete":[66],"spaces":[67,100],"combined":[68],"with":[69,81,201],"set":[71],"mutual":[73],"observations":[74],"at":[75],"specific":[76],"locations":[77],"significant":[82],"deviations":[83],"preordained":[86],"routes.":[87],"this":[89,138],"paper,":[90],"we":[91,153],"develop":[92],"planner":[94,112],"works":[96],"continuous":[98],"configuration":[99],"while":[101],"also":[102],"into":[104],"account":[105],"similar":[106],"spatio-temporal":[107],"constraints.":[108,209],"addition,":[110],"allows":[113,188],"for":[114,189],"general":[116],"tasks":[117],"can":[119],"be":[120,128],"formulated":[121],"as":[122],"arbitrary":[123],"smooth":[124],"cost":[125,203],"functions":[126],"specified.":[129],"The":[130],"combination":[131],"constraints":[133],"and":[134,181,184,187,206],"objectives":[135,180],"considered":[136],"paper":[139],"are":[140],"not":[141],"easily":[142],"handled":[143],"by":[144],"popular":[145],"path":[146],"planning":[147],"algorithms":[148],"(e.g.,":[149],"sampling-based":[150],"methods),":[151],"thus":[152],"propose":[154],"method":[156,196],"based":[157],"Alternating":[160],"Direction":[161],"Method":[162],"Multipliers":[164],"(ADMM).":[165],"ADMM":[166],"is":[167],"capable":[168],"finding":[170],"locally":[171],"optimal":[172],"solutions":[173],"problems":[175],"involving":[176],"different":[177],"kinds":[178],"non-convex":[182],"temporal":[183],"spatial":[185],"constraints,":[186],"infeasible":[190],"initialization.":[191],"benchmark":[193],"our":[194],"map":[199],"exploration":[200],"minimum-uncertainty":[202],"function,":[204],"obstacles,":[205],"observation":[207],"schedule":[208]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}