{"id":"https://openalex.org/W2199834110","doi":"https://doi.org/10.1109/iros.2015.7354273","title":"A fast cost-to-go map approximation algorithm on known large scale rough terrains","display_name":"A fast cost-to-go map approximation algorithm on known large scale rough terrains","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2199834110","doi":"https://doi.org/10.1109/iros.2015.7354273","mag":"2199834110"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2015.7354273","doi":"https://doi.org/10.1109/iros.2015.7354273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7354273","pdf_url":null,"source":{"id":"https://openalex.org/S4393918188","display_name":"IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","issn_l":"2153-0858","issn":["2153-0858"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"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":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5059079323","display_name":"Nadir Kapetanovi\u0107","orcid":"https://orcid.org/0000-0002-1167-2000","observed_orcids":["https://orcid.org/0000-0002-1167-2000"]},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Nadir Kapetanovic","raw_affiliation_strings":["Department for Automatic Control and Electronics, University of Sarajevo, Sarajevo, Bosnia, Herzegovina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department for Automatic Control and Electronics, University of Sarajevo, Sarajevo, Bosnia, Herzegovina","institution_ids":["https://openalex.org/I104817121"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060268233","display_name":"Adnan Tahirovi\u0107","orcid":"https://orcid.org/0000-0003-2049-8523","observed_orcids":["https://orcid.org/0000-0003-2049-8523"]},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Adnan Tahirovic","raw_affiliation_strings":["Department for Automatic Control and Electronics, University of Sarajevo, Sarajevo, Bosnia, Herzegovina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department for Automatic Control and Electronics, University of Sarajevo, Sarajevo, Bosnia, Herzegovina","institution_ids":["https://openalex.org/I104817121"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039518248","display_name":"GianAntonio Magnani","orcid":"https://orcid.org/0000-0003-4879-6514","observed_orcids":["https://orcid.org/0000-0003-4879-6514"]},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianantonio Magnani","raw_affiliation_strings":["Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8171,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67230104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"6279","last_page":"6285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.00039999998989515007,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.00019999999494757503,"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/uneven-terrain","display_name":"uneven terrain","score":0.6110000014305115},{"id":"https://openalex.org/keywords/terrain-traversability","display_name":"terrain traversability","score":0.8679999709129333},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.9369999766349792},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7089999914169312},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6610000133514404},{"id":"https://openalex.org/keywords/large-scale-terrain","display_name":"large-scale terrain","score":0.6589999794960022},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.5559999942779541}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.8861929178237915},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.829704761505127},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.6456020474433899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6291885375976562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5660902261734009},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4689594805240631},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46100279688835144},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4569244384765625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39703169465065},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.356728732585907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30780506134033203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2601169943809509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18873965740203857},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07729554176330566},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.07250729203224182},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2015.7354273","doi":"https://doi.org/10.1109/iros.2015.7354273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7354273","pdf_url":null,"source":{"id":"https://openalex.org/S4393918188","display_name":"IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","issn_l":"2153-0858","issn":["2153-0858"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"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":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:re.public.polimi.it:11311/973117","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/973117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1424654272","https://openalex.org/W1502875864","https://openalex.org/W1532362218","https://openalex.org/W1559777421","https://openalex.org/W1810931192","https://openalex.org/W1836839941","https://openalex.org/W2014578444","https://openalex.org/W2015226852","https://openalex.org/W2042711481","https://openalex.org/W2081794857","https://openalex.org/W2098259051","https://openalex.org/W2100586428","https://openalex.org/W2111308925","https://openalex.org/W2116198080","https://openalex.org/W2130103520","https://openalex.org/W2131288186","https://openalex.org/W2135010458","https://openalex.org/W2169528473","https://openalex.org/W2170282673","https://openalex.org/W2611243847","https://openalex.org/W2799211309","https://openalex.org/W3088994749","https://openalex.org/W4235486443","https://openalex.org/W4253755764"],"related_works":["https://openalex.org/W2015226852","https://openalex.org/W2103185221","https://openalex.org/W7099117605","https://openalex.org/W2147898618","https://openalex.org/W7095240363","https://openalex.org/W2269218225","https://openalex.org/W2109032771","https://openalex.org/W2126888775","https://openalex.org/W2122977027","https://openalex.org/W4400182640"],"abstract_inverted_index":{"Obtaining":[0],"the":[1,28,53,56,68,76,91],"optimal":[2,29],"cost-to-go":[3,30,57],"map":[4,31,58],"for":[5,25,38],"large":[6,43],"scale":[7,44],"rough":[8,45],"terrains":[9,46],"is":[10,47],"computationally":[11],"very":[12],"expensive":[13],"both":[14],"in":[15,32],"terms":[16,33],"of":[17,27,34,55,93],"duration":[18],"and":[19,83],"memory":[20],"resources.":[21],"A":[22],"fast":[23],"algorithm":[24,78],"approximation":[26],"terrain":[35,63],"traversability":[36],"measures":[37],"path":[39],"planning":[40],"on":[41,90],"known":[42],"developed.":[48],"The":[49],"results":[50],"show":[51],"that":[52],"majority":[54],"values,":[59],"computed":[60],"from":[61],"every":[62],"location":[64],"with":[65],"respect":[66],"to":[67],"goal":[69],"location,":[70],"are":[71],"near-optimal.":[72],"Unlike":[73],"Dijkstra":[74],"algorithm,":[75],"proposed":[77],"has":[79],"inherently":[80],"parallel":[81],"structure,":[82],"can":[84],"be":[85],"significantly":[86],"speeded":[87],"up":[88],"depending":[89],"number":[92],"used":[94],"CPU":[95],"cores.":[96]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}