Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex, non-convex constraints. In practice, these algorithms perform very well on configuration space planning, but struggle to grow efficiently in systems with dynamics or differential constraints when using conventional proximity met...

Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying in an arbitrary totally bounded metric space where rationals replaced with countable hierarchy “well-spread” points, which we refer to as abstract prove various Jarník–Besicovitch type dimension bounds and investigate their sharpness.

The xed point result in Mustafa-Sims metrical structures obtained by Karapinar and Agarwal[Fixed Point Th. Appl., 2013, 2013:154] is deductible from a corresponding one stated in terms ofanticipative contractions over the associated (standard) metric space.