{"id":"https://openalex.org/W2971985902","doi":"https://doi.org/10.1109/iros40897.2019.8968502","title":"Fast Trajectory Planning for Multiple Quadrotors using Relative Safe Flight Corridor","display_name":"Fast Trajectory Planning for Multiple Quadrotors using Relative Safe Flight Corridor","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2971985902","doi":"https://doi.org/10.1109/iros40897.2019.8968502","mag":"2971985902"},"language":"en","primary_location":{"id":"doi:10.1109/iros40897.2019.8968502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1909.02896","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100650928","display_name":"Jungwon Park","orcid":"https://orcid.org/0000-0003-2927-4331"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jungwon Park","raw_affiliation_strings":["Seoul National University,Department of Mechanical and Aerospace Engineering,Seoul,South Korea","Seoul National Univ.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University,Department of Mechanical and Aerospace Engineering,Seoul,South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National Univ.#TAB#","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073996122","display_name":"H. Jin Kim","orcid":"https://orcid.org/0000-0002-6819-1136"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"H. Jin Kim","raw_affiliation_strings":["Seoul National University,Department of Mechanical and Aerospace Engineering,Seoul,South Korea","Seoul National Univ.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University,Department of Mechanical and Aerospace Engineering,Seoul,South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National Univ.#TAB#","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"596","last_page":"603"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9829000234603882,"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/trajectory","display_name":"Trajectory","score":0.7728827595710754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5794345736503601},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5686801671981812},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.561714231967926},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5373574495315552},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5367101430892944},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.5043016672134399},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4661276340484619},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4405921995639801},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43429261445999146},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3289337158203125},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.32871881127357483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.284389853477478},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.153304785490036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14201244711875916}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7728827595710754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5794345736503601},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5686801671981812},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.561714231967926},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5373574495315552},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5367101430892944},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.5043016672134399},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4661276340484619},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4405921995639801},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43429261445999146},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3289337158203125},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.32871881127357483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.284389853477478},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.153304785490036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14201244711875916},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/iros40897.2019.8968502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1909.02896","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.02896","pdf_url":"https://arxiv.org/pdf/1909.02896","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"mag:2971985902","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1909.02896.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1909.02896","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1909.02896","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1909.02896","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.02896","pdf_url":"https://arxiv.org/pdf/1909.02896","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321681","display_name":"Ministry of Trade, Industry and Energy","ror":"https://ror.org/008nkqk13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2971985902.pdf","grobid_xml":"https://content.openalex.org/works/W2971985902.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1989407213","https://openalex.org/W2062731992","https://openalex.org/W2084474153","https://openalex.org/W2115344771","https://openalex.org/W2124015815","https://openalex.org/W2133844819","https://openalex.org/W2136207702","https://openalex.org/W2147756883","https://openalex.org/W2162991084","https://openalex.org/W2165188227","https://openalex.org/W2181845023","https://openalex.org/W2322076341","https://openalex.org/W2565972716","https://openalex.org/W2565998605","https://openalex.org/W2573311857","https://openalex.org/W2587415290","https://openalex.org/W2600080636","https://openalex.org/W2738298787","https://openalex.org/W2787876816","https://openalex.org/W2797693573","https://openalex.org/W2886374915","https://openalex.org/W2891491652","https://openalex.org/W2914296650","https://openalex.org/W6629161821","https://openalex.org/W6758754608"],"related_works":["https://openalex.org/W3003294137","https://openalex.org/W2587415290","https://openalex.org/W2891491652","https://openalex.org/W2291160178","https://openalex.org/W2912952941","https://openalex.org/W3036124189","https://openalex.org/W1988543053","https://openalex.org/W2223813397","https://openalex.org/W3112558153","https://openalex.org/W2962787639","https://openalex.org/W1990297170","https://openalex.org/W3137344536","https://openalex.org/W2940876386","https://openalex.org/W2772356073","https://openalex.org/W2327253585","https://openalex.org/W3049171653","https://openalex.org/W3114626444","https://openalex.org/W3128381983","https://openalex.org/W2140130304","https://openalex.org/W3090914879"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,16,27,55,70,82,115,123],"new":[4],"trajectory":[5,80,89,110],"planning":[6,90],"method":[7,106],"for":[8,39,111,118],"multiple":[9],"quadrotors":[10],"in":[11],"obstacle-dense":[12],"environments.":[13],"We":[14,77],"suggest":[15],"relative":[17,49],"safe":[18,24,71],"flight":[19,72,134],"corridor":[20,73],"(RSFC)":[21],"to":[22,35,60,68],"model":[23],"region":[25],"between":[26],"pair":[28],"of":[29,48],"agents,":[30],"and":[31,75,86,102,117,125,132],"it":[32,126],"is":[33,66,127],"used":[34,67],"generate":[36,61],"linear":[37,98],"constraints":[38,99],"inter-collision":[40],"avoidance":[41],"by":[42],"utilizing":[43],"the":[44,79,88],"convex":[45],"hull":[46],"property":[47],"Bernstein":[50,84],"polynomial.":[51],"Our":[52],"approach":[53],"employs":[54],"graph-based":[56],"multi-agent":[57],"pathfinding":[58],"algorithm":[59],"an":[62],"initial":[63],"trajectory,":[64],"which":[65],"construct":[69],"(SFC)":[74],"RSFC.":[76,103],"express":[78],"as":[81],"piecewise":[83],"polynomial":[85],"formulate":[87],"problem":[91,96],"into":[92],"one":[93],"quadratic":[94],"programming":[95],"using":[97],"from":[100],"SFC":[101],"The":[104],"proposed":[105],"can":[107],"compute":[108],"collision-free":[109],"16":[112],"agents":[113,120],"within":[114],"second":[116],"64":[119],"less":[121],"than":[122],"minute,":[124],"validated":[128],"both":[129],"through":[130],"simulation":[131],"indoor":[133],"test.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}