2 papers
cs.LG2026
Dynamic Latent Routing
Fangyuan Yu, Xin Su, Amir Abdullah
We investigate the temporal concatenation of sub-policies in Markov Decision Processes (MDP) with time-varying reward functions. We introduce General Dijkstra Search (GDS), and pro…
cs.RO2026
Just in time Informed Trees: Manipulability-Aware Asymptotically Optimized Motion Planning
Kuanqi Cai, Liding Zhang, Xinwen Su +6
In high-dimensional robotic path planning, traditional sampling-based methods often struggle to efficiently identify both feasible and optimal paths in complex, multi-obstacle envi…