{"id":"https://openalex.org/W3033621224","doi":"https://doi.org/10.1177/0278364920918919","title":"Reactive sampling-based path planning with temporal logic specifications","display_name":"Reactive sampling-based path planning with temporal logic specifications","publication_year":2020,"publication_date":"2020-06-04","ids":{"openalex":"https://openalex.org/W3033621224","doi":"https://doi.org/10.1177/0278364920918919","mag":"3033621224"},"language":"en","primary_location":{"id":"doi:10.1177/0278364920918919","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364920918919","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5086654963","display_name":"Cristian-Ioan Vasile","orcid":"https://orcid.org/0000-0002-1132-1462"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cristian Ioan Vasile","raw_affiliation_strings":["Laboratory for Information and Decision Systems,Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1132-1462","affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems,Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100375290","display_name":"Xiao Li","orcid":"https://orcid.org/0000-0002-5518-5044"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Li","raw_affiliation_strings":["Department of Mechanical Engineering, Boston University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Calin Belta","raw_affiliation_strings":["Department of Mechanical Engineering, Boston University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086654963"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.7961,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.91393851,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"8","first_page":"1002","last_page":"1028"},"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/T10142","display_name":"Formal Methods in Verification","score":0.98580002784729,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.5981723666191101},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5761451721191406},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5671356320381165},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5473532676696777},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5327187776565552},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5319436192512512},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5166261792182922},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4913391172885895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4735768735408783},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3592216968536377},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3463648855686188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2134653925895691},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09542131423950195}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5981723666191101},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5761451721191406},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5671356320381165},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5473532676696777},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5327187776565552},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5319436192512512},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5166261792182922},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4913391172885895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4735768735408783},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3592216968536377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3463648855686188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2134653925895691},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09542131423950195},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364920918919","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364920918919","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G150725574","display_name":null,"funder_award_id":"MURI N000141010952","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G1940259160","display_name":null,"funder_award_id":"MURI N00014-09-1051","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4636813251","display_name":"NRI: Formal Methods for Motion Planning and Control with Human-in-the-Loop","funder_award_id":"1426907","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5125752015","display_name":"CPS: Medium: Collaborative Research: Efficient Control Synthesis and Learning in Distributed Cyber-Physical Systems","funder_award_id":"1035588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W47556920","https://openalex.org/W1424654272","https://openalex.org/W1498432697","https://openalex.org/W1521785144","https://openalex.org/W1564897360","https://openalex.org/W1742473997","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W1991596047","https://openalex.org/W2000359213","https://openalex.org/W2002201291","https://openalex.org/W2002675616","https://openalex.org/W2002893084","https://openalex.org/W2029253432","https://openalex.org/W2045811332","https://openalex.org/W2048563056","https://openalex.org/W2052111476","https://openalex.org/W2054145244","https://openalex.org/W2054585537","https://openalex.org/W2055101460","https://openalex.org/W2055688322","https://openalex.org/W2069522844","https://openalex.org/W2072127296","https://openalex.org/W2073548775","https://openalex.org/W2077245982","https://openalex.org/W2089003125","https://openalex.org/W2089709927","https://openalex.org/W2104241562","https://openalex.org/W2116647221","https://openalex.org/W2128990851","https://openalex.org/W2142577696","https://openalex.org/W2150335178","https://openalex.org/W2150500908","https://openalex.org/W2163941698","https://openalex.org/W2165216595","https://openalex.org/W2165364079","https://openalex.org/W2167185915","https://openalex.org/W2167458550","https://openalex.org/W2167805536","https://openalex.org/W2168992242","https://openalex.org/W2344321026","https://openalex.org/W2381901500","https://openalex.org/W2411429396","https://openalex.org/W2522043470","https://openalex.org/W2571161957","https://openalex.org/W2594675090","https://openalex.org/W2601040338","https://openalex.org/W2737479107","https://openalex.org/W2772485446","https://openalex.org/W2775497185","https://openalex.org/W2784743256","https://openalex.org/W2786893837","https://openalex.org/W2804655496","https://openalex.org/W2811294511","https://openalex.org/W2889786920","https://openalex.org/W2890208026","https://openalex.org/W2911097698","https://openalex.org/W2963117388","https://openalex.org/W2963566599","https://openalex.org/W2963889167","https://openalex.org/W3147673685","https://openalex.org/W4285719527","https://openalex.org/W4292408570","https://openalex.org/W4365800106"],"related_works":["https://openalex.org/W2058579816","https://openalex.org/W2099776859","https://openalex.org/W1031601050","https://openalex.org/W2560930356","https://openalex.org/W2931443989","https://openalex.org/W2013878945","https://openalex.org/W1546948343","https://openalex.org/W1572612329","https://openalex.org/W2103740034","https://openalex.org/W4285783524"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,24,29,36,48,53,59,90,96,148],"sampling-based":[3,84,106],"motion":[4],"planning":[5],"algorithm":[6,85,107,131,199],"that":[7,42,56,64,94,111,119,143,164],"combines":[8],"long-term":[9],"temporal":[10,31],"logic":[11,32],"goals":[12],"with":[13,156],"short-term":[14],"reactive":[15],"requirements.":[16],"The":[17,72,129,197],"mission":[18],"specification":[19,26,55,125,217],"has":[20,132,191],"two":[21,78],"parts:":[22],"(1)":[23],"global":[25,91,124,216],"given":[27],"as":[28],"linear":[30],"(LTL)":[33],"formula":[34],"over":[35],"set":[37,60],"of":[38,47,61,77,89,122,159,214,233],"static":[39],"service":[40,112],"requests":[41,63],"occur":[43],"at":[44,151,163],"the":[45,70,87,99,113,120,123,141,144,157,167,177,192,212,215,228,231,234],"regions":[46],"known":[49],"environment,":[50],"and":[51,102,205,224,230],"(2)":[52],"local":[54,114],"requires":[57],"servicing":[58,219],"dynamic":[62],"can":[65],"be":[66],"sensed":[67,221],"locally":[68,220],"during":[69],"execution.":[71],"proposed":[73],"computational":[74],"framework":[75,235],"consists":[76],"main":[79,134],"ingredients:":[80],"(a)":[81],"an":[82,104],"off-line":[83,130],"for":[86,146,176],"construction":[88],"transition":[92],"system":[93],"contains":[95],"path":[97,150],"satisfying":[98,149],"LTL":[100,203],"formula;":[101],"(b)":[103],"on-line":[105,198],"to":[108,208],"generate":[109],"paths":[110],"requests,":[115],"while":[116,218],"making":[117],"sure":[118],"satisfaction":[121,213],"is":[126,138,170,182],"not":[127],"affected.":[128],"four":[133],"features.":[135],"First,":[136],"it":[137,181,190],"incremental,":[139],"in":[140],"sense":[142],"procedure":[145],"finding":[147],"each":[152],"iteration":[153],"scales":[154],"only":[155],"number":[158],"new":[160],"samples":[161],"generated":[162],"iteration.":[165],"Second,":[166],"underlying":[168],"graph":[169],"sparse,":[171],"which":[172],"implies":[173],"low":[174],"complexity":[175,195],"overall":[178],"method.":[179],"Third,":[180],"probabilistically":[183],"complete.":[184],"Fourth,":[185],"under":[186],"some":[187],"mild":[188],"assumptions,":[189],"best":[193],"possible":[194],"bound.":[196],"leverages":[200],"ideas":[201],"from":[202],"monitoring":[204],"potential":[206],"functions":[207],"ensure":[209],"progress":[210],"towards":[211],"requests.":[222],"Examples":[223],"experimental":[225],"trials":[226],"illustrating":[227],"usefulness":[229],"performance":[232],"are":[236],"included.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}