{"id":"https://openalex.org/W4309676928","doi":"https://doi.org/10.1109/smc53654.2022.9945075","title":"Learning Hierarchical Traversability Representations for Efficient Multi-Resolution Path Planning","display_name":"Learning Hierarchical Traversability Representations for Efficient Multi-Resolution Path Planning","publication_year":2022,"publication_date":"2022-10-09","ids":{"openalex":"https://openalex.org/W4309676928","doi":"https://doi.org/10.1109/smc53654.2022.9945075"},"language":"en","primary_location":{"id":"doi:10.1109/smc53654.2022.9945075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc53654.2022.9945075","pdf_url":null,"source":{"id":"https://openalex.org/S4363607746","display_name":"2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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 International Conference on Systems, Man, and Cybernetics (SMC)","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/A5032388623","display_name":"Reza Etemadi Idgahi","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reza Etemadi Idgahi","raw_affiliation_strings":["University of Texas at Arlington,Department of Computer Science and Engineering,Arlington,TX,76019-0015"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington,Department of Computer Science and Engineering,Arlington,TX,76019-0015","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047174917","display_name":"Manfred Huber","orcid":"https://orcid.org/0009-0007-0294-9147"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manfred Huber","raw_affiliation_strings":["University of Texas at Arlington,Department of Computer Science and Engineering,Arlington,TX,76019-0015"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington,Department of Computer Science and Engineering,Arlington,TX,76019-0015","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189196454"],"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":"4","issue":null,"first_page":"2520","last_page":"2526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9894000291824341,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7570866942405701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7393499612808228},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6383556723594666},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6103733777999878},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6101279854774475},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5700730681419373},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5455282926559448},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.539291262626648},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.4906271994113922},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.47369906306266785},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4330846965312958},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.4236403703689575},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.36669695377349854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3230031728744507},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.23726963996887207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1577652394771576}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7570866942405701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7393499612808228},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6383556723594666},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6103733777999878},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6101279854774475},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5700730681419373},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5455282926559448},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.539291262626648},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.4906271994113922},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.47369906306266785},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4330846965312958},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.4236403703689575},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.36669695377349854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3230031728744507},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.23726963996887207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1577652394771576},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc53654.2022.9945075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc53654.2022.9945075","pdf_url":null,"source":{"id":"https://openalex.org/S4363607746","display_name":"2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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 International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W571818863","https://openalex.org/W1515851193","https://openalex.org/W1969483458","https://openalex.org/W1996183429","https://openalex.org/W1997880753","https://openalex.org/W2014729048","https://openalex.org/W2015034115","https://openalex.org/W2072931156","https://openalex.org/W2086608109","https://openalex.org/W2109996097","https://openalex.org/W2120600560","https://openalex.org/W2140760839","https://openalex.org/W2161076907","https://openalex.org/W2164561380","https://openalex.org/W2169498096","https://openalex.org/W2586680856","https://openalex.org/W2783485394","https://openalex.org/W3027095131","https://openalex.org/W6605295560","https://openalex.org/W6683620479","https://openalex.org/W6683841269"],"related_works":["https://openalex.org/W2060743914","https://openalex.org/W2982486675","https://openalex.org/W4367628293","https://openalex.org/W2914106695","https://openalex.org/W2075951586","https://openalex.org/W2990979393","https://openalex.org/W4391811480","https://openalex.org/W3110876360","https://openalex.org/W4282823369","https://openalex.org/W1540605002"],"abstract_inverted_index":{"Path":[0],"planning":[1,70,178],"on":[2,28,120,151],"grid-based":[3],"obstacle":[4,57,140,200],"maps":[5,154],"is":[6],"an":[7,104],"essential":[8],"and":[9,16,53,59,126,146,160,184],"much-studied":[10],"problem":[11],"with":[12,50,64,84,97],"applications":[13],"in":[14,19,71,181,186],"robotics":[15],"autonomy.":[17],"Traditionally,":[18],"the":[20,51,56,121,129,133,138,144,191,198,204],"AI":[21],"community,":[22],"heuristic":[23,106,193],"search":[24,194],"methods":[25],"(e.g.,":[26],"based":[27],"Dijkstra,":[29],"$\\text{A}^{*}$,":[30],"or":[31],"random":[32],"trees)":[33],"are":[34],"used":[35],"to":[36,61,67,89,107,156,163,190,197],"solve":[37],"this":[38,149,207],"problem.":[39],"This":[40,73,113],"search,":[41],"however,":[42],"incurs":[43],"a":[44,76,80,85,91,109],"high":[45],"computational":[46],"cost":[47],"that":[48,100,172],"grows":[49],"size":[52],"resolution":[54,99,123],"of":[55,93,148,153,206],"grid":[58],"has":[60],"be":[62],"mitigated":[63],"effective":[65],"heuristics":[66],"allow":[68],"path":[69,111,114,130,177],"real-time.":[72],"work":[74],"introduces":[75],"learning":[77],"framework":[78],"using":[79],"deep":[81],"neural":[82],"network":[83],"stackable":[86],"convolution":[87],"kernel":[88],"establish":[90],"hierarchy":[92,134],"directional":[94],"traversability":[95,124],"representations":[96],"decreasing":[98],"can":[101,175],"serve":[102],"as":[103],"efficient":[105],"guide":[108],"multi-resolution":[110],"planner.":[112],"planner":[115],"finds":[116],"paths":[117],"efficiently,":[118],"starting":[119],"lowest":[122],"representation":[125],"then":[127],"refining":[128],"incrementally":[131],"through":[132],"until":[135],"it":[136],"addresses":[137],"original":[139,199],"constraints.":[141],"We":[142],"demonstrate":[143],"benefits":[145],"applicability":[147],"approach":[150],"datasets":[152],"created":[155],"represent":[157,164],"both":[158],"indoor":[159,182],"outdoor":[161,187],"environments":[162,183,188],"different":[165],"real-world":[166],"applications.":[167],"The":[168],"conducted":[169],"experiments":[170],"show":[171],"our":[173],"method":[174,195],"accelerate":[176],"by":[179],"40%":[180],"65%":[185],"compared":[189],"same":[192],"applied":[196],"map,":[201],"which":[202],"demonstrates":[203],"effectiveness":[205],"method.":[208]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}