Pith. sign in

REVIEW

Formation control with binary information

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1304.4893 v2 pith:YVDJ5T2H submitted 2013-04-17 cs.SY cs.SY

Formation control with binary information

classification cs.SY cs.SY
keywords informationcoarsecontrolformationveryagentskeepingother
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we study the problem of formation keeping of a network of strictly passive systems when very coarse information is exchanged. We assume that neighboring agents only know whether their relative position is larger or smaller than the prescribed one. This assumption results in very simple control laws that direct the agents closer or away from each other and take values in finite sets. We show that the task of formation keeping while tracking a desired trajectory and rejecting matched disturbances is still achievable under the very coarse information scenario. In contrast with other results of practical convergence with coarse or quantized information, here the control task is achieved exactly.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.