@conference {146,
	title = {3D Mutual Localization with Anonymous Bearing Measurements},
	booktitle = {2012 IEEE Int. Conf. on Robotics and Automation},
	year = {2012},
	month = {05/2012},
	address = {St. Paul, MN},
	abstract = {We present a decentralized algorithm for estimating mutual 3-D poses in a group of mobile robots, such as a team of UAVs. Our algorithm uses bearing measurements reconstructed, e.g., by a visual sensor, and inertial measurements coming from the robot IMU. Since identification of a specific robot in a group would require visual tagging and may be cumbersome in practice, we simply assume that the bear- ing measurements are anonymous. The proposed localization method is a non-trivial extension of our previous algorithm for the 2-D case, and exhibits similar performance and robustness. An experimental validation of the algorithm has been performed using quadrotor UAVs.},
	keywords = {Distributed algorithms, Estimation, Localization, Localization of aerial robots, Multi-robot systems},
	author = {Marco Cognetti and Paolo Stegagno and Antonio Franchi and Giuseppe Oriolo and Heinrich H. B{\"u}lthoff}
}
@article {141,
	title = {Bilateral Teleoperation of Groups of Mobile Robots with Time-Varying Topology},
	journal = {IEEE Transaction on Robotics},
	volume = {28},
	year = {2012},
	month = {10/2012},
	pages = {1019	-1033},
	abstract = {In this paper, a novel decentralized control strategy for bilaterally teleoperating heterogeneous groups of mobile robots from different domains (aerial, ground, marine and under- water) is proposed. By using a decentralized control architecture, the group of robots, treated as the slave-side, is made able to navigate in a cluttered environment while avoiding obstacles, inter-robot 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 inter-robot 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-tloop simulations by considering a heterogeneous fleet of UAVs and UGVs as case study. Finally, we also provide an experimental validation with 4 quadrotor UAV},
	keywords = {Bilateral Shared Control of Mobile Robots, Decentralized control, Distributed algorithms, Force feedback, Haptics, Motion control of multiple robots, Multi-robot systems, Teleoperation},
	author = {Antonio Franchi and Cristian Secchi and Hyoung Il Son and Heinrich H. B{\"u}lthoff and Paolo Robuffo Giordano}
}
@article {134,
	title = {On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms},
	journal = {IEEE Transaction on Robotics},
	volume = {28},
	year = {2012},
	month = {06/2012},
	pages = {592-606},
	abstract = {The subject of this work 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 we 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.},
	keywords = {Coverage, Distributed algorithms, Multi-robot systems, Patrolling / Surveillance},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6122514},
	author = {Fabio Pasqualetti and Antonio Franchi and Francesco Bullo}
}
@article {135,
	title = {Distributed Pursuit-Evasion without Mapping and Global Localization via Local Frontiers},
	journal = {Autonomous Robots},
	volume = {32},
	year = {2012},
	month = {01/2012},
	pages = {81-95},
	abstract = {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.},
	keywords = {Coverage, Distributed algorithms, Multi-robot systems, Pursuit-evasion / Clearing},
	url = {http://www.springerlink.com/content/a02pr41790ll754w/},
	author = {Joseph W. Durham and Antonio Franchi and Francesco Bullo}
}
@conference {145,
	title = {Mutual Localization using Anonymous Bearing Measurements},
	booktitle = {2011 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems},
	year = {2011},
	month = {09/2011},
	address = {San Francisco, CA},
	abstract = {This paper addresses the problem of mutual localization in multi-robot systems in presence of anonymous (i.e., without the identity information) bearing-only measurements. The solution of this problem is relevant for the design and implementation of any decentralized multi-robot algorithm/control. A novel algorithm for probabilistic multiple registration of these measurements is presented, where no global localization, distances, or identity are used. With respect to more conventional solutions that could be conceived on the basis of the current literature, our method is theoretically suitable for tasks requiring frequent, many-to-many encounters among agents (e.g., formation control, cooperative exploration, multiple-view environment sensing). An extensive experimental study validates our method and compares it with the fullinformative case of bearing plus-distance measurements. The results show that the proposed localization system exhibits an accuracy commensurate to our previous method [1] which uses bearing-plus-distance information.},
	keywords = {Distributed algorithms, Estimation, Localization, Multi-robot systems},
	author = {Paolo Stegagno and Marco Cognetti and Antonio Franchi and Giuseppe Oriolo}
}
@article {140,
	title = {The Sensor-based Random Graph Method for Cooperative Robot Exploration},
	journal = {IEEE/ASME Transaction on Mechatronics},
	volume = {14},
	year = {2009},
	month = {04/2009},
	pages = {163-175},
	abstract = {We present a decentralized cooperative exploration strategy for a team of mobile robots equipped with range finders. A roadmap of the explored area, with the associate safe region, is built in the form of a Sensor-based Random Graph (SRG). This is expanded by the robots by using a randomized local planner which automatically realizes a trade-off between information gain and navigation cost. The nodes of the SRG represent view configurations that have been visited by at least one robot, and are connected by arcs that represent safe paths. These paths have been actually traveled by the robots or added to the SRG to improve its connectivity. Decentralized cooperation and coordination mechanisms are used so as to guarantee exploration efficiency and avoid conflicts. Simulations and experiments are presented to show the performance of the proposed technique.},
	keywords = {Coverage, Distributed algorithms, Exploration, Multi-robot systems},
	author = {Antonio Franchi and Luigi Freda and Giuseppe Oriolo and Marilena Vendittelli}
}
