Nilanjan Chakraborty

Wangyi Liu, Dasharadhan Mahalingam, Fanru Gao et al.

In this paper, we study the problem of manipulation skill acquisition for performing construction activities consisting of repetitive tasks (e.g., building a wall or installing ceiling tiles). Our approach involves setting up a simulated construction activity in a Virtual Reality (VR) environment, where the user can provide demonstrations of the object manipulation skills needed to perform the construction activity. We then exploit the screw geometry of motion to approximate the demonstrated motion as a sequence of constant screw motions. For performing the construction activity, we generate the sequence of manipulation task instances and then compute the joint space motion plan corresponding to each instance using Screw Linear Interpolation (ScLERP) and Resolved Motion Rate Control (RMRC). We evaluate our framework by executing two representative construction tasks: constructing brick walls and installing multiple ceiling tiles. Each task is performed using only a single demonstration, a pick-and-place action for the bricks, and a single ceiling tile installation. Our experiments with a 7-DoF robot in both simulation and hardware demonstrate that the approach generalizes robustly to arbitrarily long construction activities that involve repetitive motions and demand precision, even when provided with just one demonstration. For instance, we can construct walls of arbitrary layout and length by leveraging a single demonstration of placing one brick on top of another.

Dasharadhan Mahalingam, Michael Gallagher, Nilanjan Chakraborty et al.

We present a screw geometry-based manipulation planning framework for the robotic automation of solution-based synthesis, exemplified through the preparation of gold and magnetite nanoparticles. The synthesis protocols are inherently long-horizon, multi-step tasks, requiring skills such as pick-and-place, pouring, turning a knob, and periodic visual inspection to detect reaction completion. A central challenge is that some skills, notably pouring, transferring containers with solutions, and turning a knob, impose geometric and kinematic constraints on the end-effector motion. To address this, we use a programming by demonstration paradigm where the constraints can be extracted from a single demonstration. This combination of screw-based motion representation and demonstration-driven specification enables domain experts, such as chemists, to readily adapt and reprogram the system for new experimental protocols and laboratory setups without requiring expertise in robotics or motion planning. We extract sequences of constant screws from demonstrations, which compactly encode the motion constraints while remaining coordinate-invariant. This representation enables robust generalization across variations in grasp placement and allows parameterized reuse of a skill learned from a single example. By composing these screw-parameterized primitives according to the synthesis protocol, the robot autonomously generates motion plans that execute the complete experiment over repeated runs. Our results highlight that screw-theoretic planning, combined with programming by demonstration, provides a rigorous and generalizable foundation for long-horizon laboratory automation, thereby enabling fundamental kinematics to have a translational impact on the use of robots in developing scalable solution-based synthesis protocols.

Dibyendu Das, Aditya Patankar, Nilanjan Chakraborty et al.

In this paper, we study the problem of methodically obtaining a sufficient set of kinesthetic demonstrations, one at a time, such that a robot can be confident of its ability to perform a complex manipulation task in a given region of its workspace. Although Learning from Demonstrations has been an active area of research, the problems of checking whether a set of demonstrations is sufficient, and systematically seeking additional demonstrations have remained open. We present a novel approach to address these open problems using (i) a screw geometric representation to generate manipulation plans from demonstrations, which makes the sufficiency of a set of demonstrations measurable; (ii) a sampling strategy based on PAC-learning from multi-armed bandit optimization to evaluate the robot's ability to generate manipulation plans in a subregion of its task space; and (iii) a heuristic to seek additional demonstration from areas of weakness. Thus, we present an approach for the robot to incrementally and actively ask for new demonstration examples until the robot can assess with high confidence that it can perform the task successfully. We present experimental results on two example manipulation tasks, namely, pouring and scooping, to illustrate our approach. A short video on the method: https://youtu.be/R-qICICdEos

Amin Fakhari, Aditya Patankar, Jiayin Xie et al.

Evaluating a grasp generated by a set of hand-object contact locations is a key component of many grasp planning algorithms. In this paper, we present a novel second order cone program (SOCP) based optimization formulation for evaluating a grasps' ability to apply wrenches to generate a linear motion along a given direction and/or an angular motion about the given direction. Our quality measure can be computed efficiently, since the SOCP is a convex optimization problem, which can be solved optimally with interior point methods. A key feature of our approach is that we can consider the effect of contact wrenches from any contact of the object with the environment. This is different from the extant literature where only the effect of finger-object contacts is considered. Exploiting the environmental contact is useful in many manipulation scenarios either to enhance the dexterity of simple hands or improve the payload capability of the manipulator. In contrast to most existing approaches, our approach also takes into account the practical constraint that the maximum contact force that can be applied at a finger-object contact can be different for each contact. We can also include the effect of external forces like gravity, as well as the joint torque constraints of the fingers/manipulators. Furthermore, for a given motion path as a constant screw motion or a sequence of constant screw motions, we can discretize the path and compute a global grasp metric to accomplish the whole task with a chosen set of finger-object contact locations.

Anirban Sinha, Anik Sarker, Nilanjan Chakraborty

In this paper, we present a task space-based local motion planner that incorporates collision avoidance and constraints on end-effector motion during the execution of a task. Our key technical contribution is the development of a novel kinematic state evolution model of the robot where the collision avoidance is encoded as a complementarity constraint. We show that the kinematic state evolution with collision avoidance can be represented as a Linear Complementarity Problem (LCP). Using the LCP model along with Screw Linear Interpolation (ScLERP) in SE(3), we show that it may be possible to compute a path between two given task space poses by directly moving from the start to the goal pose, even if there are potential collisions with obstacles. The scalability of the planner is demonstrated with experiments using a physical robot. We present simulation and experimental results with both collision avoidance and task constraints to show the efficacy of our approach.

Amin Fakhari, Aditya Patankar, Nilanjan Chakraborty

Manipulation of objects by exploiting their contact with the environment can enhance both the dexterity and payload capability of robotic manipulators. A common way to manipulate heavy objects beyond the payload capability of a robot is to use a sequence of pivoting motions, wherein, an object is moved while some contact points between the object and a support surface are kept fixed. The goal of this paper is to develop an algorithmic approach for automated plan generation for object manipulation with a sequence of pivoting motions. A plan for manipulating a heavy object consists of a sequence of joint angles of the manipulator, the corresponding object poses, as well as the joint torques required to move the object. The constraint of maintaining object contact with the ground during manipulation results in nonlinear constraints in the configuration space of the robot, which is challenging for motion planning algorithms. Exploiting the fact that pivoting motion corresponds to movements in a subgroup of the group of rigid body motions, SE(3), we present a novel task-space based planning approach for computing a motion plan for both the manipulator and the object while satisfying contact constraints. We also combine our motion planning algorithm with a grasping force synthesis algorithm to ensure that friction constraints at the contacts and actuator torque constraints are satisfied. We present simulation results with a dual-armed Baxter robot to demonstrate our approach.

Jiayin Xie, Chenghao Bi, David J. Cappelleri et al.

Design of robots at the small scale is a trial-and-error based process, which is costly and time-consuming. There are few dynamic simulation tools available to accurately predict the motion or performance of untethered microrobots as they move over a substrate. At smaller length scales, the influence of adhesion and friction, which scales with surface area, becomes more pronounced. Thus, rigid body dynamic simulators, which implicitly assume that contact between two bodies can be modeled as point contact are not suitable. In this paper, we present techniques for simulating the motion of microrobots where there can be intermittent and non-point contact between the robot and the substrate. We use these techniques to study the motion of tumbling microrobots of different shapes and select shapes that are optimal for improving locomotion performance. Simulation results are verified using experimental data on linear velocity, maximum climbable incline angle, and microrobot trajectory. Microrobots with improved geometry were fabricated, but limitations in the fabrication process resulted in unexpected manufacturing errors and material/size scale adjustments. The developed simulation model is able to incorporate these limitations and emulate their effect on the microrobot's motion, reproducing the experimental behavior of the tumbling microrobots, further showcasing the effectiveness of having such a dynamic model.

Jiayin Xie, Nilanjan Chakraborty

In this paper, we develop a principled method to model line and surface contact with point contact (we call this point, equivalent contact point) that is consistent with physics-based models of surface (line) contact. Assuming that the set of contact points form a convex set, we solve the contact detection and dynamic simulation step simultaneously by formulating the problem as a mixed nonlinear complementarity problem. This allows us to simultaneously compute the equivalent contact point as well as the wrenches (forces and moments) at the equivalent contact point (consistent with the friction model) along with the configuration and velocities of the rigid objects. Furthermore, we prove that the contact constraints of no inter-penetration between the objects is also satisfied. We present a geometrically implicit time-stepping scheme for dynamic simulation for contacts between two bodies with convex contact area, which includes line contact and surface contact. We prove that for surface and line contact, for any value of the velocity of center of mass of the object, there is a unique solution for contact point and contact wrench that satisfies the discrete-time equations of motion. Simulation examples are shown to demonstrate the validity of our approach and show that with our approach we can seamlessly transition between point, line, and surface contact.

Jiayin Xie, Nilanjan Chakraborty

We present a principled method for motion prediction via dynamic simulation for rigid bodies in intermittent contact with each other where the contact region is a planar non-convex contact patch. Such methods are useful in planning and control for robotic manipulation. The planar non-convex contact patch can either be a topologically connected set or disconnected set. Most work in rigid body dynamic simulation assume that the contact between objects is a point contact, which may not be valid in many applications. In this paper, by using the convex hull of the contact patch, we build on our recent work on simulating rigid bodies with convex contact patches for simulating motion of objects with planar non-convex contact patches. We formulate a discrete-time mixed complementarity problem where we solve the contact detection and integration of the equations of motion simultaneously. We solve for the equivalent contact point (ECP) and contact impulse of each contact patch simultaneously along with the state, i.e., configuration and velocity of the objects. We prove that although we are representing a patch contact by an equivalent point, our model for enforcing non-penetration constraints ensure that there is no artificial penetration between the contacting rigid bodies. We provide empirical evidence to show that our method can seamlessly capture transition among different contact modes like patch contact, multiple or single point contact.

Anirban Sinha, Nilanjan Chakraborty

In many bi-manual robotic tasks, like peg-in-a-hole assembly, the success of the task execution depends on the error in achieving the desired relative pose between the peg and the hole in a pre-insertion configuration. Random actuation errors in the joint space usually prevent the two arms from reaching their desired task space poses, which in turn results in a random error in relative pose between the two hands. This random error varies from trial to trial, and thus depending on the tolerance between the peg and the hole, the outcome of the assembly task may be random (sometimes the task execution succeeds and sometimes it fails). In general, since the relative pose has $6$ degrees-of-freedom, there are infinite numbers of joint space solutions for the two arms that correspond to the same task space relative pose. However, in the presence of actuation errors, the joint space solutions are not all identical since they map the joint space error sets differently to the task space. Thus, the goal of this paper is to develop a methodical approach to compute a joint space solution such that the maximum task space error is below a (specified) threshold with high probability. Such a solution is called a robust inverse kinematics solution for the bi-manual robot. Our proposed method also allows the robot to self-evaluate whether it can perform a given bi-manual task reliably. We use a square peg-in-a-hole assembly scenario on the dual-arm Baxter robot for numerical simulations that shows the utility of our approach.

Anirban Sinha, Nilanjan Chakraborty

Robotic tasks, like reaching a pre-grasp configuration, are specified in the end effector space or task space, whereas, robot motion is controlled in joint space. Because of inherent actuation errors in joint space, robots cannot achieve desired configurations in task space exactly. Furthermore, different inverse kinematics (IK) solutions map joint space error set to task space differently. Thus for a given task with a prescribed error tolerance, all IK solutions will not be guaranteed to successfully execute the task. Any IK solution that is guaranteed to execute a task (possibly with high probability) irrespective of the realization of the joint space error is called a robust IK solution. In this paper we formulate and solve the robust inverse kinematics problem for redundant manipulators with actuation uncertainties (errors). We also present simulation and experimental results on a $7$-DoF redundant manipulator for two applications, namely, a pre-grasp positioning and a pre-insertion positioning scenario. Our results show that the robust IK solutions result in higher success rates and also allows the robot to self-evaluate how successful it might be in any application scenario.

Jiayin Xie, Chenghao Bi, David J. Cappelleri et al.

Design of robots at the small scale is a trial-and-error based process, which is costly and time-consuming. There are no good dynamic simulation tools to predict the motion or performance of a microrobot as it moves against a substrate. At smaller length scales, the influence of adhesion and friction, which scales with surface area, becomes more pronounced. Thus, rigid body dynamic simulators, which implicitly assume that contact between two bodies can be modeled as point contact are not suitable. In this paper, we present techniques for simulating the motion of microrobots where there can be intermittent and non-point contact between the robot and the substrate. We use this simulator to study the motion of microrobots of different shapes and select shapes that are most promising for performing a given task.

Jiayin Xie, Nilanjan Chakraborty

We present a principled method for motion prediction via dynamic simulation for rigid bodies in intermittent contact with each other where the contact is assumed to be a planar non-convex contact patch. The planar non-convex contact patch can either be a topologically connected set or disconnected set. Such algorithms are useful in planning and control for robotic manipulation. Most works in rigid body dynamic simulation assume that the contact between objects is a point contact, which may not be valid in many applications. In this paper, by using the convex hull of the contact patch, we build on our recent work on simulating rigid bodies with convex contact patches, for simulating the motion of objects with planar non-convex contact patches. We formulate a discrete-time mixed complementarity problem where we solve the contact detection and integration of the equations of motion simultaneously. Thus, our method is a geometrically-implicit method and we prove that in our formulation, there is no artificial penetration between the contacting rigid bodies. We solve for the equivalent contact point (ECP) and contact impulse of each contact patch simultaneously along with the state, i.e., configuration and velocity of the objects. We provide empirical evidence to show that our method can seamlessly capture the transition between different contact modes like patch contact to multiple or single point contact during the simulation.

Jiayin Xie, Nilanjan Chakraborty

We present a principled method for dynamic simulation of rigid bodies in intermittent contact with each other where the contact is assumed to be a non-convex contact patch that can be modeled as a union of convex patches. The prevalent assumption in simulating rigid bodies undergoing intermittent contact with each other is that the contact is a point contact. In recent work, we introduced an approach to simulate contacting rigid bodies with convex contact patches (line and surface contact). In this paper, for non-convex contact patches modeled as a union of convex patches, we formulate a discrete-time mixed complementarity problem where we solve the contact detection and integration of the equations of motion simultaneously. Thus, our method is a geometrically-implicit method and we prove that in our formulation, there is no artificial penetration between the contacting rigid bodies. We solve for the equivalent contact point (ECP) and contact impulse of each contact patch simultaneously along with the state, i.e., configuration and velocity of the objects. We provide empirical evidence to show that if the number of contact patches between two objects is less than or equal to three, the state evolution of the bodies is unique, although the contact impulses and ECP may not be unique. We also present simulation results showing that our method can seamlessly capture transition between different contact modes like non-convex patch to point (or line contact) and vice-versa during simulation.

Jiayin Xie, Nilanjan Chakraborty

In this paper, we present a principled method to model general planar sliding motion with distributed convex contact patch. The effect of contact patch with indeterminate pressure distribution can be equivalently modeled as the contact wrench at one point contact. We call this point equivalent contact point. Our dynamic model embeds ECP within the equations of slider's motion and friction model which approximates the distributed contact patch, and eventually brings us a system of quadratic equations. This discrete-time dynamic model allows us to solve for the two components of tangential friction impulses, the friction moment and the slip speed. The state of the slider as well as the ECP can be computed by solving a system of linear equations once the contact impulses are computed. In addition, we derive the closed form solutions for the state of slider for quasi-static motion. Furthermore, in pure translation case, based on the discrete-time model, we present the closed form expressions for the friction impulses the slider suffers and the state of it at each time step. Simulation examples are shown to demonstrate the validity of our approach.