activity
20242026
collaborators

6 papers

cs.DS2026

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics

Saswata Jana, Partha Sarathi Mandal

Collaboration between drones and trucks in a last-mile delivery system offers numerous benefits and reduces many challenges of the traditional delivery system. Here, we introduce D…

cs.DC2025

Separation of Unconscious Robots with Obstructed Visibility

Prajyot Pyati, Navjot Kaur, Saswata Jana +2

We study a recently introduced \textit{unconscious} mobile robot model, where each robot is associated with a \textit{color}, which is visible to other robots but not to itself. Th…

cs.DC2025

Asynchronous Gathering of Opaque Robots with Mobility Faults

Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1

We consider the fundamental benchmarking problem of gathering in an -fault system consisting of robots, of which at most might fail at any execution, under asynchron…

cs.DS2025

Graph Traversal via Connected Mobile Agents

Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal

This paper considers the Hamiltonian walk problem in the multi-agent coordination framework, referred to as -agents Hamiltonian walk problem (-HWP). In this problem, a set of…

cs.DC2025

Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots

Saswata Jana, Subhajit Pramanick, Adri Bhattacharya +1

In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property…

cs.DC2024

Uniform Partitioning of a Bounded Region using Opaque ASYNC Luminous Mobile Robots

Subhajit Pramanick, Saswata Jana, Adri Bhattacharya +1

We are given autonomous mobile robots inside a bounded region. The robots are opaque which means that three collinear robots are unable to see each other as one of the robots a…