Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vatsalya Chaubey

dblp:258/9853 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-5707-8018ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
Motion planning and robot control · 75% Multi-agent systems · 25%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
collision avoidance
0.912025
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions · ICRA 2025
Robotics › Motion planning and robot control › robot control › safe control
control barrier functions
0.912025
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions · ICRA 2025
Knowledge, reasoning and agents › Multi-agent systems
pursuit-evasion
0.912025
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions · ICRA 2025
Robotics › Motion planning and robot control › motion planning › perception-aware planning
visibility maintenance
0.912025
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions · ICRA 2025

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

signed distance function · 0.9sampling-based kinodynamic planning · 0.9convex optimization · 0.9control barrier functions · 0.9
YearPublicationVenuePosition
2025 Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions
abstract
This paper develops a control strategy for pursuit-evasion problems in environments with occlusions. We address the challenge of a mobile pursuer keeping a mobile evader within its field of view (FoV) despite line-of-sight obstructions. The signed distance function (SDF) of the FoV is used to formulate visibility as a control barrier function (CBF) constraint on the pursuer's control inputs. Similarly, obstacle avoidance is formulated as a CBF constraint based on the SDF of the obstacle set. While the visibility and safety CBFs are Lipschitz continuous, they are not differentiable everywhere, necessitating the use of generalized gradients. To achieve non-myopic pursuit, we generate reference control trajectories leading to evader visibility using a sampling-based kinodynamic planner. The pursuer then tracks this reference via convex optimization under the CBF constraints. We validate our approach in CARLA simulations and real-world robot experiments, demonstrating successful visibility maintenance using only onboard sensing, even under severe occlusions and dynamic evader movements.
Minnan Zhou, Mustafa Shaikh, Vatsalya Chaubey, Patrick Haggerty, Shumon Koga, Dimitra Panagou, Nikolay Atanasov 0001
ICRA3
2022 Making the Most of Sporadic Feedback: Low-Complexity Application Layer Coding for Data Recovery in the Internet of Things
abstract
In this article, we propose application layer coding schemes to recover lost data in delay-sensitive uplink (sensor-to-gateway) communications in the Internet of Things. Built on an approach that combines retransmissions and forward erasure correction, the salient features of the proposed schemes include low computational complexity and the ability to exploit sporadic receiver feedback for efficient data recovery. Reduced complexity is achieved by keeping the number of coded transmissions as low as possible and by devising a mechanism to compute the optimal degree of a coded packet in$\mathcal {O} (1)$. Our major contributions are as follows: 1) an enhancement to an existing scheme calledwindowed coding, whose complexity is greatly reduced and data recovery performance is improved by our proposed approach; 2) a technique that combines elements of windowed coding with a new feedback structure to further reduce the coding complexity and improve data recovery; and 3) a coded forwarding scheme, in which a relay node provides further resilience against packet loss by overhearing source-to-destination communications and making forwarding decisions based on overheard information.
Vatsalya Chaubey, Siddhartha S. Borkotoky
IEEE Trans. Ind. Informatics1
2021 Coded Relaying in LoRa Sensor Networks
abstract
To enhance the reliability of LoRa sensor networks, we propose two opportunistic forwarding protocols in which relays overhear sensor-to-gateway messages and periodically forward them to a gateway. To reduce the number of transmissions, the relays forward XOR sums of the overheard messages. One protocol employs a single relay node, while two relays cooperate in the other. With a single relay, our proposed protocol requires fewer relay transmissions to achieve similar loss rates as conventional uncoded forwarding in which every received message is immediately forwarded. We demonstrate up to 55% reduction in relay transmission time relative to uncoded forwarding. The cooperative protocol provides better loss and delay performance than the single-relay protocol, and we demonstrate up to 16% reduction in the message-loss rate along with 33% reduction in relay transmission times compared to conventional forwarding.
Siddhartha S. Borkotoky, Pavan Datta Abbineni, Vatsalya Chaubey, Sonu Rathi
GLOBECOM3