Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A review on improving the autonomy of unmanned surface vehicles through intelligent collision avoidance manoeuvres
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 …
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 …
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
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 …
text and a handful of other datatypes. However, surprisingly little progress has been made …
Monte carlo localization for mobile robots
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 …
reliable position estimation is a key problem in mobile robotics. We believe that probabilistic …
Robust Monte Carlo localization for mobile robots
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 …
article presents a family of probabilistic localization algorithms known as Monte Carlo …
Experiences with an interactive museum tour-guide robot
This article describes the software architecture of an autonomous, interactive tour-guide
robot. It presents a modular and distributed software architecture, which integrates …
robot. It presents a modular and distributed software architecture, which integrates …
ARA*: Anytime A* with provable bounds on sub-optimality
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 …
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
Instrumental responses are hypothesized to be of two kinds: habitual and goal-directed,
mediated by the sensorimotor and the associative cortico-basal ganglia circuits …
mediated by the sensorimotor and the associative cortico-basal ganglia circuits …
[PDF][PDF] Anytime dynamic A*: An anytime, replanning algorithm.
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 …
suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution …
A probabilistic approach to collaborative multi-robot localization
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 …
approach uses a sample-based version of Markov localization, capable of localizing mobile …