Abstract
We study a time-optimal problem in the roto-translation group with admissible control in a circular sector. The problem reveals the trajectories of a car model that can move forward on a plane and turn with a given minimum turning radius. Our work generalizes the sub-Riemannian problem by adding a restriction on the velocity vector to lie in a circular sector. The sub-Riemannian problem is given by a special case when the sector is the full disc. The trajectories of the system are applicable in image processing to detect salient lines. We study the local and global controllability of the system and the existence of a solution for given arbitrary boundary conditions. In a general case of the sector opening angle, the system is globally but not small-time locally controllable. We show that when the angle is obtuse, a solution exists for any boundary conditions, and when the angle is reflex, a solution does not exist for some boundary conditions. We apply the Pontryagin maximum principle and derive a Hamiltonian system for extremals. Analyzing a phase portrait of the Hamiltonian system, we introduce the rectified coordinates and obtain an explicit expression for the extremals in Jacobi elliptic functions. We show that abnormal extremals are of circular type, and they correspond to motions of a car along circular arcs of minimal possible radius. The normal extremals in a general case are given by concatenation of segments of sub-Riemannian geodesics in and arcs of circular extremals. We show that, in a general case, the vertical (momentum) part of the extremals is periodic. We partially study the optimality of the extremals and provide estimates for the cut time in terms of the period of the vertical part.
Keywords:
geometric control; model of a car; extremal trajectories; Pontryagin maximum principle; group of motions of a plane MSC:
49K15
1. Introduction
Consider a car model that can move forward on a plane and turn with a given minimum turning radius (see Figure 1). The car has two wheels, equidistant from the axle of the wheelset. Both wheels have independent drives that can rotate so that the corresponding rolling of the wheels occurs without slipping. The configuration of the system is described by the triple , where is the central point, and is the orientation angle of the car. In such a way, the configuration space forms the Lie group of roto-translations
Figure 1.
A model of a car that can move forward and turn within a given minimal radius. The control is responsible for moving forward and for the turn.
The car has two controls: the tangential velocity and the angular velocity . Consider the configuration , when the car is located at the origin and oriented along the positive direction of . An infinitesimal translation is generated by the vector and rotation by the vector . They are possible motions controlled by and . The remaining direction is forbidden since the immediate motion of the car in a direction perpendicular to its wheels is not possible. Thus, the dynamics of the car at the origin is given by , , and .
The origin Id is the unit element of the group (see Section 2). Any element is generated by the left translation Id. The dynamics at an arbitrary configuration q are
where represents left-invariant vector fields (see Section 2).
Various sets of admissible controls lead to different models (see Figure 2). The time-optimal problem for
Figure 2.
Set of admissible controls for various models of a car on a plane: Dubins car [1]; Reeds–Shepp car [2]; Ardentov model [3] (generalized Dubins car); Sachkov model [4] (sub-Riemannian problem); Berestovskii model [5]; Duits model [6]; our model with control in a sector.
- , , leads to Dubins car [1];
- , , leads to Reeds–Shepp car [2];
- , leads to a generalized Dubins car, studied by Ardentov [3];
- leads to the model whose solutions are sub-Riemannian length minimals, studied by Sachkov [4];
- , leads to the model studied by Berestovskii [5];
- , leads to the model of a car moving forward and turning in place, proposed by Duits [6];
- , , , leads to the general model of a car with control in a circular sector, which is studied in this paper.
In 1957, Dubins described [1] the problem of finding the shortest path for a car in plane moving with no reverse gear from an initial configuration (position and direction) to a final configuration penalizing the curvature of its trajectory in the plane. Later in 1990, Reeds and Shepp studied [2] the same problem, but for a car that has reverse gear. Both papers are devoted to a description of the general shape of the optimal paths, without providing explicit solutions for given boundary conditions. It was shown that the optimal trajectories of Dubins and Reeds–Shepp cars are given by concatenation of arcs of a circle of minimum possible radius (circular trajectories) and segments of a straight line (straight trajectories). In a recent study [3], Ardentov refines the Dubins model by considering the bounded angular speed of two wheels, which results in maximal tangential speed when the car is moving straight. For the refined model, extremal trajectories have been found. They are also given by concatenation of circular and straight trajectories. Note that such trajectories have bounded curvature: the upper bound is given by reciprocal to the minimal turning radius.
In 2011, Sachkov [4] obtained optimal synthesis in a sub-Riemannian problem in . This problem can be seen as the shortest path problem for a car that can move forward/backward and turn in place. In such a model, the curvature of trajectories is unbounded, and it was shown that optimal trajectories may contain cusp points, the points where the direction of motions is switching to the opposite one. Berestovskii [5] studied segments of the trajectories that contain no cusps and can be parameterized by the length of the planar projection.
In 2018, Duits and coauthors [6] studied a modification of the sub-Riemannian problem obtained by the restriction of the reverse gear. In the Duits model, the car can move forward and rotate in place, but it cannot move backward. Motivation came from image analysis applications, where the trajectories of the car are used to detect salient lines in images. An exact expression for the extremals was obtained in [7]. The original idea of the Duits model was to reduce the number of undesirable cusp points by suppressing the backward motions. However, it turned out that the cusp points are replaced by turning points (the points of in-place rotation on radians), and the projection of extremal trajectories of the Duits car to the image plane coincide with the projection of sub-Riemannian geodesics in . This observation shows that in order to entirely solve the “cusp problem”, the model needs further adaptation. In the present paper, we propose a model of a car that can move forward, stay in place, and turn with a given minimal turning radius. Trajectories of this system a priori cannot have cusp points in the planar projection.
The problem of transferring the car between the given initial and final configurations is known in robotics as a motion planning problem. There are different approaches to tackle this problem [8]. Introducing a cost function for the system leads to an optimal control problem. Such optimal control problems are tackled by various numerical methods, see, e.g., [9]. However, exact solutions (optimal synthesis) are known only for a few of the simplest models in robotics [4,10]. In the present paper, we obtain explicit expressions for extremals in a more complicated model with control in a circular sector.
System (1) arises in the modeling of the human visual system. An important discovery of the neurophysiology of vision was made by Hubel and Wiesel in 1959 [11], who showed that in the striate cortex of a cat, there exist groups of neurons sensitive to positions and directions (orientations). In the first stage of processing, the image is lifted by the brain to the extended space of positions and directions. In [12], a sub-Riemannian structure on the Heisenberg group was proposed for contour perception and completion. The model was refined in [13] by taking into account the global nature of the orientation angle. The roto-translation group endowed with a sub-Riemannian metric has been proposed to model the functional architecture of the primary visual cortex. This model is known as the Petiot–Citti–Sarti model, where sub-Riemannian geodesics (extremal trajectories) are used for the completion of occluded contours. The usage of sub-Riemannian geodesics for modeling the association field in the psychophysiology of vision was studied in [14]. It was shown that good candidates for the association field lines are given by sub-Riemannian geodesics with cuspless planar projection. Application of sub-Riemannian geodesics for modeling illusory contours in geometrical optical illusions has been studied in [15,16].
The principles of biological visual systems are actively used in computer vision. Based on these principles, effective image processing methods are created, e.g., image reconstruction [17] and detection of salient lines in images [18,19]. In [18], optimal trajectories of a System (1) are used to detect salient lines in images. The motivation for our study is to solve the problem of cusp points that appear in the salient line detection method [18], which is based on tracking via sub-Riemannian geodesics. At such points, the car reverses its direction of motion, and a detected salient line has an undesirable cusp point. In our model with control in a circular sector with an acute opening angle, the cusp points are impossible.
Our work generalizes the sub-Riemannian problem [4] by adding a restriction on the velocity vector to lie in a circular sector. The sub-Riemannian problem is given by a special case when the sector is the full disc. In addition to its importance for applications, the problem under study is of independent interest in geometric control theory [20] as a model example of an optimal control problem in which zero control lies on the boundary of the set of control parameters.
The problem can be seen as a rolling geodesic problem [21,22], where a disc is rolling on a plane. We explicitly derive the geodesics and analyze their optimality.
In the present paper, we study the time-optimal problem for System (1) with control in a circular sector. We generalize the results [7], where we studied the special case of admissible controls in a half-disc. The present paper is an extended version of the preliminary work [23], where we studied the case of the sector opening angle less than and parameterized the extremal trajectories by the length of their planar projection (s–parametrization). Now we study the general case of the sector opening angle and derive the explicit formulas for the time-parameterized extremals (t–parametrization), which is natural for time-optimal problems. We also provide an analysis of their optimality.
The present paper is organized as follows. In Section 2, we give preliminary materials on the Lie group . In Section 3, we formulate an optimal control problem under consideration. In Section 4, we study local and global controllability (see Definitions 1–3) of the system and the existence of a solution for given arbitrary boundary conditions. In Section 5, we apply a necessary optimality condition, the Pontryagin maximum principle (PMP), and describe a phase portrait of the Hamiltonian system of PMP. In Section 6, we integrate the Hamiltonian system and obtain an explicit expression for the extremals. In Section 7, we partially study the optimality of the extremals and provide estimates for the cut time.
2. Preliminaries
The roto-translation group is the group of proper motions of the Euclidean plane. Any such motion consists of a rotation around a given point on angle and a parallel translation on a vector .
The composition of two motions results in the product of two elements :
The identical transformation of the plane is the unit element .
For any , there exists such that given by
Note that the group operation is not commutative. The left translation is defined as
The tangent space with the Lie bracket operation
forms the Lie algebra . It is isomorphic to the Lie algebra of the left-invariant vector field , where the vector fields are obtained via push-forward
3. Statement of the Problem
For a given angle , consider the following control system:
For given boundary conditions , , we aim to find the controls , such that the corresponding trajectory transfers the system from the initial to the final configuration in minimal time:
Remark 1.
The problem is invariant under the left action of since the vector fields and are left-invariant. Due to this property without loss of generality, we set .
4. Existence of the Solution
4.1. Controllability and Existence of Optimal Controls
In this section, we study the existence of the solution in Problem (2), (3). First, we give some necessary definitions.
Denote by the attainable set [20] of System (2) from Id for any non-negative time.
Definition 1.
System (2) is called globally controllable if .
In other words, a control system is globally controllable if any two points of its configuration space can be connected by an admissible trajectory.
Let . Denote by the attainable set of System (2) from for time . Denote by the interior of the set .
Definition 2.
System (2) is called small-time locally controllable at Id if for all , there holds the inclusion
Definition 3.
System (2) is called locally controllable for time at Id if
Next, we provide an analysis of global and small-time local controllability of System (2) and study the existence of optimal control. We show that there are four different possible cases depending on the domain of angle . The result is gathered in Theorem 1.
Theorem 1.
- 1.
- For , the system is not globally controllable. The attainable set is . For any , there exists a unique optimal trajectory;
- 2.
- For , the system is globally controllable, but not small-time locally controllable. For any , there exists an optimal trajectory;
- 3.
- For , the system is globally controllable and small-time locally controllable. An optimal trajectory does not exist for some boundary conditions;
- 4.
- For , the system is globally and small-time locally controllable. For any , there exists an optimal trajectory.
Proof.
First, we show that the system is not globally controllable if . Indeed, when , System (2) is reduced to , , , and the attainable set is a segment of the trajectory , . Consequently, the attainable set for any non-negative time is a ray . The optimal control is given by , and there exists a unique optimal trajectory, a segment of a straight line, which transfers the system from Id to any element .
Next, we provide three different proofs of global controllability for . The global controllability of System (2) for follows from the global controllability of Dubins car (see [1]). Indeed, the sets of admissible trajectories of the two systems are the same, since the convex cones of the sets of admissible controls in these problems coincide with one another. Thus, the controllability of the Dubins car is equivalent to the controllability of our problem. The second proof follows from the general statement in [24]. According to [24], a left-invariant system is globally controllable on if and only if the system is full-rank (bracket generating), i.e., the Lie algebra at every point forms the full tangent space. We have , thus System (2) is globally controllable. The third proof of controllability is given in [23]. It relies on the Lie saturation method (see [20]), which is standard in geometric control theory.
Now we study the case . For any , we have . Thus,
Consequently, System (2) is not small-time locally controllable for . Further, in Theorem 2, we give a precise time estimate for local controllability in this case. The existence of an optimal trajectory that transfers the system for from Id to any is guaranteed by the Filippov theorem [20]. Indeed, all the conditions of the Filippov theorem hold due to the compactness and convexity of U and the global controllability of the system.
Next, we analyze the case . First, we show that the system is small-time locally controllable. To this end, we consider a convex closure of the set U and the corresponding relaxed control system (2) with the set of admissible controls . Denote by the attainable set of the relaxed system by time . Since and the relaxed system is full-rank, it is small-time locally controllable, i.e., for all , we have . By Thm. 8.2 of [20], the attainable sets of the original and the relaxed systems are related by , where is the closure of a set S. Thus, . Since the original system is full-rank, we have , and hence we prove that the system is small-time locally controllable.
In the case , the set U is not convex. Now we show that there exists a boundary condition for which an optimal trajectory does not exist. Consider . We show that it satisfies the following conditions:
- (a)
- ;
- (b)
- A trajectory , s.t. does not exist.
It is obvious that Conditions (a) and (b) imply the nonexistence of optimal trajectory connecting Id and . Let us prove Item (a). Let . Consider the following control:
For , , the corresponding trajectory satisfies the following ODE:
and is given by
Thus, the trajectory with Controls (4) and (5) departing from Id has an end point
Therefore, point is attainable from Id by time , and we have when . However, the system is small-time locally controllable at any point, thus for any , an attainable set in reverse time from point for time contains a neighborhood of point . Therefore, for any , point is attainable from by time , and Item (a) is proved.
Now we prove Item (b). Assume that there exists a trajectory that transfers the system from Id to for time . The corresponding control has the form
Then,
Assume that the function changes its sign on the segment . Then, for some , we have . However, ; therefore, , and we obtain a contradiction. Thus, for . Then, we have , and from (6), we conclude that , , , which contradicts (7), and Item (b) is proved.
The case coincides with the well-known sub-Riemannian problem in studied in [4]. In this case, the system is globally and small-time locally controllable. For any , there exists an optimal trajectory (sub-Riemannian length minimizer) from Id to , which is explicitly computed in [4]. Note that for some boundary conditions , there exist two distinct length minimizers. Such points are located on the so-called Maxwell set. In the general case, when does not belong to the Maxwell set, there exists a unique optimal trajectory from Id to . □
Remark 2.
Remark 3.
For , a natural modification of the ill-posed time minimization problem in a circular sector is given by replacing the set of admissible controls U by its convex closure.
4.2. Local Controllability
In this subsection, we study the local controllability of System (2) for . In Theorem 1, we showed that the system is not small-time locally controllable. In this subsection, we find an instant of time at which the local controllability is attained.
We denote
- By , the attainable set of System (2) from Id for a time ;
- By , the attainable set of System (2) from Id for time not greater than t;
- By , the attainable set of System (2) from for time not greater than t.
Theorem 2.
Let , and let . Then, for any , System (2) is locally controllable at Id for time not greater than , i.e.,
The proof of this theorem follows from the next Lemmas 1–3.
Lemma 1.
For any , the point .
Lemma 2.
For any and any , the point .
Lemma 3.
For any and any , the point .
Now we prove Theorem 2 on the basis of Lemmas 1–3.
Proof.
Fix any , and denote . It follows from Lemma 1 that . Further, it follows from Lemma 3 that . However
thus . □
Now we prove Lemma 1.
Proof.
Fix any . Consider the following admissible control:
Then, immediate computation shows that the corresponding trajectory passes through the points
□
Further, we prove Lemma 2.
Proof.
Denote the vector field , . Consider the mapping
Let , , and let . Then
thus
Finally, we prove Lemma 3.
Proof.
Fix any and any . By Lemma 2, the point . System (2) is invariant with regard to left translations , , thus
□
Remark 4.
There is numerical evidence that the lower bound , , of the time at which the local controllability is attained (see Theorem 2) is exact, i.e., .
5. Pontryagin Maximum Principle
5.1. Hamiltonian System and Maximality Condition
A necessary optimality condition is given by the Pontryagin maximum principle (PMP) [20,25]. In this section, we apply the PMP to Problem (2), (3).
Let . Define the Pontryagin function
where are canonical coordinates in the cotangent space corresponding to the coordinates in .
The PMP states the following. Let , , be an optimal control and the corresponding optimal trajectory. Then, there exists a Lipshitzian curve for which for (the nontriviality condition), and the following conditions hold for almost every :
- 1.
- The Hamiltonian system
- 2.
- The maximality condition
The maximized Pontryagin function is called the Hamiltonian. It is the first integral of the Hamiltonian system. The case is called abnormal, and the case is called normal.
Natural coordinates for left-invariant systems [20] are given linearly on fibers of cotangent bundle Hamiltonians associated with the basis left-invariant vector fields: , . In canonical coordinates, they read as
The Pontryagin function takes the form
The Hamiltonian system is given by
The subsystem for state variables x, y, and is called the horizontal part, and the subsystem for adjoint variables , , and is called the vertical part of the Hamiltonian system.
Now we analyze the maximum condition
Note that the Pontryagin function can be seen as a scalar product of two vectors and . From this point of view, the maximum condition has a clear geometric interpretation (see Figure 3).
Figure 3.
The maximum condition.
Introduce polar coordinates in the planes and :
For , we have and . In this case, we have trivial abnormal extremals.
For , we have , , and . In this case, we have nontrivial abnormal extremals. We study them in detail in Section 5.2.
For , we have for any . In this case, we have abnormal extremals. Since the Hamiltonian is constant along the extremals, the point can lie on a trivial or a nontrivial abnormal extremal that we listed in the two cases above. Further, we consider .
For , we have , In this case, we have and the normal extremals corresponding to the motion of a car along a circle of minimal possible radius, as we will show in Section 5.3.
For , we have . In this case, we have that and the normal extremals corresponding to the motion of a car along sub-Riemannian geodesics, as we will show in Section 5.3.
5.2. Abnormal Case
Trivial abnormal extremal control corresponds to the fixed point of the Hamiltonian system.
Nontrivial abnormal extremal controls are given by
Proposition 1.
If an admissible control , is not arc length parameterized, i.e., there exists a positive measure set such that for , then is not optimal.
Proof.
Let for a given trajectory. Let us show that if on a set of measure , then the trajectory is not optimal. First, note that if for all , then this part of the trajectory is a fixed point. Staying in place is not optimal in a time minimization problem. Now, if for , then one can reparametrize the trajectory with . In this case, the support of the trajectory stays the same, new controls are also admissible, but the new motion time S becomes strictly less than the original one:
□
Further, we consider arclength parameterized abnormal extremals.
Theorem 3.
Abnormal arclength parameterized extremal controls are piecewise constant
with switching times (discontinuity points of ) differing by . The corresponding trajectories are motions of a car along circular arcs of the minimal possible radius by angle π (except the first and the last arcs, which may have angles not greater than π).
Proof.
Abnormal extremals satisfy the statements of the PMP: the maximum condition, the Hamiltonian system (11), and nontriviality condition for all .
From the maximum condition we have
Here, .
The vertical part of the Hamiltonian system (11) is given by
This system preserves the Hamiltonian and the Casimir (see Figure 4). Since for abnormal extremals, the nontriviality condition implies .
Figure 4.
Abnormal case. (Left) Level surfaces of the Hamiltonian (in green) and the Casimir (in red). (Center) Phase portrait on the surface . (Right) An abnormal extremal trajectory.
If , for some , then implies and . Thus, and from the second equation of the system, we have for for sufficiently small . Thus, the function changes its sign in a neighborhood of . We see that is an isolated point where changes its sign.
If , then (see (12)). The extremal control is piecewise constant with interval between switchings , as it follows from the first equation of the system with boundary values , .
The corresponding trajectory of the horizontal part of (11) is easy to find by direct integration. For time intervals between switchings, the point moves along the circular arc with increments of angle . □
5.3. Normal Case
In this section, we provide a qualitative analysis of the dynamics in the normal case . Note that the normal case appears iff . In the normal case, we set the Hamiltonian value without loss of generality (see [20]).
The vertical part has the first integrals: the Hamiltonian
and the Casimir
In Figure 5, we show variants of the mutual arrangement of the level surface of the Hamiltonian , which consists of two half-planes glued with a segment of the cylinder, and the level surface of the Casimir , which is a cylinder.
Figure 5.
Level surfaces of the Hamiltonian H (in green) and the Casimir E (in red). (Left) . (Center) . (Right) .
For the description of the phase portrait of the vertical part, we use techniques of convex trigonometry [26]. The polar set to U is
The corresponding functions of convex trigonometry are
where .
Along the extremal trajectories, we have
Denote . The Casimir E can be seen as a total energy integral (sum of potential and kinetic energy)
of conservative system with one degree of freedom [27]
The phase portrait of this system is depicted in Figure 6.
Figure 6.
The phase portrait on the level surfaces of the Hamiltonian .
Analyzing the phase portrait of (16), we conclude:
is stable equilibrium;
the trajectory is periodic;
either is unstable equilibrium or is a separatrix of the saddle point.
6. Explicit Expression for Normal Extremals
6.1. Stratification of the Hamiltonian System Adjoint Variables Domain
In this section, we derive explicit expressions for the normal extremals. To this end, we stratify the domain of adjoint variables , , and into five subdomains and introduce the coordinates that rectify the phase portrait of the vertical part in each subdomain. Next, we integrate the horizontal part and derive explicit expressions for the extremal trajectories. This method was applied for the construction of optimal synthesis in several optimal control problems [28].
In Figure 7, we stratify the domain of the vertical part with respect to the value of the Casimir E, the value of , and the sign , . From the analysis in the previous section, we know that there are two generic types of motion: and , which are equivalent to and , respectively. We denote by the letter S the domain with the first type of motion and by O the domain with the second type of motion. Such notions are motivated by S — sub-Riemannian, and O — circle, as we will show next that the corresponding extremal trajectory (solution to the horizontal part) is given by arcs of sub-Riemannian geodesics in [4] and arcs of circular extremals (which correspond to motion of a car along circles of minimal possible radius).
Figure 7.
Stratification of the domain of the vertical part.
Denote . There are five qualitative types of normal extremal trajectories:
- 1.
- Arcs of noninflectional sub-Riemannian geodesics in , joined by arcs of the circular extremals, when (the subdomain ; );
- 2.
- Arcs of inflectional sub-Riemannian geodesics in joined by arcs of the circular extremals, when (the subdomain ; here, in the S-domain, and in the O-domain);
- 3.
- Arcs of the separatrix sub-Riemannian geodesics in joined by an arc of the circular extremal, when and (the subdomain ; here, in the S-domain, and in the O-domain);
- 4.
- The circular extremals, when (the subdomains ; here, correspond to the motion of the car clockwise or counterclockwise);
- 5.
- The straight extremal (the ray), when and (the subdomain ).
Next, we derive explicit formulas for the extremals in each case. In order to avoid difficulties in the interpretation of formulas of convex trigonometry, which appeared very useful for qualitative analysis of the Hamiltonian system in the previous section, we return to the classical coordinates , where the vertical part (16) takes the form
where . The extremal controls are given by
and the horizontal part is given by
Note that for , System (17)–(19) coincides with the system for sub-Riemannian geodesics in [4]. Thus, the solutions in the S-domains are given by arcs of sub-Riemannian geodesics. Denote by the flow from Id along the sub-Riemannian geodesic with the initial covector . The exact formula for the operator in the different domains is presented in the subsections below.
For , System (17)–(19) is easily integrated, and the solutions are given by arcs of circles of radius , which is the minimal possible turning radius for the car model. Denote by the corresponding flow from Id:
The case is joined to the case when , and joined to the case , when (see Figure 7). Here, , and .
To obtain a general solution for the horizontal part we separate the timeline by the intervals, in which the S or the O mode holds. We denote by , , the instances of time when the dynamics switches (see Figure 8). Denote by the corresponding value of the adjoint covector, and by the corresponding point of the extremal trajectory. Due to left-invariance (see Remark 1), the arc of the trajectory starting from is given by
Figure 8.
Timeline with indicated instances of switching and the corresponding trajectory.
6.2. The Domain
Here, we consider the case when the initial covector belongs to the subdomain , where . Notice that in this case, the trajectory of the vertical part is periodic, and is constant (see Figure 7). Denote the period by , where is the full time of motion in the O-domain, and is the full time of motion in the S-domain.
Denote . Introduce the coordinates (see Figure 9). Here, is periodic with the period .
Figure 9.
Rectified coordinates in the domain .
For in , where :
where , . The time of the full motion is computed as
and the initial value is expressed via as follows:
Here, sn, cn, and dn are Jacobi elliptic functions; F is the elliptic integral of the first kind; and is the complete elliptic integral of the first kind.
For in , where :
where , . The time of the full motion is computed as
and the initial value is expressed via as follows:
The direct computation shows that (17) is rectified in the coordinates :
Remark 5.
There is a symmetry between the solutions for and : the substitution translates a trajectory in to the trajectory in .
Remark 6.
The values and are computed as the minimal positive time instances when
Now we integrate the horizontal part and find the exact expression for the extremal trajectories. Recall that in the O-domain, the extremal trajectories are given by arcs of the circles (20), and in the S-domain, the extremal trajectories are given by arcs of sub-Riemannian geodesics. Exact formulas for the sub-Riemannian geodesics are found in [4]. In our notation, they read as:
where
Here, am, sn, cn, and dn are Jacobi elliptic functions, and E is the elliptic integral of the second kind.
To obtain a general solution for the horizontal part, we separate the timeline by the intervals
in which the S or the O mode holds (see Figure 10). Here, we have
where the square brackets denote the integer part.
Figure 10.
Timeline for the trajectory with indicated instances of switches.
Denote
the initial covector for the full arc of O and S segment of the extremals (see Figure 7), and
the end point of the corresponding extremal trajectory.
Now we obtain the resulting formula for the extremal trajectories by usage of (21).
Theorem 4.
For , the corresponding extremal trajectory is given by
where .
For , the corresponding extremal trajectory is given by
where .
In Figure 11, we show an example of the extremal trajectories in the domain .
Figure 11.
Two extremal trajectories in with for : for and . The sub-Riemannian arcs are depicted in red, and arcs of the circles are depicted in blue.
Remark 7.
The power of an element is defined as
6.3. The Domain
Here, we consider the case when the initial covector belongs to the subdomain , where in the S-domain, and in the O-domain. Notice that in this case, the trajectory of the vertical part is periodic (see Figure 7). Denote the period by , where is the full time of motion in the O-domain, and is the full time of motion in the S-domain.
Denote . Introduce the coordinates (see Figure 12). Here, is periodic with the period .
Figure 12.
Rectified coordinates in the domain .
For in , where :
where the time of the full motion is computed as
For , we have
and the initial value is expressed via as follows:
For , we have
and the initial value is expressed via as follows:
For in , where :
where the time of the full motion is computed as
For , we have
and the initial value is expressed via as follows:
For , we have
and the initial value is expressed via as follows:
The direct computation shows that (17) is rectified in the coordinates :
Now we integrate the horizontal part and find the exact expression for the extremal trajectories. Recall that in the O-domain, the extremal trajectories are given by arcs of the circles (20), and in the S-domain, the extremal trajectories are given by arcs of sub-Riemannian geodesics. Exact formulas for the sub-Riemannian geodesics are found in [4]. In our notation, they read as:
where
Here, am, sn, cn, and dn are Jacobi elliptic functions, and E is the elliptic integral of the second kind.
To obtain a general solution for the horizontal part, we separate the timeline by the intervals
in which the S or the O mode holds (see Figure 10). Here, we have
where the square brackets denote the integer part.
Denote
the initial covector for the full arc of O and S segment of the extremals (see Figure 7), and denote
the end point of the corresponding extremal trajectory.
Now we obtain the resulting formula for the extremal trajectories by usage of (21).
Theorem 5.
For , the corresponding extremal trajectory is given by
where , and .
For , the corresponding extremal trajectory is given by
where , and
In Figure 13, we show an example of the extremal trajectories in the domain .
Figure 13.
Two extremal trajectories in with : for and , for . The sub-Riemannian arcs are depicted in red, and arcs of the circles are depicted in blue.
6.4. The Domain and
In this subsection, we consider the case when the initial covector belongs to the subset , where . Notice that in this case, the trajectory of the vertical part is a separatrix of the saddle point (see Figure 7). It consists of not greater than three arcs of the types S, O, and S.
Figure 14.
Rectified coordinates in the domain , .
For , we have:
where
For :
where
Now we integrate the horizontal part and find the exact expression for the extremal trajectories. Recall that in the O-domain, the extremal trajectories are given by arcs of the circles (20), and in the S-domain, the extremal trajectories are given by arcs of sub-Riemannian geodesics. Exact formulas for the sub-Riemannian geodesics are found in [4]. In our notation, they read as:
where
Denote the first switching time by
The initial covector for the full O segment of the extremals (see Figure 7), denoted by
and the end point of the corresponding trajectory denoted by
Denote
the covector, when switching from the O to the S segment appears.
Now we obtain the resulting formula for the extremal trajectories by usage of (21).
Theorem 6.
For , , the corresponding extremal trajectory is given by
where .
For , the corresponding extremal trajectory is given by
where .
For , , the corresponding extremal trajectory is given by
In Figure 15, we show an example of the extremal trajectories in the set .
Figure 15.
Three extremal trajectories in with : for and ; for and ; for and . The sub-Riemannian arcs are depicted in red, and arcs of the circles are depicted in blue.
6.5. The Domain
Figure 16.
Extremal trajectories in .
Theorem 7.
For , the corresponding extremal trajectory is given by the circle
6.6. The Domain and
Theorem 8.
For , i.e., , the corresponding extremal trajectory is the ray
The extremal trajectory for is depicted in Figure 17.
Figure 17.
Extremal trajectory in .
7. Optimality of Extremal Trajectories
7.1. General Upper Bound of Cut Time
The limitation of the Pontryagin maximum principle is that it is only a necessary but not a sufficient condition of optimality. It provides a Hamiltonian system for the extremals, which are first-order candidates for being optimal among all admissible trajectories of a control system. An extremal loses its optimality at a cut point [20].
In this section, we provide an upper bound of the cut time for a time-optimal problem
Recall that the cut time for a trajectory of an optimal control problem is defined as
A trajectory , , of the control system (48) is called quasiperiodic with a period if the following two conditions hold:
- (1)
- for all ;
- (2)
- There exists a linear function , such that
Proposition 2.
Let the time-optimal Problem (48)–(51) satisfies the hypotheses:
- (1)
- and for any ;
- (2)
- .
Let a trajectory , , of the control system (48) be quasiperiodic with a period . Assume moreover that the curve , , is not a straight line.
Then, the cut time of the trajectory for the time-optimal problem (48)–(51) admits an upper bound
Proof.
Consider the function l from Condition (52). The function is T-periodic and continuous, thus it attains a maximum , . The curve is tangent to the straight line for each value of the parameter , . Moreover, is distinct from the line , thus the control corresponding to the trajectory satisfies the inequality . On the other hand, the vector is collinear with the line , as well as the vector .
Consider now the trajectory of the control system (48) with the initial condition and the control . There exists such that . Since , then . Indeed, , , is a straight line segment connecting the points and , while , , is a curvilinear arc connecting the same points (see Figure 18). Thus, the trajectory is not optimal for Problem (48)–(51).
Figure 18.
Nonoptimal arc of the extremal trajectory.
The arc is not optimal as well since it contains a non-optimal arc . The required bound (53) follows. □
7.2. Optimality of Extremals for
In this subsection, we analyze optimality of the extremal trajectories for , described in Section 6.2.
Proposition 3.
Let , , be an extremal trajectory in the time-optimal Problem (2), (3). Assume that the corresponding initial covector , and let and be the traveling time along full O and full S arc, given by (25) and (23).
The trajectory , , is not optimal if . In particular,
Proof.
First, we fix the sign . The proof for follows by Remark 5.
To prove the proposition, we rely on the general upper bound of cut time in Proposition 2, where obviously the Hypotheses (1) and (2) hold. Let us show that the extremal trajectory is quasiperiodic with the period . To this end, without loss of generality, we fix the initial covector corresponding to the beginning of the circular arc of the extremal . The result for another choice of initial covector follows by left-invariance (21). Denote by the covector at the end of the circular arc (see Figure 7). Periodicity by follows by direct computation from Theorem 4:
where by and , we denote the -component of the operators and , which are the flows from Id along the O and S arcs, respectively. Thus,
Now, note that the extremal control is periodic with the period , and thus the components of the corresponding extremal trajectory satisfy
Thus, by Proposition 2, the extremal trajectory is quasiperiodic and admits the upper bound for the cut time . □
7.3. Optimality of Extremals for
In this subsection, we analyze optimality of the extremal trajectories for , described in Section 6.3.
Proposition 4.
Let , , be an extremal trajectory in the time-optimal Problem (2), (3). Assume that the corresponding initial covector , and let and be the traveling time along full O and full S arc, given by (33) and (31).
The trajectory , , is not optimal if . In particular,
Proof.
The proof is similar to the proof of Proposition 4. The only difference appears in the periodicity by . In the case , we have , , which follows from Theorem 5. □
7.4. Optimality of Separatrix Extremals (, )
In this subsection, we analyze optimality of extremal trajectories for , described in Section 6.4.
Proposition 5.
Proof.
The extremal trajectory is given by Theorem 6. For , the corresponding trajectory , is given by an arc of circular extremal, which is optimal as we prove in Proposition 6. For , the corresponding extremal trajectory before the first switching is given by an arc of separatrix sub-Riemannian geodesic in , which is optimal, as proved in [4]. In particular, for , the trajectory is optimal up to infinity since it has no switchings. □
Remark 9.
An upper bound of the cut time for the separatrix extremals of general type, which have the switching points, remains an open problem.
7.5. Optimality of Circular Trajectories, cos
In this subsection, we analyze optimality of circular extremals described in Section 6.5.
Proposition 6.
Let , , be an extremal trajectory in the time-optimal Problem (2), (3). Assume that is of circular type and let be its period.
A trajectory , , is optimal iff . In particular,
Moreover, for any , the trajectory , , is a unique optimal trajectory connecting to .
Proof.
First of all, a full circular arc , , is not optimal since it connects the same points in a positive time .
Now we prove that for any , the trajectory , , is a unique optimal trajectory connecting to . By contradiction, suppose that there is another trajectory , , with a control such that and , . We have , moreover, this inequality becomes strict on a nonempty interval since the trajectory is not circular. Thus,
whence , a contradiction. □
7.6. Optimality of the Straight Trajectory (, )
In this subsection, we analyze the optimality of the straight extremal (47) (see Section 6.6).
Proof.
Since , an end point cannot be reached from Id by time . □
7.7. Lower Bound of Cut Time
Proposition 8.
Let , , be an extremal trajectory in the time-optimal problem on with control in a circular sector. Assume that is of sub-Riemannian type.
If is optimal for the sub-Riemannian problem on , then it is optimal in the time-optimal problem on with control in a circular sector. Thus,
where is the cut time of the trajectory for the sub-Riemannian problem on (see [4]).
In particular, there exists such that .
Proof.
The sub-Riemannian problem on can be stated as a time-optimal problem with a set of control parameters given by the full disc. Now the statements of this proposition are obvious since if a trajectory is optimal for a problem with a bigger set of control parameters, then it is also optimal for a problem with a smaller set of control parameters. □
Now, Propositions 6 and 8 imply the following.
Corollary 1.
Let , , be an extremal trajectory in the time-optimal problem on with control in a circular sector. Then, there exists such that .
8. Conclusions
We considered the time minimization Problem (2), (3) in the roto-translation group with admissible control in a circular sector. The problem reveals the trajectories of a car model that can move forward on a plane and turn with a given minimum turning radius. The model generalizes the sub-Riemannian length minimizers problem by adding a restriction on the velocity vector to lie in a circular sector with the opening angle .
We studied the local and global controllability of the system and the existence of the solution for given arbitrary boundary conditions in Theorem 1. We obtained the following.
- 1.
- For , the system is not globally controllable.
- 2.
- For , the system is globally but not small-time locally controllable.
- 3.
- For , the problem is ill-posed. The system is globally and small-time locally controllable, but an optimal trajectory does not exist for some boundary conditions.
- 4.
- For , the system is globally and small-time locally controllable. This case coincides with the sub-Riemannian length minimizers problem in .
Then, we considered the well-posed case .
We obtained a lower bound for local controllability time (see Theorem 2).
We applied PMP and obtained explicit expressions for the extremals.
We showed that arclength parameterized abnormal extremals are given by joining of the half period arcs of the circular extremals (see Theorem 3).
We showed that there are five qualitative types of normal extremal trajectories.
- 1.
- Arcs of noninflectional sub-Riemannian geodesics in , joined by arcs of circular extremals. The exact expression is given by Theorem 4. An upper bound for the cut time is given by Proposition 3.
- 2.
- Arcs of inflectional sub-Riemannian geodesics in , joined by arcs of circular extremals. The exact expression is given by Theorem 5. An upper bound for the cut time is given by Proposition 4.
- 3.
- Arcs of the separatrix sub-Riemannian geodesics in joined by an arc of the circular extremal. The exact expression is given by Theorem 6. The extremals before the first switching are optimal (see Proposition 5).
- 4.
- The circular extremals. The exact expression is given by Theorem 7. The cut time is given by Proposition 6.
- 5.
- The straight extremal. The exact expression is given by Theorem 8. It is optimal up to infinity (see Proposition 7).
We showed that small arcs of the normal extremals are optimal (see Corollary 1).
As a further extension of the present work, we plan to use the obtained exact expressions for the extremals and the bounds for the cut time to construct the optimal synthesis; similarly, it is performed for the sub-Riemannian length minimizer problem in [4].
Author Contributions
Conceptualization, A.M. and Y.S.; methodology, A.M. and Y.S.; software, A.M.; validation, A.M. and Y.S.; formal analysis, A.M. and Y.S.; investigation, A.M. and Y.S.; resources, A.M. and Y.S.; data curation, A.M. and Y.S.; writing—original draft preparation, A.M. and Y.S.; writing—review and editing, A.M. and Y.S.; visualization, A.M.; supervision, Y.S.; project administration, A.M.; funding acquisition, Y.S. All authors have read and agreed to the published version of the manuscript.
Funding
The work is supported by the Russian Science Foundation under grant 22-11-00140 (https://rscf.ru/project/22-11-00140/, accessed on 14 September 2023) and performed in Ailamazyan Program Systems Institute of Russian Academy of Sciences.
Data Availability Statement
Not applicable.
Acknowledgments
The authors thank Andrei Ardentov for valuable discussions resulting to clarification of the structure of abnormal extremals.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
| PMP | Pontryagin maximum principle |
References
- Dubins, L.E. On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents. Am. J. Math. 1975, 79, 497–516. [Google Scholar] [CrossRef] [Scilit]
- Reeds, J.A.; Shepp, L.A. Optimal paths for a car that goes both forwards and backwards. Pac. J. Math. 1990, 145, 367–393. [Google Scholar] [CrossRef] [Scilit]
- Ardentov, A.A. Markov–Dubins problem with Control on a Triangle. In Proceedings of the International Voronezh Spring Mathematical School Dedicated to the 115th Anniversary of the Birth of Academician L.S. Pontryagin, Voronezh, Russia, 3–9 May 2023; pp. 43–44. (In Russian) [Google Scholar]
- Sachkov, Y.L. Cut locus and optimal synthesis in the sub-Riemannian problem on the group of motions of a plane. ESAIM: Control. Optim. Calc. Var. 2011, 17, 293–321. [Google Scholar] [CrossRef] [Scilit]
- Berestovskii, V.N. Geodesics of a left-invariant nonholonomic Riemannian metric on the group of motions of the Euclidean plane. Sib. Math. J. 1994, 35, 1083–1088. [Google Scholar] [CrossRef] [Scilit]
- Duits, R.; Meesters, S.P.L.; Mirebeau, J.-M.; Portegies, J.M. Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis. J. Math. Imaging Vis. 2018, 60, 816–848. [Google Scholar] [CrossRef] [Scilit]
- Mashtakov, A.P. Time minimization problem on the group of motions of a plane with admissible control in a half-disk. Mat. Sb. 2022, 213, 100–122. (In Russian) [Google Scholar]
- Lynch, K.M.; Park, F.C. Modern Robotics. Mechanics, Planning, and Control; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
- Arismendi, C.; Alvarez, D.; Garrido, S.; Moreno, L. Nonholonomic Motion Planning Using the Fast Marching Square Method. Int. J. Adv. Robot. Syst. 2015, 12, 60129. [Google Scholar] [CrossRef] [Scilit]
- Boscain, U.V.; Chitour, Y. Time-Optimal Synthesis for Left-Invariant Control Systems on SO(3). SIAM J. Control Optim. 2005, 44, 111–139. [Google Scholar] [CrossRef] [Scilit]
- Hubel, D.H.; Wiesel, T.N. Receptive fields of single neurones in the cat’s striate cortex. J. Physiol. 1959, 148, 574. [Google Scholar] [CrossRef] [Scilit]
- Petitot, J. The neurogeometry of pinwheels as a sub-Riemannian contact structure. J. Physiol. 2003, 97, 265–309. [Google Scholar] [CrossRef] [Scilit]
- Citti, G.; Sarti, A. A cortical based model of perceptual completion in the roto-translation space. J. Math. Imaging Vis. 2006, 24, 307–326. [Google Scholar] [CrossRef] [Scilit]
- Duits, R.; Boscain, U.; Rossi, F.; Sachkov, Y.L. Association Fields via Cuspless Sub-Riemannian Geodesics in SE(2). J. Math. Imaging Vis. 2014, 49, 384–417. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Franceschiello, B.; Mashtakov, A.; Citti, G.; Sarti, A. Geometrical optical illusion via sub-Riemannian geodesics in the roto-translation group. Differ. Geom. Appl. 2019, 65, 55–77. [Google Scholar] [CrossRef] [Scilit]
- Baspinar, E.; Calatroni, L.; Franceschi, V.; Prandi, D. A Cortical-Inspired Sub-Riemannian Model for Poggendorff-Type Visual Illusions. J. Imaging 2021, 7, 41. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Boscain, U.; Gauthier, J.; Prandi, D.; Remizov, A. Image reconstruction via non-isotropic diffusion in Dubins/Reed-Shepp-like control systems. In Proceedings of the 53rd IEEE Conference on Decision and Control, Los Angeles, CA, USA, 15–17 December 2014; pp. 4278–4283. [Google Scholar]
- Bekkers, E.J.; Duits, R.; Mashtakov, A.; Sanguinetti, G.R. A PDE Approach to Data-driven Sub-Riemannian Geodesics in SE(2). Siam J. Imaging Sci. 2015, 8, 2740–2770. [Google Scholar] [CrossRef] [Scilit]
- Chen, D.; Mirebeau, J.-M.; Shu, M.; Cohen, L.D. Computing geodesic paths encoding a curvature prior for curvilinear structure tracking. Proc. Natl. Acad. Sci. USA 2023, 120, e2218869120. [Google Scholar] [CrossRef] [Scilit]
- Agrachev, A.A.; Sachkov, Y.L. Control Theory from the Geometric Viewpoint; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
- Jurdjevic, V. Rolling Geodesics, Mechanical Systems and Elastic Curves. Mathematics 2022, 10, 4827. [Google Scholar] [CrossRef] [Scilit]
- Jurdjevic, V. Integrable Systems: In the Footprints of the Greats. Mathematics 2023, 11, 1063. [Google Scholar] [CrossRef] [Scilit]
- Mashtakov, A.P.; Sachkov, Y.L. Extremal Trajectories in a Time Minimization Problem on the Group of Motions of a Plane with Admissible Control in a Circular Sector. Tr. Mat. Instituta Im. V.A. Steklova 2023, 321, 215–222. [Google Scholar]
- Bonnard, B.; Jurdjevic, V.; Kupka, I.; Sallet, G. Transitivity of families of invariant vector fields on the semidirect products of Lie groups. Trans. Am. Math. Soc. 1982, 271, 525–535. [Google Scholar] [CrossRef]
- Agrachev, A.; Barilari, D.; Boscain, U. A Comprehensive Introduction to Sub-Riemannian Geometry; Cambridge Studies in Advanced Mathematics; Cambridge University Press: Cambridge, UK, 2019. [Google Scholar]
- Lokutsievskiy, L.V. Convex trigonometry with applications to sub-Finsler geometry. Sb. Math. 2019, 210, 1179–1205. [Google Scholar] [CrossRef] [Scilit]
- Arnold, V.I. Ordinary Differential Equations; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
- Sachkov, Y.L. Left-invariant optimal control problems on Lie groups that are integrable by elliptic functions. Uspekhi Mat. Nauk. 2023, 78, 67–166. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

















