Competitive robot mapping with homogeneous markers
Authors:
- Xiaotie DengXDXiaotie Deng
- A. MirzaianAMA. Mirzaian
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 12 (4) , 532-542
Abstract
: We consider the robot exploration problem of graph maps with homogeneousmarkers, following the graph world model introduced by Dudek et al. [DJMW]. The environmentis a graph consisting of nodes and edges, where the robot can navigate from one node toanother through an edge connecting these two nodes. However, the robot may not distinguishone node (or edge) from another in this unknown graph. All the nodes (edges) look the same.However, at each node, the robot can observe a consistent...Keywords
This publication has 16 references indexed in Scilit:
- Parallel searching in the planeComputational Geometry, 1995
- A robot exploration and mapping strategy based on a semantic hierarchy of spatial representationsRobotics and Autonomous Systems, 1991
- Navigating in unfamiliar geometric terrain1991
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991
- On the complexity of kinodynamic planning1988
- New lower bound techniques for robot motion planning problems1987
- A new algebraic method for robot motion planning and real geometry1987
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974