Sciweavers

189 search results - page 8 / 38
» Shortest Paths Without a Map
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 8 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 5 months ago
Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
Michael J. Neely

Presentation
2175views
15 years 8 months ago
Robust Robotic Path Planning Using Level Sets
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surround...
M. Sabry Hassouna
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
14 years 1 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts