Title:
HETEROGENEOUS MULTI-AGENT NETWORKING COOPERATIVE SCHEDULING PLANNING METHOD BASED ON AUTONOMOUS OBSTACLE BYPASSING
Document Type and Number:
WIPO Patent Application WO/2024/016457
Kind Code:
A1
Abstract:
A heterogeneous multi-agent networking cooperative scheduling planning method based on autonomous obstacle bypassing. The method comprises: performing system configuration and transportation task management for multi-agent networking cooperative scheduling planning; performing cooperative path searching on each agent, which is about to execute a transportation task, in a system to obtain a corresponding path list; the agent performing motion planning to obtain an execution path; performing calculation according to the execution path to obtain a traveling speed; the agent performing autonomous obstacle bypassing during an operation process; and adjusting a time window. By using a time window algorithm and introducing the autonomous obstacle bypassing technology of agents, the present invention realizes the cooperative resolution of conflicts between the agents and autonomous obstacle bypassing, is more efficient, flexible and robust, and can involve more agents that can be accommodated in a system.
Inventors:
CHENG XIANG (CN)
LI PENG (CN)
CHEN SHITAO (CN)
WEI PING (CN)
ZHENG NANNING (CN)
LI PENG (CN)
CHEN SHITAO (CN)
WEI PING (CN)
ZHENG NANNING (CN)
Application Number:
PCT/CN2022/119207
Publication Date:
January 25, 2024
Filing Date:
September 16, 2022
Export Citation:
Assignee:
UNIV BEIJING (CN)
UNIV XI AN JIAOTONG (CN)
UNIV XI AN JIAOTONG (CN)
International Classes:
G05D1/02
Foreign References:
| CN115016506A | 2022-09-06 | |||
| CN114625140A | 2022-06-14 | |||
| CN106251016A | 2016-12-21 | |||
| CN113074728A | 2021-07-06 | |||
| CN110174111A | 2019-08-27 | |||
| CN111367294A | 2020-07-03 | |||
| CN107727099A | 2018-02-23 | |||
| JP2009294934A | 2009-12-17 |
Attorney, Agent or Firm:
BEIJING WANXIANGXINYUE INTELLECTUAL PROPERTY OFFICE (CN)
Download PDF: