Results 1  10
of
729
FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem
 In Proceedings of the AAAI National Conference on Artificial Intelligence
, 2002
"... The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filterbase ..."
Abstract

Cited by 599 (10 self)
 Add to MetaCart
The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filter
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
The stages of economic growth.
 Economic History Review , 2nd series 12,
, 1959
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 297 (0 self)
 Add to MetaCart
available and potentially profitable innovations actually incorporated in the capital stock.1 In addition, one must introduce an extremely significant empirical hypothesis; namely, that deceleration is the normal optimum path of a sector, due to a variety of factors operating on it, from the side of both
An O(ND) Difference Algorithm and Its Variations
 Algorithmica
, 1986
"... The problems of finding a longest common subsequence of two sequences A and B and a shortest edit script for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longest path in an edit graph. Using this perspective, a s ..."
Abstract

Cited by 212 (4 self)
 Add to MetaCart
The problems of finding a longest common subsequence of two sequences A and B and a shortest edit script for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longest path in an edit graph. Using this perspective, a
Shortest path problems with node failures
 Networks
, 1992
"... Consider the problem of finding the shortest paths from a node source s to a node sink t in a complete network. On any given instance of the problem, only a subset of the intermediate nodes can be used to go from s to t, the subset being chosen according to a given probability law. We wish to find ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Consider the problem of finding the shortest paths from a node source s to a node sink t in a complete network. On any given instance of the problem, only a subset of the intermediate nodes can be used to go from s to t, the subset being chosen according to a given probability law. We wish to find
Expected shortest paths for landmarkbased robot navigation
 International Journal of Robotics Research
, 2004
"... Abstract. In this paper we address the problem of planning reliable landmarkbased robot navigation strategies in the presence of significant sensor uncertainty. The navigation environments are modeled with directed weighted graphs in which edges can be traversed with given probabilities. To construc ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
. To construct robust and efficient navigation plans, we compute expected shortest paths in such graphs. We formulate the expected shortest paths problem as a Markov decision process and provide two algorithms for its solution. We demonstrate the practicality of our approach using an extensive experimental
Expected Shortest Paths for Landmark Based Robot Navigation
"... In this paper we address the problem of planning reliable landmarkbased robot navigation strategies in the presence of significant sensor uncertainty. The navigation environments are modeled with directed weighted graphs in which edges can be traversed with given probabilities. To construct robus ..."
Abstract
 Add to MetaCart
robust and efficient navigation plans, we compute “expected shortest paths ” in such graphs. We formulate the expected shortest paths problem as a Markov decision process and provide two algorithms for its solution. We demonstrate the practicality of our approach using an extensive experimental analysis
Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
 234 I. Chabini. Minimum expected travel times in stochastic timedependent networks revisited. Internal Report. MIT
, 1999
"... A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models that a ..."
Abstract

Cited by 78 (2 self)
 Add to MetaCart
that arise in dynamic transportation systems, such as intelligent transportation systems (ITS) applications. The alltoone dynamic shortest paths problem and the onetoall fastest paths problems are studied. Early results are revisited and new properties are established. The complexity of these problems
Parallel Implementation of Geometric Shortest Path Algorithms
 Parallel Computing
, 2003
"... In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics however increases the runtime of algorith ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
). To the best of our knowledge, this is the first parallel implementation of shortest path problems in these metrics. We provide a detailed discussion of the algorithmic issues and the factors related to data, machine, implementation determining the performance of parallel shortest path algorithms. We
An Extended Shortest Path Problem with Switch Cost Between Arcs
, 2008
"... Computing the shortest path in a graph is an important problem and it is very useful in various applications. The standard shortest path problem has been studied extensively and intensively, but it can’t handle the situation when there is a switch cost between arcs. For example, in a train transpor ..."
Abstract
 Add to MetaCart
Computing the shortest path in a graph is an important problem and it is very useful in various applications. The standard shortest path problem has been studied extensively and intensively, but it can’t handle the situation when there is a switch cost between arcs. For example, in a train
Results 1  10
of
729