{"id":"https://openalex.org/W4308079972","doi":"https://doi.org/10.1109/itsc55140.2022.9922384","title":"A Rigorous Optimization Approach for the Generic Derivation of Secondary Information from Digital Maps for Urban Scenarios","display_name":"A Rigorous Optimization Approach for the Generic Derivation of Secondary Information from Digital Maps for Urban Scenarios","publication_year":2022,"publication_date":"2022-10-08","ids":{"openalex":"https://openalex.org/W4308079972","doi":"https://doi.org/10.1109/itsc55140.2022.9922384"},"language":"en","primary_location":{"id":"doi:10.1109/itsc55140.2022.9922384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc55140.2022.9922384","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","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/A5035767064","display_name":"Michael Eder","orcid":"https://orcid.org/0000-0002-1392-1664"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Eder","raw_affiliation_strings":["Technical University of Munich, Chair of Mathematical Optimization,Department of Mathematics,Garching,Germany,85748"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich, Chair of Mathematical Optimization,Department of Mathematics,Garching,Germany,85748","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006824589","display_name":"Sebastian Skibinski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sebastian Skibinski","raw_affiliation_strings":["Pre-Development Automated Driving, AUDI AG,Ingolstadt,Germany,85045"],"affiliations":[{"raw_affiliation_string":"Pre-Development Automated Driving, AUDI AG,Ingolstadt,Germany,85045","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087163248","display_name":"Florian Mickler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florian Mickler","raw_affiliation_strings":["Pre-Development Automated Driving, AUDI AG,Ingolstadt,Germany,85045"],"affiliations":[{"raw_affiliation_string":"Pre-Development Automated Driving, AUDI AG,Ingolstadt,Germany,85045","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014423708","display_name":"Michael Ulbrich","orcid":"https://orcid.org/0000-0002-4320-8616"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Ulbrich","raw_affiliation_strings":["Technical University of Munich, Chair of Mathematical Optimization,Department of Mathematics,Garching,Germany,85748"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich, Chair of Mathematical Optimization,Department of Mathematics,Garching,Germany,85748","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035767064"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10159703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":null,"first_page":"4202","last_page":"4208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.676656186580658},{"id":"https://openalex.org/keywords/taylor-series","display_name":"Taylor series","score":0.6063570976257324},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6048275232315063},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6039324998855591},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5750530362129211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4975588619709015},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"Interval arithmetic","score":0.4819350242614746},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4766576886177063},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.46738186478614807},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41784900426864624},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.4114547073841095},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4101278781890869},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39452624320983887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3899375796318054}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.676656186580658},{"id":"https://openalex.org/C158946198","wikidata":"https://www.wikidata.org/wiki/Q131187","display_name":"Taylor series","level":2,"score":0.6063570976257324},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6048275232315063},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6039324998855591},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5750530362129211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4975588619709015},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.4819350242614746},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4766576886177063},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.46738186478614807},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41784900426864624},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.4114547073841095},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4101278781890869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39452624320983887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3899375796318054},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc55140.2022.9922384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc55140.2022.9922384","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8299999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W179158423","https://openalex.org/W182436700","https://openalex.org/W1502451396","https://openalex.org/W1526536257","https://openalex.org/W1969747399","https://openalex.org/W1988622494","https://openalex.org/W2008739241","https://openalex.org/W2016196165","https://openalex.org/W2029223910","https://openalex.org/W2053866918","https://openalex.org/W2060565114","https://openalex.org/W2103054960","https://openalex.org/W2146341805","https://openalex.org/W2154904851","https://openalex.org/W2500738484","https://openalex.org/W2556572655","https://openalex.org/W2560882727","https://openalex.org/W2566680697","https://openalex.org/W2795213472","https://openalex.org/W2963786102","https://openalex.org/W2969592259","https://openalex.org/W3089522406","https://openalex.org/W3115686604","https://openalex.org/W3146520007","https://openalex.org/W3204562766","https://openalex.org/W4310211179","https://openalex.org/W6607327023"],"related_works":["https://openalex.org/W2364127131","https://openalex.org/W2155888019","https://openalex.org/W4206704743","https://openalex.org/W2152773061","https://openalex.org/W2107730133","https://openalex.org/W4200095174","https://openalex.org/W2911254004","https://openalex.org/W4291128200","https://openalex.org/W3206492465","https://openalex.org/W2383691256"],"abstract_inverted_index":{"In":[0],"the":[1,53,56,62,67,89,115],"context":[2],"of":[3,55,88],"Highly":[4],"Automated":[5],"Driving":[6],"(HAD)":[7],"and":[8,31,59,121],"Advanced":[9],"Driver":[10],"Assistance":[11],"Systems":[12],"(ADAS),":[13],"we":[14,107],"derive":[15],"optimal":[16],"stopping":[17],"points":[18],"for":[19],"vehicles":[20],"in":[21,118],"urban":[22,63,119],"scenarios.":[23],"We":[24,113],"develop":[25],"a":[26,35,43,76,102],"rigorous":[27],"global":[28],"optimization":[29],"algorithm":[30,74,117],"apply":[32],"it":[33,123],"to":[34,61,124],"constrained":[36],"maximization":[37,94],"problem":[38,95,105],"that":[39,106,127],"is":[40,99],"based":[41],"on":[42],"high-definition":[44],"map":[45,49],"(HD":[46],"map).":[47],"Specific":[48],"feature":[50],"functions":[51],"describe":[52],"contribution":[54],"points,":[57],"curves,":[58],"polygons":[60],"scenario":[64],"model,":[65],"while":[66],"perceived":[68],"obstacles":[69],"form":[70],"infeasible":[71],"areas.":[72],"Our":[73],"combines":[75],"branch-and-bound":[77],"method":[78],"using":[79,109],"interval":[80,125],"arithmetic":[81],"with":[82,96],"locally":[83],"applied":[84],"cubic":[85],"Taylor":[86,132],"expansions":[87],"objective":[90],"function.":[91],"The":[92],"polynomial":[93],"box":[97],"constraints":[98],"formulated":[100],"as":[101],"root":[103],"finding":[104],"solve":[108],"an":[110],"eigenvalue":[111],"approach.":[112],"test":[114],"developed":[116],"scenarios":[120],"compare":[122],"algorithms":[126],"either":[128],"use":[129],"local":[130,136],"quadratic":[131],"approaches":[133],"or":[134],"no":[135],"improvement":[137],"at":[138],"all.":[139]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}