YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASCE
    • Journal of Aerospace Engineering
    • View Item
    •   YE&T Library
    • ASCE
    • Journal of Aerospace Engineering
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Nonlinear Multiobjective Time-Dependent TF/TA Trajectory Planning Using a Network Flow–Based Algorithm

    Source: Journal of Aerospace Engineering:;2016:;Volume ( 029 ):;issue: 002
    Author:
    R. Zardashti
    ,
    M. J. Yazdanpanah
    ,
    A. A. Nikkhah
    DOI: 10.1061/(ASCE)AS.1943-5525.0000527
    Publisher: American Society of Civil Engineers
    Abstract: This paper studies the problem of finding the optimum time-dependent trajectory for an unmanned aerial vehicle (UAV) or any aerial robot flying on a low-altitude terrain following/threat avoidance (TF/TA) mission. Using a grid-based discrete scheme, a modified minimum cost network flow (MCNF) algorithm over a large-scale network is proposed. Using the Digital Terrain Elevation Data (DTED) and discrete dynamic equations of motion, the four-dimensional (4D) trajectory (three spatial and one time dimensions) from a source to a destination is obtained exactly through minimization of a cost functional subject to the nonlinear dynamics and mission constraints of the UAV. Several objectives (including the arc length, fuel consumption, flight time, and risk of threat regions) may be assigned to each arc in the network. The algorithm uses scalarization, by which a multiobjective problem can be tackled by repeatedly solving a single-objective subproblem. An attempt is made to reduce the time order of the algorithm using innovative techniques to construct a polynomial-time algorithm. Moreover, owing to the increasing deviation of the inertial navigation system (INS) in terms of time, flying safely and avoding a collision with terrain at low altitudes is a significant problem in the trajectory design of this type of vehicle. An attempt is made to add this constraint to the algorithm to produce a practical and safe trajectory with no evident increase in the complexity and execution time. Numerical results are presented to verify the capability of the proposed approach to generate an admissible trajectory in the minimum possible time compared to previous approaches.
    • Download: (7.575Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Statistics

      Nonlinear Multiobjective Time-Dependent TF/TA Trajectory Planning Using a Network Flow–Based Algorithm

    URI
    https://yetl.yabesh.ir/yetl1/handle/yetl/4244524
    Collections
    • Journal of Aerospace Engineering

    Show full item record

    contributor authorR. Zardashti
    contributor authorM. J. Yazdanpanah
    contributor authorA. A. Nikkhah
    date accessioned2017-12-30T13:00:55Z
    date available2017-12-30T13:00:55Z
    date issued2016
    identifier other%28ASCE%29AS.1943-5525.0000527.pdf
    identifier urihttp://138.201.223.254:8080/yetl1/handle/yetl/4244524
    description abstractThis paper studies the problem of finding the optimum time-dependent trajectory for an unmanned aerial vehicle (UAV) or any aerial robot flying on a low-altitude terrain following/threat avoidance (TF/TA) mission. Using a grid-based discrete scheme, a modified minimum cost network flow (MCNF) algorithm over a large-scale network is proposed. Using the Digital Terrain Elevation Data (DTED) and discrete dynamic equations of motion, the four-dimensional (4D) trajectory (three spatial and one time dimensions) from a source to a destination is obtained exactly through minimization of a cost functional subject to the nonlinear dynamics and mission constraints of the UAV. Several objectives (including the arc length, fuel consumption, flight time, and risk of threat regions) may be assigned to each arc in the network. The algorithm uses scalarization, by which a multiobjective problem can be tackled by repeatedly solving a single-objective subproblem. An attempt is made to reduce the time order of the algorithm using innovative techniques to construct a polynomial-time algorithm. Moreover, owing to the increasing deviation of the inertial navigation system (INS) in terms of time, flying safely and avoding a collision with terrain at low altitudes is a significant problem in the trajectory design of this type of vehicle. An attempt is made to add this constraint to the algorithm to produce a practical and safe trajectory with no evident increase in the complexity and execution time. Numerical results are presented to verify the capability of the proposed approach to generate an admissible trajectory in the minimum possible time compared to previous approaches.
    publisherAmerican Society of Civil Engineers
    titleNonlinear Multiobjective Time-Dependent TF/TA Trajectory Planning Using a Network Flow–Based Algorithm
    typeJournal Paper
    journal volume29
    journal issue2
    journal titleJournal of Aerospace Engineering
    identifier doi10.1061/(ASCE)AS.1943-5525.0000527
    page04015041
    treeJournal of Aerospace Engineering:;2016:;Volume ( 029 ):;issue: 002
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian