{"id":"https://openalex.org/W4322731596","doi":"https://doi.org/10.1109/iccp56966.2022.10053965","title":"Pathfinding in a 3D Grid for UAV Navigation","display_name":"Pathfinding in a 3D Grid for UAV Navigation","publication_year":2022,"publication_date":"2022-09-22","ids":{"openalex":"https://openalex.org/W4322731596","doi":"https://doi.org/10.1109/iccp56966.2022.10053965"},"language":"en","primary_location":{"id":"doi:10.1109/iccp56966.2022.10053965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp56966.2022.10053965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 18th International Conference on Intelligent Computer Communication and Processing (ICCP)","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/A5067860606","display_name":"Vivian Chiciudean","orcid":"https://orcid.org/0009-0002-0798-5247"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Vivian Chiciudean","raw_affiliation_strings":["Technical University of Cluj-Napoca,Computer Science Department,Cluj-Napoca,Romania","Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca,Computer Science Department,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I158333966"]},{"raw_affiliation_string":"Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I158333966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061493057","display_name":"Florin Oniga","orcid":"https://orcid.org/0000-0003-4875-2220"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Florin Oniga","raw_affiliation_strings":["Technical University of Cluj-Napoca,Computer Science Department,Cluj-Napoca,Romania","Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca,Computer Science Department,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I158333966"]},{"raw_affiliation_string":"Computer Science Department, Technical University of Cluj-Napoca, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I158333966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I158333966"],"apc_list":null,"apc_paid":null,"fwci":0.2774,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64118943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"311"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.998199999332428,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/voxel","display_name":"Voxel","score":0.6773368716239929},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6533904075622559},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6359566450119019},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.601763129234314},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.576068103313446},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5756663084030151},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5648459196090698},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5391268134117126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4976959526538849},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.4587138295173645},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.44395965337753296},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.44166338443756104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4328278601169586},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4156540036201477},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.38668543100357056},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36860591173171997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2662197947502136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19666537642478943},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.17903044819831848},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14532512426376343},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08707600831985474},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08355739712715149}],"concepts":[{"id":"https://openalex.org/C54170458","wikidata":"https://www.wikidata.org/wiki/Q663554","display_name":"Voxel","level":2,"score":0.6773368716239929},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6533904075622559},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6359566450119019},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.601763129234314},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.576068103313446},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5756663084030151},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5648459196090698},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5391268134117126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4976959526538849},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.4587138295173645},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.44395965337753296},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.44166338443756104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4328278601169586},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4156540036201477},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.38668543100357056},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36860591173171997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2662197947502136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19666537642478943},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.17903044819831848},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14532512426376343},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08707600831985474},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08355739712715149},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccp56966.2022.10053965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp56966.2022.10053965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 18th International Conference on Intelligent Computer Communication and Processing (ICCP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1140243306","https://openalex.org/W1576883264","https://openalex.org/W2089314366","https://openalex.org/W2129038678","https://openalex.org/W2171330332","https://openalex.org/W2295752869","https://openalex.org/W2403099801","https://openalex.org/W2471962767","https://openalex.org/W2507893898","https://openalex.org/W2887081507","https://openalex.org/W2890807499","https://openalex.org/W3035531970","https://openalex.org/W3038457211","https://openalex.org/W3045642835","https://openalex.org/W4244382951","https://openalex.org/W4245901107","https://openalex.org/W6629993715","https://openalex.org/W6679201544","https://openalex.org/W6753822870"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W2128644323","https://openalex.org/W4221129498"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,120],"propose":[4],"an":[5,24,98],"approach":[6],"for":[7,86,174],"computing":[8],"the":[9,32,45,51,58,64,69,74,78,87,94,107,124,128,133,137,141,166,170,178],"3D":[10,34,76,108,142,179],"trajectory":[11],"of":[12,68,106,113,132,140],"UAVs":[13],"between":[14],"two":[15],"locations":[16],"when":[17],"obstacles":[18],"are":[19,159],"present.":[20],"The":[21,54,89,144],"result":[22],"is":[23,37,48,91,110],"obstruction":[25],"free":[26],"path,":[27],"close":[28],"to":[29,63,92,122,136],"optimal.":[30],"First,":[31],"precomputed":[33],"environment":[35],"map":[36],"converted":[38],"into":[39],"a":[40],"discrete":[41],"voxel":[42,70,134],"space.":[43,53],"Next,":[44],"$\\mathrm{A}^{*}$":[46,55,125,172],"algorithm":[47],"applied":[49],"on":[50,161],"discretized":[52],"method":[56,168],"provides":[57],"optimal":[59],"path":[60,80,96,109,126,173],"with":[61],"respect":[62],"graph":[65,129],"equivalent":[66,130],"representation":[67,105,131,139],"space,":[71],"however":[72],"in":[73,177],"continuous":[75,138],"space":[77,135],"resulting":[79,95,145],"will":[81],"cause":[82],"unnecessary":[83],"steering":[84],"maneuvers":[85],"UAV.":[88],"solution":[90],"smooth":[93],"using":[97],"iterative":[99],"linear":[100],"approximation":[101],"approach.":[102],"A":[103],"new":[104],"obtained,":[111],"consisting":[112],"line":[114],"segments":[115],"and":[116],"control":[117,146],"points.":[118],"Therefore,":[119],"manage":[121],"transform":[123],"from":[127],"environment.":[143,180],"points":[147],"can":[148],"be":[149],"used":[150],"as":[151],"intermediate":[152],"destinations":[153],"during":[154],"autonomous":[155],"UAV":[156,175],"navigation.":[157],"Experiments":[158],"performed":[160],"multiple":[162],"scenarios,":[163],"demonstrating":[164],"that":[165],"proposed":[167],"shortens":[169],"standard":[171],"navigation":[176]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}