In the previous chapter, the scheme for exploration generated a subset P (of the G grid points) that the robot can reach and obtain sensor readings. A map indicating connectivity of “adjacent” nodes (for example, a node at (40,40) and (80,40) in Figure 4.11) was also generated.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Hardware-Efficient Landmark Determination. In: Robotic Exploration and Landmark Determination. Studies in Computational Intelligence, vol 81. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75394-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-75394-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75393-3
Online ISBN: 978-3-540-75394-0
eBook Packages: EngineeringEngineering (R0)