107 search results - page 15 / 22 » Perfect Simulations for Random Trip Mobility Models |
ROBOCOMM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
96
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
2007
ACM
The testing of the performance of opportunistic communication protocols and applications is usually done through simulation as i) deployments are expensive and should be left to t...
85
Voted
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from ...