In this paper, we propose a distributed elastic behaviour for a deformable chain-like formation of small autonomous underwater vehicles with the task of forming special shapes which have been explicitly defined or are defined by some iso-contour of an environmental concentration field. In the latter case, the formation has to move in such a way as to meet certain formation parameters as well as adapt to the iso-line. We base our controller on our previous models (for manually controlled end points) using general curve evolution theory but will also propose appropriate motions for the end robots of an open chain.
Exploration and mapping of the underwater environment using autonomous vehicles has gained a lot of momentum in the past decade. Numerous robotic platforms have been designed, fabricated and used for practical purposes. One important aspect of mapping is to identify and track boundaries of environmental features. These, in particular, include isolines (level curves) of concentration fields (such as temperature or salinity) (Okubo, A., 1980) as well as bathymetric contours. In (Bennett, A., Leonard, J.J., 2000), a single vehicle tracks bathymetric contours provided by an altitude map (the robot marked 1 in figure 1). Due to inherent limitations of a single vehicle, multi-robot systems have been proposed and studied in recent years, although real-world implementations still lag behind.
In (Ogren, P., Leonard, N.E., 2002) and (Ogren, P., Fiorelli, E., Leonard, N.E., 2004), a small group of robots form special shapes, suitable for estimating local gradients, and localize the source of the field (formation marked 2 in figure 1). In (Zhang, F., Leonard, N.E., 2005), a formation of four robots converge to and track a desired isoline (formation 3 in figure 1), creating contour maps of the environment. These approaches are not scalable. The latter one, although addressing boundary tracking, suffers from the same limitations as the single robot case.
Adaptation to contours
In (Robinett, R.D., Hurtado, J.E., 2004), an arbitrary number of robots individually localize and move to a source by field gradient estimation, attaining a particular formation at the source. The setting in (Christopoulos, V., Roumeliotis, S., 2005) is similar but they are mainly interested in estimating parameters of the diffusion process. There is no tight coupling between the robots in these two approaches and cooperation is not explicitly defined.
On the other hand, the approach studied in (Kalantar, S., Zimmer, U., 2005a), (Kalantar, S., Zimmer, U., 2005b), (Kalantar, S., Zimmer, U., 2006a), and (Marthaller, D., Bertozzi, A.L., 2002) is, in our opinion, a more natural choice for the task of boundary tracking. These specific types of formation are composed of a chain of mobile platforms, cooperatively moving towards the feature of interest, mimicking an elastic band. Apart from being especially suited to isoline tracking, the method is scalable and lends itself to distributed control strategies. We dubbed them contour formations in previous publications (formation 5 in figure 1). The idea, that of evolving an elastic band in such a way that it eventually adapts to a boundary was originally suggested by machine vision researchers in (Caselles, V., Kimmel, R., Sapiro, G., 1997) for segmentation but, nevertheless, the same abstract model can be used for our purposes. This, in turn, inspired the authors of (Marthaller, D., Bertozzi, A.L., 2002) to apply the same concept to robotics straightforwardly. We took this idea further in previous publications, focusing on the problem from a robotics point of view. It should be mentioned that the approach proposed in (Michael, N, Kumar, V., 2005) is very similar but it lacks the elegant inter-robot interaction which is provided by curve evolution schemes.
Here, we will first review the basic concepts, summarize the control scheme developed in (Kalantar, S., Zimmer, U., 2006b) for formations with fixed end points and then propose appropriate motions for free-moving boundary robots. Simulation runs show the effectiveness of the approach.
As in previous papers, we will use Serafina (the autonomous underwater vehicle developed at our lab and shown in figure 2) as the model. To make the presentation simpler, it is assumed that the vehicles are capable of tracking a desired trajectory with negligible dynamics. Thus, the motion of a robot R, with position q, is described by ̇q = τ(q, t), where τ(q, t) represents the designed trajectory. It is also assumed that the robots are individually capable of measuring the local gradient of the field VqF(q).
Serafina
Contour formations
It turns out to be beneficial to model a contour formation by a continuous curve , in the plane, parametrized by s, with boundary condition γR(0, t) = γR(1, t), for a closed curve, and γR(0, t) = γR(1, t) = 0, for an open curve, for all t ≥ t0. Such a curve should ideally act like an elastic band being deformed by an external force ΔxF(x) which is the local gradient of a concentration field . As will be seen shortly, a recipe for realizing such behaviour will lead to a distributed control scheme for contour formations. The most general motion for a curve is
where is the unit tangent vector and (the unit normal vector) is such that form a basis for . Note that, for open curves, these vectors are not defined. Now note that the tangential velocity only changes the parametrization and has no effect on the image of the curve.
ηN(s, t) should include internal as well as external forces:
Among the models proposed are the traditional elastic snake model
and the one based on general curve evolution
where
is the curvature at γR(s, t). g(·) goes to zero as F(γR(s, t)) → Fd. F(q) = Fd defines a level set which we represent with the curve . In the snake formulation, special balloon forces are used, depending on whether the closed curve is inside the level curve or not. The snake equation is the gradient descent for the energy functional
while the equation for curve evolution minimizes . We will base our methods on the more general curve evolution model. Translating back to the case of a collection R of robots Ri, i = 0, …, N − 1, with positions , measured with respect to an inertial coordinate system γ, we will have the general for
is a function of the discrete curvature. An estimate for curvature is given by
where
Also,
and . Note that, in the discrete case, the tangential speed has again appeared. This is due to the fact that normal motion alone does not guarantee uniform tangential distribution.
Now, let every robot be equipped with a compass and define a local coordinate system γi attached to robot Ri. Let denote the position of robot Rj with respect to γi. Then the velocity of Ri in the north-south and west-east directions would be
which is not dependent on the location of an inertial global coordinate system. In the rest of he paper, though, we will use the fixed frame for clarity.
The polyline approximating γR is defined by
where si = γR (qi), and δi(s) = 1 if si ≤ s < si+1 and is 0 otherwise.
The configuration space for is
We would naturally want to keep q in a subset of S(q) based on requirements on smoothness and inter-robot distances.
Definition 1
A formation R is called valid at time instant t if q(t) ∈ Ω., whereand is defined as the set of q's satisfying the following conditions:
is simple (non-intersecting),
For every i = 1, …, N − 1, d1 ≤ ||qi(t) – qi−1(t)|| ≤ d2, for given bounds d1and d2,
For every i = 1, …, N − 2, |κi(t)| ≤ κM,
has the property that for everywheredenotes the x-component of RzT(θj)qj where RzT(θj) is the inverse rotation around z axis by θj = atan((yj+1 – yj−1)/(xj+1 – xj−1)).
Controlling formations
The problem of controlling a contour formation can now be stated as:
Problem 1
Given that
is closed, simple and smooth (C2),
q(t0) ∊ Ω.,
Ri can only communicate with Ri−1and Ri+1, find control lawsandsuch that, for some finite time tf and tolerance bound ε,
q(t) ∊ Ω., ∀t > 0,
, where
The condition defining can be replaced by the simpler condition denotes the closest point on to qi, for every i, which is equivalent to |F(qi) – Fd| < εʺ. This last condition corresponds to what we can actually achieve as no information about is available. Such a control should try to minimize the energy functional
where , and . This implies that, in the absence of external tangential and normal forces, respectively, the curvature at each node should converge to zero and the robots be exactly d units apart. External normal forces are, in this simplified setting, the gradient forces. External tangential forces, on the other hand, could for instance be exerted by obstacles.
In (Kalantar, S., Zimmer, U., 2006b), we proposed a distributed control strategy for an open contour with fixed end points. In this paper, we will extend it to the case of moving end robots. First, consider the motion of interior robots. We state the equations governing the motion and refer to (Kalantar, S., Zimmer, U., 2006b) for details. Define, for i = 1, …, N − 2,
where and
The symbols are explained as follows:
is an external force (disturbance) given by
ui(t) determines the way convergence to the isoline is to be done and a good choice for it is
where .
is the internal restoring force given by where νi(t) = κi(t)gi(t)
is a tangential force for uniformly distributing the robots. For the tangential motion, we put where wi(t) is a decreasing function of the error between the left and right energies, i.e., wi(t) = (ei, i+1 – ei, i−1)Hs(ei, σ) where ei = Ei, i+1(t) – Ei, i−1(t) is the energy difference. The energy is defined as Ei, iω1(t) = (1/2)ei, iω12 where ω ∊ {-, +}, and ei, iω1 = || qiω1, – qi|| – d.
Finally,
φB is a bounding function (such as tanh(αx)).
νN and νT are nominal maximum speeds for normal and tangential motions, respectively.
αN and αT determine the slope of the bounding function.
restricts the external force to satisfy inter-robot distance constraint, where
Denoting Ω = [q1, q2], the function is defined by
where and
WΩ(q) is zero when q ∊ Ω., is −1 when q ≥ q2, and is equal to 1 when q ≤ q1.
restricts the internal force, where
constrains the tangential motion, where
ζi balances the external and internal forces to satisfy the smoothness constraint and is given by ζi = ζ0i ζ−i ζ+i where and
prevents any tangential motion which increases the curvature at the two neighboring robots
ςi is a decreasing function of ei and is used to dampen the normal motion when the energy difference is high, thus giving tangential motion more priority. Refer to figure 3 for the visual demonstration of various forces and gains.
Acting forces and control terms
In this paper, to better study the behaviour of an isolated formation, we will focus on internal forces and ignore external forces which may give rise to anomalous situations. In the next section, appropriate motions for the end robots are explored.
Open Contours
In the mathematical treatment of curve evolution by curvature, the two end points are kept fixed to symmetrize and periodize the curve. The steady state of the evolution process can then be proved to be a straight line segment (Caselles, V., Kimmel, R., Sapiro, G., 1997). In this section, we will examine various candidate motions for the end robots and will pick the most appropriate one. Consider the simplest case of a three-robot formation with just one interior robot, shown in figure 4. Let the curve Ċ(s, 0), composed of the two links connecting q−1(0) and q+1(0) to q0(0), be evolved according to the law
Three-robot system
The transformed and scaled curve
will also go through the same motion. can be regarded as the graph of the function defined by u(x, 0) = 1 – |x|. The evolution of u would thus be
in (−1, 1), where ux = ∂u/∂x and uxx = ∂2/∂x2, while u(−1, t) = u(1, t) = 0. Under these settings, convergence properties for u (and thus C) can be rigorously proved.
Figure 5(a) shows the motion of the robots following the evolution of u. q0(t) is attached to C(1/2, t). q−1(t) and q+1(t) move in such a way that their link with q0(t) pass through q−1(0) and q+1(0), respectively. Thus
where i = −1, +1, and
where u(0, t) is the solution of equation (28) at x = 0. As can be seen from the figure, q−1 and q+1 go through a path with considerable curvature. The tangent to the path taken by them starts from being nearly equal to (qi – q0)/||qi – q0|| to ((qi – q0)/||qi – q0||)┴ at the end of the path when the curvature at q0 becomes zero. Also, keeping the initial start point fixed is not practical.
Figure 5(b) shows a situation where the motion of the two end robots is in the direction of (qi – q0)/||qi – q0|| and there are no fixed points. In this case, the line the robots converge to is shifted down considerably as a function of the initial curvature.
In figure 5(c), the direction of motion is (q+1 – q−1)/||q+1 – q−1||, and thus the normals at each end robot are defined to be the same as the middle robot. Although the paths of the end robots are minimal, they need to know the positions of each other and the way the normal direction is defined is, in principle, at odds with inter-robot distance constraints.
Figure 5(d) is a variant of that in figure 5(b), where the end robots apply a moment proportional to minus the speed function for q0 in the direction ((qi – q0)/||qi – q0||)⊥. This seems to be an appropriate motion in the absence of external forces. Note that, for low curvatures, the behaviour of these four strategies are basically the same.
Motions for end robots
Based on these observations, we define the tangents at the two end robots of a general contour formation by
We will also artificially define
The energy errors would be
and eN−1, N = e−1, 0 = 0. There is no need to constrain the normal motion of the end robots for satisfying inter-robot distances as, in this case, the normal direction is orthogonal to the q1 – q0 (respectively, qN−1 – qN–2) and so we define
The same is true about the tangential motion of the end robots and the constraint related to the curvature of the neighboring robots and thus . Finally, define and
ς0 and ςN−1 remain unchanged. See figure 6 for forces acting on an end robot.
Forces acting on end robots
Simulation results
Some example simulation runs are given here to demonstrate the behaviour of the discussed elastic model.
Figure 7 shows the evolution of a contour formation, fixed at one end (R0), with no pressure from the environment, i.e., we have set ▽qF(q) = 0 (or, more accurately, ui(t) = 0 and gi(t) = 0). The final configuration is a straight line. The constraints are d1 = 60, d2 = 120, and κM = 0.01. Moreover, εκ = 0.03 − 0.01 and εd = 0.1d1. Also, β1 = 108, β2 = 104, and β3 = 10. Figure 8 shows the evolution of a longer formation and with more initial energy. Since only one end is moving, the transmission of tangential energy dissipating pulses takes time. In this run, we have increased β3 to 105. Black lines in the snapshots indicate that the corresponding distance constraint has been violated. Similarly, darker triangles (formed by vertices qi, qi−1, and qi+1) indicate higher curvatures.
Figure 9 shows the converging of a formation, with both end robots moving, to a straight line.
In figure 10, the formation stops moving before dissipating the internal energy. This is because the moving end robot (RN−1) is constrained to remain with the framed area. Any movement of the interior robots will violate some of the constraints.
It is possible to have a formation with desired shapes. To do this, we need to designate desired curvatures for individual robots. Note that any shape can be uniquely determined by its local curvature. This can be achieved by defining .
For example, letting (for i = 0, …, N − 1), will result in an arch, as shown in figure 11. Similarly, let , for , and , for , to get the formation shown in figure 12. Note that, for this operation to be stable, the end points have to be kept fixed.
Figure 13 shows the motion towards and subsequent adaptation to an external profile represented by the curve . Here, we use the formula
for , where denotes the closest point on to qi(t). Also, in place of F(qi) – Fd, we use . Figure 14 shows another example.
An adapted formation can slide along the tangent to the boundary using where cT is a constant speed of traversal. For proper motion, we have to set cT = 0 whenever wi(t)cT < 0, i.e., when they have different directions, thus giving wi(t) higher precedence. Figure 15 shows this behaviour. Note that the robots move along the local tangent to the contour, i.e. , and not
assuming that the formation is sufficiently close to . Normal motion will drag the robots to the boundary.
Simulation 1
Simulation 2
Simulation 3
Simulation 4
Simulation 5
Simulation 6
Simulation 7
Simulation 8
Simulation 9
Conclusions and future research
We defined appropriate boundary conditions for free moving open contours of robotic vehicles in the plane. The designed motion is consistent with motion of interior robots and respects the constrains imposed. This was put into the context of adaptation of these chain like formations to iso-clines or boundaries of environmental advection-diffusion processes. We have assumed no a-priori information about the process. The gradient of such field, though, should be measurable by each individual vehicle. Among the topics addressed in sequel papers are extensions to the case of non-holonomic vehicles with considerable dynamics, as well as motion constrained to manifolds, rigorous results for stability and convergence, interaction with humans, gradient estimation by groups of robots, implementation on real robots, methods for dealing with the effect of turbulence, and obstacle avoidance.
References
1.
BeltaC.KumarV., 2002Towards abstraction and control for large groups of robots, 2nd Intl. Workshop on Control Problems in Robotics and Automation, Las Vegas, NV
2.
BennettA.LeonardJ.J., 2000A behavior-based approach to adaptive feature mapping with autonomous underwater vehicles, IEEE Journal of Oceanic Engineering, Vol. 25, No. 2, pages 213–226
3.
CasellesV.KimmelR.SapiroG., 1997Geodesic Active Contours, Intl. Journal of Computer Vision, Vol. 22, No. 1
4.
ChristopoulosV.RoumeliotisS., 2005Multi Robot Trajectory Generation for Single Source Explosion Parameter Estimation, Proc. IEEE Intl. Conf. on Robotics and Automation, Barcelona, Spain
5.
CortesJ.MartinezS.BulloF., 2004Coverage control for mobile sensing networks, EEE Trans. on Robotics and Automation, Vol. 20, No. 2
6.
GaziV.PassinoK.M., 2002Stability Analysis of Social Foraging Swarms: Combined Effects of Attractant/Repellent Profiles, Proc. 41st IEEE Conf. on Decision and Control, Las Vegas, USA
7.
KalantarS.ZimmerU., 2005aContour Shaped Robotic Formations for Isocline Adaptation, Proc. of the intl. conf TAROS'05, London, U.K.
8.
KalantarS.ZimmerU., 2005bControl of Contour Formations of Autonomous Vehicles by General Curve Evolution Theory, Submitted to ACRA
9.
KalantarS.ZimmerU., 2006aA Formation Control Approach to Adaptation of Contour-Shaped Robotic Formations, Submitted to EUROS
10.
KalantarS.ZimmerU., 2006bControl of Contour-Shaped Robotic Formations with Constraints, Submitted to ICRA
11.
MarthallerD.BertozziA.L., 2002Tracking environmental level sets with autonomous vehicles, Proc. of the Conf. on Cooperative Control and Optimization, Gainesville, Florida
12.
MichaelN.KumarV., 2005Controlling Swarms of Robots Using Interpolated Implicit Functions, Proc. of IEEE Intl. Conf. on Robotics and Automation, Barcelona, Spain
13.
OgrenP.LeonardN.E., 2002Formations with a Mission: Stabe Coordination of Vehicle Group Maneuvers, Proc. Symp. on Math. Theory of Networks and Systems
14.
OgrenP.FiorelliE.LeonardN.E., 2004Cooperative Control of Mobile Sensor Networks: Adaptive Gradient Climbing in a Distributed Environment, IEEE Trans. on Automatic Control, Vol. 49, No. 8
15.
OkuboA., 1980Diffusion and Ecological Problems: Mathematical Models, Vol. 10 in Biomathematics Series, Springer-Verlag
16.
RobinettR.D.HurtadoJ.E., 2004Stability and Control of Collective Systems, Journal of Intelligent and Robotics Systems, Vol. 39, pp. 43–55.
17.
ZarzhitskyD.SpearsW.SpearsW., 2005Distributed Robotics Approach to Chemical Plume Tracing, Proc. of the IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS'05)
18.
ZhangF.LeonardN.E., 2005Generating Contour Plots using Multiple sensor platforms, Proc. of IEEE Swarm Intelligence Symposium