Results 1  10
of
26,045
New shortestpath approaches to visual servoing
 In IEEE/RSJ International Conference on Intelligent Robots and Systems
, 2004
"... AbslraclIn recent years, a number of \,isual servo control slgarithms have been proposed. Most approaches try to solve the inherent problems of imagebased and positionbased servoing by partitioning the eontml between image and Cartesian spaces. However, partitioning of the cuntml often causes the ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
the Cartesian path to become more complex, which might result in operation close to the joint limits. A solution to avoid the joint limits is to use a shortestpath approach, which avoids the limits in must cases. In this paper, two new shortestpath approaches to visual servoing are presented. Fin6 a pusition
A New Shortest Paths Ranking Algorithm
, 1999
"... Ranking shortest paths is a classical network problem consisting of the determination of the K shortest paths connecting a given initialdestination pair of nodes such as the distance of the k th path that is determined is no greater than the distance of any j th one, for some j ? k . In this ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
Ranking shortest paths is a classical network problem consisting of the determination of the K shortest paths connecting a given initialdestination pair of nodes such as the distance of the k th path that is determined is no greater than the distance of any j th one, for some j ? k
A New Shortest Path Routing Algorithm and Ernbedding Cycles of Crossed Cube
"... An ndzmensaonal crossed cube, CQn, zs a varzataon of hypercubes. In thzs paper, we gave a new shortest path routzng algorzthm based on a new dastance measure defined herean. In comparzson wath Efe's algorzthm whzch generates one shortest path an O(n2) tame, our algorathm can generate more shor ..."
Abstract
 Add to MetaCart
An ndzmensaonal crossed cube, CQn, zs a varzataon of hypercubes. In thzs paper, we gave a new shortest path routzng algorzthm based on a new dastance measure defined herean. In comparzson wath Efe's algorzthm whzch generates one shortest path an O(n2) tame, our algorathm can generate more
Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract)
, 2002
"... We evaluate the practical eciency of a new shortest path algorithm for undirected graphs which was developed by the rst two authors. This algorithm works on the fundamental comparisonaddition model. Theoretically, this new algorithm outperforms Dijkstra's algorithm on sparse graphs for t ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We evaluate the practical eciency of a new shortest path algorithm for undirected graphs which was developed by the rst two authors. This algorithm works on the fundamental comparisonaddition model. Theoretically, this new algorithm outperforms Dijkstra's algorithm on sparse graphs
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
Regularization paths for generalized linear models via coordinate descent
, 2009
"... We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, twoclass logistic regression, and multinomial regression problems while the penalties include ℓ1 (the lasso), ℓ2 (ridge regression) and mixtures of the two (the elastic ..."
Abstract

Cited by 724 (15 self)
 Add to MetaCart
elastic net). The algorithms use cyclical coordinate descent, computed along a regularization path. The methods can handle large problems and can also deal efficiently with sparse features. In comparative timings we find that the new algorithms are considerably faster than competing methods.
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1277 (120 self)
 Add to MetaCart
A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the singlesource shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the allpairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite
Results 1  10
of
26,045