{"id":165771,"date":"2023-06-14T16:27:13","date_gmt":"2023-06-14T21:27:13","guid":{"rendered":"https:\/\/lifeboat.com\/blog\/2023\/06\/mean-shift-exploration-in-shape-assembly-of-robot-swarms-communications"},"modified":"2023-06-14T16:27:13","modified_gmt":"2023-06-14T21:27:13","slug":"mean-shift-exploration-in-shape-assembly-of-robot-swarms-communications","status":"publish","type":"post","link":"https:\/\/lifeboat.com\/blog\/2023\/06\/mean-shift-exploration-in-shape-assembly-of-robot-swarms-communications","title":{"rendered":"Mean-shift exploration in shape assembly of robot swarms Communications"},"content":{"rendered":"

<\/a><\/p>\n

The fascinating collective behaviors of biological systems have inspired extensive studies on shape assembly of robot swarms6<\/a>,7<\/a>,8<\/a>,9<\/a><\/sup>. One class of strategies widely studied in the literature are based on goal assignment in either centralized or distributed ways10<\/a>,11<\/a>,12<\/a><\/sup>. Once a swarm of robots are assigned unique goal locations in a desired shape, the consequent task is simply to plan collision-free trajectories for the robots to reach their goal locations10<\/a><\/sup> or conduct distributed formation control based on locally sensed information6<\/a>,13<\/a>,14<\/a><\/sup>. It is notable that centralized goal assignment is inefficient to support large-scale swarms since the computational complexity increases rapidly as the number of robots increases15<\/a>,16<\/a><\/sup>. Moreover, when robots fail to function normally, additional algorithms for fault-tolerant detection and goal re-assignment are required to handle such situations17<\/a><\/sup>. As a comparison, distributed goal assignment can support large-scale swarms by decomposing the centralized assignment into multiple local ones11<\/a>,12<\/a><\/sup>. It also exhibits better robustness to robot faults. However, since distributed goal assignments are based on locally sensed information, conflicts among local assignments are inevitable and must be resolved by sophisticated algorithms such as local task swapping11<\/a>,12<\/a><\/sup>.<\/p>\n

Another class of strategies for shape assembly that have also attracted extensive research attention are free of goal assignment18<\/a>,19<\/a>,20<\/a>,21<\/a><\/sup>. For instance, the method proposed in ref. 18<\/a><\/sup> can assemble complex shapes using thousands of homogeneous robots. An interesting feature of this method is that it does not rely on external global positioning systems. Instead, it establishes a local positioning system based on a small number of pre-localized seed robots. As a consequence of the local positioning system, the proposed edge-following control method requires that only the robots on the edge of a swarm can move while those inside must stay stationary. The method in ref. 19<\/a><\/sup> can generate swarm shapes spontaneously from a reaction-diffusion network similar to embryogenesis in nature. However, this method is not able to generate user-specified shapes precisely. The method in ref. 21<\/a><\/sup> can aggregate robots on the frontier of shapes based on saliency detection. The user-defined shape is specified by a digital light projector. An interesting feature of this method is that it does not require centralized edge detectors. Instead, edge detection is realized in a distributed manner by fusing the beliefs of a robot with its neighbors. However, since the robots cannot self-localize themselves relative to the desired shape, they make use of random walks to search for the edges, which would lead to random trajectories. Another class of methods that do not require goal assignment is based on artificial potential fields22<\/a>,23<\/a>,24<\/a>,25<\/a><\/sup>. One limitation of this class of methods is that robots may easily get trapped in local minima, making it difficult to assemble nonconvex complex shapes.<\/p>\n

Here, we propose a strategy for shape assembly of robot swarms based on the idea of mean-shift exploration: when a robot is surrounded by neighboring robots and unoccupied locations, it would actively give up its current location by exploring the highest density of nearby unoccupied locations in the desired shape. This idea does not rely on goal assignment. It is realized by adapting the mean-shift algorithm26<\/a>,27<\/a>,28<\/a><\/sup>, which is an optimization technique widely used in machine learning for locating the maxima of a density function. Moreover, a distributed negotiation mechanism is designed to allow robots to negotiate the final desired shape with their neighbors in a distributed manner. This negotiation mechanism enables the swarm to maneuver while maintaining a desired shape based on a small number of informed robots. The proposed strategy empowers robot swarms to assemble nonconvex complex shapes with strong adaptability and high efficiency, as verified by numerical simulation results and real-world experiments with swarms of 50 ground robots. The strategy can be adapted to generate interesting behaviors including shape regeneration, cooperative cargo transportation, and complex environment exploration.<\/p>\n","protected":false},"excerpt":{"rendered":"

The fascinating collective behaviors of biological systems have inspired extensive studies on shape assembly of robot swarms6,7,8,9. One class of strategies widely studied in the literature are based on goal assignment in either centralized or distributed ways10,11,12. Once a swarm of robots are assigned unique goal locations in a desired shape, the consequent task is [\u2026]<\/p>\n","protected":false},"author":662,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,41,6,1491],"tags":[],"class_list":["post-165771","post","type-post","status-publish","format-standard","hentry","category-biological","category-information-science","category-robotics-ai","category-transportation"],"_links":{"self":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/165771","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/users\/662"}],"replies":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/comments?post=165771"}],"version-history":[{"count":0,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/165771\/revisions"}],"wp:attachment":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/media?parent=165771"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/categories?post=165771"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/tags?post=165771"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}