The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 23, 2026

Filed:

Sep. 13, 2022
Applicants:

Megnath Ramesh, Waterloo, CA;

Francis Christopher Imeson, Kitchener, CA;

Stephen Smith, Kitchener, CA;

Baris Fidan, Kitchener, CA;

Inventors:

Megnath Ramesh, Waterloo, CA;

Francis Christopher Imeson, Kitchener, CA;

Stephen Smith, Kitchener, CA;

Baris Fidan, Kitchener, CA;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06Q 20/20 (2012.01); A47L 11/40 (2006.01); G05D 1/00 (2006.01); G06F 17/12 (2006.01); G06Q 20/40 (2012.01); G07G 3/00 (2006.01);
U.S. Cl.
CPC ...
A47L 11/4011 (2013.01); G05D 1/0219 (2013.01); G05D 1/0274 (2013.01); G06F 17/12 (2013.01); A47L 2201/04 (2013.01);
Abstract

A system and method of minimum turn coverage of arbitrary non-convex regions. Coverage planning is the task of generating a path that ensures the tool carried by the robot covers all regions of interest. The number of turns in the path can affect the time to cover the region and the quality of coverage (tools like cameras and cleaning attachments commonly have poor performance around turns). In recent turn-minimizing coverage methods, the region is partitioned to be covered by the least number of rectangles of width equal to the tool's width. The partitioning problem is typically solved using heuristics that have no optimality guarantees. A linear programming (LP) approach is disclosed to generate an axis-parallel coverage plan that minimizes the number of turns taken by the robot. The LP method solves this problem optimally in polynomial time. Coverage plans are generated for real regions using the LP method.


Find Patent Forward Citations

Ramesh, Megnath. (2026). System and method of minimum turn coverage of arbitrary non-convex regions (U.S. Patent No. 12660975). U.S. Patent and Trademark Office. https://idiyas.com/patent/badge/12660975

Data source: USPTO (United States Patent and Trademark Office) public patent records. Weekly synchronization. How IDiyas builds this profile

Loading…