{"id":"https://openalex.org/W2739094621","doi":"https://doi.org/10.1109/icra.2017.7989157","title":"Sampling-based approximate optimal temporal logic planning","display_name":"Sampling-based approximate optimal temporal logic planning","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2739094621","doi":"https://doi.org/10.1109/icra.2017.7989157","mag":"2739094621"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5014329552","display_name":"Lening Li","orcid":"https://orcid.org/0000-0002-8321-1254"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lening Li","raw_affiliation_strings":["Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, US","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046206794","display_name":"Jie Fu","orcid":"https://orcid.org/0000-0002-4470-2827"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Fu","raw_affiliation_strings":["Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA, US","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.5572,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79293979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"55","issue":null,"first_page":"1328","last_page":"1335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9933000206947327,"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.9933000206947327,"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.9911999702453613,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.987500011920929,"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/temporal-logic","display_name":"Temporal logic","score":0.6486684679985046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6034609079360962},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5900624394416809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5535540580749512},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5498549342155457},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4408014118671417},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4338816702365875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34572887420654297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29604434967041016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2387654185295105}],"concepts":[{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6486684679985046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6034609079360962},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5900624394416809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5535540580749512},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5498549342155457},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4408014118671417},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4338816702365875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34572887420654297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29604434967041016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2387654185295105},{"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":1,"locations":[{"id":"doi:10.1109/icra.2017.7989157","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1498432697","https://openalex.org/W1506588809","https://openalex.org/W1540883472","https://openalex.org/W1761635979","https://openalex.org/W1777783943","https://openalex.org/W1969483458","https://openalex.org/W1977985274","https://openalex.org/W1985919024","https://openalex.org/W1986417217","https://openalex.org/W2009453719","https://openalex.org/W2050215344","https://openalex.org/W2064572756","https://openalex.org/W2071797744","https://openalex.org/W2073548775","https://openalex.org/W2090528409","https://openalex.org/W2098432798","https://openalex.org/W2104241562","https://openalex.org/W2117218135","https://openalex.org/W2117927826","https://openalex.org/W2128990851","https://openalex.org/W2132083787","https://openalex.org/W2134447392","https://openalex.org/W2150335178","https://openalex.org/W2153267861","https://openalex.org/W2160142094","https://openalex.org/W2188902571","https://openalex.org/W2570925621","https://openalex.org/W4236251699","https://openalex.org/W4249999916","https://openalex.org/W6646916188","https://openalex.org/W6683687343","https://openalex.org/W6687150552"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W31328628","https://openalex.org/W2143025323","https://openalex.org/W3163822336","https://openalex.org/W3091862538","https://openalex.org/W1969550103","https://openalex.org/W1031601050"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,66,92,131],"propose":[4],"a":[5,28,45,76,106,134,161,191,195],"sampling-based":[6,101],"policy":[7,68,87,114,165],"iteration":[8],"for":[9,44,88,190],"optimal":[10,20,41,80,164],"planning":[11,35,189],"under":[12],"temporal":[13,32,58,125,171,187],"logic":[14,126,139,172,188],"constraints.":[15,173],"The":[16,174],"method":[17,180],"integrates":[18],"approximate":[19,163],"control,":[21],"importance":[22,100],"sampling,":[23],"and":[24,128,176,194],"formal":[25,138],"methods.":[26],"For":[27],"subclass":[29],"of":[30,61,78,113,170,178],"linear":[31,54,192],"logic,":[33],"the":[34,63,73,85,110,118,153,168,179],"problem":[36,43,74],"is":[37],"transformed":[38],"to":[39,71,104,141,160],"an":[40,79,99],"control":[42],"hybrid":[46],"system":[47,129,193],"where":[48],"discrete":[49],"transitions":[50],"are":[51,181],"triggered":[52],"by":[53,124],"time":[55],"events":[56],"in":[57,120,137],"logic.":[59],"Instead":[60],"solving":[62],"Hamilton-Jacobi-Bellman":[64],"equation,":[65],"use":[67],"function":[69,115,122,136],"approximation":[70],"reduce":[72],"into":[75],"search":[77,108],"weight":[81],"vector":[82],"that":[83,166],"parametrizes":[84],"near-optimal":[86],"given":[89],"bases.":[90],"Then,":[91],"incorporate":[93],"Model":[94],"Reference":[95],"Adaptive":[96],"Search":[97],"-":[98],"optimization":[102],"algorithm":[103,155],"perform":[105],"sample-efficient":[107,143],"within":[109],"parameter":[111],"space":[112],"approximations.":[116],"Facing":[117],"discontinuity":[119],"cost":[121],"introduced":[123],"constraints":[127],"dynamics,":[130],"introduce":[132],"(1)":[133],"rank":[135],"specifications":[140],"enable":[142],"search;":[144],"(2)":[145],"specification-guided":[146],"basis":[147],"selection.":[148],"Under":[149],"mild":[150],"technical":[151],"assumptions,":[152],"proposed":[154],"converges,":[156],"with":[157],"probability":[158],"one,":[159],"global":[162],"ensures":[167],"satisfaction":[169],"correctness":[175],"efficiency":[177],"demonstrated":[182],"through":[183],"numerical":[184],"experiments":[185],"including":[186],"nonlinear":[196],"mobile":[197],"robot.":[198]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}