<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Endowing Mobile Robot Teams with Ambient Intelligence for Improved Patient Care</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marin Lujak</string-name>
          <email>marin.lujak@imt-lille-douai.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Panagiotis Papadakis</string-name>
          <email>panagiotis.papadakis@imt-atlantique.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Fernandez</string-name>
          <email>alberto.fernandez@urjc.es</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IMT Atlantique</institution>
          ,
          <addr-line>Brest</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IMT Lille Douai</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University Rey Juan Carlos</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>By networking mobile robots, personal smart devices, and smart space networks, we can provide for a more accurate data for patient care than when the former are used individually. We call this network of personal and smart space devices and robots “Robot-Assisted Ambient Intelligence (RAmI)”. Even more, with the application of distributed network optimization, not only can we improve the assistance of an individual patient, but we can also minimize conflict or congestion over multiple patients' usage of limited resources that are spatially and temporally constrained in such a system. The emphasis of RAmI is on the efficiency and effectiveness of the physical assistance of multiple users and on the influence of individual robot actions on the desired system's performance. In this paper, we propose a distributed RAmI system and put the basis for the architectural setup of such a system. This distributed system should be modular and should facilitate fast decision-making to multiple agents over limited available resources. The proposed architecture is showcased by means of a case study.</p>
      </abstract>
      <kwd-group>
        <kwd>Service robotics</kwd>
        <kwd>ambient intelligence</kwd>
        <kwd>ambient assisted living</kwd>
        <kwd>multirobot systems</kwd>
        <kwd>multi-agent systems</kwd>
        <kwd>patient care</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Ambient Intelligence (AmI) uses multiple sensors fixed in a smart space to assist user’s
activities through recommendation, guidance, and appliance control. However, AmI is
not capable of interacting with a user by physical contact since its user interfaces are
usually tactile, auditive, and/or visual. On the other hand, mobile robots with installed
robot arms are capable of physical user interaction, though with a world view that is
limited to their local sensory and communication capabilities, see, e.g., [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        The quality of service provided by mobile robot teams (MRT) to simultaneous
multiple patients and elderly with decreased mobility depends on the efficiency of the
robots’ coordination with one another and with humans. To keep a good MRT
performance in simultaneous multiple tasks, an updated task information is required. Even
though the MRT quality of service depends on the quality of the available information
that can be facilitated by maintaining the MRT connectivity [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], MRT task assignment
can be performed both in perfect (e.g., [
        <xref ref-type="bibr" rid="ref2 ref4">2,4</xref>
        ]) and imperfect robot networks, e.g., [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
Due to the loss in the information quality, the efficiency of a MRT in the task execution
can fall rapidly, e.g., [
        <xref ref-type="bibr" rid="ref10 ref9">9,10</xref>
        ]. The strategy to employ to mitigate this problem depends
also on the environment that can be collaborative, neutral, or adversarial [
        <xref ref-type="bibr" rid="ref10 ref9">9,10</xref>
        ].
Providing redundant robots to keep the network’s connectivity is a possible approach to
this problem. However, it is costly and can create congestion in narrow spaces. This
is why, here, we propose to network mobile robots, patients’ smart devices, and AmI
networks, such that we can use more accurate data for decision-making than when the
former are used individually. Even more, with the application of distributed network
optimization, not only can we improve the assistance of an individual patient, but we
can also ensure that robots’ actions that are geographically and temporally constrained
in the usage of limited resources do not result in conflict or congestion. We call this
network of AmI, personal devices, and robots “Robot-Assisted Ambient Intelligence
(RAmI)”. The emphasis of RAmI is on the quality of service in simultaneous multiple
patients’ assistance and the influence of individual robot decisions on the desired
system’s performance. One of the issues of RAmI in large installations is its computational
efficiency. Mobile robot teams are intrinsically decentralized and should act quickly and
efficiently in real-time in large smart spaces, e.g., [
        <xref ref-type="bibr" rid="ref3 ref4">3,4</xref>
        ].
      </p>
      <p>
        A distributed ROS-based AmI architecture DAmIA integrating robotic and AmI
sensors for human tracking has been proposed in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. A survey of cloud robotics
that leverages the ad-hoc cloud formed by communicating robots, and an infrastructure
cloud was presented in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], we proposed ORCAS architecture for
manufacturing MRTs that configures and schedules robots based on robots’ and tasks’ semantic
descriptions. In ORCAS, every robot is considered a collaborative agent whose
architecture is made of three layers: semantic, scheduling and the execution layer. The aim
of the semantic layer is to find feasible robots’ configurations which can satisfy
customer demand based on given semantic descriptions about factory setting, available
resources and product specifications. The semantic layer generates compatible subsets
of resources for the given tasks. The scheduling layer determines robot-task
assignments and sequencing of tasks assigned to each robot configuration considering task
interrelations and the robot assembly capacities. The objective is to seamlessly
optimize robots’ performance by dynamic reconfiguration and rescheduling in case of
contingencies thus minimizing overall assembly costs and off-line times. The solution is
found through distributed minimization of total production time and cost considering
resource combinations obtained from the semantic layer. We apply a modification of
dynamic auction-based negotiation [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The execution layer monitors the correct
execution of the schedule in real-time. In case of unpredicted contingencies, the objective
here is to carry out local actions to minimize their effects. The schedule’s quality and
stability are controlled in real-time, e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>In this paper, we formulate the RAmI problem in x2 and in x3 present its architecture
for task assignment and routing of MRTs in congested AmI networks. The principles of
the proposed architecture are demonstrated by means of a case study in x4.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Problem formulation</title>
      <p>We represent a smart building layout by an undirected graph G = (N; A), where N is a
set of smart space agent (SA) nodes representing rooms, offices, halls, and, in general, a
relatively small portion of space within a building. Each arc (i; j) 2 A has an associated
travel time tij , which depends on its length and the relative congestion. Each SA is
responsible of monitoring its surrounding area (by, e.g., iBeacons and cameras) to locate
users’ momentary positions and compute space congestion. Moreover, we assume that
each mobile robot agent assumed with a limited communication range is positioned
in one of nodes n 2 N and it can communicate with the rest of robots within its
communication range and with the belonging SA. Alike, each user is represented by
a user agent u installed on an app of a user’s personal smart device (e.g., tablet or a
smartphone) containing user-relevant info and able to communicate with the closest SA
and the robots if located within their communication range.</p>
      <p>We consider multiple simultaneous item delivery by a MRT to patients in a building.
The most frequent items for delivery to patients are a meal or a medicine. We assume
that there is a set I N of item storage locations in the building. Furthermore, let
O N and D N be the set of all robots and patients at their momentary positions,
respectively. Moreover, we assume that the items are packaged such that only grasping
is required to handle them. Then, the objective is to assign item delivery tasks to robots
in O such that the overall delivery time is minimal considering travel time under
congestion from the robots’ momentary locations through item storages in I, and delivering
the items to patients in D.
3</p>
    </sec>
    <sec id="sec-3">
      <title>RAmI architecture</title>
      <p>The architecture used for the distributed coordination of robots in task assignment and
routing is implemented in each one of the robots and is presented in Fig. 1. It
contains semantic, scheduling and the execution layer. Contrary to ORCAS, in RAmI, we
assume that robot configuration is fixed and that each robot’s delivery capacity is
limited by maximum item’s weight and dimensions. Moreover, all resources and each item
delivery are semantically described by a human operator: e.g., meal/medicine, time of
delivery, weight, dimensions, and type of a meal/medicine. The semantic storage
description contains the information of available items and their hospital locations.</p>
      <p>
        In the semantic layer, a set of compatible robots for each patient demand is found by
using a DL inference engine and SPARQL query language. Scheduling layer contains
the task assignment and route planning module. Based on the semantically described
delivery demand, each robot agent o 2 O coordinates with other robot agents for the
task assignment through the bi-level task assignment algorithm in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. While MRT is
responsible of the MRT task assignment, the AmI network is responsible of updating the
travel times under congestion in the network and distributively optimizing robots’ routes
by using the route finding algorithm in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Robots receive updated routes and travel
times info from the belonging SA. In the execution layer, the individual performance
is monitored in real time and in case of unpredicted events, a robot tries to coordinate
locally with its neighbors to lower their impact. If the local coordination is not sufficient,
the scheduling layer recomputes the robots’ routes. In the case of larger contingencies
that make the schedule infeasible or the addition of robots that can improve the MRT’s
performance, semantic layer updates matchings between the tasks and the MRT.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Case study</title>
      <p>We demonstrate the functionality of the proposed approach by means of a simple case
study example in Figure 2. Given is a simple scenario of a building network with 5
nodes and 6 arcs. There are two mobile robots positioned at o1 and o2, two patients (at
d1 and d2), and inventory node i. Moreover, given are arcs’ travel times tij , [min] for
each arc (i; j). Patients’ delivery items are ontologically described through RDF. The
objective is to find routes from the robots’ positions o1 and o2 through inventory i to
patients d1 and d2 that minimize the overall patient delivery time.</p>
      <p>
        Let us assume that both robots can deliver the demands of both patients d1 and
d2. Then, in the scheduling layer, the robots get assigned to patients’ demands (tasks)
following steps in the MRTA algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] based on the updated paths with shortest
travel times given by SAs. The travel time computation is done by the AmI network
where SA nodes compute distributively the routes through [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        Let us analyze this simple example. Robots start the task assignment through [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
From o1 to d1 and from o2 to d2, there is only one simple path available passing through
i. The overall cost of this assignment is 16. From o1 to d2 and from o2 to d1, there are
four simple paths available for each one of the patient nodes d1 and d2. The overall cost
of optimal paths (o1; i); (i; d2) and (o2; i); (i; d1) is also 16. Since both assignments
have the same cost, the solution is found lexicographically.
      </p>
      <p>
        In the case of contingencies during the moving from one node to another, the robots
try to coordinate among themselves by locally recomputing their routes by following the
algorithm in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. If the solution is unsatisfactory, they recompute routes in the
scheduling layer. If one of them breaks, then the other recomputes its route starting from the
semantic layer.
      </p>
      <p>
        In case of high travel time variations, robots should be able to reroute. This is where
SA agents play a crucial role in observing congestion and updating travel times. The SA
agents compute the routes and inform the robots of the available routes’ arrival times.
MRT performance depends on the navigational maps (i.e. areas where the robots can
safely go) by tracking human trajectories and integrating them within the probabilistic
map which is built directly through the conventional sensory readings (see, e.g., [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]).
Acknowledgements. This work has been partially supported by the COMRADES project
within the framework “Fonds d’amorc¸age Sante´” by Institut Mines Telecom in France.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Chibani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amirat</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohammed</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , et al.:
          <article-title>Ubiquitous robotics: Recent challenges and future trends</article-title>
          .
          <source>Robotics and Autonomous Systems</source>
          <volume>61</volume>
          (
          <issue>11</issue>
          ),
          <fpage>1162</fpage>
          -
          <lpage>1172</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Giordani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinelli</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A distributed algorithm for the multi-robot task allocation problem</article-title>
          . In: Garc´
          <article-title>ıa-</article-title>
          <string-name>
            <surname>Pedrajas</surname>
          </string-name>
          , N.e.a. (ed.)
          <source>Trends in Applied Intelligent Systems, Proceedings of the 23rd Int. Conf. on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE</source>
          <year>2010</year>
          ,
          <article-title>LNCS</article-title>
          , vol.
          <volume>6096</volume>
          , pp.
          <fpage>721</fpage>
          -
          <lpage>730</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Julian</surname>
            ,
            <given-names>B.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angermann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwager</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rus</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Distributed robotic sensor networks: An information-theoretic approach</article-title>
          .
          <source>The Int. J. of Robotics Res</source>
          .
          <volume>31</volume>
          (
          <issue>10</issue>
          ),
          <fpage>1134</fpage>
          -
          <lpage>1154</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kantaros</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavlanos</surname>
            ,
            <given-names>M.M.</given-names>
          </string-name>
          :
          <article-title>Global planning for multi-robot communication networks in complex environments</article-title>
          .
          <source>IEEE Transactions on Robotics</source>
          <volume>32</volume>
          (
          <issue>5</issue>
          ),
          <fpage>1045</fpage>
          -
          <lpage>1061</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Katragjini</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vallada</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruiz</surname>
          </string-name>
          , R.:
          <article-title>Flow shop rescheduling under different types of disruption</article-title>
          .
          <source>International Journal of Production Research</source>
          <volume>51</volume>
          (
          <issue>3</issue>
          ),
          <fpage>780</fpage>
          -
          <lpage>797</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kehoe</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patil</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abbeel</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldberg</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>A survey of research on cloud robotics and automation</article-title>
          .
          <source>IEEE Transactions on automation science and engineering 12(2)</source>
          ,
          <fpage>398</fpage>
          -
          <lpage>409</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Billhardt</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ossowski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Distributed coordination of emergency medical service for angioplasty patients</article-title>
          .
          <source>Annals of Mathematics and Artif. Intell</source>
          .
          <volume>78</volume>
          (
          <issue>1</issue>
          ),
          <fpage>73</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fernandez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>ORCAS: Optimized robots configuration and scheduling system</article-title>
          .
          <source>In: Proc. of the 30th ACM Symp. On Applied Computing</source>
          . vol.
          <volume>1</volume>
          , pp.
          <fpage>327</fpage>
          -
          <lpage>330</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giordani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>On the communication range in the auction-based multi-agent target assignment</article-title>
          . In: Bettstetter,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Gershenson</surname>
          </string-name>
          , C. (eds.)
          <article-title>Self-Organizing Systems</article-title>
          .
          <source>Proc. of the 5th Int. WS, IWSOS</source>
          <year>2011</year>
          ,
          <article-title>LNCS</article-title>
          , vol.
          <volume>6557</volume>
          , pp.
          <fpage>32</fpage>
          -
          <lpage>43</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giordani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ossowski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Value of incomplete information in mobile target allocation</article-title>
          . In: Klgl,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Ossowski</surname>
          </string-name>
          , S. (eds.)
          <article-title>Multiagent System Technologies</article-title>
          .
          <source>Proceedings of the 9th German Conference, MATES</source>
          <year>2011</year>
          ,
          <article-title>LNCS</article-title>
          , vol.
          <volume>6973</volume>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lujak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giordani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ossowski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Route guidance: Bridging system and user optimization in traffic assignment</article-title>
          .
          <source>Neurocomputing</source>
          <volume>151</volume>
          (
          <issue>1</issue>
          ),
          <fpage>449</fpage>
          -
          <lpage>460</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Papadakis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rives</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Binding human spatial interactions with mapping for enhanced mobility in dynamic environments</article-title>
          .
          <source>Autonomous Robots</source>
          <volume>41</volume>
          (
          <issue>5</issue>
          ),
          <fpage>1047</fpage>
          -
          <lpage>1059</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Petitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di Paola</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milella</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lorusso</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Colella</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Attolico</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Caccia</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A network of stationary sensors and mobile robots for distributed ambient intelligence</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          <volume>31</volume>
          (
          <issue>6</issue>
          ),
          <fpage>28</fpage>
          -
          <lpage>34</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Sabattini</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chopra</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Secchi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Decentralized connectivity maintenance for cooperative control of mobile robotic systems</article-title>
          .
          <source>The International Journal of Robotics Research</source>
          <volume>32</volume>
          (
          <issue>12</issue>
          ),
          <fpage>1411</fpage>
          -
          <lpage>1423</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>