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...
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 ...
— 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...
— 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...
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...