{"id":"https://openalex.org/W4310137697","doi":"https://doi.org/10.1109/sbgames56371.2022.9961114","title":"Safe and Topographic Path Planning with Deep Neural Networks","display_name":"Safe and Topographic Path Planning with Deep Neural Networks","publication_year":2022,"publication_date":"2022-10-24","ids":{"openalex":"https://openalex.org/W4310137697","doi":"https://doi.org/10.1109/sbgames56371.2022.9961114"},"language":"en","primary_location":{"id":"doi:10.1109/sbgames56371.2022.9961114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sbgames56371.2022.9961114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 21st Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)","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/A5043436810","display_name":"Cr\u00edstian Marcos Weber","orcid":null},"institutions":[{"id":"https://openalex.org/I33501960","display_name":"Universidade Federal de Santa Maria","ror":"https://ror.org/01b78mz79","country_code":"BR","type":"education","lineage":["https://openalex.org/I33501960"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Cristian M. Weber","raw_affiliation_strings":["Undergraduate Program in Computer Science, Federal Univ. of Santa Maria,Santa Maria,Brazil","Undergraduate Program in Computer Science, Federal Univ. of Santa Maria, Santa Maria, Brazil"],"affiliations":[{"raw_affiliation_string":"Undergraduate Program in Computer Science, Federal Univ. of Santa Maria,Santa Maria,Brazil","institution_ids":["https://openalex.org/I33501960"]},{"raw_affiliation_string":"Undergraduate Program in Computer Science, Federal Univ. of Santa Maria, Santa Maria, Brazil","institution_ids":["https://openalex.org/I33501960"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008036042","display_name":"Edison Pignaton de Freitas","orcid":"https://orcid.org/0000-0003-4655-8889"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Edison P. Freitas","raw_affiliation_strings":["Institute of Informatics, Federal Univ. of Rio Grande do Sul,Porto Alegre,Brazil","Institute of Informatics, Federal Univ. of Rio Grande do Sul, Porto Alegre, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Federal Univ. of Rio Grande do Sul,Porto Alegre,Brazil","institution_ids":["https://openalex.org/I130442723"]},{"raw_affiliation_string":"Institute of Informatics, Federal Univ. of Rio Grande do Sul, Porto Alegre, Brazil","institution_ids":["https://openalex.org/I130442723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029891245","display_name":"Lu\u00eds A. L. Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I33501960","display_name":"Universidade Federal de Santa Maria","ror":"https://ror.org/01b78mz79","country_code":"BR","type":"education","lineage":["https://openalex.org/I33501960"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luis A. L. Silva","raw_affiliation_strings":["Federal Univ. of Santa Maria,Applied Computing Department,Santa Maria,Brazil","Applied Computing Department, Federal Univ. of Santa Maria, Santa Maria, Brazil"],"affiliations":[{"raw_affiliation_string":"Federal Univ. of Santa Maria,Applied Computing Department,Santa Maria,Brazil","institution_ids":["https://openalex.org/I33501960"]},{"raw_affiliation_string":"Applied Computing Department, Federal Univ. of Santa Maria, Santa Maria, Brazil","institution_ids":["https://openalex.org/I33501960"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043436810"],"corresponding_institution_ids":["https://openalex.org/I33501960"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11043608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T12290","display_name":"Human Motion and Animation","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.8662421703338623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6836389899253845},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6522669196128845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6438044309616089},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6267029047012329},{"id":"https://openalex.org/keywords/observer","display_name":"Observer (physics)","score":0.5257152915000916},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.49289751052856445},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4628007113933563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3630402088165283},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.360062837600708},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2194853127002716},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.1364728808403015},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.13134276866912842},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.12256255745887756},{"id":"https://openalex.org/keywords/cartography","display_name":"Cartography","score":0.11376869678497314},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0828208327293396}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.8662421703338623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836389899253845},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6522669196128845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6438044309616089},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6267029047012329},{"id":"https://openalex.org/C2780704645","wikidata":"https://www.wikidata.org/wiki/Q9251458","display_name":"Observer (physics)","level":2,"score":0.5257152915000916},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.49289751052856445},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4628007113933563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3630402088165283},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.360062837600708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2194853127002716},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.1364728808403015},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.13134276866912842},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.12256255745887756},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.11376869678497314},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0828208327293396},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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":1,"locations":[{"id":"doi:10.1109/sbgames56371.2022.9961114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sbgames56371.2022.9961114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 21st Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1504291959","https://openalex.org/W1969101827","https://openalex.org/W1970805560","https://openalex.org/W2082142117","https://openalex.org/W2089314366","https://openalex.org/W2112677235","https://openalex.org/W2134436419","https://openalex.org/W2240526870","https://openalex.org/W2245493112","https://openalex.org/W2515999487","https://openalex.org/W2592295835","https://openalex.org/W2602799623","https://openalex.org/W2785461295","https://openalex.org/W2964568892","https://openalex.org/W3106791263","https://openalex.org/W3109221829","https://openalex.org/W4283790961","https://openalex.org/W4285614298","https://openalex.org/W4287883077","https://openalex.org/W4299335686","https://openalex.org/W4301861531","https://openalex.org/W6725974673","https://openalex.org/W6840032395"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3128311703","https://openalex.org/W3101047024","https://openalex.org/W131718761","https://openalex.org/W4285089922"],"abstract_inverted_index":{"Path":[0,23],"planning":[1,24],"with":[2,32,79,92,145,152],"the":[3,13,43,50,53,71,114,121,124,128,132,153],"topographical":[4,94],"characteristics":[5],"of":[6,15,38,52,73,116,123,137],"real-world":[7,26],"terrains":[8,27,78],"has":[9],"been":[10],"investigated":[11],"in":[12,17,25,36,76,105,120],"solution":[14],"problems":[16],"simulation":[18],"systems":[19],"and":[20,135,157],"computer":[21],"games.":[22],"involves":[28],"finding":[29],"a":[30,33,67,90,106],"path":[31,69,91],"low":[34],"cost":[35,95],"terms":[37],"distance":[39],"traveled":[40],"according":[41],"to":[42,59,65,141],"terrain":[44,84,108],"relief.":[45],"This":[46,81],"work":[47,112],"investigates":[48],"how":[49],"computations":[51],"<tex":[54,159],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[55,160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$A^{\\ast}$</tex>":[56,161],"algorithm":[57],"have":[58],"be":[60],"performed":[61],"for":[62,88],"an":[63,74,100,103],"agent":[64,101],"obtain":[66],"hidden":[68],"from":[70,102],"view":[72],"observer":[75,104],"such":[77],"topography.":[80],"indicates":[82],"that":[83,96,149],"features":[85],"are":[86,150],"important":[87],"obtaining":[89],"reduced":[93],"permits":[97],"visually":[98],"hiding":[99],"given":[107],"location.":[109],"Moreover,":[110],"this":[111],"evaluates":[113],"use":[115],"deep":[117],"neural":[118],"networks":[119],"approximation":[122],"heuristic":[125],"used":[126],"by":[127],"pathfinding":[129],"algorithm,":[130],"optimizing":[131],"execution":[133],"time":[134],"number":[136],"expanded":[138],"nodes":[139],"required":[140],"compute":[142],"safe":[143],"routes":[144],"lower":[146],"topographic":[147],"costs":[148],"generated":[151],"proposed":[154],"Deep":[155],"Safe":[156],"Topographic":[158],"(DSTA*)":[162],"algorithm.":[163]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}