127 search results - page 10 / 26 » The Directed Planar Reachability Problem |
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
OZCHI
2006
ACM
14 years 3 months ago
2006
ACM
The HCI community currently faces the problem of making tangible user interfaces actively responsive to their user’s current physical context. This paper explores the context of...
TOPNOC
2008
13 years 9 months ago
2008
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
TASE
2010
IEEE
13 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...