Loading view.
Student Talks
Interleaving Discrete Search and Continuous Optimization for Kinodynamic Motion Planning
NSH 4305Abstract: Motion planning for dynamically complex robotic tasks requires explicit reasoning within constraints on velocity, acceleration, force/torque, and kinematics such as avoiding obstacles. To meet these constraints, planning algorithms must simultaneously make high-level discrete decisions and low-level continuous decisions. For example, pushing a heavy object involves making discrete decisions about contact locations and continuous decisions [...]