Results 1  10
of
466,027
M.: Fast marching trees: a fast marching samplingbased method for optimal motion planning in many dimensions
 CoRR
, 2013
"... In this paper we present a novel probabilistic samplingbased motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in highdimensional configuration spaces. This algorithm is proven to be asymptoti ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In this paper we present a novel probabilistic samplingbased motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in highdimensional configuration spaces. This algorithm is proven
Fast Marching Methods
 SIAM Review
, 1998
"... Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are opti ..."
Abstract

Cited by 208 (4 self)
 Add to MetaCart
Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms
Evaluating the Accuracy of SamplingBased Approaches to the Calculation of Posterior Moments
 IN BAYESIAN STATISTICS
, 1992
"... Data augmentation and Gibbs sampling are two closely related, samplingbased approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical accurac ..."
Abstract

Cited by 583 (14 self)
 Add to MetaCart
Data augmentation and Gibbs sampling are two closely related, samplingbased approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical
SamplingBased Motion Planning
, 2006
"... There are two main philosophies for addressing the motion planning problem, in Formulation 4.1 from Section 4.3.1. This chapter presents one of the philosophies, samplingbased motion planning, which is outlined in Figure 5.1. The main idea is to avoid the explicit construction of Cobs, as described ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
There are two main philosophies for addressing the motion planning problem, in Formulation 4.1 from Section 4.3.1. This chapter presents one of the philosophies, samplingbased motion planning, which is outlined in Figure 5.1. The main idea is to avoid the explicit construction of Cobs
Samplingbased algorithms for optimal motion planning
 International Journal of Robotics Research (IJRR
"... During the last decade, samplingbased path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidlyexploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to t ..."
Abstract

Cited by 178 (12 self)
 Add to MetaCart
a constant factor of that of their probabilistically complete (but not asymptotically optimal) counterparts. The analysis in this paper hinges on novel connections between stochastic samplingbased path planning algorithms and the theory of random geometric graphs.
The FF planning system: Fast plan generation through heuristic search
 Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract

Cited by 822 (53 self)
 Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
FastMap: A Fast Algorithm for Indexing, DataMining and Visualization of Traditional and Multimedia Datasets
, 1995
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in kd space, using k featureextraction functions, provided by a domain expert [25]. Thus, we can subsequently use highly finetuned spatial access methods (SAMs), to answer several types ..."
Abstract

Cited by 497 (23 self)
 Add to MetaCart
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in kd space, using k featureextraction functions, provided by a domain expert [25]. Thus, we can subsequently use highly finetuned spatial access methods (SAMs), to answer several
Results 1  10
of
466,027