Author name cluster

Aditya Mahadevan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers

1 author row

ICRA Conference 2014 Conference Paper

Robust online belief space planning in changing environments: Application to physical mobile robots

Ali-Akbar Agha-Mohammadi
Saurav Agarwal
Aditya Mahadevan
Suman Chakravorty
Daniel Tomkins
Jory Denny
Nancy M. Amato

Motion planning in belief space (under motion and sensing uncertainty) is a challenging problem due to the computational intractability of its exact solution. The Feedback-based Information RoadMap (FIRM) framework made an important theoretical step toward enabling roadmap-based planning in belief space and provided a computationally tractable version of belief space planning. However, there are still challenges in applying belief space planners to physical systems, such as the discrepancy between computational models and real physical models. In this paper, we propose a dynamic replanning scheme in belief space to address such challenges. Moreover, we present techniques to cope with changes in the environment (e. g. , changes in the obstacle map), as well as unforeseen large deviations in the robot's location (e. g. , the kidnapped robot problem). We then utilize these techniques to implement the first online replanning scheme in belief space on a physical mobile robot that is robust to changes in the environment and large disturbances. This method demonstrates that belief space planning is a practical tool for robot motion planning.

Details

IROS Conference 2013 Conference Paper

Multi-robot caravanning

Jory Denny
Andrew Giese
Aditya Mahadevan
Arnaud Marfaing
Rachel Glockenmeier
Colton Revia
Samuel Rodríguez
Nancy M. Amato

We study multi-robot caravanning, which is loosely defined as the problem of a heterogeneous team of robots visiting specific areas of an environment (waypoints) as a group. After formally defining this problem, we propose a novel solution that requires minimal communication and scales with the number of waypoints and robots. Our approach restricts explicit communication and coordination to occur only when robots reach waypoints, and relies on implicit coordination when moving between a given pair of waypoints. At the heart of our algorithm is the use of leader election to efficiently exploit the unique environmental knowledge available to each robot in order to plan paths for the group, which makes it general enough to work with robots that have heterogeneous representations of the environment. We implement our approach both in simulation and on a physical platform, and characterize the performance of the approach under various scenarios. We demonstrate that our approach can successfully be used to combine the planning capabilities of different agents.

Details

ICRA Conference 2012 Conference Paper

A sampling-based approach to probabilistic pursuit evasion

Aditya Mahadevan
Nancy M. Amato

Probabilistic roadmaps (PRMs) are a sampling-based approach to motion-planning that encodes feasible paths through the environment using a graph created from a subset of valid positions. Prior research has shown that PRMs can be augmented with useful information to model interesting scenarios related to multi-agent interaction and coordination. Pursuit evasion is the problem of planning the motions of one or more agents to effectively track and/or capture an initially unseen evader in an environment. Unlike prior probabilistic approaches that assume the environment is partitioned into convex cells or square grids, we present a sampling-based technique that allows us to generalize the problem to an arbitrary partitioning of the environment. We then show how PRMs can exploit this method using Voronoi diagrams. We discuss the theoretical underpinnings of this approach and demonstrate its validity experimentally.

Details

ICRA Conference 2011 Conference Paper

Toward realistic pursuit-evasion using a roadmap-based approach

Samuel Rodríguez
Jory Denny
Juan Burgos
Aditya Mahadevan
Kasra Manavi
Luke Murray
Anton Kodochygov
Takis Zourntos

In this work, we describe an approach for modeling and simulating group behaviors for pursuit-evasion that uses a graph-based representation of the environment and integrates multi-agent simulation with roadmap-based path planning. Our approach can be applied to more realistic scenarios than are typically studied in most previous work, including agents moving in 3D environments such as terrains, multi-story buildings, and dynamic environments. We also support more realistic three-dimensional visibility computations that allow evading agents to hide in crowds or behind hills. We demonstrate the utility of this approach on mobile robots and in simulation for a variety of scenarios including pursuit-evasion and tag on terrains, in multi-level buildings, and in crowds.

Details