{"id":"https://openalex.org/W3114918366","doi":"https://doi.org/10.1109/itsc45102.2020.9294328","title":"A Multi-Step Approach to Accelerate the Computation of Reachable Sets for Road Vehicles","display_name":"A Multi-Step Approach to Accelerate the Computation of Reachable Sets for Road Vehicles","publication_year":2020,"publication_date":"2020-09-20","ids":{"openalex":"https://openalex.org/W3114918366","doi":"https://doi.org/10.1109/itsc45102.2020.9294328","mag":"3114918366"},"language":"en","primary_location":{"id":"doi:10.1109/itsc45102.2020.9294328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://mediatum.ub.tum.de/1545516","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050613797","display_name":"Moritz Klischat","orcid":"https://orcid.org/0000-0003-0960-9747"},"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":"Moritz Klischat","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Lehrstuhl f\u00fcr Robotik und Echtzeitsysteme, Boltzmannstra\u00dfe 3, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Lehrstuhl f\u00fcr Robotik und Echtzeitsysteme, Boltzmannstra\u00dfe 3, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005383495","display_name":"Matthias Althoff","orcid":"https://orcid.org/0000-0003-3733-842X"},"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":"Matthias Althoff","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Lehrstuhl f\u00fcr Robotik und Echtzeitsysteme, Boltzmannstra\u00dfe 3, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Lehrstuhl f\u00fcr Robotik und Echtzeitsysteme, Boltzmannstra\u00dfe 3, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050613797"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.7816,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.75003361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9944999814033508,"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/reachability","display_name":"Reachability","score":0.9053831100463867},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7726017236709595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7334535121917725},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47752702236175537},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47024479508399963},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4617592990398407},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.4571426510810852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44293510913848877},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.41091763973236084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3787357211112976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19546717405319214}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9053831100463867},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7726017236709595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7334535121917725},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47752702236175537},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47024479508399963},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4617592990398407},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.4571426510810852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44293510913848877},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.41091763973236084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3787357211112976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19546717405319214},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itsc45102.2020.9294328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1545516","is_oa":true,"landing_page_url":"https://mediatum.ub.tum.de/1545516","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/1545516","is_oa":true,"landing_page_url":"https://mediatum.ub.tum.de/1545516","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ConferencePaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W618708471","https://openalex.org/W1522694098","https://openalex.org/W1569692898","https://openalex.org/W1575486920","https://openalex.org/W1964345118","https://openalex.org/W1975236902","https://openalex.org/W1979785172","https://openalex.org/W2064682705","https://openalex.org/W2066423936","https://openalex.org/W2089915742","https://openalex.org/W2113922565","https://openalex.org/W2123922810","https://openalex.org/W2158451642","https://openalex.org/W2162791642","https://openalex.org/W2169289043","https://openalex.org/W2176215692","https://openalex.org/W2202589926","https://openalex.org/W2289542002","https://openalex.org/W2573365710","https://openalex.org/W2576277975","https://openalex.org/W2740508249","https://openalex.org/W2750753797","https://openalex.org/W2897650660","https://openalex.org/W2897652013","https://openalex.org/W2904313094","https://openalex.org/W2905161341","https://openalex.org/W2962896691","https://openalex.org/W2963403829","https://openalex.org/W2963488412","https://openalex.org/W2970679500","https://openalex.org/W4242811155","https://openalex.org/W6678726515","https://openalex.org/W6731923558","https://openalex.org/W6731927080"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W2381242807","https://openalex.org/W2135836819"],"abstract_inverted_index":{"We":[0,124],"propose":[1],"an":[2,93],"approach":[3,41,127],"for":[4,32,134],"the":[5,47,53,85,96,103,112,148],"fast":[6],"computation":[7,140],"of":[8,11,26,46,106,132,151],"reachable":[9,20,54,67,116],"sets":[10,21,117],"road":[12],"vehicles":[13,27,136],"while":[14,146],"considering":[15,78],"dynamic":[16],"obstacles.":[17],"The":[18,39],"obtained":[19],"contain":[22],"all":[23],"possible":[24],"behaviors":[25],"and":[28,36,58],"can":[29,98],"be":[30],"used":[31],"motion":[33],"planning,":[34],"verification,":[35],"criticality":[37],"assessment.":[38],"proposed":[40],"precomputes":[42],"computationally":[43],"expensive":[44],"parts":[45],"reachability":[48],"analysis.":[49],"Further,":[50],"we":[51],"partition":[52],"set":[55],"into":[56],"cells":[57,65,70],"construct":[59],"a":[60,129,138],"directed":[61,86],"graph":[62],"storing":[63],"which":[64,69],"are":[66],"from":[68,84,119],"at":[71],"preceding":[72],"time":[73,141],"steps.":[74],"Using":[75],"this":[76,89,107],"approach,":[77],"obstacles":[79],"reduces":[80],"to":[81,110,143],"deleting":[82],"nodes":[83],"graph.":[87],"Although":[88],"simple":[90],"idea":[91],"ensures":[92],"efficient":[94],"computation,":[95],"discretization":[97],"introduce":[99],"considerable":[100],"over-approximations.":[101],"Thus,":[102],"main":[104],"novelty":[105],"paper":[108],"is":[109],"reduce":[111],"over-approximations":[113],"by":[114],"intersecting":[115],"propagated":[118],"multiple":[120],"points":[121],"in":[122],"time.":[123],"demonstrate":[125],"our":[126],"on":[128],"large":[130],"range":[131],"scenarios":[133],"automated":[135],"showing":[137],"faster":[139],"compared":[142],"previous":[144],"approaches":[145],"providing":[147],"same":[149],"level":[150],"accuracy.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}