I am an incoming PhD student at the CoMMA Lab, advised by Dr. Zachary Kingston. I intend to work on Task and Motion Planning problems. I worked at Aurora Inc for 2 years before this, developing perception systems for the self-driving truck stack. Prior to this, I did my masters at UC San Diego, with a thesis on Affordance based task planning under Prof. Henrik Christensen.
Many robot planning tasks require satisfaction of one or more constraints throughout the entire trajectory. For geometric constraints, manifold-constrained motion planning algorithms are capable of planning collision-free path between start and goal configurations on the constraint submanifolds specified by task. Current state-of-the-art methods can take tens of seconds to solve these tasks for complex systems such as humanoid robots, making real-world use impractical, especially in dynamic settings. Inspired by recent advances in hardware accelerated motion planning, we present a CPU SIMD-accelerated manifold-constrained motion planner that revisits projection-based constraint satisfaction through the lens of parallelization. By transforming relevant components into parallelizable structures, we use SIMD parallelism to plan constraint satisfying solutions. Our approach achieves up to 100-1000x speed-ups over the state-of-the-art, making real-time constrained motion planning feasible for the first time. We demonstrate our planner on a real humanoid robot and show real-time whole-body quasi-static plan generation.
@inproceedings{iyer2026mcvamp,author={Iyer, Shrutheesh R. and Chang, I-Chia and Liu, Andrew Z. and Gu, Yan and Kingston, Zachary},booktitle={IEEE/RSJ International Conference on Intelligent Robots and Systems},note={To Appear},title={Vectorizing Projection in Manifold-Constrained Motion Planning for Real-Time Whole-Body Control},year={2026}}
Sequential robot manipulation tasks require finding collision-free trajectories that satisfy geometric constraints across multiple object interactions in potentially high-dimensional configuration spaces. Solving these problems in real-time and at large scales has remained out of reach due to computational requirements. Recently, GPU-based acceleration has shown promising results, but prior methods achieve limited performance due to CPU-GPU data transfer overhead and complex logic that prevents full hardware utilization. To this end, we present SPaSM (Sampling Particle optimization for Sequential Manipulation), a fully GPU-parallelized framework that compiles constraint evaluation, sampling, and gradient-based optimization into optimized CUDA kernels for end-to-end trajectory optimization without CPU coordination. The method consists of a two-stage particle optimization strategy: first solving placement constraints through massively parallel sampling, then lifting solutions to full trajectory optimization in joint space. Unlike hierarchical approaches, SPaSM jointly optimizes object placements and robot trajectories to handle scenarios where motion feasibility constrains placement options. Experimental evaluation on challenging benchmarks demonstrates solution times in the realm of milliseconds with a 100% success rate; a 4000x speedup compared to existing approaches.
@inproceedings{chen2026spasm,author={Chen, Lucas and Iyer, Shrutheesh R. and Kingston, Zachary},booktitle={IEEE International Conference on Robotics and Automation},doi={10.1109/ICRA57385.2026.11697416},pages={6446--6453},title={Differentiable Particle Optimization for Fast Sequential Manipulation},year={2026}}
arXiv
ReVAMP: Vector-Accelerated Motion Planning for Kinematically-Constrained Systems via Reparameterization
Robots often must satisfy one or more constraints during motion planning for real-world tasks. When such constraints reduce the valid configuration space to a measure-zero subset, sampling based planning algorithms require modifications to draw feasible samples. For many common end-effector constraints, parameterizations built on inverse kinematics (IK) provide an alternate formulation where the constraints are satisfied by construction, allowing directly sampling the feasible set. Despite their elegant approach, parameterized planners have remained slower than vector-accelerated implementations of projection-based approaches, leaving their performance ceiling an open question. We explore a new axis of vectorization built upon reparameterizing the planning space through analytic IK. This approach addresses existing inefficiencies in vectorized projection-based planners and exposes new opportunities for parallelism within the planner. We show that the planner can synthesize plans in microseconds to milliseconds for high dimensional systems (up to 20 dimensions), with complex constraints, up to 10x faster than the current state-of-the-art. Furthermore, we demonstrate how such planning speeds open up avenues for restructuring sequential manipulation pipelines.
@misc{iyer2026revamp,archiveprefix={arXiv},author={Iyer, Shrutheesh R. and Cohn, Thomas and Kingston, Zachary},eprint={2609.30213},note={Under Review},primaryclass={cs.RO},title={ReVAMP: Vector-Accelerated Motion Planning for Kinematically-Constrained Systems via Reparameterization},year={2026}}
