← Search

Jatan Shrestha

5 accepted papers

2026

Pareto-Conditioned Diffusion Models for Offline Multi-Objective Optimization

ICLR 2026oral

Multi-objective optimization (MOO) arises in many real-world applications where trade-offs between competing objectives must be carefully balanced. In the offline setting, where only a static dataset is available, the main challenge is generalizing beyond observed data. We introduce Pareto-Condition…

Cited by 1SourceScholar
2023

End-to-End Learning of Behavioural Inputs for Autonomous Driving in Dense Traffic

IROS 2023poster

Trajectory sampling in the Frenet(road-aligned) frame, is one of the most popular methods for motion planning of autonomous vehicles. It operates by sampling a set of behavioral inputs, such as lane offset and forward speed, before solving a trajectory optimization problem conditioned on the sampled…

Cited by 5SourcecodeScholar
2023

VACNA: Visibility-Aware Cooperative Navigation With Application in Inventory Management

RA-L 2023

This letter presents an online trajectory planning algorithm for an Unmanned Aerial Vehicle (UAV) to autonomously scan warehouse racks for inventory management. Our main motivation is to make small-sized UAVs with limited computing and sensing hardware capable of reliably performing the scanning tas

Cited by 8SourceScholar
2022

Visibility-Aware Navigation With Batch Projection Augmented Cross-Entropy Method Over a Learned Occlusion Cost

RA-L 2022

We present two real-time trajectory optimizers based on the Cross-Entropy Method for visibility-aware navigation. The two approaches differ in handling inequality constraints stemming from bounds on motion derivatives, collision avoidance, tracking error, etc. Our first optimizer augments the inequa

Cited by 22SourceScholar
2021

GPU Accelerated Convex Approximations for Fast Multi-Agent Trajectory Optimization

RA-L 2021

In this letter, we present a computationally efficient trajectory optimizer that can exploit GPUs to jointly compute trajectories of tens of agents in under a second. At the heart of our optimizer is a novel reformulation of the non-convex collision avoidance constraints that reduces the core comput

Cited by 15SourcecodeScholar