Results 11  20
of
1,751
Exploring Unknown Environments
 SIAM Journal on Computing
, 1997
"... We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge trave ..."
Abstract

Cited by 95 (2 self)
 Add to MetaCart
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge
Broadcasting algorithms in radio networks with unknown topology
 In Proc. of FOCS
, 2003
"... In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal wor ..."
Abstract

Cited by 122 (1 self)
 Add to MetaCart
In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal
Deterministic Broadcasting in Unknown Radio Networks
, 2000
"... We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and nod ..."
Abstract

Cited by 75 (24 self)
 Add to MetaCart
We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other
Topological Simultaneous Localization and Mapping (SLAM): Toward Exact Localization Without Explicit Localization
 IEEE Transactions on Robotics and Automation
, 2001
"... One of the critical components of mapping an unknown environment is the robot's ability to locate itself on a partially explored map. This becomes challenging when the robot experiences positioning error, does not have an external positioning device, nor the luxury of engineered landmarks place ..."
Abstract

Cited by 224 (10 self)
 Add to MetaCart
map used in this paper is the generalized Voronoi graph (GVG), which also encodes some metric information about the robot's environment, as well. In this paper, we present the lowlevel control laws that generate the GVG edges and nodes, thereby allowing for exploration of an unknown space
Exploring Unknown Environments with Obstacles
 In Proc. 10th ACMSIAM Sympos. Discrete Algorithms
, 1998
"... We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the first problem setting we consider, a robot has to explore n rectangles. We show that no deterministic or randomized online algorithm can be better t ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the first problem setting we consider, a robot has to explore n rectangles. We show that no deterministic or randomized online algorithm can be better
A Selective Anchor Node Localization Algorithm for
 Wireless Sensor Networks”, 2007 International Conference on Convergence Information Technology
"... Abstract—Wireless sensor network (WSN) are more and more widely used in many different scenarios. The localization information is an important criterion for the capability of WSN. Nowadays, there are many localization algorithms. DVhop is a classical Rangefree localization algorithm, by which unkn ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
unknown nodes can obtain anchors ’ information within designated hops, and estimate the distances from themselves to anchors. Unknown nodes then use the information to localize themselves. But the estimative distances may incur large error, and will jeopardize the localization precision. In order to solve
Exploring an unknown graph efficiently
 In Proc. 13th Annu. European Sympos. Algorithms
, 2005
"... Abstract. We study the problem of exploring an unknown, strongly connected directed graph. Starting at some node of the graph, we must visit every edge and every node at least once. The goal is to minimize the number of edge traversals. It is known that the competitive ratio of online algorithms for ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Abstract. We study the problem of exploring an unknown, strongly connected directed graph. Starting at some node of the graph, we must visit every edge and every node at least once. The goal is to minimize the number of edge traversals. It is known that the competitive ratio of online algorithms
Competitive Routing of Virtual Circuits with Unknown Duration
 In Proc. 5th ACMSIAM Symposium on Discrete Algorithms
, 1994
"... In this paper we present a strategy to route unknown duration virtual circuits in a highspeed communication network. Previous work on virtual circuit routing concentrated on the case where the call duration is known in advance. We show that by allowing O(log n) reroutes per call, we can achieve O(lo ..."
Abstract

Cited by 65 (15 self)
 Add to MetaCart
(log n) competitive ratio with respect to the maximum load (congestion) for the unknown duration case, were n is the number of nodes in the network. This is in contrast to the ( 4p n)lower bound on the competitive ratio for this case if no rerouting is allowed [3]. Our routing algorithm can be also
Comparison of Graph Cuts with Belief Propagation for Stereo, Using Identical MRF Parameters
 In ICCV
, 2003
"... Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRFbased approach is the inference algorithm used to find the most likely setting of each node in the MRF. Algorithms have been proposed which use ..."
Abstract

Cited by 172 (0 self)
 Add to MetaCart
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRFbased approach is the inference algorithm used to find the most likely setting of each node in the MRF. Algorithms have been proposed which use
Optimal and Efficient Path Planning for Unknown and Dynamic Environments
 International Journal of Robotics and Automation
, 1993
"... The {ask of planning trajectories for a mobile robot hat received considerable attention in the research literature. Algorithms exist for handling a variety of robot shapes, configurations, motion constraints, and environments. Most of the work assumes the robot has a complete and accurate model of ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
paths in unknown, partially known, and changing environments in an efficient, optimal, and complete manner. D* models the environment as a graph, where each node represents a robot state (e.g., a location in a room), and each arc represents the cost (e.g., distance to travel) of moving between two
Results 11  20
of
1,751