Sciweavers

553 search results - page 33 / 111
» On Planar Path Transformation
Sort
View
90
Voted
IROS
2007
IEEE
134views Robotics» more  IROS 2007»
15 years 7 months ago
From path to 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...
Hanna Kurniawati, Thierry Fraichard
STACS
2010
Springer
15 years 7 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
84
Voted
IROS
2008
IEEE
130views Robotics» more  IROS 2008»
15 years 7 months ago
Energy based path planning for a novel cabled robotic system
— Cabled robotic systems have been used for a diverse set of applications such as environmental sensing, search and rescue, sports and entertainment and air vehicle simulators. I...
Per Henrik Borgstrom, Amarjeet Singh 0003, Brett L...
113
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Online Calibration of Path Loss Exponent in Wireless Sensor Networks
— The path loss exponent (PLE) is a parameter indicating the rate at which the received signal strength (RSS) decreases with distance, and its value depends on the specific prop...
Guoqiang Mao, Brian D. O. Anderson, Baris Fidan
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
14 years 11 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou