Wuhan University

Minghao Jiang

Yang Chen

Yanping Tan

Lei Cheng

Wen Long

Huaiyu Wu

The present invention relates to an air-ground heterogeneous robot system path planning method based on a neighborhood constraint. A smallest heterogeneous robot system is formed by a ground mobile robot and an air flying robot. The steps of the method include the ground mobile robot and the air flying robot start from a start point at the same time, successively access N sub-task points for executing sub-tasks and finally reach a destination together. In the present invention, it is considered that the position of each sub-task point is allowed to be effective in a certain neighborhood, and a neighborhood constraint is introduced. In addition, the maximum speed constraints are considered respectively for the air flying robot and the ground mobile robot. In the present invention, the air-ground heterogeneous robot system is enabled to fully utilize respective characteristics to realize advantage complementation, tasks are completed within a specific neighborhood range, the efficiency of path planning is improved, resources are saved, and the air-ground heterogeneous robot system path planning method is applicable to the fields such as marine cooperative rapid rescue, target identification and communication networking, cooperative environment sensing and positioning, so that the method has a wide application prospect.

Growing community of inventors

Hubei, China

Minghao Jiang