FranchiOS2013 3 A Franchi G Oriolo P Stegagno 2013-05-00 International Journal of Robotics Research no notspecified http://www.kyb.tuebingen.mpg.de/ accepted 0 Mutual Localization in Multi-Robot Systems using Anonymous Relative Measurements 15017 15422 SonFLKBR2012 3 HI Son A Franchi LL Chuang J Kim HH Bülthoff P Robuffo Giordano 2013-04-00 2 43 597 609 IEEE Transactions on Cybernetics In this paper, we investigate the effect of haptic cueing on a human operator's performance in the field of bilateral teleoperation of multiple mobile robots, particularly multiple unmanned aerial vehicles (UAVs). Two aspects of human performance are deemed important in this area, namely, the maneuverability of mobile robots and the perceptual sensitivity of the remote environment. We introduce metrics that allow us to address these aspects in two psychophysical studies, which are reported here. Three fundamental haptic cue types were evaluated. The Force cue conveys information on the proximity of the commanded trajectory to obstacles in the remote environment. The Velocity cue represents the mismatch between the commanded and actual velocities of the UAVs and can implicitly provide a rich amount of information regarding the actual behavior of the UAVs. Finally, the Velocity+Force cue is a linear combination of the two. Our experimental results show that, while maneuverability is best supported by the Force cue feedback, perceptual sensitivity is best served by the Velocity cue feedback. In addition, we show that large gains in the haptic feedbacks do not always guarantee an enhancement in the teleoperator's performance. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2013a-SonFraChuKimBueRob.pdf published 12 Human-Centered Design and Evaluation of Haptic Cueing for Teleoperation of Multiple Mobile Robots 15017 15422 CensiFMO2012 3 A Censi A Franchi L Marchionni G Oriolo 2013-04-00 2 29 475 492 IEEE Transaction on Robotics Consider a differential-drive mobile robot equipped with an on-board exteroceptive sensor that can estimate its own motion, e.g., a range-finder. Calibration of this robot involves estimating six parameters: three for the odometry (radii and distance between the wheels) and three for the pose of the sensor with respect to the robot. After analyzing the observability of this problem, this paper describes a method for calibrating all parameters at the same time, without the need for external sensors or devices, using only the measurement of the wheel velocities and the data from the exteroceptive sensor. The method does not require the robot to move along particular trajectories. Simultaneous calibration is formulated as a maximum-likelihood problem and the solution is found in a closed form. Experimental results show that the accuracy of the proposed calibration method is very close to the attainable limit given by the Cramér-Rao bound. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2013i-CenFraMarOri.pdf published 17 Simultaneous Calibration of Odometry and Sensor Parameters for Mobile Robots 15017 15422 RobuffoGiordanoFSB2012 3 P Robuffo Giordano A Franchi C Secchi HH Bülthoff 2013-03-00 3 32 299 323 International Journal of Robotics Research The design of decentralized controllers coping with the typical constraints on the inter-robot sensing/communication capabilities represents a promising direction in multi-robot research thanks to the inherent scalability and fault tolerance of these approaches. In these cases, connectivity of the underlying interaction graph plays a fundamental role: it represents a necessary condition for allowing a group or robots to achieve a common task by resorting to only local information. The goal of this paper is to present a novel decentralized strategy able to enforce connectivity maintenance for a group of robots in a flexible way, that is, by granting large freedom to the group internal configuration so as to allow establishment/deletion of interaction links at anytime as long as global connectivity is preserved. A peculiar feature of our approach is that we are able to embed into a unique connectivity preserving action a large number of constraints and requirements for the group: (i) the presence of specific inter-robot sensing/communication models; (ii) group requirements such as formation control; and (iii) individual requirements such as collision avoidance. This is achieved by defining a suitable global potential function of the second smallest eigenvalue λ2 of the graph Laplacian, and by computing, in a decentralized way, a gradient-like controller built on top of this potential. Simulation results obtained with a group of quadrotor unmanned aerial vehicles (UAVs) and unmanned ground vehicles, and experimental results obtained with four quadrotor UAVs, are finally presented to thoroughly illustrate the features of our approach on a concrete case study. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2013/2013l-RobFraSecBue-preprint.pdf published 24 A Passivity-Based Decentralized Strategy for Generalized Connectivity Maintenance 15017 15422 FranchiSSBR2012 3 A Franchi C Secchi HI Son HH Bülthoff P Robuffo Giordano 2012-10-00 5 28 1019 1033 IEEE Transaction on Robotics In this paper, a novel decentralized control strategy for bilaterally teleoperating heterogeneous groups of mobile robots from different domains (aerial, ground, marine, and underwater) is proposed. By using a decentralized control architecture, the group of robots, which is treated as the slave side, is made able to navigate in a cluttered environment while avoiding obstacles, interrobot collisions, and following the human motion commands. Simultaneously, the human operator acting on the master side is provided with a suitable force feedback informative of the group response and of the interaction with the surrounding environment. Using passivity-based techniques, we allow the behavior of the group to be as flexible as possible with arbitrary split and join events (e.g., due to interrobot visibility/packet losses or specific task requirements) while guaranteeing the stability of the system. We provide a rigorous analysis of the system stability and steady-state characteristics and validate performance through human/hardware-in-the-loop simulations by considering a heterogeneous fleet of unmanned aerial vehicles (UAVs) and unmanned ground vehicles as a case study. Finally, we also provide an experimental validation with four quadrotor UAVs. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2012e-FraSecSonBueRob.pdf published 14 Bilateral Teleoperation of Groups of Mobile Robots with Time-Varying Topology 15017 15422 FranchiMGRBR2012 3 A Franchi C Masone V Grabe M Ryll HH Bülthoff P Robuffo Giordano 2012-10-00 12 31 1504 1525 International Journal of Robotics Research In this paper we address the problem of controlling the motion of a group of unmanned aerial vehicles (UAVs) bound to keep a formation defined in terms of only relative angles (i.e. a bearing formation). This problem can naturally arise within the context of several multi-robot applications such as, e.g. exploration, coverage, and surveillance. First, we introduce and thoroughly analyze the concept and properties of bearing formations, and provide a class of minimally linear sets of bearings sufficient to uniquely define such formations. We then propose a bearing-only formation controller requiring only bearing measurements, converging almost globally, and maintaining bounded inter-agent distances despite the lack of direct metric information. The controller still leaves the possibility of imposing group motions tangent to the current bearing formation. These can be either autonomously chosen by the robots because of any additional task (e.g. exploration), or exploited by an assisting human co-operator. For this latter ‘human-in-the-loop’ case, we propose a multi-master/multi-slave bilateral shared control system providing the co-operator with some suitable force cues informative of the UAV performance. The proposed theoretical framework is extensively validated by means of simulations and experiments with quadrotor UAVs equipped with onboard cameras. Practical limitations, e.g. limited field-of-view, are also considered. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2012q-FraMasGraRylBueRob-preprint.pdf published 21 Modeling and Control of UAV Bearing-Formations with Bilateral High-Level Steering 15017 15422 FranchiSRBR2012 3 A Franchi C Secchi M Ryll HH Bülthoff P Robuffo Giordano 2012-09-00 3 19 57 68 IEEE Robotics & Automation Magazine Robustness and flexibility constitute the main advantages of multiple-robot systems with respect to single-robot ones as per the recent literature. The use of multiple unmanned aerial vehicles (UAVs) combines these benefits with the agility and pervasiveness of aerial platforms [1], [2]. The degree of autonomy of the multi-UAV system should be tuned according to the specificities of the situation under consideration. For regular missions, fully autonomous UAV systems are often appropriate, but, in general, the use of semiautonomous groups of UAVs, supervised or partially controlled by one or more human operators, is the only viable solution to deal with the complexity and unpredictability of real-world scenarios as in, e.g., the case of search and rescue missions or exploration of large/cluttered environments [3]. In addition, the human presence is also mandatory for taking the responsibility of critical decisions in high-risk situations [4]. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2012f-FraSecRylBueRob-preprint_01.pdf published 11 Shared Control: Balancing Autonomy and Human Assistance with a Group of Quadrotor UAVs 15017 15422 PasqualettiFB2011 3 F Pasqualetti A Franchi F Bullo 2012-06-00 3 28 592 606 IEEE Transaction on Robotics The subject of this paper is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal properties and of distributed control laws converging to optimal trajectories. As performance criteria, the refresh time and the latency are considered, i.e., respectively, time gap between any two visits of the same region and the time necessary to inform every agent about an event occurred in the environment. We associate a graph with the environment, and we study separately the case of a chain, tree, and cyclic graph. For the case of chain graph, we first describe a minimum refresh time and latency team trajectory and propose a polynomial time algorithm for its computation. Then, we describe a distributed procedure that steers the robots toward an optimal trajectory. For the case of tree graph, a polynomial time algorithm is developed for the minimum refresh time problem, under the technical assumption of a constant number of robots involved in the patrolling task. Finally, we show that the design of a minimum refresh time trajectory for a cyclic graph is NP-hard, and we develop a constant factor approximation algorithm. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2010f-FraPasBul-preprint.pdf published 14 On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms 15017 15422 DurhamFB2011 3 JW Durham A Franchi F Bullo 2012-01-00 1 32 81 95 Autonomous Robots This paper addresses a visibility-based pursuit-evasion problem in which a team of mobile robots with limited sensing and communication capabilities must coordinate to detect any evaders in an unknown, multiply-connected planar environment. Our distributed algorithm to guarantee evader detection is built around maintaining complete coverage of the frontier between cleared and contaminated regions while expanding the cleared region. We detail a novel distributed method for storing and updating this frontier without building a map of the environment or requiring global localization. We demonstrate the functionality of the algorithm through simulations in realistic environments and through hardware experiments. We also compare Monte Carlo results for our algorithm to the theoretical optimum area cleared as a function of the number of robots available. no notspecified http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2012/2011c-DurFraBul-preprint.pdf published 14 Distributed pursuit-evasion without mapping or global localization via local frontiers 15017 15422