This project investigates how a team of mobile robots with qualitatively different sensing capabilities should be organized in order to effectively cover an area. Given that each of the sensing modalities measures a particular type of event or feature in the domain, in general, it is no longer true that a single density function effectively encodes the importance of a point for all the robots in the team. Instead, we consider a different density function for each of the sensing modalities present in the team, so that each robot can calculate the importance of a point in the domain by composing the density functions associated with each of its sensors.

A coverage control algorithm for teams with heterogeneous sensing capabilities has been published in the IEEE Robotics and Automation Letters and will be presented at the 2018 IEEE International Conference on Robotics and Automation (ICRA) in Brisbane, Australia. Below is the spotlight video for the ICRA presentation:

**Investigators:**

- María Santos
- Yancy Diaz-Mercado
- Magnus Egerstedt

**Related Publications:**

M. Santos, Y. Diaz-Mercado and M. Egerstedt, “Coverage Control for Multirobot Teams With Heterogeneous Sensing Capabilities,” in IEEE Robotics and Automation Letters, vol. 3, no. 2, pp. 919-925, April 2018.

]]>

Paper Submitted to CDC 2017.

Download the video.

]]>Communication is not only essential for sharing sensor measurements and performing diagnostics, it is often an integral part of the closed loop control mechanism. In fact, in many applications and scenarios such as extra-terrestrial exploration, high precision manufacturing, and multi-robot testbeds, the robots frequently rely on communicating with a centralized decision maker for their velocity or position commands. In such situations, a failure in the communication network can severely hinder the motion of the robots and performance of the algorithm. This is the premise behind this project, whereby the adverse effects caused by intermittently failing communication networks are mitigated.

In order to calculate the safe time horizon, we first compute the set of all possible locations that can be reached by a robot within a given time (i.e., the reachable set). This is followed by computing the time horizon for which each robot lies outside the reachable set of other robots. But, for the differential-drive robots considered here, performing such set-membership tests is computationally expensive owing to the non-convexity of the reachable set. Consequently, the reachable set is over-approximated by enclosing it within an ellipse whose convex structure allows for simpler set-membership tests and finite representation. By minimizing the area of the ellipse enclosing the convex hull of the reachable set, we obtain the best ellipsoidal over-approximation of the reachable set in terms of the accuracy and effectiveness of set-membership tests.

Taking advantage of this ellipsoidal approximation, the safe time horizon is defined as the longest time duration for which the robot lies outside the ellipsoidal reachable sets of other robots. Thus, the robot experiencing communication failure can execute its last received velocity command for the corresponding safe time horizon and remain safe. Beyond this, the robot stops moving.

**Investigators:**

- Siddharth Mayya
- Magnus Egerstedt

- Zak Costello
- Yancy Diaz-Mercado
- Rowland O’Flaherty
- Daniel Pickem
- Thiagarajan Ramachandran

]]>