{"id":"https://openalex.org/W2982475064","doi":"https://doi.org/10.1109/icstcc.2019.8886091","title":"Path Planning for Autonomous Drones using 3D Rectangular Cuboid Decomposition","display_name":"Path Planning for Autonomous Drones using 3D Rectangular Cuboid Decomposition","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2982475064","doi":"https://doi.org/10.1109/icstcc.2019.8886091","mag":"2982475064"},"language":"en","primary_location":{"id":"doi:10.1109/icstcc.2019.8886091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icstcc.2019.8886091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 23rd International Conference on System Theory, Control and Computing (ICSTCC)","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/A5058824423","display_name":"Marian Lupa\u015fcu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Marian Lupascu","raw_affiliation_strings":["Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024836791","display_name":"Sofia Hu\u015ftiu","orcid":"https://orcid.org/0000-0002-2146-5603"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Sofia Hustiu","raw_affiliation_strings":["Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003446848","display_name":"Adrian Burlacu","orcid":"https://orcid.org/0000-0003-3844-1808"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Adrian Burlacu","raw_affiliation_strings":["Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046534630","display_name":"Marius Kloetzer","orcid":"https://orcid.org/0000-0003-4338-0421"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Marius Kloetzer","raw_affiliation_strings":["Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]},{"raw_affiliation_string":"Department of Automatic Control and Applied Informatics, Technical University of Iasi, Romania","institution_ids":["https://openalex.org/I4210108695"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058824423"],"corresponding_institution_ids":["https://openalex.org/I4210108695"],"apc_list":null,"apc_paid":null,"fwci":0.7086,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.7542848,"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":"119","last_page":"124"},"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/T11133","display_name":"UAV Applications and Optimization","score":0.9979000091552734,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9926000237464905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cuboid","display_name":"Cuboid","score":0.9520927667617798},{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.7310439348220825},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6864113211631775},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6164560914039612},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6021497845649719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5857073068618774},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5818653702735901},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5643484592437744},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44700080156326294},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.433192640542984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42377984523773193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3605842590332031},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.3281603455543518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26958826184272766},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2369592785835266},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1983165144920349},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1622905433177948},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0895301103591919},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06894844770431519}],"concepts":[{"id":"https://openalex.org/C203527163","wikidata":"https://www.wikidata.org/wiki/Q262959","display_name":"Cuboid","level":2,"score":0.9520927667617798},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.7310439348220825},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6864113211631775},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6164560914039612},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6021497845649719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5857073068618774},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5818653702735901},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5643484592437744},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44700080156326294},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.433192640542984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42377984523773193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3605842590332031},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.3281603455543518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26958826184272766},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2369592785835266},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1983165144920349},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1622905433177948},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0895301103591919},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06894844770431519},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icstcc.2019.8886091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icstcc.2019.8886091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 23rd International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W101508493","https://openalex.org/W131069610","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1631530940","https://openalex.org/W2036186681","https://openalex.org/W2056864430","https://openalex.org/W2106380037","https://openalex.org/W2112271657","https://openalex.org/W2116647221","https://openalex.org/W2229747717","https://openalex.org/W2343223723","https://openalex.org/W2492353954","https://openalex.org/W2510239027","https://openalex.org/W2543592198","https://openalex.org/W2752885492","https://openalex.org/W2762698157","https://openalex.org/W2900980292","https://openalex.org/W2907813167","https://openalex.org/W2962691117","https://openalex.org/W4210631977","https://openalex.org/W4241021229","https://openalex.org/W4242811155","https://openalex.org/W4251391716","https://openalex.org/W6605295560","https://openalex.org/W6725652775"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W2139391407","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2863424594","https://openalex.org/W2372633663","https://openalex.org/W4388720133","https://openalex.org/W2564325388","https://openalex.org/W2108906364"],"abstract_inverted_index":{"This":[0],"paper":[1],"targets":[2],"the":[3,24,30,43,58,68,71],"problem":[4],"of":[5,10,42,70],"generating":[6],"a":[7,37,52],"trajectory":[8],"free":[9,44],"collisions":[11],"for":[12,57],"autonomous":[13],"drones":[14],"evolving":[15],"in":[16],"3D":[17,38],"static":[18],"environments.":[19],"To":[20],"solve":[21],"this":[22],"problem,":[23],"work":[25],"is":[26,49],"focused":[27],"on":[28],"extending":[29],"classical":[31],"2D":[32],"rectangular":[33,39],"cell":[34],"decomposition":[35],"towards":[36],"cuboid":[40],"representation":[41],"space.":[45],"The":[46],"new":[47],"approach":[48],"compared":[50],"to":[51],"rapidly-exploring":[53],"random":[54],"tree":[55],"method":[56],"same":[59],"scenario.":[60],"Testing":[61],"and":[62],"evaluation":[63],"through":[64],"numerical":[65],"simulation":[66],"prove":[67],"effectiveness":[69],"proposed":[72],"path":[73],"planning":[74],"approach.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}