This paper introduces a hybrid control method for vehicles in n-dimensional space that ensures both goal stabilization and obstacle avoidance through robust, chattering-free switching between modes.
Contribution
It presents a novel hybrid feedback control strategy that guarantees global asymptotic stabilization and obstacle avoidance in n-dimensional Euclidean spaces.
Findings
01
Guarantees robust switching without chattering.
02
Ensures global asymptotic stabilization of the reference position.
03
Demonstrates effectiveness through 3D simulation results.
Abstract
For a vehicle moving in an n-dimensional Euclidean space, we present a construction of a hybrid feedback that guarantees both global asymptotic stabilization of a reference position and avoidance of an obstacle corresponding to a bounded spherical region. The proposed hybrid control algorithm switches between two modes of operation: stabilization (motion-to-goal) and avoidance (boundary-following). The geometric construction of the flow and jump sets of the hybrid controller, exploiting a hysteresis region, guarantees robust switching (chattering-free) between the stabilization and avoidance modes. Simulation results illustrate the performance of the proposed hybrid control approach for a 3-dimensional scenario.
Tables2
Table 1. TABLE I: Points ( x , m ) 𝑥 𝑚 \displaystyle(x,m) and their tangent cones ( m ¯ ¯ 𝑚 \displaystyle\bar{m} is either − 1 1 \displaystyle-1 or 1 1 \displaystyle 1 and n m ¯ ( x ) := π ψ ( p m ¯ − c ) ( x − c ) assign subscript 𝑛 ¯ 𝑚 𝑥 superscript 𝜋 𝜓 subscript 𝑝 ¯ 𝑚 𝑐 𝑥 𝑐 \displaystyle n_{\bar{m}}(x):=\pi^{\psi}(p_{\bar{m}}-c)(x-c) ).
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
A Hybrid Controller for Obstacle Avoidance
in an n-dimensional Euclidean Space
Soulaimane Berkane, Andrea Bisoffi, Dimos V. Dimarogonas
This research was supported in part by the Swedish Research Council (VR), the European Research Council (ERC) through ERC StG BUCOPHSYS, the Swedish Foundation for Strategic Research (SSF), the EU H2020 Co4Robots project, and the Knut and Alice Wallenberg Foundation (KAW).
The authors are with the Department of Automatic Control, KTH Royal Institute of Technology, Sweden. [email protected] (S. Berkane), [email protected] (A. Bisoffi), [email protected] (D. V. Dimarogonas).
(September 2018)
Abstract
For a vehicle moving in an n-dimensional Euclidean space,
we present a construction of a hybrid feedback that guarantees both global asymptotic stabilization of a reference position and avoidance of an obstacle corresponding to a bounded spherical region. The proposed hybrid control algorithm switches between two modes of operation: stabilization (motion-to-goal) and avoidance (boundary-following). The geometric construction of the flow and jump sets of the hybrid controller, exploiting a hysteresis region, guarantees robust switching (chattering-free) between the stabilization and avoidance modes. Simulation results illustrate the performance of the proposed hybrid control approach for a 3-dimensional scenario.
I Introduction
The obstacle avoidance problem is a long lasting problem that has attracted the attention of the robotics and control communities for decades. In a typical robot navigation scenario, the robot is required to reach a given goal (destination) while avoiding to collide with a set of obstacle regions in the workspace. Since the pioneering work by Khatib [1] and the seminal work by Koditscheck and Rimon [2], artificial potential fields or navigation functions have been widely used in the literature, see. e.g., [1, 2, 3, 4], to deal with the obstacle avoidance problem. The idea is to generate an artificial potential field that renders the goal attractive and the obstacles repulsive. Then, by considering trajectories that navigate along the negative gradient of the potential field, one can ensure that the system will reach the desired target from all initial conditions except from a set of measure zero.
This is a well known topological obstruction to global asymptotic stabilization by continuous time-invariant feedback when the free state space is not diffeomorphic to a Euclidean space, see, e.g., [5, Thm. 2.2]. This topological obstruction occurs then also in the navigation transform [6] and (control)-barrier-function approaches [7, 8, 9, 10].
To deal with such a limitation, the authors in [11] have proposed a hybrid state feedback controller to achieve robust global asymptotic regulation, in R2, to a target while avoiding an obstacle. This approach has been exploited in [12] to steer a planar vehicle to the source of an unknown but measurable signal while avoiding an obstacle. In [13], a hybrid control law has been proposed to globally asymptotically stabilize a class of linear systems while avoiding an unsafe single point in Rn.
In this work, we propose a hybrid control algorithm for the global asymptotic stabilization of a single-integrator system that is guaranteed to avoid a non-point spherical obstacle.
Our approach considers trajectories in an n−dimensional Euclidean space and we resort to tools from higher-dimensional geometry [14] to provide a construction of the flow and jump sets where the different modes of operation of the hybrid controller are activated.
Our proposed hybrid algorithm employs a hysteresis-based switching between the avoidance controller and the stabilizing controller in order to guarantee forward invariance of the obstacle-free region (related to safety) and global asymptotic stability of the reference position. The parameters of the hybrid controller can be tuned so that the hybrid control law matches the stabilizing controller in arbitrarily large subsets of the obstacle-free region.
Preliminaries are in Section II, the problem is formulated in Section III, and our solution is in Sections IV-V, with a numerical exemplification in Section VI. All the proofs of the intermediate lemmas are in the appendix.
II Preliminaries
Throughout the paper, R denotes the set of real numbers, Rn is the n-dimensional Euclidean space and Sn is the n-dimensional unit sphere embedded in Rn+1. The Euclidean norm of x∈Rn is defined as ∥x∥:=x⊤x and the geodesic distance between two points x and y on the sphere Sn is defined by dSn(x,y):=arccos(x⊤y) for all x,y∈Sn. The closure, interior and boundary of a set A⊂Rn are denoted as A,A∘ and ∂A, respectively. The relative complement of a set B⊂Rn with respect to a set A is denoted by A∖B and contains the elements of A which are not in B. Given a nonzero vector z∈Rn∖{0}, we define the maps:
[TABLE]
where In is the n×n identity matrix. The map π∥(⋅) is the parallel projection map, π⊥(⋅) is the orthogonal projection map [14], and ρ⊥(⋅) is the reflector map (also called Householder transformation). Consequently, for any x∈Rn, the vector π∥(z)x corresponds to the projection of x onto the line generated by z, π⊥(z)x corresponds to the projection of x onto the hyperplane orthogonal to z and ρ⊥(z)x corresponds to the reflection of x about the hyperplane orthogonal to z. For each z∈n∖{0}, some useful properties of these maps follow:
[TABLE]
We define for z∈n∖{0}
and θ∈ℜ the parametric map
[TABLE]
In (9)–(14), we define for v∈n∖{0} some geometric subsets of Rn, which are described after (14):
[TABLE]
where the symbols △ and ▽ can be selected as △∈{=,<,>,≤,≥} and ▽∈{<,>,≤,≥}.
The set Bϵ(c) in (9) is the ball centered at c∈Rn with radius ϵ.
The set L(c,v) in (10) is the 1−dimensional line passing by the point c∈Rn and with direction parallel to v.
The set P=(c,v) in (11) is the (n−1)−dimensional hyperplane that passes through a point c∈Rn and has normal vector v.
The hyperplane P=(c,v) divides the Euclidean space Rn into two closed sets P≥(c,v) and P≤(c,v).
The set C=(c,v,θ) in (12) is the right circular cone with vertex at c∈Rn, axis parallel to v and aperture 2θ.
The set C△(c,v,θ) in (12) with ≤ as △ (or ≥ as △, respectively) is the region inside (or outside, respectively) the cone C=(c,v,θ).
The plane P=(c,v) divides the conic region C△(c,v,θ) into two regions C≤△(c,v,θ) and C≥△(c,v,θ) in (13).
The set H(c,ϵ,ϵ′,μ) in (14) is called a helmet and is obtained by removing from the spherical shell (annulus) Bϵ′(c)∖Bϵ(c) the portion contained in the ball B∥μc∥(μc), see Fig. 1. The following geometric fact will be used.
Lemma 1
Let c∈Rn and v1,v2∈Sn−1 be some arbitrary unit vectors such that dSn−1(v1,v2)=θ for some θ∈(0,π]. Let ψ1,ψ2∈[0,π] such that ψ1+ψ2<θ<π−(ψ1+ψ2). Then
[TABLE]
Finally, we consider in this paper hybrid dynamical systems [15], described through constrained differential and difference inclusions for state X∈n:
[TABLE]
The data of the hybrid system (15) (i.e., the flow setF⊂Rn, the flow mapF:Rn⇉Rn, the jump setJ⊂Rn, the jump mapJ:Rn⇉Rn) is denoted as H=(F,F,J,J).
III Problem Formulation
We consider a vehicle moving in the n-dimensional Euclidean space according to the following single integrator dynamics:
[TABLE]
where x∈Rn is the state of the vehicle and u∈Rn is the control input. We assume that in the workspace there exists an obstacle considered as a spherical region Bϵ(c) centered at c∈Rn and with radius ϵ>0. The vehicle needs to avoid the obstacle while stabilizing its position to a given reference. Without loss of generality we consider n≥2 and take our reference position at x=0 (the origin)111 For n=1 (i.e., the state space is a line), global asymptotic stabilization with obstacle avoidance is physically impossible to solve via any feedback..
Assumption 1
∥c∥>ϵ>0.
Assumption 1 requires that the reference position x=0 is not inside the obstacle region, otherwise the following control objective would not be feasible. Our objective is indeed to design a control strategy for the input u such that:
i)
the obstacle-free region Rn∖Bϵ(c) is forward invariant;
ii)
the origin x=0 is globally asymptotically stable;
iii)
for each ϵ′>ϵ, there exist controller parameters such that the control law matches, in Rn∖Bϵ′(c), the law u=−k0x (k0>0) used in the absence of the obstacle.
Objective i) guarantees that all trajectories of the closed-loop system are safely avoiding the obstacle by remaining outside the obstacle region. Objectives i) and ii), together, can not be achieved using a continuous feedback due to the topological obstruction discussed in the introduction. Objective iii) is the so-called semiglobal preservation property [13]. This property is desirable when the original controller parameters are optimally tuned and the controller modifications imposed by the presence of the obstacle should be as minimal as possible. Such a property is also accounted for in the quadratic programming formulation of [16, III.A.].
The obstacle avoidance problem described above is solved via a hybrid feedback strategy in Sections IV-V.
IV Proposed Hybrid Control Algorithm for Obstacle Avoidance
In this section, we propose a hybrid controller that switches suitably between an avoidance controller and a stabilizing controller. Let m∈{−1,0,1} be a discrete variable dictating the control mode where m=0 corresponds to the activation of the stabilizing controller and ∣m∣=1 corresponds to the activation of the avoidance controller, which has two configurations m∈{−1,1}. The proposed control input, depending on both the state x∈Rn and the control mode m∈{−1,0,1}, is given by the feedback law
[TABLE]
where km>0 (with m∈{−1,0,1}) and pm∈Rn (with m∈{−1,1}) are design parameters. During the stabilization mode (m=0), the control input above steers x towards x=0. During the avoidance mode (∣m∣=1), the control input above minimizes the distance to the auxiliary attractive point pmwhile maintaining a constant distance to the center of the ball Bϵ(c), thereby avoiding to hit the obstacle. This is done by projecting the feedback −km(x−pm) on the hyperplane orthogonal to (x−c). This control strategy resembles the well-known path planning Bug algorithms (see, e.g., [17]) where the motion planner switches between motion-to-goal objective and boundary-following objective.
We refer the reader to Fig. 2 from now onward for all of this section.
For θ>0 (further bounded in (21)), the points p1,p−1 are selected to lie on the cone222Following the remark in Footnote 1, note that the set C≤=(c,c,θ)∖{c} is nonempty for all n≥2. C≤=(c,c,θ)∖{c}:
[TABLE]
Note that, by (17), p−1 opposes p1 diametrically with respect to the axis of the cone C≤=(c,c,θ) and also belongs to C≤=(c,c,θ)∖{c} as shown in the following lemma.
Lemma 2
p−1∈C≤=(c,c,θ)∖{c}.**
The logic variable m is selected according to a hybrid mechanism that exploits a suitable construction of the flow and jump sets. This hybrid selection is obtained through the hybrid dynamical system
[TABLE]
where ϵs, ϵh, θ, ψ, ψˉ are design parameters selected later as in Assumption 2. Before we state our main result, a discussion motivating the above construction of flow and jump sets is in order.
During the stabilization mode m=0, the closed-loop system should not flow when x is close enough to the surface of the obstacle region Bϵ(c) and the vector field −k0x points inside Bϵ(c). Indeed, by computing the time derivative of ∥x−c∥2, we can obtain the set where the stabilizing vector field −k0x causes a decrease in the distance ∥x−c∥2 to the centre of the obstacle region Bϵ(c). This set is characterized by the inequality
[TABLE]
The closed set in (19) corresponds to the region outside the ball B∥c/2∥(c/2). Therefore, to keep the vehicle safe during the stabilization mode, we define around the obstacle a helmet region H(c,ϵ,ϵs,1/2), which is used as the jump set J0 in (18d). In other words, if during the stabilization mode the vehicle hits this safety helmet, then the controller jumps to avoidance mode. The amount ϵs−ϵ represents the thickness of the safety helmet that defines the jump set J0.
During the avoidance mode ∣m∣=1, we want our controller to slide on the helmet H(c,ϵ,ϵh,μ) while maintaining a constant distance to the center c. Note that, with ϵh>ϵs and μ<1/2, the helmet H(c,ϵ,ϵh,μ) (see also Fig. 1) is an inflated version of the helmet H(c,ϵ,ϵs,1/2) and creates a hysteresis region useful to prevent infinitely many consecutive jumps (Zeno behavior). Let us then characterize in the following lemma the equilibria of the avoidance vector field κ(x,m)=−kmπ⊥(x−c)(x−pm) (∣m∣=1).
Lemma 3
For each x∈n∖{c} and m∈{−1,1}, π⊥(x−c)(x−pm)=0 if and only if
x∈L(c,pm−c).
Since we want the trajectories to leave the set Fm during the avoidance mode, it is necessary to select the point pm and the flow set Fm such that L(c,pm−c)∩Fm=∅ for each m∈{−1,1}, otherwise trajectories can stay in the avoidance mode indefinitely. This motivates the intersection with the conic region in (18e) and Lemma 4, in view of which we pose the following assumption.
The intervals in (20)–(24) are well defined. They can be checked in this order. The intervals of ϵh and ϵs are well defined by Assumption 1. Then, those of μmin, μ, θmax (θmax>0 directly from μ>μmin), θ, ψmax and, finally, those of ψ and ψˉ (corresponding to 0<ψ<ψˉ<ψmax) are also well defined.
Lemma 4
Under Assumption 2, Fm∩L(c,pm−c)=∅, for m∈{−1,1}.
V Main Result
In this section, we state and prove our main result, which corresponds to the objectives discussed in Section III. Let us first write more compactly flow/jump sets and maps:
[TABLE]
The mild regularity conditions satisfied by the hybrid system (18), as in the next lemma, guarantee the applicability of many results in the proof of our main result.
Lemma 5
The hybrid system with data (F,F,J,J) satisfies the hybrid basic conditions in [15, Ass. 6.5].
Let us define the obstacle-free set K and the attractor A as:
[TABLE]
Our main result is given in the following theorem.
Theorem 1
Consider the hybrid system (18) under Assumptions 1-2. Then,
i)
all maximal solutions do not have finite escape times, are complete in the ordinary time direction, and the obstacle-free set K in (28) is forward invariant;
ii)
the set A in (28) is globally asymptotically stable;
iii)
for each ϵ′>ϵ, it is possible to tune the hybrid controller parameters so that the resulting hybrid feedback law matches, in Rn∖Bϵ′(c), the law u=−k0x.
Theorem 1 shows that the three objectives discussed in Section III are fulfilled.
To prove item i), we resort to [18, Thm. 4.3]. We first establish for H in (18) the relationships invoked in [18, Thm. 4.3], and we refer the reader to Fig. 2 for a two-dimensional visualization. In particular, the boundary of the flow set F is given by ∂F={(x,m):x∈∂Fm}, where the sets ∂F0 and ∂Fm,m∈{−1,1}, are
[TABLE]
The tangent cone333For the definition of tangent cone, see [15, Def. 5.12 and Fig. 5.4]., evaluated at the boundary of F, is given in Table I. Consider m=0 and let z:=κ(x,0)=−k0x.
If x∈∂Bϵ(c)∩B∥c/2∥∘(c/2) then one has (x−c)⊤z=−k0x⊤(x−c)>0 (since x∈B∥c/2∥∘(c/2), see (19)), i.e., z∈P>(0,x−c). If x∈(∂B∥c/2∥(c/2)∩Bϵs∘(c))∖Bϵ(c) then one has (x−c/2)⊤z=−k0x⊤(x−c/2)=−k0x⊤c/2=−k0∥x∥2/2≤0 since x⊤(x−c)=0 from ∥x−c/2∥=∥c/2∥. Then, z∈P≤(0,x−c/2).
If x∈∂Bϵ(c)∩∂B∥c/2∥(c/2) or x∈∂B∥c/2∥(c/2)∩∂Bϵs(c) then z⊤(x−c)=0 and z⊤(x−c/2)=−k0∥x∥2/2≤0 showing, respectively, that z∈P≥(0,x−c)∩P≤(0,x−c/2).
Finally, if x∈∂Bϵs(c)∖B∥c/2∥(c/2), then one has (x−c)⊤z=−k0x⊤(x−c)<0 (since x∈/B∥c/2∥(c/2)), i.e., z∈P<(0,x−c). Let L0:=∂Bϵs(c)∖B∥c/2∥(c/2). Therefore, by all the previous arguments,
[TABLE]
Consider then m∈{−1,1} and let now z:=κ(x,m)=−kmπ⊥(x−c)(x−pm).
If x∈∂Bϵ(c) or x∈∂Bϵh(c) then one has (x−c)⊤z=−km(x−c)⊤π⊥(x−c)(x−pm)=0, which implies that both z∈P≥(0,x−c) and z∈P≤(0,x−c).
Define nm(x):=πψ(pm−c)(x−c), which is a normal vector to the cone C=(c,pm−c,ψ) at x.
If x∈C≤=(c,pm−c,ψ), then444Each (in)equality is obtained thanks to the relationship reported over it.
[TABLE]
where the last bound follows from π⊥(pm−c) positive semidefinite and (x−c)⊤(pm−c)≤0 (since x∈C≤=(c,pm−c,ψ)⊂P≤(c,pm−c)). Hence, z∈P≥(0,nm(x)). Finally, let x∈∂B∥μc∥(μc)∩Bϵh(c)∖Bϵ∘(c). With θmax in (23), we have
[TABLE]
where the bounds in (30a) follow from (33) in the proof of the previous Lemma 4, μ<1/2, and x∈∂B∥μc∥(μc)∩Bϵh(c)∖Bϵ∘(c)⊂H(c,ϵ,ϵh,μ); (30c) follows from pm∈C≤=(c,c,θ) (by (17) and Lemma 2). So
[TABLE]
since km>0, 1−μ>0 (from (20)) and θ<θmax (from (21)). (x−μc)⊤z<0 implies then z∈P<(0,x−μc). Let Lm:=∂B∥μc∥(μc)∩Bϵh(c)∖Bϵ∘(c). Therefore, by all the previous arguments,
[TABLE]
We can now apply [18, Thm. 4.3]. With K in (28), let F^:=∂(K∩F)∖L with L:={(x,m)∈∂F:F(x,m)∩TF(x,m)=∅}. By (29) and (31) and K∩F=F, we have F^=∪m=−1,0,1(∂Fm∖Lm)×{m}
and L=∪m=−1,0,1Lm×{m}. It follows from (29) and (31) that for every (x,m)∈F^, F(x,m)⊂TF(x,m). Also, J(K∩J)⊂K, F is closed, the map F satisfies the hybrid basic conditions as proven in Lemma 5 and it is, moreover, locally Lipschitz since it is continuously differentiable. We conclude then that the set K is forward pre-invariant [18, Def. 3.3]. In addition, since L0⊂J0 and Lm⊂Jm with m∈{−1,1}, one has L⊂J. Besides, finite escape times can only occur through flow, and since the sets F−1 and F1 are bounded by their definitions in (18e), finite escape times cannot occur for x∈F−1∪F1. They can neither occur for x∈F0 because they would make x⊤x grow unbounded, and this would contradict that dtd(x⊤x)≤0 by the definition of κ(x,0) and by (18a). Therefore, all maximal solutions do not have finite escape times. By [18, Thm. 4.3] again, the set K is actually forward invariant [18, Def. 3.3], and solutions are complete. Finally, we anticipate here a straightforward corollary of completeness and Lemma 7 below: since the number of jumps is finite by Lemma 7, all maximal solutions to (18) are actually complete in the ordinary time direction.
Now, we will prove item ii) in two steps. First, we prove in the following Lemma 6 that the set A is globally asymptotically stable for the system without jumps. To this end, the jumpless system has data
H0=(F,F,∅,∅)
with flow map F and flow set F defined in (18). We emphasize that H0 is obtained in accordance to [19, Eqq. (38)-(39)] by identifying all jumps with events.
Lemma 6
A* in (28) is globally asymptotically stable for the jumpless hybrid system H0.*
Second, we prove in the following Lemma 7 that the number of jumps is finite for the given hybrid dynamics in (18).
Lemma 7
For H in (18), each solution starting in K experiences no more than 3 jumps.
Based on Lemmas 6-7, global asymptotic stability of A follows straightforwardly from [19, Thm. 31] since the hybrid system in (18) satisfies the Basic Assumptions [19, p. 43], as proven in Lemma 5, the set A is compact and has empty intersection with the jump set.
Lastly, to prove item iii), let ϵ′>ϵ. Select the parameter ϵh∈(ϵ,min(ϵ′,ϵ∥c∥)) while all other hybrid controller parameters are selected as in Assumption 2. Then this implies that the flow sets Fm,m∈{−1,1}, of the avoidance mode are entirely contained in Bϵ′(c). Therefore, as long as the state x remains in Rn∖Bϵ′(c), solutions are enforced to flow only with the stabilizing mode m=0, which corresponds to the feedback law u=−k0x.
VI Numerical example
We illustrate our results through a three-dimensional example. The hybrid system in (18) is fully specified by the following parameters. The obstacle has center c=(1,1,1) and radius ϵ=0.700. The controller gains are km=1 for m∈{−1,0,1}. The parameters used in the construction of the flow and jump sets are ϵh=0.901, ϵs=0.800, μ=0.444, θ=0.276, which satisfy Assumption 2. To select a point p1∈C≤=(c,c,θ)∖{c}, we proceed as follows. Select v∈Sn such that v⊤c=0 and consider R(v,θ)∈SO(3), i.e., an orthogonal rotation matrix specified by axis v and angle θ. Then, we can verify that the point p1=(I3−R(v,θ))c is a point on the cone C≤=(c,c,θ). By letting v=(0,1,−1), we determine p1=(0.424,−0.155,−0.155) and p−1=(−0.348,0.231,0.231) as in (17). We also select ψ=0.249 and ψˉ=0.266, which satisfy Assumption 2.
Fig. 3 shows that the objectives posed in Section III and proven in Theorem 1 are fulfilled. The top part of the figure illustrates the relevant sets. The middle part shows that the origin is globally asymptotically stable, and the control law matches the stabilizing one sufficiently away from the obstacle. The bottom part shows that the solutions are safe since they all stay away from the obstacle set Bϵ(c).
Let xi∈C≤(c,vi,ψi)∖{c},i=1,2, and be otherwise arbitrary. Define then zi:=(xi−c)/∥xi−c∥∈Sn−1 for i=1,2. Hence, zi∈Si with Si:=C≤(0,vi,ψi)∩Sn−1, i=1,2.
Since zi∈C≤(0,vi,ψi), either
dSn−1(vi,zi)≤ψi (upper half cone) or dSn−1(−vi,zi)≤ψi (lower half cone), for i=1,2. Consider all possible cases.
If dSn−1(vi,zi)≤ψi for both i=1,2, then it follows from the triangle inequality that
θ=dSn−1(v1,v2)≤dSn−1(v1,z1)+dSn−1(z1,z2)+dSn−1(v2,z2)≤dSn−1(z1,z2)+ψ1+ψ2.
Hence, in view of the condition ψ1+ψ2<θ, dSn−1(z1,z2)>0.
If, on the other hand, dSn−1(−v1,z1)≤ψ1 and dSn−1(v2,z2)≤ψ2, we have
π−θ=dSn−1(−v1,v2)≤dSn−1(−v1,z1)+dSn−1(z1,z2)+dSn−1(v2,z2)≤dSn−1(z1,z2)+ψ1+ψ2.
Hence, in view of the condition θ<π−(ψ1+ψ2), dSn−1(z1,z2)>0.
The two cases of dSn−1(−v1,z1)≤ψ1 and dSn−1(−v2,z2)≤ψ2, and of dSn−1(v1,z1)≤ψ1 and dSn−1(−v2,z2)≤ψ2 lead analogously to the same conclusion. dSn−1(z1,z2)>0 implies that the sets S1 and S2 (and in turn C≤(c,vi,ψi)∖{c},i=1,2)
are disjoint.
Let m be either −1 or 1. The ⟸ implication is straightforward. As for the ⟹ implication, let x∈Rn∖{c} be such that π⊥(x−c)(x−pm)=0, which is equivalent to π⊥(x−c)(pm−c)=0. By the definition of the map π⊥(⋅), one obtains ∥x−c∥2(pm−c)=(pm−c)⊤(x−c)(x−c). However, (pm−c)⊤(x−c)=0, otherwise we would have pm=c (not true by (17) and Lemma 2). Therefore, by letting \displaystyle\lambda=\|x-c\|^{2}/\big{(}(p_{m}-c)^{\top}(x-c)\big{)} in (10), one deduces that x∈L(c,pm−c).
Let m be either −1 or 1. To deduce the claim, we prove first the relations:
[TABLE]
As for (32a), let x∈L(c,pm−c). Then there exists λ such that x−c=λ(pm−c) and, hence,
[TABLE]
since pm∈C=(c,c,θ) by (17) and Lemma 2, so (32a) is proven. As for (32b), let x∈L(c,pm−c)∖{c}. Then there exists λ=0 such that x−c=λ(pm−c) and, hence,
[TABLE]
by (8), (3), (2), so (32b) is proven. As for (32c), let x∈L(c,pm−c)∩P≥(c,pm−c). Then there exists λ≥0 such that x−c=λ(pm−c) and, hence,
[TABLE]
where we used pm∈C≤=(c,c,θ) and 0<θ<θmax<π/2 by Assumption 2. Hence, one has x∈P≤(c,c), so (32c) is proven. As for (32d), let x∈H(c,ϵ,ϵh,μ), then x∈Bϵh(c), x∈Rn∖B∥μc∥(μc), and x∈Rn∖Bϵ(c) by (14). So,
[TABLE]
However, for all z, z∈C≤=(c,c,θ) is equivalent to (z−c)⊤πθ(c)(z−c)=0 and c⊤(z−c)≤0, i.e., c⊤(z−c)=−cos(θ)∥z−c∥∥c∥<−cos(θmax)∥z−c∥∥c∥ by θ∈(0,θmax) in Assumption 2. Then, by comparing with (33), x∈/C≤=(c,c,θ), so (32d) is proven. Thanks to (32), the claim of the lemma is deduced as follows:
F and J are closed subsets of n×{−1,0,1}. F is a continuous function in F (hence, it is outer semicontinuous and locally bounded relative to F, F⊂domF, and F(x,m) is convex for every (x,m)∈F). J has a closed graph in J, is locally bounded relative to J and is nonempty on J. In particular, let us show that M(x,0)=∅ for all x∈J0.
We preliminarily show that ∩m=−1,1C≤(c,pm−c,ψˉ)={c}. Let vm=(pm−c)/∥pm−c∥, and substitute in
[TABLE]
where we have used, in this order, the facts that ρ⊥(c)=2πθ(c)−cos(2θ)In, ρ⊥(c)ρ⊥(c)=In and (p1−c)⊤πθ(c)(p1−c)=0 (since p1∈C=(c,c,θ) is implied by (17)).
Then, by Lemma 1 and 2ψˉ<2θ<π−2ψˉ (from (21) and (24), ψˉ<min(θ,π/2−θ)), ∩m=−1,1C≤(c,pm−c,ψˉ)={c}. Hence, it can be shown by a contradiction argument that ∪m=−1,1C≥(c,pm−c,ψˉ)=Rn. Therefore, in view of (18g), the set M(x,0) is nonempty.
Finally, M(x,0) has a closed graph since the construction in (18g) allows M to be set-valued whenever x∈∩m=−1,1C≥(c,pm−c,ψˉ)∩J0.
with p0:=0 and pm (m∈{−1,1}) defined in (17). One has V(x,m)=0 for all (x,m)∈A in (28), V(x,m)>0 for all (x,m)∈/A, and is radially unbounded relative to F∪J. Straightforward computations show that
[TABLE]
The last inequality follows from projection matrices being positive semidefinite and Lemma 3, which implies that it cannot be ⟨∇V(x,m),F(x,m)⟩=0 for m∈{−1,1} and all x∈Fm since L(c,pm−c) is excluded from Fm by Lemma 4. All the above conditions satisfied by V suffice to conclude global asymptotic stability of A for H0 since A is compact and H0 satisfies [15, Ass. 6.5].
We prove, case by case, that the number of jumps, denoted N, does not exceed 3.
(i)Case m(0,0)=0.
Let us define the disjoint sets
[TABLE]
with cos(γ):=1−ϵs2/∥c∥2 (well-defined by Assumption 1 and (20)). Note that Ra∪Rb∪J0=Rn∖Bϵ(c).
(i.1)x(0,0)∈Rb: Solutions can only flow. Consider then the jumpless hybrid system in n with data (−k0x,Rb,∅,∅) and let us show that maximal solutions are complete. Since finite escape times are excluded, it is sufficient (by, e.g., [15, Prop. 2.10]) to show that the viability condition {−k0x}⊂TRb(x) holds for all x∈∂Rb, with
[TABLE]
and TRb(x) in the following table.
Let z:=−k0x and let us show that z∈TRb(x) for all x∈∂Rb. If x∈B∥c/2∥(c/2), then z⊤(x−c)=−k0x⊤(x−c)≥0, hence z∈P≥(0,x−c). If x∈∂B∥c/2∥(c/2), then z⊤(x−c/2)=−k0x⊤(x−c/2)=−k0x⊤c/2=−k0∥x∥2/2≤0, hence z∈P≤(0,x−c/2). Finally, if x∈C≥=(0,c,γ), then z⊤πγ(c)x=−k0x⊤πγ(c)x=0 implying that z∈P≥(0,πγ(c)x), where πγ(c)x is a normal vector to C≥=(0,c,γ) at x. By combining these cases and inspecting the previous table, the above viability condition holds for all x∈∂Rb, hence solutions are complete. Therefore, N=0 for each solution with this initial condition.
(i.2)x(0,0)∈Ra: We argue that J0 is reached in finite time. Let us preliminarily show that
[TABLE]
Let x∈∂B∥c/2∥(c/2)∩C≥<(0,c,γ). Since x∈∂B∥c/2∥(c/2), one has ∥x−c/2∥2=∥c/2∥2, i.e., ∥x∥2=c⊤x. Besides, since x∈C≥<(0,c,γ), one has c⊤x=∥x∥2>cos(γ)∥x∥∥c∥, i.e., −∥x∥2<ϵs2−∥c∥2 by the definition of cos(γ) in (i).
By ∥x∥2=c⊤x and the last bound, we have ∥x−c∥2=∥c∥2−∥x∥2<ϵs2, i.e., x∈Bϵs∘(c). Therefore, by (37) and (35), it can only be \displaystyle\partial\mathcal{R}_{a}=\big{(}\mathcal{C}^{=}_{\geq}(0,c,\gamma)\setminus\mathcal{B}_{\|c/2\|}(c/2)\big{)}\cup\big{(}\partial\mathcal{B}_{\epsilon_{s}}(c)\setminus\mathcal{B}^{\circ}_{\|c/2\|}(c/2)\big{)}.
Then, note that maximal solutions to (18) with the current initial condition are complete by item i), previously proven. Since V(x,0):=∥x∥2/2 in (34) is strictly decreasing along the flow in Ra and is bounded from below, such complete solutions cannot flow indefinitely in Ra×{0} and must leave this set in finite time. On the other hand, they cannot leave through C≥=(0,c,γ)∖B∥c/2∥(c/2). Indeed, for all x∈C≥=(0,c,γ), (−k0x)⊤πγ(c)x=0 and thus {−k0x}∈P=(0,πγ(c)x)⊂P≤(0,πγ(c)x) which is the tangent cone of Ra at x (πγ(c)x is defined in item (i.1)).
It follows that solutions must leave Ra through ∂Bϵs(c)∖B∥c/2∥∘(c/2)⊂J0, that is, they reach J0 in finite time. From there, the analysis boils down to that in item (i.3).
Therefore, N=2 for each solution with this initial condition.
(i.3)x(0,0)∈J0: According to the jump map, m(0,1)=m′ for some m′∈{−1,1} and the jump map in (18g) ensures x(0,0)=x(0,1)∈C≥(c,pm′−c,ψˉ). Therefore, since we selected ψˉ>ψ in (21), one has x(0,1)∈C≥(c,pm′−c,ψˉ)∩J0⊂C>(c,pm′−c,ψ)∩J0⊂Fm′∖Jm′. Hence, x(0,1)∈Fm′∖Jm′, thereby excluding a further consecutive jump. We show in item (ii.2)
that after a flow, one jump is experienced. Therefore, N=2 for each solution with this initial condition.
(ii)Case m(0,0)=mˉ∈{−1,1}.
(ii.1)x(0,0)∈Jmˉ: According to the jump map, one has m(0,1)=0 and the cases (i.1), (i.2), or (i.3)
can occur. Therefore N≤3 for each solution with this initial condition.
(ii.2)x(0,0)∈Fmˉ∖Jmˉ.
An argument similar to that in (i.2)
concludes that solutions to (18) with this initial condition must leave Fmˉ∖Jmˉ in finite time.
Indeed, solutions are complete by Theorem 1 and V(x,mˉ) in (34) is strictly decreasing along the flow in Fmˉ by the proof in Lemma 6 and bounded from below, so solutions cannot flow indefinitely in Fmˉ.
Then, by similar arguments as in the previously proven item i) of Theorem 1, solutions can reach in finite time only the set Lmˉ (defined there, above (31)). However, Lmˉ⊂Rb, and we have shown in item (i.1)
that no jumps are experienced in Rb. Therefore, N=1 for each solution with this initial condition.
Because all the possible cases for x and m are covered without circularity, we conclude then that each solution starting in K experiences no more than 3 jumps.
Bibliography19
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” in Autonomous robot vehicles . Springer, 1986, pp. 396–404.
2[2] D. E. Koditschek and E. Rimon, “Robot navigation functions on manifolds with boundary,” Advances in applied mathematics , vol. 11, no. 4, pp. 412–442, 1990.
3[3] D. V. Dimarogonas, S. G. Loizou, K. J. Kyriakopoulos, and M. M. Zavlanos, “A feedback stabilization and collision avoidance scheme for multiple independent non-point agents,” Automatica , vol. 42, no. 2, pp. 229–243, 2006.
4[4] I. Filippidis and K. J. Kyriakopoulos, “Navigation functions for focally admissible surfaces,” in American Control Conference , 2013, pp. 994–999.
5[5] F. Wilson Jr, “The structure of the level surfaces of a Lyapunov function,” Journal of Differential Equations , 1967.
6[6] S. G. Loizou, “The navigation transformation,” IEEE Trans. Robot. , vol. 33, no. 6, pp. 1516–1523, 2017.
7[7] S. Prajna, A. Jadbabaie, and G. J. Pappas, “A framework for worst-case and stochastic safety verification using barrier certificates,” IEEE Trans. Automat. Contr. , vol. 52, no. 8, pp. 1415–1428, 2007.
8[8] P. Wieland and F. Allgöwer, “Constructive safety using control barrier functions,” IFAC Proceedings Volumes , vol. 40, no. 12, pp. 462–467, 2007.