On motion planning in graphs

dc.contributor.guide	Kapoor, Kalpesh
dc.coverage.spatial	Mathematics
dc.creator.researcher	Deb, Biswajit
dc.date.accessioned	2023-05-22T09:34:23Z
dc.date.available	2023-05-22T09:34:23Z
dc.date.awarded	2012
dc.date.completed	2012
dc.date.registered	2009
dc.description.abstract	Consider an undirected graph G in which a robot is placed at a vertex say u and obstacles are placed at all other vertices except at vertex v The vertex without a robot or an obstacle is said to have a hole We refer to this placement of robot and obstacles as a configuration Cu v of G We say that Cu v is reachable from Cv u by an mRJ move of the robot provided there is a u v path u u0 u1 u2 D D D um um 1 v of length m 1 in G For m 0 an mRJ move is also known as a simple move
dc.description.note	Not Available
dc.format.accompanyingmaterial	None
dc.format.dimensions	Not Available
dc.format.extent	Not Available
dc.identifier.uri	http://hdl.handle.net/10603/484505
dc.language	English
dc.publisher.institution	DEPARTMENT OF MATHEMATICS
dc.publisher.place	Guwahati
dc.publisher.university	Indian Institute of Technology Guwahati
dc.relation	Not Available
dc.rights	self
dc.source.university	University
dc.subject.keyword	Mathematics
dc.subject.keyword	Physical Sciences
dc.title	On motion planning in graphs
dc.title.alternative	Not available
dc.type.degree	Ph.D.