robot, nonholonomic, complete coverage, control
Coverage control has many applications such as security patrolling, land mine detectors, and automatic vacuum cleaners. This Thesis presents an analytical approach for generation of control inputs for a non-holonomic mobile robot in coverage control. Neural Network approach is used for complete coverage of a given area in the presence of stationary and dynamic obstacles. A complete coverage algorithm is used to determine the sequence of points. Once the sequences of points are determined a smooth trajectory characterized by fifth order polynomial having second order continuity is generated. And the slope of the curve at each point is calculated from which the control inputs are generated analytically. Optimal trajectory is generated using a method given in research literature and a qualitative analysis of the smooth trajectory is done. Cooperative sweeping of multirobots is achieved by dividing the area to be covered into smaller areas depending on the number of robots. Once the area is divided into sub areas, each robot is assigned a sub area for cooperative sweeping.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Master of Science (M.S.)
College of Engineering and Computer Science
Electrical and Computer Engineering
Length of Campus-only Access
Masters Thesis (Open Access)
Balakrishnan, Mohanakrishnan, "Coverage Path Planning And Control For Autonomous Mobile Robots" (2005). Electronic Theses and Dissertations. 429.