R Kimmel and J A Sethian. Applications of fast marching methods to robotic navigation and construction of optimal paths. submitted, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Optimal Time Algorithm for Shape from Shading - Kimmel And Sethian (2000) (1 citation) Self-citation (Kimmel Sethian) (Correct)
No context found.
R Kimmel and J A Sethian. Applications of fast marching methods to robotic navigation and construction of optimal paths. submitted, 1996.
Multivalued Distance Maps for Motion Planning on.. - Kimmel, Kiryati.. (1998) (9 citations) Self-citation (Kimmel) (Correct)
....tracking procedure. The parameter may be considered as a measure for this flexibility; see Fig. 5. The discrete back tracking procedure presented here is simple but not consistent. Consistent sub grid methods for back tracking that are based on second order ODE integrators are possible (see, e.g. [13]) An interesting observation is the following: Consider an obstacle moving at a velocity and forcing the robot to follow it. Using the above approximation, i.e. preferring a unit velocity, may cause the robot to travel back and forth (juggle) along the boundary of the moving obstacle while ....
....[5] plus the important convergence property. In other words, a systematically resolution complete algorithm for the stationary search problem with a complexity of It is based on recent works by Sethian [25] Tsitisiklis [27] and was recently used for efficiently solving navigation problems in [13]. These algorithms apply to flat domains, as well as flat weighted domains; domains with a different cost assigned to each point, referred to as traversability in the appendix. Still, for non flat domains, e.g. surfaces, the level set implicit propagation, with Adalsteinsson Sethian [1] ....
R. Kimmel and J. A. Sethian, "Applications of fast marching methods to robotic navigation and construction of optimal paths," submitted for publication.
Multi-Valued Distance Maps for Motion Planning on.. - Kimmel, Kiryati.. (1998) (9 citations) Self-citation (Kimmel) (Correct)
....procedure. The parameter ffi may be considered as a measure for this flexibility, see Figure 5. The discrete back tracking procedure presented here is simple but not consistent. Consistent sub grid methods for back tracking that are based on second order ODE integrators are possible (see e.g. [13]) An interesting observation is the following: Consider an obstacle moving at a velocity v 1 and forcing the robot to follow it. Using the above approximation, i.e. preferring a unit velocity, may cause the robot to travel back and forth (juggle) along the boundary of the moving obstacle ....
....the important convergence property. In other words a systematically resolution complete algorithm for the stationary search problem with a complexity of O(n log n) It is based on recent works by Sethian [25] Tsitisiklis [27] and was recently used for efficiently solving navigation problems in [13]. These algorithms apply to flat domains, as well as flat weighted domains; domains with a different cost assigned to each point, referred to as traversability in the appendix. Still, for non flat domains, e.g. surfaces, the level set implicit propagation, with Adalsteinsson Sethian [1] narrow ....
R Kimmel and J A Sethian. Applications of fast marching methods to robotic navigation and construction of optimal paths. submitted, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC