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

Kalvik Jakkala

dblp:233/1656 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-0245-0323ORCID · corroborated

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

Systems, architecture and hardware · 3 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
2 papers
Robot navigation and mapping · 50% Motion planning and robot control · 27% Reinforcement learning · 23%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › mobile robot navigation › navigation planning
informative path planning
1.622025
Fully Differentiable Adaptive Informative Path Planning · ICRA 2025
Multi-Robot Informative Path Planning from Regression with Sparse Gaussian Processes · ICRA 2024
Robotics › Motion planning and robot control › path planning
adaptive path planning
0.912025
Fully Differentiable Adaptive Informative Path Planning · ICRA 2025
Machine learning › Reinforcement learning › exploration
multi-robot exploration
0.812024
Multi-Robot Informative Path Planning from Regression with Sparse Gaussian Processes · ICRA 2024

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

sparse gaussian process · 1.6differentiable optimization · 0.9gradient descent · 0.8
YearPublicationVenuePosition
2025 Fully Differentiable Adaptive Informative Path Planning
abstract
Autonomous robots can survey and monitor large environments. However, these robots often have limited compu-tational and power resources, making it crucial to develop an ef-ficient and adaptive informative path planning (IPP) algorithm. Such an algorithm must quickly adapt to environmental data to maximize the information collected while accommodating path constraints, such as distance budgets and boundary limitations. Current approaches to this problem often rely on maximizing mutual information using methods such as greedy algorithms, Bayesian optimization, and genetic algorithms. These methods can be slow and do not scale well to large or 3D environments. We present an adaptive IPP approach that is fully differentiable, significantly faster than previous methods, and scalable to 3D spaces. Our approach also supports continuous sensing robots, which collect data continuously along the entire path, by leveraging streaming sparse Gaussian processes. Benchmark results on two real-world datasets demonstrate that our approach yields solutions that are on par with or better than baseline methods while being up to two orders of magnitude faster. Additionally, we showcase our adaptive IPP approach in a 3D space using a system-on-chip embedded computer with minimal computational resources. Our code is available in the SGP- Tools Python library with a companion ROS 2 package for deployment on ArduPilot-based robots.
Kalvik Jakkala, Srinivas Akella
ICRA1
2024 Multi-Robot Informative Path Planning from Regression with Sparse Gaussian Processes
abstract
This paper addresses multi-robot informative path planning (IPP) for environmental monitoring. The problem involves determining informative regions in the environment that should be visited by robots to gather the most information about the environment. We propose an efficient sparse Gaussian process-based approach that uses gradient descent to optimize paths in continuous environments. Our approach efficiently scales to both spatially and spatio-temporally correlated environments. Moreover, our approach can simultaneously optimize the informative paths while accounting for routing constraints, such as a distance budget and limits on the robot’s velocity and acceleration. Our approach can be used for IPP with both discrete and continuous sensing robots, with point and non-point field-of-view sensing shapes, and for both single and multi-robot IPP. We demonstrate that the proposed approach is fast and accurate on real-world data.
Kalvik Jakkala, Srinivas Akella
ICRA1
2018 NeuralWave: Gait-Based User Identification Through Commodity WiFi and Deep Learning
abstract
This paper proposes NeuralWave, an intelligent and non-intrusive user identification system based on human gait biometrics extracted from WiFi signals. In particular, the channel state information (CSI)measurements are first collected from commodity WiFi devices. Then, a collection of data preprocessing schemes are applied to sanitize and calibrate the noisy and erroneous CSI data samples to manifest and augment the gait-induced radio-frequency (RF)signatures. Next, a 23-layer deep convolutional neural network, namely RadioNet, is developed to automatically learn the salient features from the preprocessed CSI data samples. The extracted features constitute a latent representation for the gait biometric that is discriminative enough to distinguish one person from another. Using the latent biometric representation, a softmax multi-class classifier is adopted to achieve accurate user identification. Extensive experiments in a typical indoor environment are conducted to show the effectiveness of our system. In particular, NeuralWave can achieve 87.76 ± 2.14% user identification accuracy for a group of 24 people. To the best of our knowledge, NeuralWave is the first in the literature to exploit deep learning for feature extraction and classification of physiological and behavioral gait biometrics embedded in CSI signals from commodity WiFi.
Akarsh Pokkunuru, Kalvik Jakkala, Arupjyoti Bhuyan, Pu Wang 0001
IECON2