• DocumentCode
    1677055
  • Title

    A path planning algorithm for Surveillance UAVs with timing mission constrains

  • Author

    Lim, Chan-Wook ; Park, Sanghyuk ; Ryoo, Chang-Kyung ; Choi, Keeyoung ; Cho, Jung-Hee

  • Author_Institution
    Dept. of Aerosp. Eng., Inha Univ., Incheon, South Korea
  • fYear
    2010
  • Firstpage
    2371
  • Lastpage
    2375
  • Abstract
    In this paper, we propose a path generation algorithm with timing mission constrains in consideration of observing equipments, required observation time, line of sight, and flight capability of a UAV for effective ISR missions. The proposed algorithm is composed of the following steps: (1) target´s modeling for LOS ranging, equipments performance, (2) the determination of target observation order the based on modified TSP(Travelling Salesman Problem) with time constraints, (3) the determination of line segments for target observation following target observation order, and (4) the generation Dubins curve for connecting line segments. Although the proposed method provides only a suboptimal solution, it is practical and produces a reference path for a UAV with ISR missions in almost real time.
  • Keywords
    aircraft; military systems; path planning; remotely operated vehicles; surveillance; travelling salesman problems; Dubins curve; ISR missions; LOS ranging; path planning algorithm; surveillance UAV; timing mission constrains; travelling salesman problem; Cameras; Heuristic algorithms; Image segmentation; Time factors; Timing; Traveling salesman problems; Unmanned aerial vehicles; Dubins curve; Intelligence; Path generation; Path planning; Segment; Surveillance and Reconnaissance (ISR); Target modeling; Traveling Salesman Problem (TSP); Traveling Salesman Problem with Time Windows (TSPTW); Unmanned Aerial Vehicle (UAV);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Automation and Systems (ICCAS), 2010 International Conference on
  • Conference_Location
    Gyeonggi-do
  • Print_ISBN
    978-1-4244-7453-0
  • Electronic_ISBN
    978-89-93215-02-1
  • Type

    conf

  • Filename
    5669935