Aniket Shirsat

dblp:274/6897 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-5514-9214ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 50% Reinforcement learning · 25% Motion planning and robot control · 25%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › collective behavior › swarm behavior › collective motion
herding control
0.512021
Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach · IEEE Trans. Robotics 2021
Machine learning › Reinforcement learning › multi-agent reinforcement learning
mean field control
0.512021
Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach · IEEE Trans. Robotics 2021
Knowledge, reasoning and agents › Multi-agent systems › swarm robotics
swarm control
0.512021
Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach · IEEE Trans. Robotics 2021

Methods — techniques the papers use, named apart from their topics

switching control · 0.5mean-field approximation · 0.5continuous-time markov chain · 0.5
YearPublicationVenuePosition
2021 Controllability and Stabilization for Herding a Robotic Swarm Using a Leader: A Mean-Field Approach
abstract
In this article, we introduce a model and a control approach for herding a swarm of “follower” agents to a target distribution among a set of states using a single “leader” agent. The follower agents evolve on a finite state space that is represented by a graph and transition between states according to a continuous-time Markov chain (CTMC), whose transition rates are determined by the location of the leader agent. The control problem is to define a sequence of states for the leader agent that steers the probability density of the forward equation of the Markov chain. For the case, when the followers are possibly interacting, we prove local approximate controllability of the system about equilibrium probability distributions. For the case, when the followers are noninteracting, we design two switching control laws for the leader that drive the swarm of follower agents asymptotically to a target probability distribution that is positive for all states. The first strategy is open-loop in nature, and the switching times of the leader are independent of the follower distribution. The second strategy is of feedback type, and the switching times of the leader are functions of the follower density in the leader's current state. We validate our control approach through numerical simulations with varied numbers of follower agents that evolve on graphs of different sizes, through a 3-D multirobot simulation in which a quadrotor is used to control the spatial distribution of eight ground robots over four regions, and through a physical experiment in which a swarm of ten robots is herded by a virtual leader over four regions.
Karthik Elamvazhuthi, Zahi M. Kakish, Aniket Shirsat, Spring Berman
IEEE Trans. Robotics3