Loading…

General fight rule-based trajectory planning for pairwise collision avoidance in a known environment

This paper presents a general flight rule-based autonomous trajectory planning scheme for two aerial vehicles to avoid obstacles and collisions in known environments in low-altitude airspace for general aviation. Flight rules in low-altitude airspace are first introduced based on the general flight...

Full description

Saved in:
Bibliographic Details
Published in:International journal of control, automation, and systems 2014, Automation, and Systems, 12(4), , pp.813-822
Main Authors: Wang, Gang, Ge, Shuzhi Sam
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53
cites cdi_FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53
container_end_page 822
container_issue 4
container_start_page 813
container_title International journal of control, automation, and systems
container_volume 12
creator Wang, Gang
Ge, Shuzhi Sam
description This paper presents a general flight rule-based autonomous trajectory planning scheme for two aerial vehicles to avoid obstacles and collisions in known environments in low-altitude airspace for general aviation. Flight rules in low-altitude airspace are first introduced based on the general flight rules in US, UK and China, and then the suitable flight rules are embedded into the trajectory planning algorithm. It is supposed that the flight parameters, such as positions and velocities, are all available to the aerial vehicles involved in the possible conflict. Then the trajectory of each aerial vehicle is calculated by optimizing an objective function, such as distance and fuel consumption, with the constraints corresponding to the airspace traffic rules. The optimization problem is solved by receding horizon control (RHC) based mixed integer linear programming (MILP). Compared with other collision avoidance algorithms, the proposed algorithm can be adapted to plan the autonomous trajectory to avoid pairwise collision and obstacles as proposed general flight rules. Simulations show the feasibility of the proposed scheme.
doi_str_mv 10.1007/s12555-013-0006-z
format article
fullrecord <record><control><sourceid>proquest_nrf_k</sourceid><recordid>TN_cdi_nrf_kci_oai_kci_go_kr_ARTI_129606</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3357644351</sourcerecordid><originalsourceid>FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53</originalsourceid><addsrcrecordid>eNp1kU9rGzEQxUVpoW7aD9CboJdc1Gq0Gu3uMYT8g0Ch-C7k9ciVvZYcaZ2QfPrIdSAh0NPMwO89ePMY-w7yJ0jZ_iqgEFFIaISU0oinD2ympEShZa8-shlg3wmjtfnMvpSyrohRfTtjyyuKlN3IfVj9nXjejyQWrtCST9mtaZhSfuS70cUY4or7lPnOhfwQCvEhjWMoIUXu7lNYujgQD_Xgm5geIqd4H3KKW4rTV_bJu7HQt5d5wuaXF_Pza3H7--rm_OxWDE2nJoEteqeA0CyahW41dqpBDVKRNOicr4siBNAOiIzrCbVEBNLLdvAemxN2erSN2dvNEGxy4d9cJbvJ9uzP_MaC6o00r-gup7s9lcluQxlorEEp7YsFNG19XCe7iv54h67TPseao1IaWuh1c6DgSA05lZLJ210OW5cfLUh7aMgeG7K1IXtoyD5VjTpqSmXjivIb5_-KngHjLpO7</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1541719438</pqid></control><display><type>article</type><title>General fight rule-based trajectory planning for pairwise collision avoidance in a known environment</title><source>ABI/INFORM Global</source><source>Springer Nature</source><creator>Wang, Gang ; Ge, Shuzhi Sam</creator><creatorcontrib>Wang, Gang ; Ge, Shuzhi Sam</creatorcontrib><description>This paper presents a general flight rule-based autonomous trajectory planning scheme for two aerial vehicles to avoid obstacles and collisions in known environments in low-altitude airspace for general aviation. Flight rules in low-altitude airspace are first introduced based on the general flight rules in US, UK and China, and then the suitable flight rules are embedded into the trajectory planning algorithm. It is supposed that the flight parameters, such as positions and velocities, are all available to the aerial vehicles involved in the possible conflict. Then the trajectory of each aerial vehicle is calculated by optimizing an objective function, such as distance and fuel consumption, with the constraints corresponding to the airspace traffic rules. The optimization problem is solved by receding horizon control (RHC) based mixed integer linear programming (MILP). Compared with other collision avoidance algorithms, the proposed algorithm can be adapted to plan the autonomous trajectory to avoid pairwise collision and obstacles as proposed general flight rules. Simulations show the feasibility of the proposed scheme.</description><identifier>ISSN: 1598-6446</identifier><identifier>EISSN: 2005-4092</identifier><identifier>DOI: 10.1007/s12555-013-0006-z</identifier><language>eng</language><publisher>Heidelberg: Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers</publisher><subject>Aerials ; Aircraft ; Aircraft accidents &amp; safety ; Airspace ; Algorithms ; Altitude ; Aviation ; Collision avoidance ; Collision avoidance systems ; Control ; Control Applications ; Energy consumption ; Engineering ; Flight rules ; General aviation ; Linear programming ; Mechatronics ; Obstacles ; Optimization ; Planning ; Robotics ; Studies ; Trajectory planning ; Vehicles ; Velocity ; 제어계측공학</subject><ispartof>International Journal of Control, 2014, Automation, and Systems, 12(4), , pp.813-822</ispartof><rights>Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2014</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53</citedby><cites>FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1541719438?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,778,782,11671,27907,27908,36043,36044,44346</link.rule.ids><backlink>$$Uhttps://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001888451$$DAccess content in National Research Foundation of Korea (NRF)$$Hfree_for_read</backlink></links><search><creatorcontrib>Wang, Gang</creatorcontrib><creatorcontrib>Ge, Shuzhi Sam</creatorcontrib><title>General fight rule-based trajectory planning for pairwise collision avoidance in a known environment</title><title>International journal of control, automation, and systems</title><addtitle>Int. J. Control Autom. Syst</addtitle><description>This paper presents a general flight rule-based autonomous trajectory planning scheme for two aerial vehicles to avoid obstacles and collisions in known environments in low-altitude airspace for general aviation. Flight rules in low-altitude airspace are first introduced based on the general flight rules in US, UK and China, and then the suitable flight rules are embedded into the trajectory planning algorithm. It is supposed that the flight parameters, such as positions and velocities, are all available to the aerial vehicles involved in the possible conflict. Then the trajectory of each aerial vehicle is calculated by optimizing an objective function, such as distance and fuel consumption, with the constraints corresponding to the airspace traffic rules. The optimization problem is solved by receding horizon control (RHC) based mixed integer linear programming (MILP). Compared with other collision avoidance algorithms, the proposed algorithm can be adapted to plan the autonomous trajectory to avoid pairwise collision and obstacles as proposed general flight rules. Simulations show the feasibility of the proposed scheme.</description><subject>Aerials</subject><subject>Aircraft</subject><subject>Aircraft accidents &amp; safety</subject><subject>Airspace</subject><subject>Algorithms</subject><subject>Altitude</subject><subject>Aviation</subject><subject>Collision avoidance</subject><subject>Collision avoidance systems</subject><subject>Control</subject><subject>Control Applications</subject><subject>Energy consumption</subject><subject>Engineering</subject><subject>Flight rules</subject><subject>General aviation</subject><subject>Linear programming</subject><subject>Mechatronics</subject><subject>Obstacles</subject><subject>Optimization</subject><subject>Planning</subject><subject>Robotics</subject><subject>Studies</subject><subject>Trajectory planning</subject><subject>Vehicles</subject><subject>Velocity</subject><subject>제어계측공학</subject><issn>1598-6446</issn><issn>2005-4092</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kU9rGzEQxUVpoW7aD9CboJdc1Gq0Gu3uMYT8g0Ch-C7k9ciVvZYcaZ2QfPrIdSAh0NPMwO89ePMY-w7yJ0jZ_iqgEFFIaISU0oinD2ympEShZa8-shlg3wmjtfnMvpSyrohRfTtjyyuKlN3IfVj9nXjejyQWrtCST9mtaZhSfuS70cUY4or7lPnOhfwQCvEhjWMoIUXu7lNYujgQD_Xgm5geIqd4H3KKW4rTV_bJu7HQt5d5wuaXF_Pza3H7--rm_OxWDE2nJoEteqeA0CyahW41dqpBDVKRNOicr4siBNAOiIzrCbVEBNLLdvAemxN2erSN2dvNEGxy4d9cJbvJ9uzP_MaC6o00r-gup7s9lcluQxlorEEp7YsFNG19XCe7iv54h67TPseao1IaWuh1c6DgSA05lZLJ210OW5cfLUh7aMgeG7K1IXtoyD5VjTpqSmXjivIb5_-KngHjLpO7</recordid><startdate>20140801</startdate><enddate>20140801</enddate><creator>Wang, Gang</creator><creator>Ge, Shuzhi Sam</creator><general>Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers</general><general>Springer Nature B.V</general><general>제어·로봇·시스템학회</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><scope>ACYCR</scope></search><sort><creationdate>20140801</creationdate><title>General fight rule-based trajectory planning for pairwise collision avoidance in a known environment</title><author>Wang, Gang ; Ge, Shuzhi Sam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Aerials</topic><topic>Aircraft</topic><topic>Aircraft accidents &amp; safety</topic><topic>Airspace</topic><topic>Algorithms</topic><topic>Altitude</topic><topic>Aviation</topic><topic>Collision avoidance</topic><topic>Collision avoidance systems</topic><topic>Control</topic><topic>Control Applications</topic><topic>Energy consumption</topic><topic>Engineering</topic><topic>Flight rules</topic><topic>General aviation</topic><topic>Linear programming</topic><topic>Mechatronics</topic><topic>Obstacles</topic><topic>Optimization</topic><topic>Planning</topic><topic>Robotics</topic><topic>Studies</topic><topic>Trajectory planning</topic><topic>Vehicles</topic><topic>Velocity</topic><topic>제어계측공학</topic><toplevel>online_resources</toplevel><creatorcontrib>Wang, Gang</creatorcontrib><creatorcontrib>Ge, Shuzhi Sam</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><collection>Korean Citation Index</collection><jtitle>International journal of control, automation, and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Gang</au><au>Ge, Shuzhi Sam</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>General fight rule-based trajectory planning for pairwise collision avoidance in a known environment</atitle><jtitle>International journal of control, automation, and systems</jtitle><stitle>Int. J. Control Autom. Syst</stitle><date>2014-08-01</date><risdate>2014</risdate><volume>12</volume><issue>4</issue><spage>813</spage><epage>822</epage><pages>813-822</pages><issn>1598-6446</issn><eissn>2005-4092</eissn><abstract>This paper presents a general flight rule-based autonomous trajectory planning scheme for two aerial vehicles to avoid obstacles and collisions in known environments in low-altitude airspace for general aviation. Flight rules in low-altitude airspace are first introduced based on the general flight rules in US, UK and China, and then the suitable flight rules are embedded into the trajectory planning algorithm. It is supposed that the flight parameters, such as positions and velocities, are all available to the aerial vehicles involved in the possible conflict. Then the trajectory of each aerial vehicle is calculated by optimizing an objective function, such as distance and fuel consumption, with the constraints corresponding to the airspace traffic rules. The optimization problem is solved by receding horizon control (RHC) based mixed integer linear programming (MILP). Compared with other collision avoidance algorithms, the proposed algorithm can be adapted to plan the autonomous trajectory to avoid pairwise collision and obstacles as proposed general flight rules. Simulations show the feasibility of the proposed scheme.</abstract><cop>Heidelberg</cop><pub>Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers</pub><doi>10.1007/s12555-013-0006-z</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1598-6446
ispartof International Journal of Control, 2014, Automation, and Systems, 12(4), , pp.813-822
issn 1598-6446
2005-4092
language eng
recordid cdi_nrf_kci_oai_kci_go_kr_ARTI_129606
source ABI/INFORM Global; Springer Nature
subjects Aerials
Aircraft
Aircraft accidents & safety
Airspace
Algorithms
Altitude
Aviation
Collision avoidance
Collision avoidance systems
Control
Control Applications
Energy consumption
Engineering
Flight rules
General aviation
Linear programming
Mechatronics
Obstacles
Optimization
Planning
Robotics
Studies
Trajectory planning
Vehicles
Velocity
제어계측공학
title General fight rule-based trajectory planning for pairwise collision avoidance in a known environment
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T21%3A45%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_nrf_k&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=General%20fight%20rule-based%20trajectory%20planning%20for%20pairwise%20collision%20avoidance%20in%20a%20known%20environment&rft.jtitle=International%20journal%20of%20control,%20automation,%20and%20systems&rft.au=Wang,%20Gang&rft.date=2014-08-01&rft.volume=12&rft.issue=4&rft.spage=813&rft.epage=822&rft.pages=813-822&rft.issn=1598-6446&rft.eissn=2005-4092&rft_id=info:doi/10.1007/s12555-013-0006-z&rft_dat=%3Cproquest_nrf_k%3E3357644351%3C/proquest_nrf_k%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c382t-575fa21e56b3b474582354102e065aaf02e2e5114a1ee6a9e540551e4d7cff53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1541719438&rft_id=info:pmid/&rfr_iscdi=true