Multi-agent cluster obstacle avoidance method based on rolling fast expansion random tree algorithm
The invention discloses a multi-agent cluster obstacle avoidance method based on a rolling fast expansion random tree algorithm, and belongs to the technical field of path planning of agents. The method comprises the steps that initial information is determined according to a task execution scene, a...
Saved in:
Main Authors | , , , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
09.04.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The invention discloses a multi-agent cluster obstacle avoidance method based on a rolling fast expansion random tree algorithm, and belongs to the technical field of path planning of agents. The method comprises the steps that initial information is determined according to a task execution scene, a heuristic sampling method is adopted to guide an expansion tree to expand in the direction of a target point, and cluster distance constraints are added to enable a planned path to meet cluster and obstacle avoidance requirements; enabling the obtained path to meet the dynamics requirement of the intelligent agent through path smoothing processing; and through continuous forward pushing of the rolling window, the intelligent agent cluster reaches a target point area. According to the method, an RRT algorithm is improved, a rolling window, a heuristic search strategy and extension tree node distance constraints are introduced, multi-agent cluster obstacle avoidance flight in a complex unknown scene is realized, and |
---|---|
AbstractList | The invention discloses a multi-agent cluster obstacle avoidance method based on a rolling fast expansion random tree algorithm, and belongs to the technical field of path planning of agents. The method comprises the steps that initial information is determined according to a task execution scene, a heuristic sampling method is adopted to guide an expansion tree to expand in the direction of a target point, and cluster distance constraints are added to enable a planned path to meet cluster and obstacle avoidance requirements; enabling the obtained path to meet the dynamics requirement of the intelligent agent through path smoothing processing; and through continuous forward pushing of the rolling window, the intelligent agent cluster reaches a target point area. According to the method, an RRT algorithm is improved, a rolling window, a heuristic search strategy and extension tree node distance constraints are introduced, multi-agent cluster obstacle avoidance flight in a complex unknown scene is realized, and |
Author | XIONG HUAJIE YI QINGWU GAO DAWEI HE CHENGLONG YU BAOGUO WANG QING |
Author_xml | – fullname: XIONG HUAJIE – fullname: YU BAOGUO – fullname: GAO DAWEI – fullname: YI QINGWU – fullname: HE CHENGLONG – fullname: WANG QING |
BookMark | eNqNi0sKwjAQQLPQhb87jAcoWPzUrRTFja7cl2kybQPpTEmm4vFV8ACuHjzem5sJC9PM2NsY1GfYEivYMCalCFInRRsI8CneIVuCnrQTBzUmciAMUULw3EKDSYFeA3LyX43spAeN9JlDK9Fr1y_NtMGQaPXjwqwv50d5zWiQitKAlpi0Ku95Xhz3m11xOG3_ad4dpUCl |
ContentType | Patent |
DBID | EVB |
DatabaseName | esp@cenet |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: EVB name: esp@cenet url: http://worldwide.espacenet.com/singleLineSearch?locale=en_EP sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Medicine Chemistry Sciences Physics |
DocumentTitleAlternate | 基于滚动快速扩展随机树算法的多智能体集群避障方法 |
ExternalDocumentID | CN117850476A |
GroupedDBID | EVB |
ID | FETCH-epo_espacenet_CN117850476A3 |
IEDL.DBID | EVB |
IngestDate | Fri Jul 19 12:47:24 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | Chinese English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-epo_espacenet_CN117850476A3 |
Notes | Application Number: CN202410027404 |
OpenAccessLink | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240409&DB=EPODOC&CC=CN&NR=117850476A |
ParticipantIDs | epo_espacenet_CN117850476A |
PublicationCentury | 2000 |
PublicationDate | 20240409 |
PublicationDateYYYYMMDD | 2024-04-09 |
PublicationDate_xml | – month: 04 year: 2024 text: 20240409 day: 09 |
PublicationDecade | 2020 |
PublicationYear | 2024 |
RelatedCompanies | THE 54TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORPORATION |
RelatedCompanies_xml | – name: THE 54TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORPORATION |
Score | 3.6672487 |
Snippet | The invention discloses a multi-agent cluster obstacle avoidance method based on a rolling fast expansion random tree algorithm, and belongs to the technical... |
SourceID | epo |
SourceType | Open Access Repository |
SubjectTerms | CONTROLLING PHYSICS REGULATING SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES |
Title | Multi-agent cluster obstacle avoidance method based on rolling fast expansion random tree algorithm |
URI | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240409&DB=EPODOC&locale=&CC=CN&NR=117850476A |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT8IwEL8gfr4pahQ_UhOzt0Vkc2wPi5EOQkwYxKDhjbTdJhhYCRtq_Ou9FhBf9PWaNNu1199de787gGtmsZrNuWc6HncUJadiui5PTEswh3uuhU624ju3Q6f1bD_27_oFeFtxYXSd0A9dHBEtSqC95_q8nq4vsQKdW5nd8BGK5H2z5wfGMjpGeMJ4xQjqfqPbCTrUoNSnoRE--beqC33FrjkPG7CJbnRNB20vdcVKmf6GlOY-bHVxtjQ_gMLXsAS7dNV5rQQ77eWDdwm2dYamyFC4tMLsEIRmzZpMsaKIGM9VrQMiOfp5uAcIe5ejSK0lWXSHJgqoIiJTMlsU4CYJy3ISf-I5oK7KCKJVJCdEPU8TNn6Vs1E-nBzBVbPRoy0Tv3vwo6QBDde_aB1DMZVpfALE4aoxvMerSVXYEYsxvBIR-iTCjTmK3VMo_z1P-b_BM9hTCtdZLN45FPPZPL5AgM75pdbsN7ohlv0 |
link.rule.ids | 230,309,783,888,25577,76883 |
linkProvider | European Patent Office |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT8IwEL8gfuCbokbxqyZmb4vI5tgeFiMbBBUGMWh4I203BAMrYUONf73XAuKLvl6TZrv2-rtr73cHcEkNWjYZc3TLYZak5BR122Z93eDUYo5toJMt-c7NwKo_mw_dm24G3pZcGFUn9EMVR0SL4mjvqTqvJ6tLLF_lViZXbIgicVvruL62iI4RnjBe0fyKW223_JaneZ7rBVrw5F7LLvRFs2zdrcE6uti2CpVeKpKVMvkNKbUd2GjjbHG6C5mvQR5y3rLzWh62mosH7zxsqgxNnqBwYYXJHnDFmtWpZEURPprJWgdEMPTzcA8Q-i6GoVxLMu8OTSRQhUTEZDovwE36NElJ9InngLwqI4hWoRgT-TxN6OhVTIfpYLwPF7Vqx6vr-N29HyX1vGD1i8YBZGMRR4dALCYbwzus1C9xM6QRhlc8RJ-E2xFDsX0Ehb_nKfw3eA65eqfZ6DXug8dj2JbKVxktzglk0-ksOkWwTtmZ0vI395yZ7Q |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&rft.title=Multi-agent+cluster+obstacle+avoidance+method+based+on+rolling+fast+expansion+random+tree+algorithm&rft.inventor=XIONG+HUAJIE&rft.inventor=YU+BAOGUO&rft.inventor=GAO+DAWEI&rft.inventor=YI+QINGWU&rft.inventor=HE+CHENGLONG&rft.inventor=WANG+QING&rft.date=2024-04-09&rft.externalDBID=A&rft.externalDocID=CN117850476A |