{"id":"https://openalex.org/W2045811332","doi":"https://doi.org/10.1109/icra.2014.6907486","title":"Reactive sampling-based temporal logic path planning","display_name":"Reactive sampling-based temporal logic path planning","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2045811332","doi":"https://doi.org/10.1109/icra.2014.6907486","mag":"2045811332"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2014.6907486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Robotics and Automation (ICRA)","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":"https://openalex.org/A5086654963","display_name":"Cristian-Ioan Vasile","orcid":"https://orcid.org/0000-0002-1132-1462"},"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":"Cristian Ioan Vasile","raw_affiliation_strings":["Division of Systems Engineering, Boston University, Boston, MA","Division of Systems Engineering, Boston University, Boston, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Systems Engineering, Boston University, Boston, MA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Division of Systems Engineering, Boston University, Boston, MA#TAB#","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":["Division of Systems Engineering, Boston University, Boston, MA","Division of Systems Engineering, Boston University, Boston, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Systems Engineering, Boston University, Boston, MA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Division of Systems Engineering, Boston University, Boston, MA#TAB#","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":1.4384,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.88043428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9976999759674072,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/temporal-logic","display_name":"Temporal logic","score":0.7232500910758972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7113247513771057},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.661575973033905},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5624675154685974},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5131154656410217},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.5012516975402832},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4854472279548645},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47712182998657227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40362265706062317},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32610732316970825},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3062710762023926},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17160430550575256}],"concepts":[{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.7232500910758972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7113247513771057},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.661575973033905},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5624675154685974},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5131154656410217},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.5012516975402832},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4854472279548645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47712182998657227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40362265706062317},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32610732316970825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3062710762023926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17160430550575256},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2014.6907486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:open.bu.edu:2144/29847","is_oa":false,"landing_page_url":"https://hdl.handle.net/2144/29847","pdf_url":null,"source":{"id":"https://openalex.org/S4306402384","display_name":"OpenBU (Boston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I111088046","host_organization_name":"Boston University","host_organization_lineage":["https://openalex.org/I111088046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1498432697","https://openalex.org/W1521785144","https://openalex.org/W1763528081","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W1991596047","https://openalex.org/W2000559735","https://openalex.org/W2027769154","https://openalex.org/W2052111476","https://openalex.org/W2055101460","https://openalex.org/W2055688322","https://openalex.org/W2073548775","https://openalex.org/W2082965709","https://openalex.org/W2089709927","https://openalex.org/W2104241562","https://openalex.org/W2116647221","https://openalex.org/W2128990851","https://openalex.org/W2142414682","https://openalex.org/W2163941698","https://openalex.org/W2165364079","https://openalex.org/W4285719527","https://openalex.org/W6650365267","https://openalex.org/W6657370125","https://openalex.org/W6671127643"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2031188261","https://openalex.org/W4232446061","https://openalex.org/W4285022830","https://openalex.org/W2020883449","https://openalex.org/W2077520193","https://openalex.org/W2032651852","https://openalex.org/W3205267199"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,24,29,36,48,53,59,88,94],"sampling-based":[3,82,104],"motion":[4],"planning":[5],"algorithm":[6,83,105],"that":[7,42,56,64,92,109,117],"combines":[8],"long-term":[9],"temporal":[10],"logic":[11],"goals":[12],"with":[13],"short-term":[14],"reactive":[15],"requirements.":[16],"The":[17],"mission":[18],"specification":[19,26,55,123],"has":[20],"two":[21,76],"parts:":[22],"(1)":[23],"global":[25,89,122],"given":[27],"as":[28],"Linear":[30],"Temporal":[31],"Logic":[32],"(LTL)":[33],"formula":[34],"over":[35],"set":[37,60],"of":[38,47,61,75,87,120,135,143],"static":[39],"service":[40,110],"requests":[41,63],"occur":[43],"at":[44],"the":[45,70,85,97,111,118,121,133,140,144],"regions":[46],"known":[49],"environment,":[50],"and":[51,100],"(2)":[52],"local":[54,112],"requires":[57],"servicing":[58],"dynamic":[62],"can":[65],"be":[66],"sensed":[67],"locally":[68],"during":[69],"execution.":[71],"Our":[72],"method":[73],"consists":[74],"main":[77],"ingredients:":[78],"(a)":[79],"an":[80,102],"off-line":[81],"for":[84],"construction":[86],"transition":[90],"system":[91],"contains":[93],"path":[95],"satisfying":[96],"LTL":[98],"formula,":[99],"(b)":[101],"on-line":[103,141],"to":[106],"generate":[107],"paths":[108],"requests,":[113],"while":[114],"making":[115],"sure":[116],"satisfaction":[119],"is":[124,138],"not":[125],"affected.":[126],"Building":[127],"on":[128,139],"our":[129],"previous":[130],"work":[131],"[1],":[132],"focus":[134],"this":[136],"paper":[137],"part":[142],"overall":[145],"method.":[146]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}