Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/7932Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Guruprasad, K.R. | - |
| dc.date.accessioned | 2020-03-30T10:03:07Z | - |
| dc.date.available | 2020-03-30T10:03:07Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Vol.7135 LNCS, , pp.228-236 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7932 | - |
| dc.description.abstract | This paper addresses the problem of path planning for a mobile robot in a region occupied by finite number obstacles. The region and the obstacles are not known a priori to the robot. We present an online path planning algorithm called EgressBug, that makes the robot reach any specified point in the space, and stops by reporting failure when the specified goal point does not belong to the free space. The proposed EgressBug algorithm uses simple move toward a point and wall following behaviors. The algorithm is illustrated with the help of examples, and paths generated by the EgressBug algorithm are compared with those generated by the Bug2 and TangentBug algorithms. � 2012 Springer-Verlag. | en_US |
| dc.title | EgressBug: A real time path planning algorithm for a mobile robot in an unknown environment | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.