Show simple item record

dc.contributor.authorKoenig, Sven
dc.contributor.authorHalliburton, William
dc.contributor.authorTovey, Craig A.
dc.date.accessioned2008-05-09T21:09:38Z
dc.date.available2008-05-09T21:09:38Z
dc.date.issued2001
dc.identifier.urihttp://hdl.handle.net/1853/21554
dc.description.abstractWe study a greedy mapping method that always moves the robot from its current location to the closest location that it has not visited (or observed) yet, until the terrain is mapped. Although one does not expect such a simple mapping method to minimize the travel distance of the robot, we present analytical results that show (perhaps surprisingly) that the travel distance of the robot is reasonably small. This is interesting because greedy mapping has a number of desirable properties. It is simple to implement and integrate into complete robot architectures. It does not need to have control of the robot at all times, takes advantage of prior knowledge about parts of the terrain (if available), and can be used by several robots cooperatively.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectGreedy mappingen_US
dc.subjectSensor-based planningen_US
dc.subjectTravel distance of robotsen_US
dc.titleGreedy Mapping of Terrainen_US
dc.typePaperen_US
dc.contributor.corporatenameGeorgia Institute of Technology. College of Computing


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Mobile Robot Laboratory [187]
    Papers, pre/post-prints, and presentations by faculty and students in the Georgia Tech Mobile Robot Laboratory.
  • Mobile Robot Laboratory Publications [187]
    Papers, pre/post-prints, and presentations by faculty and students in the Georgia Tech Mobile Robot Laboratory.

Show simple item record