Aniket Shirsat

Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach

IEEE Transactions on Robotics, 2021

Probabilistic Consensus on Feature Distribution for Multi-Robot Systems With Markovian Exploration Dynamics

IEEE Robotics and Automation Letters

In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a d... more In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a discrete distribution of features, modeled as an occupancy grid map, that represent information contained in a bounded planar environment, such as visual cues used for navigation or semantic labels associated with object detection. The robots explore the environment according to a random walk modeled by a discrete-time discrete-state (DTDS) Markov chain and estimate the feature distribution from their own measurements and the estimates communicated by neighboring robots, using a distributed Chernoff fusion protocol. We prove that under this decentralized fusion protocol, each robot's feature distribution converges to the actual distribution in an almost sure sense. We verify this result in numerical simulations that show that the Hellinger distance between the estimated and actual feature distributions converges to zero over time for each robot. We also validate our strategy through Software-In-The-Loop (SITL) simulations of quadrotors that search a bounded square grid for a set of visual features distributed on a discretized circle.

Download

Decentralized Multi-target Tracking with Multiple Quadrotors using a PHD Filter

AIAA Scitech 2021 Forum, 2021

We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary t... more We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary targets in an unknown, bounded environment. The quadrotors search for targets along a spatial grid overlaid on the environment while performing a random walk on this grid modeled by a discrete-time discrete-state (DTDS) Markov chain. The quadrotors can transmit their estimates of the target locations to other quadrotors that occupy their current location on the grid; thus, their communication network is time-varying and not necessarily connected. We model the search procedure as a renewal-reward process on the underlying DTDS Markov chain. To accommodate changes in the set of targets observed by each quadrotor as it explores the environment, along with uncertainties in the quadrotors' measurements of the targets, we formulate the tracking problem in terms of Random Finite Sets (RFS). The quadrotors use RFS-based Probability Hypothesis Density (PHD) filters to estimate the number of targets and their locations. We present a theoretical estimation framework, based on the Gaussian Mixture formulation of the PHD filter, and preliminary simulation results toward extending existing approaches for RFS-based multi-target tracking to a decentralized multi-robot strategy for multi-target tracking. We validate this approach with simulations of multi-target tracking scenarios with different densities of robots and targets, and we evaluate the average time required for the robots in each scenario to reach agreement on a common set of targets.

Download

Decentralized Multi-target Tracking with Multiple Quadrotors using a PHD Filter

AIAA Scitech 2021 Forum, 2021

We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary t... more We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary targets in an unknown, bounded environment. The quadrotors search for targets along a spatial grid overlaid on the environment while performing a random walk on this grid modeled by a discrete-time discrete-state (DTDS) Markov chain. The quadrotors can transmit their estimates of the target locations to other quadrotors that occupy their current location on the grid; thus, their communication network is time-varying and not necessarily connected. We model the search procedure as a renewal-reward process on the underlying DTDS Markov chain. To accommodate changes in the set of targets observed by each quadrotor as it explores the environment, along with uncertainties in the quadrotors' measurements of the targets, we formulate the tracking problem in terms of Random Finite Sets (RFS). The quadrotors use RFS-based Probability Hypothesis Density (PHD) filters to estimate the number of targets and their locations. We present a theoretical estimation framework, based on the Gaussian Mixture formulation of the PHD filter, and preliminary simulation results toward extending existing approaches for RFS-based multi-target tracking to a decentralized multi-robot strategy for multi-target tracking. We validate this approach with simulations of multi-target tracking scenarios with different densities of robots and targets, and we evaluate the average time required for the robots in each scenario to reach agreement on a common set of targets.

Download

Multi-Robot Target Search using Probabilistic Consensus on Discrete Markov Chains

2020 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), 2020

In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is rob... more In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is robust to communication link failures, and thus is suitable for disaster affected areas. The robots, capable of only local communication, explore a bounded environment according to a random walk modeled by a discrete-time discrete-state (DTDS) Markov chain and exchange information with neighboring robots, resulting in a time-varying communication network topology. The proposed strategy is proved to achieve consensus, here defined as agreement on the presence of a static target, with no assumptions on the connectivity of the communication network. Using numerical simulations, we investigate the effect of the robot population size, domain size, and information uncertainty on the consensus time statistics under this scheme. We also validate our theoretical results with 3D physics-based simulations in Gazebo. The simulations demonstrate that all robots achieve consensus in finite time with the proposed search strategy over a range of robot densities in the environment. I. INTRODUCTION Disaster areas, such as regions affected by earthquakes and floods, experience great disruption to communication and power infrastructure. This presents challenges in coordinating searches for survivors and dispersing relief teams to those locations. Teams of mobile robots have proved to be useful for exploring and mapping environments in disaster response scenarios [1], [2], [3]. However, such robots are subject to constraints on the payloads that they can carry, including power sources, sensors, embedded processors, actuators, and communication devices for transmitting information to other agents and/or to a command center. In addition, many multirobot control strategies rely on a communication network for coordination. Centralized exploration strategies like [4] rely on constant communication between agents and a central node. However, these strategies do not scale well with the number of agents, since the communication bandwidth becomes a bottleneck with increasing agent population size. Moreover, such strategies suffer from a single point of failure, i.e., a disruption to the central node causes loss of communication for all the agents. These drawbacks can be overcome by employing decentralized exploration strategies that involve only local communication between agents. However, communication can become unreliable as the number of agents increases [6],

Download

Probabilistic Consensus on Feature Distribution for Multi-robot Systems with Markovian Exploration Dynamics

IEEE Robotics and Automation Letters , 2022

In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a d... more In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a discrete distribution of features, modeled as an occupancy grid map, that represent information contained in a bounded planar 2D environment, such as visual cues used for navigation or semantic labels associated with object detection. The robots explore the environment according to a random walk modeled by a discrete-time discretestate (DTDS) Markov chain and estimate the feature distribution from their own measurements and the estimates communicated by neighboring robots, using a distributed Chernoff fusion protocol. We prove that under this decentralized fusion protocol, each robot's feature distribution converges to the ground truth distribution in an almost sure sense. We verify this result in numerical simulations that show that the Hellinger distance between the estimated and ground truth feature distributions converges to zero over time for each robot. We also validate our strategy through Software-In-The-Loop (SITL) simulations of quadrotors that search a bounded square grid for a set of visual features distributed on a discretized circle.

Download

Probabilistic Consensus on Feature Distribution for Multi-robot Systems with Markovian Exploration Dynamics

In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a d... more In this paper, we present a consensus-based decentralized multi-robot approach to reconstruct a discrete distribution of features, modeled as an occupancy grid map, that represent information contained in a bounded planar 2D environment, such as visual cues used for navigation or semantic labels associated with object detection. The robots explore the environment according to a random walk modeled by a discrete-time discretestate (DTDS) Markov chain and estimate the feature distribution from their own measurements and the estimates communicated by neighboring robots, using a distributed Chernoff fusion protocol. We prove that under this decentralized fusion protocol, each robot's feature distribution converges to the ground truth distribution in an almost sure sense. We verify this result in numerical simulations that show that the Hellinger distance between the estimated and ground truth feature distributions converges to zero over time for each robot. We also validate our strategy through Software-In-The-Loop (SITL) simulations of quadrotors that search a bounded square grid for a set of visual features distributed on a discretized circle. Index Terms-Multi-Robot Systems; Mapping; Probability and Statistical Methods I. INTRODUCTION M ULTI-ROBOT systems (MRS) composed of multiple mobile robots have been used for various collective exploration and perception tasks, such as mapping unknown environments [1], disaster response [2], and surveillance and monitoring [3], herding a group of robots [4]. The performance of MRS in such applications is constrained by the capabilities of the payloads that the robots can carry on-board, including the power source, sensor suite, computational resources, and communication devices for transmitting information to other robots and/or a central node. These constraints are particularly restrictive in the case of small aerial robots such as multi-rotors that perform vision-guided tasks [5]. Centralized MRS strategies for exploration and mapping, such as the next-best-view planning method in [6], rely on constant communication between all the robots and a central node.

Download

Decentralized Multi-target Tracking with Multiple Quadrotors using a PHD Filter

American Institute of Aeronautics and Astronautics SciTech, 2021

We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary t... more We consider a scenario in which a group of quadrotors is tasked at tracking multiple stationary targets in an unknown, bounded environment. The quadrotors search for targets along a spatial grid overlaid on the environment while performing a random walk on this grid modeled by a discrete-time discrete-state (DTDS) Markov chain. The quadrotors can transmit their estimates of the target locations to other quadrotors that occupy their current location on the grid; thus, their communication network is time-varying and not necessarily connected. We model the search procedure as a renewal-reward process on the underlying DTDS Markov chain. To accommodate changes in the set of targets observed by each quadrotor as it explores the environment, along with uncertainties in the quadrotors' measurements of the targets, we formulate the tracking problem in terms of Random Finite Sets (RFS). The quadrotors use RFS-based Probability Hypothesis Density (PHD) filters to estimate the number of targets and their locations. We present a theoretical estimation framework, based on the Gaussian Mixture formulation of the PHD filter, and preliminary simulation results toward extending existing approaches for RFS-based multi-target tracking to a decentralized multi-robot strategy for multi-target tracking. We validate this approach with simulations of multi-target tracking scenarios with different densities of robots and targets, and we evaluate the average time required for the robots in each scenario to reach agreement on a common set of targets.

Download

Multi-Robot Target Search using Probabilistic Consensus on Discrete Markov Chains

In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is rob... more In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is robust to communication link failures, and thus is suitable for disaster affected areas. The robots, capable of only local communication, explore a bounded environment according to a random walk modeled by a discrete-time discrete-state (DTDS) Markov chain and exchange information with neighboring robots, resulting in a time-varying communication network topology. The proposed strategy is proved to achieve consensus, here defined as agreement on the presence of a static target, with no assumptions on the connectivity of the communication network. Using numerical simulations, we investigate the effect of the robot population size, domain size, and information uncertainty on the consensus time statistics under this scheme. We also validate our theoretical results with 3D physics-based simulations in Gazebo. The simulations demonstrate that all robots achieve consensus in finite time with the proposed search strategy over a range of robot densities in the environment. I. INTRODUCTION Disaster areas, such as regions affected by earthquakes and floods, experience great disruption to communication and power infrastructure. This presents challenges in coordinating searches for survivors and dispersing relief teams to those locations. Teams of mobile robots have proved to be useful for exploring and mapping environments in disaster response scenarios [1], [2], [3]. However, such robots are subject to constraints on the payloads that they can carry, including power sources, sensors, embedded processors, actuators, and communication devices for transmitting information to other agents and/or to a command center. In addition, many multirobot control strategies rely on a communication network for coordination. Centralized exploration strategies like [4] rely on constant communication between agents and a central node. However, these strategies do not scale well with the number of agents, since the communication bandwidth becomes a bottleneck with increasing agent population size. Moreover, such strategies suffer from a single point of failure, i.e., a disruption to the central node causes loss of communication for all the agents. These drawbacks can be overcome by employing decentralized exploration strategies that involve only local communication between agents. However, communication can become unreliable as the number of agents increases [6],

Download

Multi-Robot Target Search using Probabilistic Consensus on Discrete Markov Chains

IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), 2020

In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is rob... more In this paper, we propose a probabilistic consensus-based multi-robot search strategy that is robust to communication link failures, and thus is suitable for disaster affected areas. The robots, capable of only local communication, explore a bounded environment according to a random walk modeled by a discrete-time discrete-state (DTDS) Markov chain and exchange information with neighboring robots, resulting in a time-varying communication network topology. The proposed strategy is proved to achieve consensus, here defined as agreement on the presence of a static target, with no assumptions on the connectivity of the communication network. Using numerical simulations, we investigate the effect of the robot population size, domain size, and information uncertainty on the consensus time statistics under this scheme. We also validate our theoretical results with 3D physics-based simulations in Gazebo. The simulations demonstrate that all robots achieve consensus in finite time with the proposed search strategy over a range of robot densities in the environment.

Download

Uploads

Papers by Aniket Shirsat

Log In