Time-optimal paths for a Dubins airplane

  title={Time-optimal paths for a Dubins airplane},
  author={Hamidreza Chitsaz and Steven M. LaValle},
  journal={2007 46th IEEE Conference on Decision and Control},
  • H. Chitsaz, S. LaValle
  • Published 1 December 2007
  • Mathematics
  • 2007 46th IEEE Conference on Decision and Control
We consider finding a time-optimal trajectory for an airplane from some starting point and orientation to some final point and orientation. Our model extends the Dubins car by L.E. Dubins (1957) to have altitude, which leads to Dubins airplane. We assume that the system has independent bounded control over the altitude velocity as well as the turning rate in the plane. Through the use of the Pontryagin Maximum Principle, we characterize the time-optimal trajectories for the system. They are… 

Figures from this paper

Geometric Modeling of Dubins Airplane Movement and its Metric
The time-optimal trajectory for an airplane from some starting point to some final point is studied by many authors. Here, we consider the extension of robot planer motion of Dubins model in three
Time optimal control in presence of moving obstacles for a Dubins airplane
It is shown that for a Dubins airplane with an initial position, the control variable can be obtained using the exact penalty function method so that the airplane reaches the end position in the shortest time in the presence of obstacles.
Parametrization of nonlinear trajectory for time optimal 2D path planning for Unmanned Aerial Vehicles
This paper presents an effective path decision method to find a two-dimension path that is time optimal and obstacle free using parametrization in Complex domain. Such a path is used only for moving
Cooperative Aerial Tracking and Rendezvous Along Time-Optimal 3-Dimensional Curves
A low computation cost, unconstrained optimization routine is presented that can be used to determine a time-optimal path that will result in the interception of another aircraft.
Rectilinear Path Following in 3D Space
The numerical method used here for simulation is based on multiple shooting and is found to be comparatively more efficient than other methods for solving such two point boundary value problem.
Time-Optimal Motion of Spatial Dubins Systems
This paper presents a generic numerical approach to find the kinematic time-optimal trajectories for 3D rigid bodies with a finite set of translation, rotation, and screw controls, in an
Motivated by a fixed-speed, fixed-altitude Unmanned Aerial Vehicle (UAV), we seek to control the turning rate of a planar Dubins vehicle that tracks an unpredictable target at a nominal standoff
Optimal path planning for an aerial vehicle in 3D space
This work addresses optimal path planning in three-dimensional space for an aerial vehicle with bounded turn radius by generating an optimal path of minimum length when the initial and final positions and orientations of the vehicle are given.
Optimal Trajectory Planning for Unmanned Aerial Vehicles in Three-Dimensional Space
T HIS paper generates an optimal path from an initial configuration (position, heading, and flight-path angle) to a final configuration in three-dimensional (3-D) space for a turn-rateconstrained
An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles
Using an exact penalty function method, the existence of the control variable for a Dubins airplane with given initial and final positions is shown so that the airplane could reach its destination in the shortest time while avoiding fixed and moving obstacles.


Optimal path planning on matrix Lie groups
The problem is to plan an optimal trajectory for an airplane moving at a constant velocity from some starting point and orientation to some final point and orientation. The problem is formulated as
Obstacle distance for car-like robots
This paper shows how to compute the nonholonomic distance between a pointwise car-like robot and polygonal obstacles and develops algorithms based on the convexity analysis of the reachable set.
Shortest paths synthesis for a car-like robot
A shortest path synthesis is determined by providing, at each point, an optimal control law to steer the robot to the origin by combining the necessary conditions given by Pontryagin's maximum principle with geometric reasoning.
Shortest paths to obstacles for a polygonal car-like robot
The paper shows how to compute the nonholonomic distance between a car-like robot of polygonal shape and polygonal obstacles. Adopting an optimal control point of view, we use transversality
Shortest Paths for a Car-like Robot to Manifolds in Configuration Space
This research extends Reeds and Shepp's results to find the shortest feasible path between a point and a manifold in configuration space and is based on the Lagrange method for optimizing a function while constrained to a manifold.
An Explicit Characterization of Minimum Wheel-Rotation Paths for Differential-Drives
This paper characterizes shortest paths for differential-drive mobile robots by classifying solutions in the spirit of Dubins curves and Reeds-Shepp curves for car-like robots. Not only are optimal
Planning smooth paths for mobile robots
  • Paul E. Jacobs, J. Canny
  • Computer Science
    Proceedings, 1989 International Conference on Robotics and Automation
  • 1989
The authors consider the problem of planning paths for a robot which has a minimum turning radius and describes a graph search algorithm which divides the configuration space into sample trajectories which satisfy the nonholonomic constraints imposed.
Optimal path planning for unmanned air vehicles with kinematic and tactical constraints
  • Guang Yang, V. Kapila
  • Engineering
    Proceedings of the 41st IEEE Conference on Decision and Control, 2002.
  • 2002
The existence of an optimal path class satisfying the UAV kinematic constraints and vector calculus are exploited to reduce this class of optimal path-planning problems for unmanned air vehicles to a parameter optimization problem.
Planning constrained motion
The decidability of the reachability question: “Given a source placement and a target placement, is there a curvature-constrained path from source to target avoiding obstacles?” is shown.
Time optimal paths for a mobile robot with one trailer
  • M. Chyba, S. Sekhavat
  • Computer Science
    Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289)
  • 1999
This paper gives an explicit description of the abnormal and singular extremals for a mobile robot with one trailer with the help of the maximum principle and characterizes the time optimal paths for aMobile robot with n-trailers.