@conference {Alhafnawi2022,
	title = {MOSAIX: a Swarm of Robot Tiles for Social Human-Swarm Interaction},
	booktitle = {2022 International Conference on Robotics and Automation (ICRA)},
	year = {2022},
	pages = {6882-6888},
	doi = {10.1109/ICRA46639.2022.9811723},
	author = {M Alhafnawi and E R Hunt and S Lemaignan and P O{\textquoteright}Dowd and S Hauert}
}
@conference {413,
	title = {AmphiLight: Direct Air-Water Communication with Laser Light},
	booktitle = {17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)},
	year = {2020},
	publisher = {USENIX Association},
	organization = {USENIX Association},
	address = {Santa Clara, CA},
	isbn = {978-1-939133-13-7},
	url = {https://www.usenix.org/conference/nsdi20/presentation/carver},
	author = {Charles J. Carver and Zhao Tian and Hongyong Zhang and Kofi M. Odame and Quattrini~Li, Alberto and Xia Zhou}
}
@article {411,
	title = {Multi-robot online sensing strategies for the construction of communication maps},
	journal = {Autonomous Robots},
	volume = {44},
	year = {2020},
	month = {Jan-03-2020},
	pages = {299 - 319},
	abstract = {This paper tackles the problem of constructing a communication map of a known environment using multiple robots. A communication map encodes information on whether two robots can communicate when they are at two arbitrary locations and plays a fundamental role for a multi-robot system deployment to reliably and effectively achieve a variety of tasks, such as environmental monitoring and exploration. Previous work on communication map building typically considered only scenarios with a fixed base station and designed offline methods, which did not exploit data collected online by the robots. This paper proposes Gaussian Process-based online methods to efficiently build a communication map with multiple robots. Such robots form a mesh network, where there is no fixed base station. Specifically, we provide two leader-follower online sensing strategies to coordinate and guide the robots while collecting data. Furthermore, we improve the performance and computational efficiency by exploiting prior communication models that can be built from the physical map of the environment. Extensive experimental results in simulation and with a team of TurtleBot 2 platforms validate the approach.},
	keywords = {Communication maps, Multi-robot systems, Sensing strategies},
	issn = {0929-5593},
	doi = {10.1007/s10514-019-09862-3},
	url = {http://link.springer.com/10.1007/s10514-019-09862-3},
	author = {Quattrini~Li, Alberto and Penumarthi, Phani Krishna and Banfi, Jacopo and Basilico, Nicola and O{\textquoteright}Kane, Jason M. and Rekleitis, Ioannis and Nelakuditi, Srihari and Amigoni, Francesco}
}
@book {414,
	title = {Online Update of Communication Maps for Exploring Multirobot Systems Under Connectivity Constraints},
	series = {Springer Proceedings in Advanced Robotics - Distributed Autonomous Robotic Systems},
	volume = {9},
	year = {2019},
	pages = {513 - 526},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	keywords = {Communication, Exploration, Multirobot systems},
	isbn = {978-3-030-05815-9},
	issn = {2511-1256},
	doi = {10.1007/978-3-030-05816-610.1007/978-3-030-05816-6_36},
	url = {http://link.springer.com/10.1007/978-3-030-05816-6},
	author = {Amigoni, Francesco and Banfi, Jacopo and Basilico, Nicola and Rekleitis, Ioannis and Quattrini~Li, Alberto},
	editor = {Correll, Nikolaus and Schwager, Mac and Otte, Michael}
}
@conference {417,
	title = {Multi-robot Dubins Coverage with Autonomous Surface Vehicles},
	booktitle = {IEEE International Conference on Robotics and Automation (ICRA)},
	year = {2018},
	url = {https://doi.org/10.1109/ICRA.2018.8460661},
	author = {Nare Karapetyan and Jason Moulton and Jeremy S. Lewis and Quattrini~Li, Alberto and Jason M. O{\textquoteright}Kane and Ioannis Rekleitis}
}
@conference {332,
	title = {Multirobot Exploration for Building Communication Maps with Prior from Communication Models},
	booktitle = {Proceedings of the International Symposium on Multi-Robot and Multi-Agent Systems (MRS)},
	year = {2017},
	author = {Phani Krishna Penumarthi and Quattrini~Li, Alberto and Jacopo Banfi and Nicola Basilico and Francesco Amigoni and Jason O{\textquoteright}Kane and Ioannis Rekleitis and Srihari Nelakuditi}
}
@article {132,
	title = {Decentralized Multi-Robot Encirclement of a 3D Target with Guaranteed Collision Avoidance},
	journal = {Autonomous Robots},
	volume = {40},
	year = {2016},
	month = {02/2016},
	pages = {245-265},
	abstract = {We present a control framework for achieving encirclement of a target moving in 3D using a multi-robot system. Three variations of a basic control strategy are proposed for different versions of the encirclement problem, and their effectiveness is formally established. An extension ensuring maintenance of a safe inter-robot distance is also discussed. The proposed framework is fully decentralized and only requires local communication among robots; in particular, each robot locally estimates all the relevant global quantities. We validate the proposed strategy through simulations on kinematic point robots and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile robots.},
	keywords = {Motion control of multiple robots},
	author = {Antonio Franchi and Paolo Stegagno and Giuseppe Oriolo}
}
@article {136,
	title = {Mutual Localization in Multi-Robot Systems using Anonymous Relative Measurements},
	journal = {The International Journal of Robotics Research},
	volume = {32},
	year = {2013},
	month = {09/2013},
	pages = {1303-1322},
	abstract = {We propose a decentralized method to perform mutual localization in multi-robot systems using anonymous relative measurements, i.e., measurements that do not include the identity of the measured robot. This is a challenging and practically relevant operating scenario that has received little attention in the literature. Our mutual localization algorithm includes two main components: a probabilistic multiple registration stage, which provides all data associations that are consistent with the relative robot measurements and the current belief, and a dynamic filtering stage, which incorporates odometric data into the estimation process. The design of the proposed method proceeds from a detailed formal analysis of the implications of anonymity on the mutual localization problem. Experimental results on a team of differential-drive robots illustrate the effectiveness of the approach, and in particular its robustness against false positives and negatives that may affect the robot measurement process. We also provide an experimental comparison that shows how the proposed method outperforms more classical approaches that may be designed building on existing techniques. The source code of the proposed method is available within the MLAM ROS stack.},
	keywords = {Localization of ground robots},
	author = {Antonio Franchi and Giuseppe Oriolo and Paolo Stegagno}
}
@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}
}
@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}
}
