3 citations · 6 across the 5 of their papers we have counts for
5 papers
Lazy Probabilistic Roadmaps Revisited
Miquel Ramirez, Daniel Selvaratnam, Chris Manzie
This paper describes a revision of the classic Lazy Probabilistic Roadmaps algorithm (Lazy PRM), that results from pairing PRM and a novel Branch-and-Cut (BC) algorithm. Cuts are d…
Explicit Time-Optimal Speed Profiles for Planar Paths with Monotone Curvature
Daniel Selvaratnam, Michael Cantoni, Chris Manzie
Minimum-time speed profiles are constructed for planar paths with smooth strictly-monotonic signed curvature, subject to constraints on velocity, normal acceleration and tangential…
MITL Verification Under Timing Uncertainty
Daniel Selvaratnam, Michael Cantoni, J. M. Davoren +1
A Metric Interval Temporal Logic (MITL) verification algorithm is presented. It verifies continuous-time signals without relying on high frequency sampling. Instead, it is assumed…
Sampling Polynomial Trajectories for LTL Verification
Daniel Selvaratnam, Michael Cantoni, J. M. Davoren +1
This paper concerns the verification of continuous-time polynomial spline trajectories against linear temporal logic specifications (LTL without 'next'). Each atomic proposition is…
Source Localisation Using Binary Measurements
Daniel D. Selvaratnam, Iman Shames, Jonathan H. Manton +1
This paper considers the problem of localising a stationary signal source using a team of mobile agents which only take binary measurements. Background false detection rates and mi…