Current Search:   complete coverage (x)

View All Items

  • CSV Spreadsheet
(1 - 2 of 2)
COVERAGE PATH PLANNING AND CONTROL FOR AUTONOMOUS MOBILE ROBOTS
Title
COVERAGE PATH PLANNING AND CONTROL FOR AUTONOMOUS MOBILE ROBOTS.
Creator
balakrishnan, mohanakrishnan, Guo, Yi, University of Central Florida
Abstract / Description
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...
Show moreCoverage 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.
Show less
Date Issued
2005
Identifier
CFE0000641, ucf:46497
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0000641
A Triangulation Based Coverage Path Planning For a Mobile Robot With Circular Sensing Range
Title
A Triangulation Based Coverage Path Planning For a Mobile Robot With Circular Sensing Range.
Creator
An, Vatana, Qu, Zhihua, Haralambous, Michael, Mikhael, Wasfy, University of Central Florida
Abstract / Description
In this dissertation, two coverage path planning (CPP) approaches for a nonholonomic mobile robot are proposed. The first approach is the Local Coverage Path Planning (LCPP) approach which is designed for all sensing ranges. The second approach is the Global Coverage Path Planning (GCPP) approach which is designed for sufficient sensing range that can observe all points of interests in the target region (TR). The LCPP approach constructs CP after finding observer points for all local regions...
Show moreIn this dissertation, two coverage path planning (CPP) approaches for a nonholonomic mobile robot are proposed. The first approach is the Local Coverage Path Planning (LCPP) approach which is designed for all sensing ranges. The second approach is the Global Coverage Path Planning (GCPP) approach which is designed for sufficient sensing range that can observe all points of interests in the target region (TR). The LCPP approach constructs CP after finding observer points for all local regions in the TR. The GCPP approach computes observer points after CP construction. Beginning with the sample TR, the LCPP approach requires 8 algorithms to find a smooth CP and sufficient number of observers for complete coverage. The Global Coverage Path Planning approach requires 17 algorithms to find the smooth CP with sufficient number of observers for completed coverage. The worst case running time for both approaches are quadratic which is consider to be very fast as compared to previous works reported in the literature. The main technical contributions of both approaches are to provide a holistic solution that segments any TR, uses triangulation to determine the line of sights and observation points, and then compute the smooth and collision-free CP. Both approaches provide localization, speed control, curvature control, CP length control, and smooth CP control. The first approach has applications in automate vacuum cleaning, search and rescue mission, spray painting, and etc. The second approach is best used in military and space applications as it requires infinite sensing range which only resource rich organizations can afford. At the very least, the second approach provides simulation opportunity and upper bound cost estimate for CPP. Both approaches will lead to a search strategy that provides the shortest CP with the minimum number of observer and with the shortest running time for any sensing range.
Show less
Date Issued
2017
Identifier
CFE0006853, ucf:51745
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0006853