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:
Jul. 14, 2026

Filed:

Jan. 17, 2025
Applicants:

Zhejiang University of Science & Technology, Hangzhou City, CN;

Zhejiang University, Hangzhou City, CN;

Inventors:

Yun Zhao, Hangzhou City, CN;

Fubo Li, Hangzhou City, CN;

Xing Xu, Hangzhou City, CN;

Yong He, Hangzhou City, CN;

Bingquan Chu, Hangzhou City, CN;

Na Wu, Hangzhou City, CN;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G01C 21/00 (2006.01); G01C 21/20 (2006.01); G01N 33/02 (2006.01); G05D 1/246 (2024.01); G05D 1/622 (2024.01); G05D 105/80 (2024.01); G05D 107/20 (2024.01);
U.S. Cl.
CPC ...
G05D 1/246 (2024.01); G01C 21/20 (2013.01); G01N 33/025 (2013.01); G05D 1/622 (2024.01); G05D 2105/80 (2024.01); G05D 2107/21 (2024.01);
Abstract

Provided are a path planning method and apparatus for a tomato inspection robot. The method includes updating a weight of a heuristic function under a previous iteration ordinal number based on a cost of a positive node under a current iteration ordinal number. A positive heuristic function value set and a negative heuristic function value set are calculated. A positive node and a negative node under a next iteration ordinal number is determined. If there is no obstacle on a direct connection path between the positive node and the negative node under the next iteration ordinal number, backward tracing is performed from the positive node under the next iteration ordinal number to a start point and from the negative node under the next iteration ordinal number to an end point to obtain a planned path. If there is an obstacle, a next iteration is entered.


Find Patent Forward Citations

Loading…