A Probabilistic Algorithm for Mode Based Motion Planning of Agile Unmanned Air Vehicles in Complex Environments

نویسندگان

  • Emre Koyuncu
  • N. Kemal Ure
  • Gokhan Inalhan
چکیده

In this work, we consider the design of a probabilistic trajectory planner for a highly maneuverable unmanned air vehicle flying in a dense and complex city-like environment. Our design hinges on the decomposition of the problem into a) flight controls of fundamental agile-maneuvering flight modes and b) trajectory planning using these controlled flight modes from which almost any aggressive maneuver (or a combination of) can be created. This allows significant decreases in control input space and thus search dimensions, resulting in a natural way to design controllers and implement trajectory planning using the closed-form flight modes. Focusing on the trajectory planning part, we provide a three-step probabilistic trajectory planner. In the first step, the algorithm rapidly explores the environment through a randomized reachability tree search using an approximate line segment models. The resulting connecting path is converted into flight milestones through a line-of-sight segmentation. This path and the corresponding milestones are refined with a single-query Probabilistic Road Map (PRM) implementation that creates dynamically feasible flight paths with distinct flight mode selections. We address the problematic issue of narrow passages through non-uniform distributed capture regions, which prefer state solutions that align the vehicle to enter the milestone region in line with the next milestone to come. Numerical simulations in 3D and 2D demonstrate the ability of the method to provide real-time solutions in dense and complex environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamically Feasible Probabilistic Motion Planning in Complex Environments for UAVs

In this work, we consider the problem of generating practically implementable path plan for flying unmanned aerial vehicles in 3D Complex environments. This problem is complicated by the fact that, generation of the dynamically and geometrically feasible flight trajectories for agile maneuver profiles requires search of nonlinear state space of the aircraft dynamics. This work suggests a two st...

متن کامل

An Adaptive Path Planning Algorithm for Cooperating Unmanned Air Vehicles

An adaptive path planning algorithm is presented for cooperating Unmanned Air Vehicles (UAVs) that are used to deploy and operate land-based sensor networks. The algorithm employs a global cost function to generate paths for the UAVs, and adapts the paths to exceptions that might occur. Examples are provided of the paths and adaptation.

متن کامل

Static and Dynamic Obstacle Avoidance in Miniature Air Vehicles

Small unmanned air vehicles are limited in sensor weight and power such that detection and avoidance of unknown obstacles during flight is difficult. This paper presents a low power low weight method of detection using a laser range finder. In addition, a rapidly-exploring random tree algorithm to generate waypoint paths around obstacles known a priori is presented, and a dynamic geometric algo...

متن کامل

Development of a Real-time Hierarchical 3d Path Planning Algorithm for Unmanned Aerial Vehicles

Title of thesis: DEVELOPMENT OF A REAL-TIME HIERARCHICAL 3D PATH PLANNING ALGORITHM FOR UNMANNED AERIAL VEHICLES Matthew David Solomon, Master of Science, 2016 Thesis directed by: Dr. Huan Xu Department of Aerospace Engineering Unmanned aerial vehicles (UAVs) frequently operate in partially or entirely unknown environments. As the vehicle traverses the environment and detects new obstacles, rap...

متن کامل

Aiaa 2000-4056 Real-time Motion Planning for Agile Autonomous Vehicles

The operation of an autonomous vehicle in an unknown, dynamic environment i s a v ery complex problem, especially when the vehicle is required to use its full maneuvering capabilities, and to react in real time to changes in the operational environment. A new class of algorithms, based on the construction of probabilistic roadmaps, has been recently introduced, and proven to provide a very fast...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008