1222 search results - page 64 / 245 » Some Results on Directable Automata |
JDA
2006
14 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— We present an interpolation-based planning and replanning algorithm that is able to produce direct, lowcost paths through three-dimensional environments. Our algorithm builds u...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper discusses the whole arm manipulation allowing the contact state transition. For manipulation of an object under fully constrained, the contact state transition becom...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We present a method to track and estimate the motion of a 3D object with a monocular image sequence. The problem is based on the state equations and is solved by a sequential Mont...