{"id":"https://openalex.org/W2735511423","doi":"https://doi.org/10.1109/lra.2017.2727514","title":"Cost-Aware Path Planning Under Co-Safe Temporal Logic Specifications","display_name":"Cost-Aware Path Planning Under Co-Safe Temporal Logic Specifications","publication_year":2017,"publication_date":"2017-07-17","ids":{"openalex":"https://openalex.org/W2735511423","doi":"https://doi.org/10.1109/lra.2017.2727514","mag":"2735511423"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2017.2727514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2727514","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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/A5034975936","display_name":"Kyunghoon Cho","orcid":"https://orcid.org/0000-0002-4679-6660"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Kyunghoon Cho","raw_affiliation_strings":["Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101682061","display_name":"Junghun Suh","orcid":"https://orcid.org/0000-0001-9051-8097"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Junghun Suh","raw_affiliation_strings":["Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045155646","display_name":"Claire J. Tomlin","orcid":"https://orcid.org/0000-0003-3192-3185"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Claire J. Tomlin","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033764106","display_name":"Songhwai Oh","orcid":"https://orcid.org/0000-0002-9781-2018"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Songhwai Oh","raw_affiliation_strings":["Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and ASRI, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5034975936"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":1.0012,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.85049442,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"4","first_page":"2308","last_page":"2315"},"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.9966999888420105,"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.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.5864418745040894},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5855550765991211},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5602549910545349},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5426661372184753},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5294979214668274},{"id":"https://openalex.org/keywords/cross-entropy","display_name":"Cross entropy","score":0.5253483653068542},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.4917023777961731},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47654324769973755},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4729948937892914},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.414377361536026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3215862810611725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25196734070777893},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12285745143890381},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.10109424591064453}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5864418745040894},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5855550765991211},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5602549910545349},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5426661372184753},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5294979214668274},{"id":"https://openalex.org/C167981619","wikidata":"https://www.wikidata.org/wiki/Q1685498","display_name":"Cross entropy","level":3,"score":0.5253483653068542},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.4917023777961731},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47654324769973755},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4729948937892914},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.414377361536026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3215862810611725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25196734070777893},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12285745143890381},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.10109424591064453},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2017.2727514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2727514","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9100000262260437}],"awards":[{"id":"https://openalex.org/G298080217","display_name":null,"funder_award_id":"0931843","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6038682070","display_name":null,"funder_award_id":"NRF-2017R1A2B2006136","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1488782959","https://openalex.org/W1498432697","https://openalex.org/W1540883472","https://openalex.org/W1970269621","https://openalex.org/W1971086298","https://openalex.org/W1986417217","https://openalex.org/W1995626426","https://openalex.org/W2000359213","https://openalex.org/W2066953328","https://openalex.org/W2073548775","https://openalex.org/W2090528409","https://openalex.org/W2095901198","https://openalex.org/W2117927826","https://openalex.org/W2124623089","https://openalex.org/W2131064738","https://openalex.org/W2135301926","https://openalex.org/W2141789581","https://openalex.org/W2153813483","https://openalex.org/W2156123119","https://openalex.org/W2165364079","https://openalex.org/W2213277935","https://openalex.org/W2233446961","https://openalex.org/W4211049957","https://openalex.org/W6669133860"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2798742893","https://openalex.org/W1981889059","https://openalex.org/W2797949337","https://openalex.org/W858755136","https://openalex.org/W3005864166","https://openalex.org/W2372633663","https://openalex.org/W31328628"],"abstract_inverted_index":{"This":[0],"letter":[1],"presents":[2],"a":[3,9,25,36,49,73,96],"path":[4,11,60],"planning":[5,61],"algorithm":[6],"for":[7],"generating":[8],"cost-efficient":[10],"that":[12,24,134],"satisfies":[13],"mission":[14],"requirements":[15],"specified":[16],"in":[17],"linear":[18],"temporal":[19],"logic":[20,75],"(LTL).":[21],"We":[22],"assume":[23],"cost":[26,37],"function":[27,38],"is":[28,121],"defined":[29],"over":[30],"the":[31,63,81,102,106,116,125,135],"configuration":[32],"space.":[33],"Examples":[34],"of":[35,55,88,119],"include":[39],"hazard":[40],"levels,":[41],"wireless":[42],"connectivity,":[43],"and":[44,72,130],"energy":[45],"consumption,":[46],"to":[47,79,94,123,141],"name":[48],"few.":[50],"The":[51],"proposed":[52,103,136],"method":[53,104,137],"consists":[54],"two":[56],"parts:":[57],"sampling-based":[58],"cost-aware":[59],"considering":[62],"vehicle":[64],"dynamics":[65],"based":[66,84],"on":[67,85],"rapidly-exploring":[68],"random":[69],"trees":[70],"(RRT*),":[71],"high-level":[74],"which":[76],"determines":[77],"how":[78],"extend":[80],"RRT":[82,107],"tree":[83,108],"spatiotemporal":[86],"specifications":[87],"an":[89],"LTL":[90],"formula.":[91],"In":[92,128],"order":[93],"find":[95],"low-cost":[97],"trajectory":[98],"with":[99,109],"computational":[100],"efficiency,":[101],"expands":[105],"long":[110],"extensions":[111],"using":[112],"cross":[113],"entropy,":[114],"while":[115],"rewiring":[117],"step":[118],"RRT*":[120],"used":[122],"preserve":[124],"asymptotic":[126],"optimality.":[127],"simulation":[129],"experiments,":[131],"we":[132],"show":[133],"performs":[138],"favorably":[139],"compared":[140],"existing":[142],"methods.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}