Dudek, Gregory# Jenkins, Michael# Milios, Evangelos# and Wilkes, David 1988. Robotic exploration as graph construction. Technical Report RBCV-TR88 -23, UniversityofToronto. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Exploring Unknown Environments with Mobile Robots using.. - Cyrill Stachniss Wolfram (2003) (Correct)
....rooms and then traverses through doorways to explore other parts of the environment. Tailor and Kriegman [16] describe a system for visiting all landmarks in the environment of the robot. Their robot maintains a list of unvisited landmarks that are approached and mapped by the robot. Dudek et al. [6] propose a strategy for exploring an unknown graph like environment. Their algorithm does not consider distance metrics and is designed for robots with very limited perceptual capabilities. Recently Koenig has shown, that a strategy, which guides the vehicle to the closest point that has not been ....
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation, 7(6):859--865, 1991.
Towards a General Theory of Topological Maps - Remolina, Kuipers (2002) (4 citations) (Correct)
....among landmarks. The theories differ on how sensory information is represented, what a place is, and how the overall spatial knowledge is structured. The use of topological maps in robotics varies according to the type of information used when building such map. Rivest and Schapire, 1987, Dudek et al. 1991, Dean et al. 1993, Basye et al. 1995] use the sequence of views and actions generated by the robot exploration to recover the minimum deterministic automaton consistent with such information. In these works, actions do not have any spatial properties associated with them. Metrical information ....
Gregory Dudek, Jenkin Michael, Evangelos Milios, and David Wilkes. Robotic exploration as graph construction. IEEE Trans. on Robotics and Automation, 7(6):859--865, 1991. 54
Path Planning for a Fuzzy Controlled Autonomous Mobile Robot - Surmann, Huser, Wehking (1996) (1 citation) (Correct)
....[17] These approaches need a lot precise information and they have difficulties to distinguish between static and dynamic objects. An off line generation of a topological map out of the geometric information can lead to errors. Exploration as a graph construction without distance information, eg [18], needs to drop distinct markers by the robot. Our approach explores different levels of maps simultaneously without dropping distinct markers. Each map type has limitations that are relevant to the exploration tasks. Robust performance in both maping and navigation means not only that ....
Greogory Dudek, Micael Jenkin, Evangelos Milos, and David Wilkes, "Robotic Exploration as Graph Construction ", IEEE Transactions on Robotics and Automation, vol. 7, no. 6, pp. 859 - 865, Dec. 1991.
Sensor Network-based Multi-Robot Task Allocation - Batalin, Sukhatme (2003) (2 citations) (Correct)
....results show that the proposed algorithm is more stable than the exploration only algorithm. II. RELATED WORK Our work is closely related to the body of literature on using markers to aid mobile robot navigation. This idea has received attention in coverage and exploration [1] 2] 4] [5], 6] and navigation [1] 7] 8] Ant like trail laying algorithms [7] 6] consider a special case of the marker deployment approaches when the distance between the two consecutive markers is small. Therefore Submitted to Intl. Conference on Intelligent Robots and Systems (IROS2003) a trail ....
....Therefore Submitted to Intl. Conference on Intelligent Robots and Systems (IROS2003) a trail is formed that the robots can follow and cover the environment and or navigate. In these cases, no intermarker communication is necessary, indeed the markers are passive read only devices. In [4] [5] the problem of graph coverage using a few markers is considered. In both cases the authors study the problem of dynamic single robot coverage on an environment consisting of nodes and edges (a graph) The key result was that the ability to tag a limited number of nodes (in some cases only one ....
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," in IEEE Transactions on Robotics and Automation, 7-6, 1991.
Collaborative Exploration of Unknown Environments with.. - Burgard, Moors.. (2002) (Correct)
....are not distributed, the interferences between them result in longer execution times. 5 Related Work The various aspects of the problem of exploring unknown environments with mobile robots have been studied intensively in the past. Different techniques for single robots have been presented in [32, 39, 51, 18, 23, 11, 16, 54, 50]. Whereas most of these approaches follow a greed strategy to acquire unknown terrain, they mainly differ in the way the environment is represented. Furthermore, there is a serious amount of theoretical work providing a mathematical analysis of the complexity of exploration strategies including ....
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation, 7(6):859--865, 1991.
Efficient Exploration Without Localization - Batalin, Sukhatme (2002) (1 citation) (Correct)
....The map is analyzed to locate the frontiers between the free and unknown space. Exploration proceeds in the direction of the closest frontier . The multi robot version of the same problem was addressed in [9] The problem of coverage was considered from the graph theoretic viewpoint in [10, 11]. In both cases the authors study the problem of dynamic single robot coverage on an environment consisting of nodes and edges (a graph) The key result was that the ability to tag a limited number of nodes (in some cases only one node) with unique markers dramatically improved the cover time. It ....
....static markers into the environment by the robot. For purposes of analysis in this paper we will treat this collection of markers as nodes of a graph even though no explicit adjacency lists are maintained at each marker. There are four key di#erences between our algorithm and the work reported in [10, 11]: 1. We do not assume the robot can navigate from one marker to another (i.e. from one node to another in the graph) The robot does not localize itself, nor has a map of the environment (the structure of the graph corresponding to the environment is not known to the robot, nor does it construct ....
[Article contains additional citation context not shown here]
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," in IEEE Transactions on Robotics and Automation, 7-6, 1991.
Inferring Finite Automata with Stochastic Output - Functions And An Self-citation (Evangelos) (Correct)
No context found.
Dudek, Gregory# Jenkins, Michael# Milios, Evangelos# and Wilkes, David 1988. Robotic exploration as graph construction. Technical Report RBCV-TR88 -23, UniversityofToronto.
Topological Exploration With Multiple Robots - Dudek Centre For Self-citation (Dudek Jenkin Milios Wilkes) (Correct)
No context found.
Gregory Dudek, Michael Jenkin, Evangelos Milios, and David Wilkes. Robotic exploration as graph construction. Transactions on Robotics and Automation, 7(6):859--865, December 1991.
Automated Creation of Image-Based Virtual Reality - Eric Bourque And (1997) Self-citation (Dudek) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," Transactions on Robotics and Automation 7, pp. 859--865, December 1991.
Coping With Uncertainty in Map Learning - Kenneth Basye Thomas (1989) (20 citations) (Correct)
No context found.
[ Dudek et al., Dudek, Gregory# Jenkins, Michael# Milios, Evangelos# and Wilkes, David 1988. Robotic exploration as graph construction. Technical Report RBCV-TR88 -23, UniversityofToronto.
Towards a General Theory of Topological Maps - Remolina, Kuipers (2002) (4 citations) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, D. Wilkes, Robotic exploration as graph construction, IEEE Trans. on Robotics and Automation 7 (6) (1991) 859--865.
Map Learning with Uninterpreted Sensors and Effectors - David Pierce And (1997) (14 citations) (Correct)
No context found.
Dudek, G., Jenkin, M., Milios, E., and Wilkes, D. (1991). Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation, 7(6):859--865.
Loop-Closing and Planarity in Topological Map-Building - Savelli, al. (2004) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Trans. on Robotics and Automation, vol. 7, no. 6, pp. 859--865, 1991.
Towards a General Theory of Topological Maps - Emilio Remolina Benjamin (2004) (4 citations) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE Trans. on Robotics and Automation, 7(6):859-- 865, 1991.
Using the Topological Skeleton for Scalable Global.. - Modayil, Beeson, Kuipers (2004) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Trans. on Robotics and Automation, vol. 7, no. 6, pp. 859--865, 1991.
Topological Mapping of Ambiguous Space: Combining Qualitative . . . - Savelli (2005) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE Trans. on Robotics and Automation, 7(6):859--865, 1991.
Coordinated Multi-Robot Exploration - Burgard, Moors, Stachniss, Schneider (2005) (4 citations) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Transactions on Robotics and Automation, vol. 7, no. 6, pp. 859--865, 1991.
Coverage, Exploration and Deployment by a Mobile Robot and.. - Batalin, Sukhatme (2004) (1 citation) (Correct)
No context found.
Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: Robotic exploration as graph construction. In: IEEE Transactions on Robotics and Automation, 7-6. (1991) 859--865
Efficient Exploration Without Localization - Batalin, Sukhatme (2003) (1 citation) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," in IEEE Transactions on Robotics and Automation, 7-6, 1991.
Sensor Network-based Multi-Robot Task Allocation - Batalin, Sukhatme (2003) (2 citations) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," in IEEE Transactions on Robotics and Automation, 7-6, 1991.
Using a Sensor Network for Distributed Multi-Robot Task.. - Batalin, Sukhatme (2003) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," in IEEE Transactions on Robotics and Automation, 7-6, 1991.
Coverage, Exploration and Deployment by a Mobile Robot and.. - Batalin, Sukhatme (2003) (1 citation) (Correct)
No context found.
Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: Robotic exploration as graph construction. In: IEEE Transactions on Robotics and Automation, 7-6. (1991)
Inference in the Space of Topological Maps: An MCMC-based.. - Ranganathan, Dellaert (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Transactions on Robotics and Automation, vol. 7, no. 6, pp. 859--865, 1991.
Appers in: Robotics and Autonomous Systems 40(2):91-97.. - Augmenting Topology-Based .. (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE T. on Robotics and Automation, 7(6):859--865, 1991.
The Power of a Pebble: Exploring and Mapping Directed.. - Bender.. (1998) (21 citations) (Correct)
No context found.
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. IEEE Transactions on Robotics and Automation, 7(6):859--865, December 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC