Method of dividing coverage area for robot and device thereof

Data processing: generic control systems or specific application – Specific application – apparatus or process – Robot control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C700S255000, C700S259000, C340S005710, C382S103000, C701S209000

Reexamination Certificate

active

07933686

ABSTRACT:
A method of dividing a coverage area of a robot and a device for the same. That is, a method of producing a space map for a robot to work and dividing the space map into at least one segment and a device for the same. The method includes producing an occupancy grid map composed of grid points that are probabilistically distributed by sensing a distance from an obstacle, producing a configuration space map by increasing the thickness of an obstacle and a wall in the occupancy grid map on the basis of the radius and size of the robot, and dividing an area by sweeping the area with a band-typed slice in the configuration space map.

REFERENCES:
patent: 6751535 (2004-06-01), Mori
patent: 2005/0159879 (2005-07-01), De Graeve et al.
patent: 2006/0025888 (2006-02-01), Gutmann et al.
patent: 2006/0064202 (2006-03-01), Gutmann et al.
patent: 2007/0156286 (2007-07-01), Yamauchi
patent: 2007/0293985 (2007-12-01), Myeong et al.
patent: 63-265312 (1988-11-01), None
patent: 09-212238 (1997-08-01), None
patent: 10-260724 (1998-09-01), None
patent: 2003-269937 (2003-09-01), None
patent: 2005-032196 (2005-02-01), None
patent: 2005-332204 (2005-12-01), None
patent: 10-2005-0024840 (2005-03-01), None
patent: 10-2006-0014715 (2006-02-01), None
Choset H, Acar E, Rizzi A and Luntz J; “Exact Cellular Decompositions in Terms of Critical Points of Morse Functions”; Proc IEEE ICRA'00, San Francisco Ca 2000.
Huang W; “Optimal Line-sweep-based Decompositions for Coverage Algorithms”; Proc of 2001 IEEE Int. Conf. on Robotics and Automation.
Kwon Y and Lee J; “An Obstacle Avoidance Algorithm for Mobile Robot: The Improved Weighted Safety Vector Field Method”; Intelligent Control 1995, Proc IEEE Int Symp pp. 441-446.
Wise K and Bowyer A; “A Survey of Global Configuration=Space Mapping Techniques for a Single Robot in a Static Environment”; Int Journal of Robotics Research, 2000, pp. 762-779.
Wong S.; “Qualitative Topological Coverage of Unknown Environments by Mobile Robots”, Doctoral Thesis, Dept of Electrical and Computer Eng, Univ. of Auckland, New Zealand, Feb. 2006, pp. 10-34.
Yao Z.; “Finding Efficient Robot Path for the Complete Coverage of a Known Space”,,Proc of 2006 IEEE-IRJ Conf. on Intelligent Robots and Sysstems, Oct. 2006; pp. 3369-3374.
Zhang H-B, Yuan K, Mei S-Q and Zhou-Q-R; “Visual Navigation of an Automated Guided Vehicle Based on Path Recognition”; Proc 3rd Int. Conf. on Machine Learning and Cybernetics, Aug. 2004; pp. 3877-3881.
Hai-bo Zhang, et al., “Visual Navigation of a Mobile Robot Based on Path Recognition”, Jul. 24, 2001.
Chinese Office Action issued Apr. 27, 2010 in corresponding Chinese Patent Application 200710102207.X.
Jung Won Kang et al., “Complete & Time-Efficient Coverage Path Planning for a Mobile Robot in Dynamic Environments”,Proceedings of the 4thInternational Symposium on Mechatronics and its Applications(ISM07),Sharjah, U.A.E., Mar. 26-29, 2007.
Chinese Journal Of Mechanical Engineering, vol. 40, No. 10 dated Oct. 2004 (6 pgs).
Chinese Office Action for corresponding Chinese Patent Application No. 200710102207X dated Nov. 6, 2009 (7 pgs).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method of dividing coverage area for robot and device thereof does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of dividing coverage area for robot and device thereof, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of dividing coverage area for robot and device thereof will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2635179

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.