{"id":"https://openalex.org/W4247274889","doi":"https://doi.org/10.1109/iccps.2016.7479106","title":"Least-Violating Planning in Road Networks from Temporal Logic Specifications","display_name":"Least-Violating Planning in Road Networks from Temporal Logic Specifications","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W4247274889","doi":"https://doi.org/10.1109/iccps.2016.7479106"},"language":"en","primary_location":{"id":"doi:10.1109/iccps.2016.7479106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccps.2016.7479106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS)","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/A5042698317","display_name":"Jana T\u016fmov\u00e1","orcid":"https://orcid.org/0000-0003-4173-2593"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jana Tumova","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081073767","display_name":"Serta\u00e7 Karaman","orcid":"https://orcid.org/0000-0002-2225-7275"},"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":false,"raw_author_name":"Sertac Karaman","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Calin Belta","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066830185","display_name":"Daniela Rus","orcid":"https://orcid.org/0000-0001-5473-3566"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniela Rus","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8609,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86361075,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.998199999332428,"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"}},{"id":"https://openalex.org/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9860000014305115,"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.7494967579841614},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6626020669937134},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5757879018783569},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5639748573303223},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5136391520500183},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.45996907353401184},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.45886629819869995},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4356841444969177},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42920905351638794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41159722208976746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22205698490142822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15650445222854614},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1208154559135437},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09914404153823853},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08946818113327026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08789312839508057}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7494967579841614},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6626020669937134},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5757879018783569},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5639748573303223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5136391520500183},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.45996907353401184},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.45886629819869995},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4356841444969177},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42920905351638794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41159722208976746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22205698490142822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15650445222854614},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1208154559135437},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09914404153823853},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08946818113327026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08789312839508057},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccps.2016.7479106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccps.2016.7479106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7300000190734863}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1540883472","https://openalex.org/W1994511055","https://openalex.org/W2010802721","https://openalex.org/W2064526960","https://openalex.org/W2074802943","https://openalex.org/W2077245982","https://openalex.org/W2077578897","https://openalex.org/W2082965709","https://openalex.org/W2095274657","https://openalex.org/W2101780609","https://openalex.org/W2110579257","https://openalex.org/W2113261006","https://openalex.org/W2117927826","https://openalex.org/W2139711135","https://openalex.org/W2155327357","https://openalex.org/W3098341813","https://openalex.org/W6668959476","https://openalex.org/W6682903071"],"related_works":["https://openalex.org/W4255837520","https://openalex.org/W2387011115","https://openalex.org/W4234808182","https://openalex.org/W4255628145","https://openalex.org/W2382043075","https://openalex.org/W2809151339","https://openalex.org/W2216913934","https://openalex.org/W2360673138","https://openalex.org/W2809370583","https://openalex.org/W4301447905"],"abstract_inverted_index":{"In":[0],"this":[1,55],"paper,":[2],"we":[3,139],"consider":[4],"the":[5,43,66,69,89,99,108,117,153],"problem":[6,118],"of":[7,33,36,45,68,101,119,137,152],"automated":[8],"plan":[9],"synthesis":[10],"for":[11,53,133],"a":[12,16,23,31,39,46,51,58,113,126,134,141],"vehicle":[13,28],"operating":[14],"in":[15,42],"road":[17],"network,":[18],"which":[19,37],"is":[20,29,75],"modeled":[21],"as":[22],"weighted":[24],"transition":[25],"system.":[26],"The":[27,61,150],"assigned":[30],"set":[32],"demands,":[34,138],"each":[35],"involves":[38],"task":[40],"specification":[41],"form":[44],"syntactically":[47],"co-safe":[48],"LTL":[49],"formula,":[50],"deadline":[52],"achieving":[54],"task,":[56],"and":[57,71,92,122],"demand":[59,102,109],"priority.":[60],"demands":[62],"arrive":[63],"gradually,":[64],"upon":[65],"run":[67],"vehicle,":[70],"hence":[72],"periodical":[73],"replanning":[74,123],"needed.":[76],"We":[77,111],"particularly":[78],"focus":[79],"on":[80,125,146],"cases,":[81],"where":[82],"all":[83],"tasks":[84],"cannot":[85],"be":[86],"accomplished":[87],"within":[88],"desired":[90],"deadlines":[91],"propose":[93],"several":[94],"different":[95],"ways":[96],"to":[97,116,128],"measure":[98],"degree":[100],"violation":[103],"that":[104],"take":[105],"into":[106],"account":[107],"priorities.":[110],"develop":[112],"general":[114],"solution":[115,144],"least-violating":[120],"planning":[121],"based":[124,145],"translation":[127],"linear":[129],"programming":[130],"problem.":[131],"Furthermore,":[132],"particular":[135],"subclass":[136],"provide":[140],"more":[142],"efficient":[143],"graph":[147],"search":[148],"algorithms.":[149],"benefits":[151],"approach":[154],"are":[155],"demonstrated":[156],"through":[157],"illustrative":[158],"simulations":[159],"inspired":[160],"by":[161],"mobility-on-demand":[162],"scenarios.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}