{"id":"https://openalex.org/W1993546951","doi":"https://doi.org/10.1109/iros.2012.6385726","title":"Path planning with probabilistic roadmaps and co-safe linear temporal logic","display_name":"Path planning with probabilistic roadmaps and co-safe linear temporal logic","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W1993546951","doi":"https://doi.org/10.1109/iros.2012.6385726","mag":"1993546951"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2012.6385726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6385726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5017823298","display_name":"Erion Plaku","orcid":"https://orcid.org/0000-0002-6622-386X"},"institutions":[{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erion Plaku","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Catholic University of America, Washington D.C., DC, USA","Department of Electrical Engineering and Computer Science, Catholic University of America, Washington DC 20064, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Catholic University of America, Washington D.C., DC, USA","institution_ids":["https://openalex.org/I84470341"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Catholic University of America, Washington DC 20064, USA","institution_ids":["https://openalex.org/I84470341"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017823298"],"corresponding_institution_ids":["https://openalex.org/I84470341"],"apc_list":null,"apc_paid":null,"fwci":0.8236,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73665863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5505","issue":null,"first_page":"2269","last_page":"2275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9965999722480774,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9926000237464905,"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/linear-temporal-logic","display_name":"Linear temporal logic","score":0.8546816110610962},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7015150189399719},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6518248915672302},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6115156412124634},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.6016212105751038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6008447408676147},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5851967334747314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5227984189987183},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5123668909072876},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5104743242263794},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5102465152740479},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45724204182624817},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45328831672668457},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.4483562111854553},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4321981966495514},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3213025629520416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3048745393753052},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.27286750078201294},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1588546335697174}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.8546816110610962},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7015150189399719},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6518248915672302},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6115156412124634},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.6016212105751038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6008447408676147},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5851967334747314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5227984189987183},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5123668909072876},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5104743242263794},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5102465152740479},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45724204182624817},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45328831672668457},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.4483562111854553},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4321981966495514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3213025629520416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3048745393753052},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.27286750078201294},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1588546335697174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2012.6385726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6385726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1495392417","https://openalex.org/W1540883472","https://openalex.org/W1548600288","https://openalex.org/W1593316755","https://openalex.org/W1970927851","https://openalex.org/W1978100913","https://openalex.org/W1991596047","https://openalex.org/W2041753526","https://openalex.org/W2050797564","https://openalex.org/W2071797744","https://openalex.org/W2075577325","https://openalex.org/W2093227835","https://openalex.org/W2096825926","https://openalex.org/W2104241562","https://openalex.org/W2104991009","https://openalex.org/W2106359407","https://openalex.org/W2107535513","https://openalex.org/W2131064738","https://openalex.org/W2132467020","https://openalex.org/W2138419444","https://openalex.org/W2226214879","https://openalex.org/W2233446961","https://openalex.org/W2986717012","https://openalex.org/W3115270213","https://openalex.org/W4234475010","https://openalex.org/W6629573421","https://openalex.org/W6632821198","https://openalex.org/W6689156237"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W31328628","https://openalex.org/W3091862538","https://openalex.org/W1969550103","https://openalex.org/W1031601050","https://openalex.org/W1513400763"],"abstract_inverted_index":{"Linear":[0],"Temporal":[1],"Logic":[2],"makes":[3],"it":[4],"possible":[5],"to":[6,22,48,89],"express":[7],"tasks":[8],"in":[9,99],"terms":[10],"of":[11,26,42],"propositions,":[12],"logical":[13],"connectives,":[14],"and":[15,72,115],"temporal":[16],"connectives.":[17],"This":[18],"paper":[19],"shows":[20],"how":[21],"incorporate":[23],"a":[24,63,81,108],"subclass":[25],"LTL,":[27,30],"namely":[28],"co-safe":[29,68,105],"into":[31],"Probabilistic":[32],"RoadMap":[33],"(PRM)":[34],"path":[35],"planners.":[36],"PRMs":[37],"provide":[38],"an":[39],"important":[40],"class":[41],"approaches":[43],"which":[44],"have":[45],"been":[46],"shown":[47],"work":[49],"well":[50],"for":[51],"high-dimensional":[52],"configuration":[53],"spaces.":[54],"The":[55],"proposed":[56],"Temporal-PRM":[57],"approach":[58],"combines":[59],"the":[60,67,74,77],"roadmap":[61,83],"with":[62,112],"finite":[64],"automaton":[65],"representing":[66],"LTL":[69,106],"formula":[70],"\u03c6":[71],"conducts":[73],"search":[75],"over":[76],"combined":[78],"graph.":[79],"As":[80],"result,":[82],"connections":[84],"are":[85],"reused":[86],"when":[87],"needed":[88],"find":[90],"paths":[91],"that":[92],"satisfy":[93],"\u03c6.":[94],"Experimental":[95],"validation":[96],"is":[97],"provided":[98],"simulation":[100],"by":[101],"using":[102],"different":[103,116],"scenes,":[104],"specifications,":[107],"snake-like":[109],"robot":[110],"model":[111],"numerous":[113],"degrees-of-freedom,":[114],"sampling":[117],"strategies.":[118]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}