Daniel Selvaratnam

Kinodynamic Motion Planning via Branch-and-Cut Over Probabilistic Roadmaps

This letter describes an extension of the classic Lazy Probabilistic Roadmaps algorithm (Lazy PRM), which results from pairing PRM and a novel Branch-and-Cut (BC) algorithm. Cuts are dynamically generated constraints that are imposed on minimum cost paths over the geometric graphs selected by PRM. C