By Topic

Generalization of Linear Cyclic Pursuit With Application to Rendezvous of Multiple Autonomous Agents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sinha, A. ; Dept. of Aerosp. Eng., Indian Inst. of Sci., Bangalore ; Ghose, D.

Cyclic pursuit is a simple distributed control law in which agent i pursues agent i+1 modulo n. We generalize existing results and show that by selecting the gains of the agents, the point of convergence of these agents can be controlled. The condition for convergence, the range of controller gains and the reachable set where convergence can occur are studied. It is also shown that the sequence in which an agent pursues another does not affect the point of convergence

Published in:

Automatic Control, IEEE Transactions on  (Volume:51 ,  Issue: 11 )