A review on improving the autonomy of unmanned surface vehicles through intelligent collision avoidance manoeuvres

S Campbell, W Naeem, GW Irwin - Annual Reviews in Control, 2012 - Elsevier
In recent years unmanned vehicles have grown in popularity, with an ever increasing
number of applications in industry, the military and research within air, ground and marine …

[PDF][PDF] Particle Filters in Robotics.

S Thrun - UAI, 2002 - Citeseer
In recent years, particle filters have solved several hard perceptual problems in robotics.
Early successes of particle filters were limited to low-dimensional estimation problems, such …

Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets

CCM Yeh, Y Zhu, L Ulanova, N Begum… - 2016 IEEE 16th …, 2016 - ieeexplore.ieee.org
The all-pairs-similarity-search (or similarity join) problem has been extensively studied for
text and a handful of other datatypes. However, surprisingly little progress has been made …

Monte carlo localization for mobile robots

F Dellaert, D Fox, W Burgard… - Proceedings 1999 IEEE …, 1999 - ieeexplore.ieee.org
To navigate reliably in indoor environments, a mobile robot must know where it is. Thus,
reliable position estimation is a key problem in mobile robotics. We believe that probabilistic …

Robust Monte Carlo localization for mobile robots

S Thrun, D Fox, W Burgard, F Dellaert - Artificial intelligence, 2001 - Elsevier
Mobile robot localization is the problem of determining a robot's pose from sensor data. This
article presents a family of probabilistic localization algorithms known as Monte Carlo …

Experiences with an interactive museum tour-guide robot

W Burgard, AB Cremers, D Fox, D Hähnel… - Artificial intelligence, 1999 - Elsevier
This article describes the software architecture of an autonomous, interactive tour-guide
robot. It presents a modular and distributed software architecture, which integrates …

ARA*: Anytime A* with provable bounds on sub-optimality

M Likhachev, GJ Gordon… - Advances in neural …, 2003 - proceedings.neurips.cc
In real world planning problems, time for deliberation is often limited. Anytime planners are
well suited for these problems: they find a feasible solution quickly and then continually work …

Speed/accuracy trade-off between the habitual and the goal-directed processes

M Keramati, A Dezfouli, P Piray - PLoS computational biology, 2011 - journals.plos.org
Instrumental responses are hypothesized to be of two kinds: habitual and goal-directed,
mediated by the sensorimotor and the associative cortico-basal ganglia circuits …

[PDF][PDF] Anytime dynamic A*: An anytime, replanning algorithm.

M Likhachev, DI Ferguson, GJ Gordon, A Stentz… - ICAPS, 2005 - cdn.aaai.org
We present a graph-based planning and replanning algorithm able to produce bounded
suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution …

A probabilistic approach to collaborative multi-robot localization

D Fox, W Burgard, H Kruppa, S Thrun - Autonomous robots, 2000 - Springer
This paper presents a statistical algorithm for collaborative mobile robot localization. Our
approach uses a sample-based version of Markov localization, capable of localizing mobile …