#### Abstract

We recapitulate the achievement about the Dubins path as well as some precise proofs which are important but omitted by Dubins. Then we prove that the shortest path (-geodesic) in environments with an obstacle consists of no more than five segments, each of which is either an arc or a straight line. To obtain such -geodesic, an effective algorithm is presented followed by a numerical simulation as verification.

#### 1. Introduction

Nowadays, Unmanned Aerial Vehicles (UAVs) are comprehensively applied in a wide range like avionics, GPS-based navigation, flight control techniques, reconnaissance and surveillance, weather, and atmospheric research. In addition, they are also widely used in both conventional combat roles and innovative roles which were not previously possible, such as operations in chemical and biological weapons environments and operations that require microair vehicles [1].

Therefore, one of the most important issues in their development is path planning. A path planning algorithm is aiming at producing one or several flyable paths for UAVs, subject to certain constraints. The path length might be the first factor that should be taken into consideration because the path length decides the traveling time and energy consumption. Besides, the trajectory has to meet the speed and turn limits of the UAVs so that the UAVs could fly safely. Now we can present this problem from the perspective of mathematics.

Given two points and in a plane, each with a prescribed direction of motion and in it; the question being asked is to find the shortest smooth path of bounded curvature that joins them. The classical result [2] achieved by Dubins in 1957 gives a sufficient set of paths (each consisting of circular arcs and straight line segments) which always contains the shortest one. Then, Shkel and Lumelsky [3] made classification for the Dubins set, while Chitsaz and Lavalle [4] discussed the directions of the paths, which are more efficient approaches to calculate the shortest path.

For 3D cases, Reeds and Shepp [5] made a “CLC conjecture” in 1990 that was widely believed in the past, which generalized the result for 2D cases directly to 3D cases. Unfortunately, such conjecture was disproved by Sussmann in 1995 [6], and he proved that the shortest path might also be a helicoidal arc that has a constant curvature and its torsion satisfies a certain differential equation.

Although such path is exactly the shortest one, it is too complicated to be easily applied in engineering. As a result, researchers began to find other models to get some paths which are easier to be calculated but might be longer than the shortest path. In some papers such as [1, 7–18], the authors considered some approaches to get the final path. One of the advantages of such approaches is that it could be used in the environments with some obstacles only after a little bit changes. A disadvantage is that neither of them is exactly the shortest path.

When it comes to more real and common conditions: UAVs fly through urban environments full of high buildings, and new methods are required to generate trajectories that traverse the regions and its associated obstacles [1, 19].

Unfortunately, when considering the Dubins problem with obstacles, the original result will no longer be suitable, because the Dubins path might pass through the obstacles so the result needs to be changed a little. For 3D cases, the approaches used in [8–17] can be used only by a little change, because the result is not the shortest paths in either condition. It is a pity that we cannot get the shortest path with obstacles in 3D cases. Instead, it is possible to find the shortest path with obstacles in 2D cases. In this paper, we prove that the shortest path consists of no more than five parts, which is either an arc or a straight line under the assumption that there is only one circular obstacle. What is more, both specific algorithm and numerical simulation are presented.

#### 2. General Case

In this section, we recapitulate the original proof given by Dubins [2], because this approach is also used in Theorem 13 in Section 3. As a result, parts of them are omitted. On the other hand, the proofs of some details which are very important but not obvious in his paper are omitted. Hence, we give the proofs with the details which are quite useful for the proofs of our results.

Let be a curve in parameterized by arc length . If we say that the curve has an average curvature always less than or equal to .

Let be the collection of all curves defined on a closed interval , where varies with , such that for ; ; the average curvature of is everywhere less than or equal to ; and .

*Definition 1. *The path which has minimal length in is called the -geodesic for denoted by .

Suppose that the arc with radius is and the straight line is .

Theorem 2. *Every planar -geodesic is necessarily a continuously differentiable curve which is either (1) or (2) or a subpath of type (1) or (2) (see also Figure 1).*

This is the most important theorem in [2] and we present the proofs, beginning with the existence of the -geodesic.

Proposition 3. *For any , , , , , and , there exists a path in of minimal length.*

*Proof. *Let be the infimum of lengths of all curves in . There exists a sequence such that the length is monotonely decreasing to . On one hand, since , it follows that are uniformly bounded. On the other hand, since , it follows that are also equicontinuous. Let be the restriction of on closed interval , hence, satisfy all conditions above and are defined on a common compact set . Then by Ascoli's theorem, there is a subsequence of family whose derivatives converge uniformly on to a function . Then, converge uniformly in to a function with length . It is easy to check that is exactly the -geodesic .

*Remark 4. *The paths are defined on different interval , so the Ascoli's theorem could not be applied. To solve this problem, we restrict on a common compact interval denoted by . This step is very important but was omitted by Dubins in [2], so we present it here as a complement.

Then we only relate several propositions without proof.

Proposition 5. *Let P be a planar curve of length less than or equal to . Then P is an -geodesic if and only if P is of type .*

Then it is easy to prove the following.

Proposition 6. *Let be a planar curve defined on a closed finite interval parameterized by arc length. Then if P is a -geodesic, it is a continuously differentiable curve which consists of a finite number of pieces, each of which is either a straight line segment or an arc of a circle of radius R.*

In fact, the -geodesic contains no more than three pieces, it is sufficient to show that no path consisting of four arc and straight line segments can be an -geodesic. So we consider all the eight paths of these types: , , , , , , , and .

Lemma 7. *If a curve is an -geodesic, then so is the curve obtained by traversing the path in the opposite direction.*

Therefore, we only need to consider five types: , , , , and .

Lemma 8. *If a curve is an -geodesic, then so is every subpath of the curve.*

Thus, it is sufficient to show that none of the following three types of curves is an -geodesic: , , and . Then we consider three lemmas to rule out such cases without proof but only Figures 2, 3, and 4, respectively.

Lemma 9. *No curve of type is an -geodesic.*

Lemma 10. *No curve of type is an -geodesic.*

Lemma 11. *No curve of type is an -geodesic.*

As a result, every planar -geodesic has no more than three pieces except , so it is either or or a subpath of them. Now we have proved Theorem 2.

#### 3. Environments with One Obstacle

In this section, we consider the path in the environments with one obstacle and prove that the shortest path consists of no more than five segments where each is either an arc or a straight line.

Denote the open circular area by and we suppose that because the radius of obstacle is always far larger than in practical problems. Suppose that is the complementary set of and is the arc along the bound of . Let be vectors in and , . Let be the collection of all curves in with an average curvature less than or equal to everywhere.

*Definition 12. *The shortest path in is called the -geodesic denoted by .

If the -geodesic is the same as -geodesic, we call the obstacle an ineffective obstacle. If they are different, we call it an effective one. Our ultimate goal in this section is to prove the following Theorem 13.

Theorem 13. *-geodesic is one of , , , , , , or a subpath of them.*

Figure 5 is the type .

Before proving Theorem 13, we prove several propositions and lemmas first. If the obstacle is ineffective, the -geodesic is showed in Theorem 2, without any difference, so we only consider the case that the obstacle is effective. The obstacle is ineffective means that the -geodesic is the same as the -geodesic which does not pass through the obstacle . On the other hand, the obstacle in effective means that the original -geodesic passes through the obstacle such that the new -geodesic is different.

Proposition 14. *For any , , , , , and , there exists an in of minimal length.*

*Proof. *As in Proposition 3, such are uniformly bounded and equicontinuous. Since is closed in , the Ascoli's theorem also holds, so converge uniformly to . Others are the same.

Besides, Propositions 5 and 6 also hold in such case.

Proposition 15. *Let be a planar curve defined on a closed finite interval parameterized by arc length. Then if P is an -geodesic, it is a continuously differentiable curve which consists of a finite number of pieces, each of which is either a straight line segment or an arc of a circle of radius .*

Before we rule out the possibility of a curve which consists of more than five pieces to be the -geodesic, we prove a lemma.

Lemma 16. *If or is tangent to the obstacle , then is ineffective; it is to say that the original -geodesic does not pass through .*

*Proof. *Theorem 2 shows that the original -geodesic consists of arc or straight lines; both and are tangent to the arcs. Since the obstacle is exactly the bound of the starting circle, -geodesic does not pass through the obstacle, which is shown in Figure 6.

In order to prove Theorem 13, we consider two cases.

##### 3.1. Case 1: does not intersect

Proposition 17. *-geodesic is CCC or CLC or subpath of them if it does not contain .*

*Proof. *It could be proved directly by Theorem 2.

##### 3.2. Case 2: Intersects

-geodesic has several pieces including . Now we prove that there are no more than five pieces.

Proposition 18. * has no more than five pieces.*

*Proof. *We prove the proposition by contradiction.

Assume that has six pieces including . Divide into two pieces, with as the middle piece: the former one is , and the latter one is .

It is obvious that and have five pieces altogether; hence, one of them has more than two;pieces. We assume that has three pieces and has two; see also Figure 7.

Let the end point of be ; the tangent vector at is . Now consider and the corresponding -geodesic . From Lemma 8, we see that is a subpath of -geodesic and so is also a -geodesic: the shortest path for condition ; hence, . Besides, is the -geodesic for .

Since is tangent to , we know that from Lemma 16, so

It is to say that the -geodesic for contains four pieces: has three and has one, which is contradict to Theorem 2. Hence, our assumption is wrong and has no more than five pieces.

Now we can prove Theorem 13.

*Proof of Theorem 13. *Firstly, consider case 2: intersects . From the proof of Proposition 18, especially (2), we know that both and has no more than two pieces. Thus, is , , , or subpath of them. Since , is or or subpath of them from Theorem 2 and then we can rule out easily. Therefore, is , , or subpath of them. Similarly, is , , or subpath of them. According to Propositions 17 and 18, the -geodesic is , , , , , , or a subpath of them.

Now we have proved Theorem 13 and solved the Dubins problem with obstacle.

#### 4. Algorithm

Such Dubins problem mentioned above could be described as input and output. Inputs are as follows:(1)initial point and initial velocity ,(2)final point and final velocity ,(3)minimal turning radius of the UAVs ,(4)radius of the circular obstacle .

While output is the length of the minimizing flyable path l.

In order to calculate the output with inputs, we present an algorithm which contains seven steps.

*Step 1. *Calculate the initial turning circle by , and , the final turning circle by , and . Denote the clockwise and counterclockwise circles by and , respectively. Then calculate four groups of data according to the original algorithm, while each of them contains a pair of initial and final turning circle, coordinates of two tangent points, and the length of Dubins path.

*Step 2. *Judge that whether each of the four Dubins path passes through the obstacle circle.

*Case 1.* If the path passes through the obstacle, go to Step 3.

*Case 2.* Else, record the data and go to Step 7.

*Step 3. *Calculate the Dubins path between and obstacle circle . Because the “final” velocity is uncertain, rule out two paths whose turning directions of and the common tangent line are different, where the other two remained and ; see also Figure 8.

*Step 4. *Calculate the Dubins path between obstacle circle and by ruling out two of four paths as in Step 3 where and remained, as in Figure 9.

*Step 5. *There are two possible combinations from to : and , where

*Step 6. *There are eight combinations in all including and . The other six paths are and : from to ; and : from to ; and : from to .

*Step 7. *Calculate the length of all the eight paths and select the minimal one as the shortest path.

#### 5. Simulation

The parameters of UAVs and the obstacle are showed in Table 1.

Since the original path B intersects with the obstacle D, a new path E which does not intersect D is calculated, as in Figure 10.

Put E together with three original paths A, C, and D, which do not intersect the obstacle, as in Figure 11.

The lengths of the four paths are shown in Table 2 so that the minimal one E could be selected directly.

#### 6. Conclusion

In this paper, we present the achievements of Dubins and his proofs with some more important complement in details at first. Then we generalize the results to the more useful cases in environments with one obstacle and prove that the shortest path (-geodesic) consists of no more than five segments, where each is either an arc or a straight line. To calculate the -geodesic, an algorithm is discussed and also a numerical simulation is accomplished as verification.

#### Acknowledgments

The authors would like to express their sincere thanks to Professor J. G. Carlsson for his valuable suggestions and special thanks to Professor D. Krupka for his help. This subject is supported by the National Natural Science Foundations of China (no. 61179031 and no. 10932002) and National Defense Project NLOS*∗**∗**∗*Technology (no. B22*∗**∗**∗*0011).