Abstract
In this paper, we develop a strategy for arranging a team of agents in orbits of arbitrary shape that pass through a common point that may move. In particular, the shapes are defined by star-shaped sets. The solution is based on its transformation into the traditional circular formation problem and subsequent reconversion. Given the large number of solutions to such a problem, the developed algorithm is well suited as a plug & play command generator to extend these solutions to the promising field of aerial robotic swarms. Two examples of such an application show its ease of implementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.