Competitive robot mapping with homogeneous markers
- 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
- https://doi.org/10.1109/70.508436
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 18 references indexed in Scilit:
- How to learn an unknown environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive algorithms for layered graph traversalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A robot exploration and mapping strategy based on a semantic hierarchy of spatial representationsRobotics and Autonomous Systems, 1991
- Navigating in unfamiliar geometric terrainPublished by Association for Computing Machinery (ACM) ,1991
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991
- On the complexity of kinodynamic planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A new algebraic method for robot motion planning and real geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- 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