A Decentralized Asynchronous Collaborative Genetic Algorithm for Heterogeneous Multi-agent Search and Rescue Problems
In this paper we propose a version of the Genetic Algorithm (GA) for combined task assignment and path planning that is highly decentralized in the sense that each agent only knows its own capabilities and data, and a set of so-called handover values communicated to it from the other agents over an...
Uloženo v:
| Vydáno v: | IEEE International Symposium on Safety, Security and Rescue Robotics s. 1 - 8 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
25.10.2021
|
| Témata: | |
| ISSN: | 2475-8426 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we propose a version of the Genetic Algorithm (GA) for combined task assignment and path planning that is highly decentralized in the sense that each agent only knows its own capabilities and data, and a set of so-called handover values communicated to it from the other agents over an unreliable low bandwidth communication channel. These handover values are used in combination with a local GA involving no other agents, to decide what tasks to execute, and what tasks to leave to others. We compare the performance of our approach to a centralized version of GA, and a partly decentralized version of GA where computations are local, but all agents need complete information regarding all other agents, including position, range, battery, and local obstacle maps. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. We compare the performance of our approach to a centralized version of GA, and a partly decentralized version of GA where computations are local, but all agents need complete information regarding all other agents, including position, range, battery, and local obstacle maps. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. |
|---|---|
| AbstractList | In this paper we propose a version of the Genetic Algorithm (GA) for combined task assignment and path planning that is highly decentralized in the sense that each agent only knows its own capabilities and data, and a set of so-called handover values communicated to it from the other agents over an unreliable low bandwidth communication channel. These handover values are used in combination with a local GA involving no other agents, to decide what tasks to execute, and what tasks to leave to others. We compare the performance of our approach to a centralized version of GA, and a partly decentralized version of GA where computations are local, but all agents need complete information regarding all other agents, including position, range, battery, and local obstacle maps. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. We compare the performance of our approach to a centralized version of GA, and a partly decentralized version of GA where computations are local, but all agents need complete information regarding all other agents, including position, range, battery, and local obstacle maps. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. We compare solution performance as well as messages sent for the three algorithms, and conclude that the proposed algorithms has a small decrease in performance, but a significant decrease in required communication. |
| Author | Pallin, Martin Rashid, Jayedur Ogren, Petter |
| Author_xml | – sequence: 1 givenname: Martin surname: Pallin fullname: Pallin, Martin email: martin.pallin@saabgroup.com organization: KTH - Royal Institute of Technology,Saab division of Command and Control systems,Stockhlm,Sweden – sequence: 2 givenname: Jayedur surname: Rashid fullname: Rashid, Jayedur email: jayedur.rashid@saabgroup.com organization: KTH - Royal Institute of Technology,Saab division of Command and Control systems,Stockhlm,Sweden – sequence: 3 givenname: Petter surname: Ogren fullname: Ogren, Petter organization: KTH - Royal Institute of Technology,Division of Robotics, Perception and Learning,Stockhlm,Sweden |
| BookMark | eNotUF9LwzAcjKLgnPsEguQLdOZ_m8cydRMmSrf3kaa_bpEukTQV5qe34p6Ou-MO7m7RlQ8eEHqgZE4p0Y-bTVVJzgmZM8LoXEudF1JdoNmIVCkpaK5EcYkmTOQyKwRTN2jW95-EEEYIpUJN0FDiJ7DgUzSd-4EGl_3J20MMPgw9XoSuM3WIJrlvwEvwkJzFZbcP0aXDEbch4hUkiGE_en-Jt6FLLjMjTXgDJtoDNr7BFfR2APwRQ93Bsb9D163pepidcYq2L8_bxSpbvy9fF-U6c0zQlIGiZtwHRNa0LYBD04rWSK00l7qw2kpSFxZ0TpvxECYF1y0nLWWjILXmU3T_X-sAYPcV3dHE0-78E_8FTtpgLg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SSRR53300.2021.9597856 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781665417648 1665417641 |
| EISSN | 2475-8426 |
| EndPage | 8 |
| ExternalDocumentID | 9597856 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Knut and Alice Wallenberg Foundation funderid: 10.13039/501100004063 |
| GroupedDBID | 6IE 6IF 6IL 6IN AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i241t-e61a330e05b1f8e3edf4fa59693598c9c50b8ce971d11025439f30f1271d5993 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000853883500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:27:05 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i241t-e61a330e05b1f8e3edf4fa59693598c9c50b8ce971d11025439f30f1271d5993 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_9597856 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-Oct.-25 |
| PublicationDateYYYYMMDD | 2021-10-25 |
| PublicationDate_xml | – month: 10 year: 2021 text: 2021-Oct.-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE International Symposium on Safety, Security and Rescue Robotics |
| PublicationTitleAbbrev | SSRR |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0002001146 |
| Score | 1.8227986 |
| Snippet | In this paper we propose a version of the Genetic Algorithm (GA) for combined task assignment and path planning that is highly decentralized in the sense that... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Batteries Communication channels Handover Path planning Safety Search problems Security |
| Title | A Decentralized Asynchronous Collaborative Genetic Algorithm for Heterogeneous Multi-agent Search and Rescue Problems |
| URI | https://ieeexplore.ieee.org/document/9597856 |
| WOSCitedRecordID | wos000853883500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3Pa8IwFMeDyg7bZT907Dc57Lho0zZpcxQ38TBE1IM3SdOXTdjaYVth--uXxKIb7LJbCYSW9wLvvfT7eQ-he54ymnKIidbMI6EIJBFSR4QnCU_jIPCpdKDwczQex4uFmDTQw46FAQAnPoOufXT_8tNcVfaqrCdM9hsz3kTNKOJbVmt3n-I7LJTXEDD1RG82m06tdtIzVaBPu_XmX1NUXBAZHv_v9Seos6fx8GQXZ05RA7IzdPSjkWAbVX38CLXOcvUFKe4Xn5myfW9NYY8He19vANtG0-a04P7bS75ela_v2OSteGRlMbk5TWB3OCyXSItd4a0gGcssxVMoVOU-xg6hKTpoPnyaD0akHqhAViZQlwQ4lcYg4LGE6hgCSHWoJRPc4rmxEop5SaxARDQ1FrSYvNCBp6lvFphJZM5RK8szuEAYBPBQBqauFiahCiPbJS8JeCK4SsBT7BK1rf2WH9uWGcvadFd_L1-jQ-siGxJ8doNa5bqCW3SgNuWqWN85P38DLmSquQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3fS8MwEMfDnIL64o9N_G0efLRb0zZp8zimY-IcY9vD3kaaXrSgraztQP96k65sCr74VgKBcBe4u_Q-30PolkWURAwCSylqWx53hcWF8i0WhiwKXNchogSFB_5wGMxmfFRDd2sWBgDK5jNomc_yX36UysI8lbW5zn4DyrbQNvU8x17RWusXFacEQ1mFARObtyeT8dh0T9q6DnRIq9r-a45KGUZ6B_87wCFqbng8PFpHmiNUg-QY7f-QEmygooPvoeq0jL8gwp3sM5FG-VaX9ri78fYSsJGa1vcFd95e0kWcv75jnbnivmmMSfV9ArOjBHMtYcArvGpJxiKJ8BgyWZSHMWNosiaa9h6m3b5VjVSwYh2qcwsYEdogYNOQqABciJSnBOXMALqB5JLaYSCB-yTSFjSgPFeurYijF6hOZU5QPUkTOEUYODBPuLqy5jql8nyjkxe6LORMhmBLeoYaxn7zj5Voxrwy3fnfyzdotz99HswHj8OnC7Rn3GUChEMvUT1fFHCFduQyj7PFdenzbzu1rgA |
| 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%3Abook&rft.genre=proceeding&rft.title=IEEE+International+Symposium+on+Safety%2C+Security+and+Rescue+Robotics&rft.atitle=A+Decentralized+Asynchronous+Collaborative+Genetic+Algorithm+for+Heterogeneous+Multi-agent+Search+and+Rescue+Problems&rft.au=Pallin%2C+Martin&rft.au=Rashid%2C+Jayedur&rft.au=Ogren%2C+Petter&rft.date=2021-10-25&rft.pub=IEEE&rft.eissn=2475-8426&rft.spage=1&rft.epage=8&rft_id=info:doi/10.1109%2FSSRR53300.2021.9597856&rft.externalDocID=9597856 |