ROMay 17
Motion Planning of Cooperative Nonholonomic Mobile ManipulatorsKeshab Patra, Arpita Sinha, Anirban Guha
We propose a real-time implementable motion planning framework for cooperative object transportation by nonholonomic mobile manipulator robots (MMRs) in dynamic environments. Our global planner finds a path from start to goal through the static, obstacle-free regions in the environment and generates a set of convex, static, obstacle-free regions around the path using a novel, fast, and computationally lightweight ellipse-based technique. We introduce a nonlinear Model Predictive Control (NMPC) based real-time implementable planning technique that jointly plans feasible motion for the mobile base and the manipulator's arm and generates a kinodynamic feasible, collision-free trajectory for cooperative object transportation. Simulation and hardware experiments validate the efficiency of our proposed planning framework.
ROMay 17
Task Capability Improvement Algorithm for Collaborative ManipulatorsKeshab Patra, Arpita Sinha, Anirban Guha
This work introduces a cooperative task capability improvement utilizing additional moments. The manipulators apply forces at the object's grasp point. Applying forces at a point other than the object's center of gravity produces undesired moments. The undesired moment acts as an additional moment. It improves the capability of an individual manipulator and, hence, the entire collaborative group. Any improvements in task capability directly add up to the object and transportation capability. The group's enhanced capability also helps achieve optimal capability, optimal resource allocation, and maximum fault tolerance in object manipulation. Our simulation results show an improvement in the capability of 5.86 \% compared to when no moment is used to enhance the capability of the manipulators.
RODec 12, 2018
Reconfigurable formations of quadrotors on Lissajous curves for surveillance applicationsAseem V. Borkar, Swaroop Hangal, Hemendra Arya et al.
This paper proposes trajectory planning strategies for online reconfiguration of a multi-agent formation on a Lissajous curve. In our earlier work, a multi-agent formation with constant parametric speed was proposed in order to address multiple objectives such as repeated collision-free surveillance and guaranteed sensor coverage of the area with ability for rogue target detection and trapping. This work addresses the issue of formation reconfiguration within this context. In particular, smooth parametric trajectories are designed for the purpose using calculus of variations. These trajectories have been employed in conjunction with a simple local cooperation scheme so as to achieve collision-free reconfiguration between different Lissajous curves. A detailed theoretical analysis of the proposed scheme is provided. These surveillance and reconfiguration strategies have also been validated through simulations in MATLAB\reg for agents performing parametric motion along the curves, and by Software-In-The-Loop simulation for quadrotors. In addition, they are validated experimentally with a team of quadrotors flying in a motion capture environment.
ROSep 11, 2017
Vector Field Guidance for Convoy Monitoring Using Elliptical OrbitsAseem V. Borkar, Vivek S. Borkar, Arpita Sinha
We propose a novel vector field based guidance scheme for tracking and surveillance of a convoy, moving along a possibly nonlinear trajectory on the ground, by an aerial agent. The scheme first computes a time varying ellipse that encompasses all the targets in the convoy using a simple regression based algorithm. It then ensures convergence of the agent to a trajectory that repeatedly traverses this moving ellipse. The scheme is analyzed using perturbation theory of nonlinear differential equations and supporting simulations are provided. Some related implementation issues are discussed and advantages of the scheme are highlighted.
ROSep 9, 2017
Hilbert's Space-filling Curve for Regions with HolesSiddharth H. Nair, Arpita Sinha, Leena Vachhani
The paper presents a systematic strategy for implementing Hilbert's space filling curve for use in online exploration tasks and addresses its application in scenarios wherein the space to be searched obstacles (or holes) whose locations are not known a priori. Using the self-similarity and locality preserving properties of Hilbert's space filling curve, a set of evasive maneuvers are prescribed and characterized for online implementation. Application of these maneuvers in the case of non-uniform coverage of spaces and for obstacles of varying sizes is also presented. The results are validated with representative simulations demonstrating the deployment of the approach.