This paper proposes a decentralized approach for solving the problem of moving a swarm of agents into a desired formation. We propose a decentralized assignment algorithm which prescribes goals to each agent using only local information. The assignment results are then used to generate energy-optimal trajectories for each agent which have guaranteed collision avoidance through safety constraints. We present the conditions for optimality and discuss the robustness of the solution. The efficacy of the proposed approach is validated through a numerical case study to characterize the framework's performance on a set of dynamic goals.
Additional approaches using only scalar bearing or distance measurements was presented by @cite_1 . This approach was generalized to include the case where only a single leader agent was able to make distance or bearing measurements.
@cite_1
1997488333
Complex systems are characterized by many independent components whose low-level actions produce collective high-level results. Predicting high-level results given low-level rules is a key open challenge; the inverse problem, finding low-level rules that give specific outcomes, is in general still less understood. We present a multi-agent construction system inspired by mound-building termites, solving such an inverse problem. A user specifies a desired structure, and the system automatically generates low-level rules for independent climbing robots that guarantee production of that structure. Robots use only local sensing and coordinate their activity via the shared environment. We demonstrate the approach via a physical realization with three autonomous climbing robots limited to onboard sensing. This work advances the aim of engineering complex systems that achieve specific human-designed goals.