Add like
Add dislike
Add to saved papers

Automatic Leader-Follower Persistent Formation Generation With Minimum Agent-Movement in Various Switching Topologies.

This paper presents the generation strategy, motion planning, and switching topologies of a distance-based leader-follower relation-invariable persistent formation (RIPF) of multiagent systems (MASs). An efficient algorithm is designed to find out if a persistent formation can be generated from a rigid graph. Derived from the properties of a rigid graph, the algorithm to generate RIPF from any initial location is presented. In order to generate different RIPFs in the switching topology, state and transition matrices are introduced. To achieve the minimum agent-movement among RIPFs, a downward-tree combinatorial optimization algorithm is presented. In the end, with the selected minimum agent-movement RIPF, a control law is designed to drive initial RIPF to desired RIPF with given distances among agents. Simulation results show the proposed generation method, control law, and downward-tree are effective to realize the desired formation.

Full text links

We have located links that may give you full text access.
Can't access the paper?
Try logging in through your university/institutional subscription. For a smoother one-click institutional access experience, please use our mobile app.

For the best experience, use the Read mobile app

Mobile app image

Get seemless 1-tap access through your institution/university

For the best experience, use the Read mobile app

All material on this website is protected by copyright, Copyright © 1994-2024 by WebMD LLC.
This website also contains material copyrighted by 3rd parties.

By using this service, you agree to our terms of use and privacy policy.

Your Privacy Choices Toggle icon

You can now claim free CME credits for this literature searchClaim now

Get seemless 1-tap access through your institution/university

For the best experience, use the Read mobile app