Results 1 - 10
of
272,153
The Vector Field Histogram -- Fast Obstacle Avoidance For Mobile Robots
- IEEE JOURNAL OF ROBOTICS AND AUTOMATION
, 1991
"... A new real-time obstacle avoidance method for mobile robots has been developed and implemented. This method, named the vector field histogram(VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses a ..."
Abstract
-
Cited by 470 (23 self)
- Add to MetaCart
A new real-time obstacle avoidance method for mobile robots has been developed and implemented. This method, named the vector field histogram(VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses
Robust Monte Carlo Localization for Mobile Robots
, 2001
"... Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples), whi ..."
Abstract
-
Cited by 826 (88 self)
- Add to MetaCart
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract
-
Cited by 1108 (51 self)
- Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The interdisciplinary study of coordination
- ACM Computing Surveys
, 1994
"... This survey characterizes an emerging research area, sometimes called coordination theory, that focuses on the interdisciplinary study of coordination. Research in this area uses and extends ideas about coordination from disciplines such as computer science, organization theory, operations research, ..."
Abstract
-
Cited by 773 (21 self)
- Add to MetaCart
, economics, linguistics, and psychology. A key insight of the framework presented here is that coordination can be seen as the process of managing dependencies among activities. Further progress, therefore, should be possible by characterizing different kinds of dependencies and identifying the coordination
Awareness and Coordination in Shared Workspaces
- Proc. of the Conf. on Computer Supported Cooperative Work (CSCW´92
, 1992
"... Awareness of individual and group activities is critical to successful collaboration and is commonly supported in CSCW systems by active, information generation mecha-nisms separate from the shared workspace. These mechanisms pena~ise information providers, presuppose rel-evance to the recipient, an ..."
Abstract
-
Cited by 790 (14 self)
- Add to MetaCart
, and make access difficult, We discuss a study of shared editor use which suggests that awareness information provided and exploited passively through the shared workspace, allows users to move smoothly between close and loose collaboration, and to assign and coordinate work dynamically. Passive awareness
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
- Machine Learning
, 1998
"... . This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract
-
Cited by 487 (47 self)
- Add to MetaCart
. This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from
Understanding Code Mobility
- IEEE COMPUTER SCIENCE PRESS
, 1998
"... The technologies, architectures, and methodologies traditionally used to develop distributed applications exhibit a variety of limitations and drawbacks when applied to large scale distributed settings (e.g., the Internet). In particular, they fail in providing the desired degree of configurability, ..."
Abstract
-
Cited by 549 (34 self)
- Add to MetaCart
, scalability, and customizability. To address these issues, researchers are investigating a variety of innovative approaches. The most promising and intriguing ones are those based on the ability of moving code across the nodes of a network, exploiting the notion of mobile code. As an emerging research field
Adaptive clustering for mobile wireless networks
- IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract
-
Cited by 556 (11 self)
- Add to MetaCart
This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically
Results 1 - 10
of
272,153