Sciweavers

189 search results - page 19 / 38
» Shortest Paths Without a Map
Sort
View
ICPP
2009
IEEE
13 years 5 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
ICRA
2008
IEEE
144views Robotics» more  ICRA 2008»
14 years 2 months ago
Path guidance control for a safer large scale dissipative haptic display
—The properties of dissipative haptic displays allow larger workspaces that permit a whole body interaction useful for sports, rehabilitation, and large-scale object design appli...
Brian Dellon, Yoky Matsuoka
JAIR
2008
107views more  JAIR 2008»
13 years 7 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
AUSAI
2008
Springer
13 years 9 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
MOBISYS
2010
ACM
13 years 10 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...