{"id":"https://openalex.org/W4405785803","doi":"https://doi.org/10.1109/iros58592.2024.10801558","title":"Multi-Robot Path Planning With Boolean Specification Tasks Under Motion Uncertainties","display_name":"Multi-Robot Path Planning With Boolean Specification Tasks Under Motion Uncertainties","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405785803","doi":"https://doi.org/10.1109/iros58592.2024.10801558"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10801558","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5100389510","display_name":"Zhenyu Zhang","orcid":"https://orcid.org/0000-0001-8985-7083"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhe Zhang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101655522","display_name":"Zhou He","orcid":"https://orcid.org/0000-0003-2486-1246"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou He","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009780160","display_name":"Ning Ran","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ning Ran","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040487816","display_name":"Michel Reniers","orcid":"https://orcid.org/0000-0002-9283-4074"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Reniers","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100389510"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2624,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58124416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3433","last_page":"3438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996399998664856,"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":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8156999349594116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.683739423751831},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6514635682106018},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6070536375045776},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5844298601150513},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3294937014579773},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09262272715568542}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8156999349594116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.683739423751831},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6514635682106018},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6070536375045776},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5844298601150513},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3294937014579773},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09262272715568542}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10801558","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10801558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2153583758","https://openalex.org/W2624912704","https://openalex.org/W2762698157","https://openalex.org/W2766927510","https://openalex.org/W2933496093","https://openalex.org/W2942307437","https://openalex.org/W2963117388","https://openalex.org/W3031766643","https://openalex.org/W3094045509","https://openalex.org/W3108081931","https://openalex.org/W3181923028","https://openalex.org/W4206742989","https://openalex.org/W4220878860","https://openalex.org/W4221021751","https://openalex.org/W4226019470","https://openalex.org/W4379780965","https://openalex.org/W4381681017","https://openalex.org/W4393196842"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W2134215012"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,41,55,77,84,116,121,134],"path":[4],"planning":[5],"problem":[6],"of":[7,40,127,139],"multi-robot":[8,42],"systems":[9],"under":[10],"motion":[11],"uncertainties":[12],"with":[13],"high-level":[14],"tasks":[15],"that":[16,105],"are":[17,130],"expressed":[18],"as":[19],"Boolean":[20],"specifications.":[21],"The":[22],"specification":[23],"imposes":[24],"logical":[25],"constraints":[26],"on":[27],"robot":[28],"trajectories":[29],"and":[30,82,93,137],"final":[31],"states.":[32],"First,":[33],"a":[34,64,99,125],"global":[35,85,122],"Markov":[36,66,86],"decision":[37,67,87],"process":[38,68,88],"model":[39],"system":[43],"is":[44],"constructed":[45],"to":[46,53,75,119,132],"provide":[47],"its":[48],"current":[49],"state.":[50],"In":[51],"order":[52],"tackle":[54],"state":[56],"explosion":[57],"problem,":[58],"at":[59],"each":[60],"stage,":[61],"we":[62,97],"construct":[63],"local":[65,78],"for":[69,109],"every":[70],"individual":[71],"agent":[72],"in":[73],"sequence":[74],"compute":[76,91],"optimal":[79],"movement":[80],"strategy":[81],"update":[83,94],"accordingly":[89],"(i.e.,":[90],"locally":[92],"globally).":[95],"Next,":[96],"propose":[98],"heuristic":[100],"reward":[101],"function":[102],"design":[103],"method":[104],"provides":[106],"different":[107,111],"rewards":[108],"visiting":[110],"task":[112],"points":[113],"by":[114],"introducing":[115],"estimated":[117],"distance":[118],"complete":[120],"task.":[123],"Finally,":[124],"series":[126],"numerical":[128],"experiments":[129],"conducted":[131],"demonstrate":[133],"computational":[135],"efficiency":[136],"scalability":[138],"our":[140],"developed":[141],"approach.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}