Sciweavers

553 search results - page 26 / 111
» On Planar Path Transformation
Sort
View
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
15 years 5 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
SPAA
2005
ACM
15 years 9 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
128
Voted
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 10 months ago
Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments
A multi-resolution path planning algorithm based on the wavelet transform of the environment has been reported previously in the literature. In this paper, we provide a proof of co...
Raghvendra V. Cowlagi, Panagiotis Tsiotras
120
Voted
IROS
2008
IEEE
113views Robotics» more  IROS 2008»
15 years 9 months ago
Navigating dynamic environments using trajectory deformation
Abstract— Path deformation is a technique that was introduced to generate robot motion wherein a path, that has been computed beforehand, is continuously deformed on-line in resp...
Vivien Delsart, Thierry Fraichard
EUROS
2008
137views Robotics» more  EUROS 2008»
15 years 5 months ago
Reactive Trajectory Deformation to Navigate Dynamic Environments
Abstract. Path deformation is a technique that was introduced to generate robot motion wherein a path, that has been computed beforehand, is continuously deformed on-line in respon...
Vivien Delsart, Thierry Fraichard