Searcharxiv⌕ Search

arXiv subjects

K. R. Guruprasad

Publications and source records attributed to K. R. Guruprasad.

4 recordsLinked to original sources

Multi-Task Visual Perception Network with LLM Conditioning for Autonomous Navigation

Long-term navigation for service robots faces crit- ical challenges like the accumulation of odometry drift and sensor error, which progressively degrade 2D maps and renders traditional path planning algorithms (e.g., A*, RRT*, DiPPer, ViT-A*) ineffective over time. To address this, we propose a user-friendly, interactive framework that eliminates the reliance on globally consistent maps. Our approach integrates visual perception with Large Language Models (LLM) to interpret user commands via text or voice. Instead of relying on a drift- prone global map, the system generates a sequential action plan based on local visual cues and egocentric geometric instructions. These action plans are executed sequentially, allowing the robot to navigate known and unknown environments safely. By reset- ting localization relative to immediate targets, our framework effectively works with a minimum accumulation drift strategy, ensuring accurate, efficient, and collision-free navigation without the maintenance overhead of traditional mapping. Experiments on real-world and simulated data have shown significant improve- ments over other methods. Our source code is publicly accessible at https://github.com/PraveenSingh24/VL-Navigation.

cs.RO↗

Coverage Optimization using Generalized Voronoi Partition

In this paper a generalization of the Voronoi partition is used for optimal deployment of autonomous agents carrying sensors with heterogeneous capabilities, to maximize the sensor coverage. The generalized centroidal Voronoi configuration, in which the agents are located at the centroids of the corresponding generalized Voronoi cells, is shown to be a local optimal configuration. Simulation results are presented to illustrate the presented deployment strategy.

math.OC↗

Generalized Voronoi Partition Based Multi-Agent Search using Heterogeneous Sensors

In this paper we propose search strategies for heterogeneous multi-agent systems. Multiple agents, equipped with communication gadget, computational capability, and sensors having heterogeneous capabilities, are deployed in the search space to gather information such as presence of targets. Lack of information about the search space is modeled as an uncertainty density distribution. The uncertainty is reduced on collection of information by the search agents. We propose a generalization of Voronoi partition incorporating the heterogeneity in sensor capabilities, and design optimal deployment strategies for multiple agents, maximizing a single step search effectiveness. The optimal deployment forms the basis for two search strategies, namely, {\em heterogeneous sequential deploy and search} and {\em heterogeneous combined deploy and search}. We prove that the proposed strategies can reduce the uncertainty density to arbitrarily low level under ideal conditions. We provide a few formal analysis results related to stability and convergence of the proposed control laws, and to spatial distributedness of the strategies under constraints such as limit on maximum speed of agents, agents moving with constant speed and limit on sensor range. Simulation results are provided to validate the theoretical results presented in the paper.

math.OC↗

Performance of a Class of Multi-Robot Deploy and Search Strategies based on Centroidal Voronoi Configurations

This paper considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is a system of autonomous mobile robots equipped with required sensors and communication equipment deployed in a search space to gather information. The lack of information about the search space is modeled as an uncertainty density distribution over the search space. A {\em combined deploy and search} (CDS) strategy has been formulated as a modification to {\em sequential deploy and search} (SDS) strategy presented in our previous work. The optimal deployment strategy using Voronoi partition forms the basis for these two search strategies. The strategies are analyzed in presence of constraints on robot speed and limit on sensor range for convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the strategies on parameters such as number of robots, speed of robots, and their sensor range limits.

math.OC↗