{"id":"https://openalex.org/W4285249829","doi":"https://doi.org/10.1109/lra.2022.3187270","title":"Multi-Objective Safe-Interval Path Planning With Dynamic Obstacles","display_name":"Multi-Objective Safe-Interval Path Planning With Dynamic Obstacles","publication_year":2022,"publication_date":"2022-06-30","ids":{"openalex":"https://openalex.org/W4285249829","doi":"https://doi.org/10.1109/lra.2022.3187270"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3187270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3187270","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570895","display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakumar Rathinam","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-9223-7456","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103257510","display_name":"Maxim Likhachev","orcid":"https://orcid.org/0000-0002-9539-2398"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Likhachev","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048906141","display_name":"Howie Choset","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howie Choset","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-5434-7945","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3585,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.90039962,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"8154","last_page":"8161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10142","display_name":"Formal Methods in Verification","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7277593016624451},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5904718041419983},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5696873664855957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.542667806148529},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5128762722015381},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4874765872955322},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4175177812576294},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.41005682945251465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3089408576488495},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24063429236412048},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1861710548400879},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.14601242542266846}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7277593016624451},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5904718041419983},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5696873664855957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.542667806148529},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5128762722015381},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4874765872955322},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4175177812576294},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.41005682945251465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3089408576488495},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24063429236412048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1861710548400879},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.14601242542266846},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2022.3187270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3187270","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6299999952316284}],"awards":[{"id":"https://openalex.org/G463718729","display_name":null,"funder_award_id":"2120219","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"},{"id":"https://openalex.org/G7688673482","display_name":null,"funder_award_id":"2120529","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"}],"funders":[{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1665845448","https://openalex.org/W1971648593","https://openalex.org/W1979426194","https://openalex.org/W1997188340","https://openalex.org/W2016049811","https://openalex.org/W2024694195","https://openalex.org/W2043293052","https://openalex.org/W2051956023","https://openalex.org/W2085041447","https://openalex.org/W2102660061","https://openalex.org/W2149079374","https://openalex.org/W2168424616","https://openalex.org/W2406067508","https://openalex.org/W2478031517","https://openalex.org/W2807637204","https://openalex.org/W2968120782","https://openalex.org/W3037164811","https://openalex.org/W3083743049","https://openalex.org/W3128804089","https://openalex.org/W3175643219","https://openalex.org/W3185306811","https://openalex.org/W3216907783","https://openalex.org/W4210773084","https://openalex.org/W4302557773","https://openalex.org/W4313148659","https://openalex.org/W6632662516","https://openalex.org/W6696584778"],"related_works":["https://openalex.org/W2794103424","https://openalex.org/W2394276631","https://openalex.org/W3216096898","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"],"abstract_inverted_index":{"Path":[0,23,89],"planning":[1],"among":[2],"dynamic":[3,65,94,130],"obstacles":[4,36,95],"is":[5,143],"a":[6,19,98],"fundamental":[7],"problem":[8,20],"in":[9,126],"Robotics":[10],"with":[11,25,154,158],"numerous":[12],"applications.":[13],"In":[14,101],"this":[15,102],"work,":[16,103],"we":[17,104],"investigate":[18],"called":[21,108],"Multi-Objective":[22],"Planning":[24],"Dynamic":[26],"Obstacles":[27],"(MOPPwDO),":[28],"which":[29],"requires":[30],"finding":[31],"collision-free":[32],"Pareto-optimal":[33,149],"paths":[34],"amid":[35],"moving":[37],"along":[38],"known":[39],"trajectories":[40],"while":[41],"simultaneously":[42],"optimizing":[43],"multiple":[44],"conflicting":[45],"objectives,":[46],"such":[47,86],"as":[48,87],"arrival":[49],"time,":[50],"communication":[51],"robustness":[52],"and":[53,67,132,151,160],"obstacle":[54],"clearance.":[55],"Most":[56],"of":[57,115,129,174],"the":[58,81,113,123,127,147,167,178],"existing":[59],"multi-objective":[60,136],"A*-like":[61],"planners":[62],"consider":[63],"no":[64],"obstacles,":[66,131],"naively":[68],"applying":[69],"them":[70],"to":[71,76,120,145,171],"address":[72],"MOPPwDO":[73],"can":[74,92],"lead":[75],"large":[77],"computation":[78],"times.":[79],"On":[80],"other":[82],"hand,":[83],"efficient":[84],"algorithms":[85],"Safe-Interval":[88],"Planing":[90],"(SIPP)":[91],"handle":[93],"but":[96],"for":[97],"single":[99],"objective.":[100],"develop":[105],"an":[106,172],"algorithm":[107],"MO-SIPP":[109,142,153,168],"by":[110],"leveraging":[111],"both":[112],"notion":[114],"safe":[116],"intervals":[117],"from":[118,135],"SIPP":[119],"efficiently":[121],"represent":[122],"search":[124,133],"space":[125],"presence":[128],"techniques":[134],"A*":[137],"algorithms.":[138],"We":[139],"show":[140,165],"that":[141,166],"guaranteed":[144],"find":[146],"entire":[148],"front,":[150],"verify":[152],"extensive":[155],"numerical":[156],"tests":[157],"two":[159],"three":[161],"objectives.":[162],"The":[163],"results":[164],"runs":[169],"up":[170],"order":[173],"magnitude":[175],"faster":[176],"than":[177],"conventional":[179],"alternates.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}