Multi-robot motion-formation distributed control with sensor self-calibration: experimental validation

09/20/2018 ∙ by Hector Garcia de Marina, et al. ∙ SDU University of Groningen 0

In this paper, we present the design and implementation of a robust motion formation distributed control algorithm for a team of mobile robots. The primary task for the team is to form a geometric shape, which can be freely translated and rotated at the same time. This approach makes the robots to behave as a cohesive whole, which can be useful in tasks such as collaborative transportation. The robustness of the algorithm relies on the fact that each robot employs only local measurements from a laser sensor which does not need to be off-line calibrated. Furthermore, robots do not need to exchange any information with each other. Being free of sensor calibration and not requiring a communication channel helps the scaling of the overall system to a large number of robots. In addition, since the robots do not need any off-board localization system, but require only relative positions with respect to their neighbors, it can be aimed to have a full autonomous team that operates in environments where such localization systems are not available. The computational cost of the algorithm is inexpensive and the resources from a standard microcontroller will suffice. This fact makes the usage of our approach appealing as a support for other more demanding algorithms, e.g., processing images from onboard cameras. We validate the performance of the algorithm with a team of four mobile robots equipped with low-cost commercially available laser scanners.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 2

page 3

page 5

page 6

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

In recent years, the use of individual and independent robots executing repetitive tasks has gradually been replaced by the exploitation of teams of co-operative robots solving multiple tasks together. The usage of robots in a coordinated fashion is already a reality in many tasks such as the transportation of objects [1], area exploration, and environmental surveillance [2]. All these tasks have practical applications in today’s society such as rescue missions in disaster areas and precision agriculture. In addition, there has been much research in more fundamental topics in the control of multi-agent robotic systems [3, 4, 5, 6], which enhances the efficiency and robustness of the successful execution of the previously mentioned tasks. Difficulties arise, however, when an attempt is made to implement such fundamental control methodologies in actual robots. For example, previous published works prefer to demonstrate their algorithms by employing external motion capture systems, not only as a ground truth, in order to localize their teams of robots [7, 8, 9]. While these systems have advantages for rapid prototyping, they present potential problems if one wants to scale up the multi-robot system or to make it independent of the environment.

In formation control algorithms, it is usually assumed that perfect measurement information is available for the robots, and their robustness against noises in the information is guaranteed by the (locally exponential) stability properties of the closed-loop system [10]. However, in multi-robot systems whose task is to maintain a formation shape by using the popular gradient-descent control [11], if neighboring robots do not have perfectly calibrated sensors, then the exponential robustness of the desired shape does not lead to the stability of the group formation. In particular, the formation will exhibit an undesired collective motion in addition to the distortion of the desired shape [12]. This difficulty can be overcome if the two neighboring robots do not share the same responsibility, e.g., only one robot controls the error distance between two neighbors. This is exemplified in the recent work undertaken by ETH Zürich regarding collaborative transportation by rotorcraft [13], where the robots are in a master-slave configuration while non-external localization system is employed. However, leader-follower configuration leads to the directed topology that describes the relation between neighboring robots [14], which makes the analysis of the key properties of the formation control algorithm, such as stability, the region of attraction or the convergence time, more complicated once we scale up the number of robots. On the other hand, the mentioned analysis is more tractable when both neighboring robots fully cooperate in an undirected topology [14], although one practical drawback of this approach lies in the extra cost of calibrating all pair of sensors on neighboring robots when we increase the number of robots in the team.

In the scenario when two neighboring robots disagree about the distance to be controlled between them, we have proposed in [15]

a solution by adding local estimators to the existing distributed gradient-based formation control law. In this paper we are going to show and experimentally validate that this solution can also be employed for online sensor calibration for a particular definition of a distance error signal.

Further work has led the systematic understanding of how the disagreement in the distances to be controlled by the robots contributes to the collective motion, which eventually has resulted in a new approach for the manipulation, such as coordinated motion, of rigid formations [6, 16]. However, to the best knowledge of the authors of this article, there are not works showing the effectiveness of these algorithms in a fully distributed and autonomous setup, i.e., where one does not employ any external localization system in the control loop (previously we were simulating local measurements from readings of a global localization system [15, 6]), and all the local computations take place on the robots without any communication among them or with a central computer. The experimental validation of such a fully distributed system is crucial in order to assure that no other real issues such as non-synchronized clocks among robots, have a substantial impact on the robustness and performance of the team of robots. This is a relevant subject after the findings showing that the exponential convergence of the gradient-based formation control does not really protect the system against small disturbances in the range sensors.

The paper is organized as follows. Firstly, we explain in Section II our experimental multi-robot platform equipped with low-cost laser scanners without any calibration, just out-of-the-box. Secondly, we introduce in Section III some notation and the concept of rigid formations for controlling shapes via the popular gradient descent. Thirdly, we show in Section IV how an external operator can drive the shape formed by the team of robots as a single entity. In particular, we experimentally show how this formation movement can be precisely achieved with the online calibration, and without requiring any communication between the robots. In addition, we will also present the practical impact of running the formation control law without any calibration routine. Finally, the paper is finished by summarizing some conclusions in Section V.

Ii Multi-robot fully distributed system

The setup for the experimental verification of the algorithms consists of four mobile robots. The dimensions and mobility of our robots are quite similar to the Kuka Youbot [17]. The base of each robot is an aluminum chassis with four 100 mm aluminum Mecanum wheels and a suspension system at the back. This kind of omnidirectional wheels allows the usage of algorithms that focus on kinematic points as motion model as commonly assumed in the literature [3]. The maximum speed of the robots is about 1.0 m/s. For the proposed algorithms and their applications, this speed gives us enough room for the control actions without saturating the motors.

Although our robots are equipped with several kinds of sensors, the only source of information employed by the experiments in this paper is a RP-LIDAR laser scanner mounted over their chassis. These laser scanners are employed to measure the relative position of a robot with respect to its neighbors. The experiments aim at achieving formation shapes where the robots are typically separated by around a couple of meters. The employed laser scanners offer an accuracy up to 0.2% of the measured distance, a maximum range of 6m, and they cover 360 degrees in 0.2 seconds with a resolution of about 1 degree. The motors and the laser scanners are driven by an ATMega microcontroller, which executes the formation control algorithm at a frequency of 5Hz.

There is also onboard of each robot an embedded computer running an Ubuntu 14.04, whose main purpose is to log the experimental data, and to provide a comfortable way to wireless communicate with the robots from a laptop in the same network, e.g., for extracting the logs. In fact, although all the algorithms will be executed in a fully distributed way, an external operator will set the high level objectives of the formation, i.e., the operator will command the size and/or the linear and rotational velocities around the centroid of a desired shape. In particular, the operator only needs to send these high level commands, e.g., with a joystick, if he desires to change the current motion of the formation. As it has been mentioned, once the high level command is set, the robots do not exchange or share any kind of communication or information for achieving the motion task.

(a) The four robots employed with omnidirectional wheels.
(b) RP-LIDAR laser scanner mounted at the front of each robot.
Fig. 1: Hardware used during the experiments.

Iii Control of rigid formations

This section introduces and explains the notation and mathematical concepts that will be used throughout the rest of the paper. Consider a team of robots and denote by their 2D positions with respect to some arbitrary and fixed frame of coordinates. The formation control algorithms generate a velocity signal to be tracked by the robots, i.e., the motion of the robots with omnidirectional wheels can be modeled by

(1)

where

is the stacked vector of positions and

is the generated stacked vector of velocities to be tracked.

A robot does not need to measure its relative position with respect to all the robots in the team, but only with respect to its neighbors. The neighbors’ relationships are described by an undirected graph with the vertex set and the ordered edge set . The set of the neighbors of robot is defined by . We define the elements of the incidence matrix for by

(2)

where and denote the tail and head nodes, respectively, of the edge , i.e., . For undirected graphs, how one sets the direction of the edges is not relevant for the stability results or for the practical implementation of the algorithm [3].

The stacked vector of the sensed relative positions by the robots can be calculated as

(3)

where is the identity matrix, and the operator denotes the Kronecker product. Note that each vector stacked in corresponds to the relative position associated with the edge .

The presented formation control algorithms are based on the distance-based approach, i.e., we are defining shapes by only controlling distances between neighboring robots. These shapes are based on the rigidity graph theory [5]. Concretely, the shapes are from a particular class of rigid formations that are infinitesimally rigid. A framework is defined by the pair , where a position is assigned to each node of the graph. Roughly speaking, a framework is infinitesimally rigid in 2D if it is not possible to smoothly move one node of the framework without moving the rest while maintaining constant all the inter-node distances, the framework is invariant under and only under translations and rotations, and the nodes in the framework are not all collinear.

The introduced concepts and notations are illustrated in Figure 2. In particular, throughout the paper the experimental setup consists of four robots with the following incidence matrix defining the neighbors’ relationship

(4)
(a)
(b)
(c)
(d)
(e)
Fig. 2: a) The square without an inner diagonal is not rigid since we can smoothly move the top two nodes keeping the other two fixed without breaking the distance constraints; b) A rigid but not infinitesimally rigid framework. If we rotate the left inner triangle, then the right inner triangle can be counter-rotated in order to keep constant all the distances; c) A rigid but not infinitesimally rigid framework since the nodes’ positions are collinear; d) The triangle is infinitesimally rigid. The only possible transformations in order to keep the distances constant are the translation or rotation of the whole framework; e) An infinitesimally rigid framework. The number in the circles denotes the label of the node or robot and the number in a diamond represents the edge . Note that robots and are not neighbors. This configuration corresponds to the incidence matrix in (4).

Let be a collection of fixed distances, associated to their corresponding edges, which defines locally a desired infinitesimally rigid shape. Then, the error signals to be minimized are given by

(5)

which is slightly different to the traditional in the literature [3]. While the latter makes the closed loop system easier to analyze, it is (5) which makes a difference for our proposed online calibration.

The control action for each robot in order to stabilize the desired shape can be derived from the gradient descent of the potential function involving all the error distances to be minimized

(6)

which leads to the following control action for each robot

(7)

where each desired distance is associated with its corresponding for the ’th edge of the undirected graph, and the superscript over the vectorial quantities is used for the representation of a vector with respect to the local frame of coordinates of robot . In fact, one appealing property of the distance-based approach is that robots do not need to share any common orientation [3], i.e., it is irrelevant how the laser scanners are mounted with respect to the others. Indeed, this fact add extra robustness to the proposed formation control law. Note that the laser scanners can measure independently the two terms of each element of the sum in (7), i.e., the relative orientation and the actual inter-robot distance . Before starting the experiments, the robots roughly know a priori where their neighbors are placed. Indeed, this condition can be relaxed if we count on an extra more sophisticated localization system based on vision. In fact, we propose to support such localization systems with the presented algorithm in this paper, since algorithms based on vision can help to identify neighbors but they are computationally expensive, and need of a more complex hardware than a microcontroller. Although we assume that there will not be obstacles between the robots as in Figure 2e), this can also be relaxed by considering switching topologies [3], e.g., some links are missing during a finite time. As a result of the mentioned assumptions, the robots can obtain and identify straightforwardly their relative positions with respect to their neighbors employing only a laser, and hence they are ready for independently executing the control action (7).

Iv Formation motion control

Iv-a Translation and rotation of the robotic team

The control action (7) only leads the team of robots to achieve the static formation of a rigid shape. We further need to extend such a control action in order to induce a collective motion, e.g., translations and rotations. A novel algorithm that assign extra velocities to the robots based on their relative positions with respect to their neighbors, allows to achieve such a desired collective motions [6]. Even with this technique one can control the scaling of the shape [18] while guaranteeing stability and convergence properties. In particular, let us focus only in the control of the inter-robot distance for the edge , the extension of (7) only for such an edge can be written as follows in two terms

(8)

where is a motion parameter associated to its corresponding edge. While the first term in (8) controls the inter-robot distance, the second one adds an extra velocity which clearly depends on the current relative position between neighboring robots. The parameter can be chosen small enough111Conversely, a gain for the controller for the error distances can be set big enough. such that the first term achieves the objective of driving the error distance to zero. In such a situation we achieve the following equality

(9)

where the superscript indicates that the relative positions of the robots describe the desired shape, i.e., once all the are equal to zero. Note that in such a case, if we take into account all the edges associated to a robot, the vector velocity of the robot is a linear combination of its relative positions as it is illustrated in Figure 3. If the parameters are chosen appropriately, they can describe rotations and translations of the desired shape [6]. Therefore, the second term in (8) does not brake the desired shape. In fact, can be split in

(10)

where the superscripts denote for different translations (vertical and horizontal) and rotations. For example, we can assign to one of the axis of a joystick the possibility to activate or inhibit one of the parameters in (10), so an operator can easily control the whole formation movement.

Iv-B Experimental validation

We present an experiment with a team of four robots as described in Section II travelling around in a squared formation between furniture in an office by executing the control law (9). The video associated to this experiment can be watched at https://www.youtube.com/watch?v=qdkDreHntNk, and captions are displayed in Figure 4. An operator gives a sequence of commands with a joystick for translating and rotating the formation whenever he desires to change the course of the team. The rest of the time, there is total radio silence since the robots only rely on their laser scanners. The plots in Figure 5 show how the formation translates around with the given constant velocities with practically a perfect shape as the error signals indicate. However, we can notice that the errors do not convergence asymptotically to zero. In fact, depending on which neighboring robot we look at for a particular edge, the error signal for the same distance to be controlled differs. This is the anticipated issue due to the non-calibrated laser scanners. Consequently, the formation does not follow precisely the commanded translation given by the operator, who has to regularly correct the course of the formation. Even when the laser scanners only differ in few millimeters for a squared shape of side of a meter. We will see in the next subsection IV-C that this issue can be eliminated with an online calibration, that can be executed at the same time while the formation is moving.

Fig. 3: According to (9), the velocity of the robots at the desired shape is the linear combination of the unit vectors from their associated relative positions (black dashed lines). The velocity of the robots can be split in the superposition of several ones as shown in (10). For example, the translational velocity for the shape is marked in blue color and it can be constructed by multiplying or by the motion parameters and respectively. In fact, the bigger the motion parameter, the higher the speed of the translational motion. It is straightforward to see that following this procedure, one can construct rotational motion (red velocity vectors), and even scaling motion (green velocity vectors). Obviously, these velocity vectors are always with respect to a frame of coordinates fixed with the desired shape, and not with a fixed frame of global coordinates . Making this approach independent of any external localization system.
(a) Initial position ().
(b) Moving diagonally with the desired shape ().
(c) Between furniture ().
(d) Back at initial positions in a rotated configuration of the desired shape ().
Fig. 4: Pictures of the formation travelling around in an office space.
(a) Inter-robot distance errors measured from the positive side of the edge as defined in (4).
(b) Speed of the robots.
(c) Inter-robot distance errors measured from the negative side of the edge as defined in (4).
Fig. 5: Note how the error signals differ depending on which neighboring robot takes the measurement.

Iv-C Online calibration

In our work in [15] we propose an online estimator in order to compensate distance disagreements between neighboring robots. In particular, it considers the following situation for two neighboring agents and sharing the same edge

(11)

Note that the selection of the error signal (5) makes trivial to identify as a bias factor in the range reading (instead of a disagreement on ). We highlight that this is not the case when the error signal is the usual one considered in the literature, i.e., like in our work in [15], since the squared signals.

For the edge we have two different range sensors, one at each neighboring robot, measuring . Only a discrepancy, or a biased sensor, in one of the edges is needed for pulling the rest of the formation [12]. This has consequences as we have explained in the previous experiment, where the shape is not perfectly achieved, and the operator has to correct the course of the team very often due to an undesired superposed motion. The employed laser scanners have roughly a precision of millimeters without being calibrated out of the box. A priori it sounds good enough for target distances of about a meter or more. We have that the corresponding control actions for the robots in the edge are

(12)

where is now the constant bias between the laser scanners of robots and . Note that the measured range by robot is given by as a whole, and since there is not communication with its neighbor, it cannot trivially figure out the value of . We run an experiment with a static shape in order to measure the impact of this bias. At the beginning of the experiment the robots are collocated close to the desired shape, and after a short transition time the error signals do not converge to zero since the presence of the biases . This is illustrated in Figure 6, where as an example the magnitude of is estimated to be around six millimeters. Consequently, the control action of the robots converge to a non-zero mean stationary value. The robots cannot track a speed below around cm/s because of the friction with the floor. Nevertheless, because the steady-state control signal is closer to that threshold than to zero, due to the noise in the laser scanner, spikes bigger than the threshold are more likely to occur. Since there is a privileged direction for the undesired motion of the formation [12, 6], this one will change its location after a sufficient long time as it is illustrated in Figure 7. In this case, about a meter after five minutes.

Fig. 6: Small biases (of the order of millimeters) in the range sensors between robots lead to different error signals at each robot. As a result, the control actions converge to a non-zero mean value. Consequently, an undesired motion of the formation occurs at the steady-state. The large spikes in the signals are due to the fact that the laser scanners instead of hitting the other sensors sometimes hit another parts of the neighboring robots.
(a) 0 secs.
(b) 300 secs.
Fig. 7: The formation achieves quickly in three seconds the desired one meter side square. However, due to discrepancies of the order of millimeters between the range sensors, there is a undesired collective motion that it is noticeable after a sufficiently long time.

We choose only one robot to estimate the discrepancy with respect to its neighbor. The dynamics of such an estimator [15] and its integration for the robot estimating the discrepancy in the edge is given by

(13)

where is a sufficiently big gain in order to make the estimator to converge quickly, so the gradient descent control for the formation behaves as expected. The selection of the estimating robots is not arbitrary [15]. In fact, this task can be represented by a directed graph, where the tails of the arrows indicate which robot is estimating the discrepancy of a given edge. It suffices that such a graph does not contain any loops. The algorithm (13) guarantees the local exponential convergence of the estimators to the unknown biases, which in practice means to have an online calibration of the sensors. As a result, the formation achieves the commanded desired shape and will not exhibit any undesired motion as it can be seen in Figure 8. Indeed, the online calibration (13) can be used at the same time than the motion control (9). Therefore, improving the practical operation of the motion of the formation by requiring less corrections from the external operator.

Fig. 8: The robots estimate their biases which helps to the convergence of the control error signal to zero where the speeds are also practically, i.e., the robots eventually are at the desired distances with respect to its neighbors. In this experiment, the gain of the estimator (13) has been set to .

V Conclusions

The goal of the presented research has been to show the design and implementation of a robust fully distributed motion formation control algorithm for a team of mobile robots. We have experimentally validated that the formation control algorithms based on undirected graphs cannot be correctly executed if the sensors in neighboring robots are not perfectly calibrated. Although this issue was predicted theoretically in [12], the real practical impact in a fully distributed system had not been investigated yet. We have shown that the algorithm presented in [15] can also be employed for online sensor calibration by appropriately defining the error distance signal. We have further shown that for a common setup of mobile robots with laser scanners, no other issues in practice arise provoking unexpected behaviors. In fact, the proposed motion algorithm and its implementation can be run in an inexpensive microcontroller, and it is robust for driving the formation around obstacles like office furniture.

References

  • [1] Z. Wang and M. Schwager, “Multi-robot manipulation without communication,” in Distributed Autonomous Robotic Systems.   Springer, 2016, pp. 135–149.
  • [2] J. Yuan, Y. Huang, T. Tao, and F. Sun, “A cooperative approach for multi-robot area exploration,” in Intelligent Robots and Systems (IROS), 2010 IEEE/RSJ International Conference on.   IEEE, 2010, pp. 1390–1395.
  • [3] K.-K. Oh, M.-C. Park, and H.-S. Ahn, “A survey of multi-agent formation control,” Automatica, vol. 53, pp. 424–440, 2015.
  • [4] R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE, vol. 95, no. 1, pp. 215–233, 2007.
  • [5] B. D. O. Anderson, C. Yu, B. Fidan, and J. Hendrickx, “Rigid graph control architectures for autonomous formations,” IEEE Control Systems Magazine, vol. 28, pp. 48–63, 2008.
  • [6] H. G. de Marina, B. Jayawardhana, and M. Cao, “Distributed rotational and translational maneuvering of rigid formations and their applications,” Robotics, IEEE Transactions on, vol. 32, no. 3, pp. 684–696, 2016.
  • [7] Y. Mulgaonkar, A. Makineni, L. Guerrero-Bonilla, and V. Kumar, “Robust aerial robot swarms without collision avoidance,” IEEE Robotics and Automation Letters, vol. 3, no. 1, pp. 596–603, 2018.
  • [8] L. Wang, A. D. Ames, and M. Egerstedt, “Safe certificate-based maneuvers for teams of quadrotors using differential flatness,” in Robotics and Automation (ICRA), 2017 IEEE International Conference on.   IEEE, 2017, pp. 3293–3298.
  • [9] D. Pickem, P. Glotfelter, L. Wang, M. Mote, A. Ames, E. Feron, and M. Egerstedt, “The robotarium: A remotely accessible swarm robotics research testbed,” in Robotics and Automation (ICRA), 2017 IEEE International Conference on.   IEEE, 2017, pp. 1699–1706.
  • [10] Z. Sun, S. Mou, B. D. Anderson, and M. Cao, “Exponential stability for formation control systems with generalized controllers: A unified approach,” Systems & Control Letters, vol. 93, pp. 50–57, 2016.
  • [11] L. Krick, M. E. Broucke, and B. A. Francis, “Stabilization of infinitesimally rigid formations of multi-robot networks,” International Journal of Control, vol. 82, pp. 423–439, 2009.
  • [12] S. Mou, M.-A. Belabbas, A. S. Morse, Z. Sun, and B. D. O. Anderson, “Undirected rigid formations are problematic,” IEEE Transactions on Automatic Control, vol. 61, no. 10, pp. 2821–2836, 2016.
  • [13] A. Tagliabue, M. Kamel, R. Siegwart, and J. Nieto, “Robust collaborative object transportation using multiple mavs,” arXiv preprint arXiv:1711.08753, 2017.
  • [14] H. Bai, M. Arcak, and J. Wen, Cooperative Control Design: A Systematic, Passivity-Based Approach.   New York: Springer, 2011.
  • [15] H. G. de Marina, M. Cao, and B. Jayawardhana, “Controlling rigid formations of mobile agents under inconsistent measurements,” Robotics, IEEE Transactions on, vol. 31, no. 1, pp. 31–39, 2015.
  • [16] H. G. de Marina, B. Jayawardhana, and M. Cao, “Taming mismatches in inter-agent distances for the formation-motion control of second-order agents,” IEEE Transactions on Automatic Control, vol. 63, pp. 449–462, 2018.
  • [17] R. Bischoff, U. Huggenberger, and E. Prassler, “Kuka youbot-a mobile manipulator for research and education,” in Robotics and Automation (ICRA), 2011 IEEE International Conference on.   IEEE, 2011, pp. 1–4.
  • [18] H. G. de Marina, B. Jayawardhana, and M. Cao, “Distributed scaling control of rigid formations,” in Decision and Control (CDC), 2016 IEEE 55th Conference on.   IEEE, 2016, pp. 5140–5145.