Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/13763
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPathya, Ramvati-
dc.date.accessioned2014-12-09T06:13:56Z-
dc.date.available2014-12-09T06:13:56Z-
dc.date.issued2003-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/13763-
dc.guideKumar, Munish-
dc.guideAstya, P. N.-
dc.description.abstractThe problem of automatic collision-free path planning is central to mobile Robot applications. The basic problem of a mobile robot is that of navigation (moving from one place to another) by the coordination of planning, sensing and control. In any navigation- the desire is to reach a destination without getting lost anywhere. The image of the region, which is full of obstacle, is scan converted and stored in the form of quadtree. And then this quadtree is used to find a collision free path for a mobile robot from any given source to any given destination. An approach to automatic path planning based on a quadtree representation is presented. Hierarchical path--searching methods are introduced, which make use of this multi-resolution representation, to speed up the path planning process considerably. The applicability of this approach to mobile robot path planning is discusseden_US
dc.language.isoenen_US
dc.subjectCDACen_US
dc.subjectPATH FINDINGen_US
dc.subjectMOBILE ROBOTSen_US
dc.subjectROBOT APPLICATIONSen_US
dc.titleCOLLISION FREE PATH FINDING FOR MOBILE ROBOTSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG11239en_US
Appears in Collections:Dissertation (C.Dec.)

Files in This Item:
File Description SizeFormat 
ERDCIG11239.pdf3.75 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Admin Tools