{"id":"https://openalex.org/W7155381320","doi":"https://doi.org/10.48550/arxiv.2604.20428","title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","display_name":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","publication_year":2026,"publication_date":"2026-04-22","ids":{"openalex":"https://openalex.org/W7155381320","doi":"https://doi.org/10.48550/arxiv.2604.20428"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.20428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20428","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.20428","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053274644","display_name":"Patrick Halder","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Halder, Patrick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000102365","display_name":"Lothar Kiltz","orcid":"https://orcid.org/0000-0003-1219-8037"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kiltz, Lothar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077735653","display_name":"Hannes Homburger","orcid":"https://orcid.org/0000-0002-4002-3448"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Homburger, Hannes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084137752","display_name":"Johannes Reuter","orcid":"https://orcid.org/0000-0003-2069-5682"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reuter, Johannes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134457375","display_name":"Matthias Althoff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Althoff, Matthias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10142","display_name":"Formal Methods in Verification","score":0.8744000196456909,"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.8744000196456909,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.028300000354647636,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.010400000028312206,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/lexicographical-order","display_name":"Lexicographical order","score":0.7631999850273132},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7214999794960022},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5245000123977661},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4961000084877014},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.445499986410141},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.38850000500679016},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.3749000132083893},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.3691999912261963}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7631999850273132},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7214999794960022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5889000296592712},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5245000123977661},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4961000084877014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4471000134944916},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31360000371932983},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2721000015735626},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.20428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20428","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.20428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20428","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.5976321697235107,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motion":[0],"planning":[1,24,153],"for":[2,46,148],"autonomous":[3],"vehicles":[4],"often":[5],"requires":[6],"satisfying":[7],"multiple":[8],"conditionally":[9],"conflicting":[10],"specifications.":[11],"In":[12],"situations":[13],"where":[14],"not":[15],"all":[16],"specifications":[17,32,50,64],"can":[18],"be":[19],"met":[20],"simultaneously,":[21],"minimum-violation":[22,151],"motion":[23,152],"maintains":[25],"system":[26],"operation":[27],"by":[28,84],"minimizing":[29],"violations":[30,132],"of":[31,56,63],"in":[33],"accordance":[34],"with":[35],"their":[36,57],"priorities.":[37],"Signal":[38],"temporal":[39,131],"logic":[40],"(STL)":[41],"provides":[42],"a":[43,60,66,92,105,123,155],"formal":[44],"language":[45],"rigorously":[47],"defining":[48],"these":[49],"and":[51,100,130,145],"enables":[52],"the":[53,86,139],"quantitative":[54],"evaluation":[55],"violations.":[58],"However,":[59],"total":[61],"ordering":[62],"yields":[65],"lexicographic":[67,88,149],"optimization":[68,89,95,116],"problem,":[69],"which":[70],"is":[71,133],"typically":[72],"computationally":[73],"expensive":[74],"to":[75,113],"solve":[76,115],"using":[77,97],"standard":[78],"methods.":[79],"We":[80],"address":[81],"this":[82],"problem":[83,90,96],"transforming":[85],"multi-objective":[87],"into":[91],"single-objective":[93,156],"scalar":[94],"non-uniform":[98],"quantization":[99],"bit-shifting.":[101],"Specifically,":[102],"we":[103],"extend":[104],"deterministic":[106],"model":[107],"predictive":[108],"path":[109],"integral":[110],"(MPPI)":[111],"solver":[112,157],"efficiently":[114],"problems":[117],"without":[118],"quadratic":[119],"input":[120],"cost.":[121],"Additionally,":[122],"novel":[124],"predicate-robustness":[125],"measure":[126],"that":[127,138],"combines":[128],"spatial":[129],"introduced.":[134],"Our":[135],"results":[136],"show":[137],"proposed":[140],"method":[141],"offers":[142],"an":[143],"interpretable":[144],"scalable":[146],"solution":[147],"STL":[150],"within":[154],"framework.":[158]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-24T00:00:00"}