Thomas Moerland

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Sampling-based kinodynamic planners, such as Rapidly-exploring Random Trees (RRTs), pose two fundamental challenges: computing a reliable (pseudo-)metric for the distance between two randomly sampled nodes, and computing a steering input to connect the nodes. The core of these challenges is a Two Point Boundary Value Problem, which is known to be NP-hard.(More)
  • 1