http://www.cds.caltech.edu/~murray/wiki/index.php?title=Cone_invariance_and_rendezvous_of_multiple_agents&feed=atom&action=historyCone invariance and rendezvous of multiple agents - Revision history2019-11-13T21:12:53ZRevision history for this page on the wikiMediaWiki 1.23.12http://www.cds.caltech.edu/~murray/wiki/index.php?title=Cone_invariance_and_rendezvous_of_multiple_agents&diff=19779&oldid=prevMurray: htdb2wiki: creating page for 2009s_bftm09-jae.html2016-05-15T06:16:25Z<p>htdb2wiki: creating page for 2009s_bftm09-jae.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = R Bhattacharya, A Tiwari, J Fung, R Murray<br />
| title = Cone invariance and rendezvous of multiple agents<br />
| source = Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, 223(6):779-789<br />
| year = 2009<br />
| type = Published version<br />
| funding = <br />
| url = http://journals.pepublishing.com/index/y04282511wr7wl3v.pdf<br />
| abstract = In this article is presented a dynamical systems framework for analysing multi-agent rendezvous problems and characterize the dynamical behaviour of the collective system. Recently, the problem of rendezvous has been addressed considerably in the graph theoretic framework, which is strongly based on the communication aspects of the problem. The proposed approach is based on the set invariance theory and focusses on how to generate feedback between the vehicles, a key part of the rendezvous problem. The rendezvous problem is defined on the positions of the agents and the dynamics is modelled as linear first-order systems. These algorithms have also been applied to non-linear first-order systems.<br />
<br />
The rendezvous problem in the framework of cooperative and competitive dynamical systems is analysed that has had some remarkable applications to biological sciences. Cooperative and competitive dynamical systems are shown to generate monotone flows by the classical Muller--Kamke theorem, which is analysed using the set invariance theory. In this article, equivalence between the rendezvous problem and invariance of an appropriately defined cone is established. The problem of rendezvous is cast as a stabilization problem, with a the set of constraints on the trajectories of the agents defined on the phase plane. The n-agent rendezvous problem is formulated as an ellipsoidal cone invariance problem in the n-dimensional phase space. Theoretical results based on set invariance theory and monotone dynamical systems are developed. The necessary and sufficient conditions for rendezvous of linear systems are presented in the form of linear matrix inequalities. These conditions are also interpreted in the Lyapunov framework using multiple Lyapunov functions. Numerical examples that demonstrate application are also presented.<br />
| flags = <br />
| tag = bftm09-jae<br />
| id = 2009s<br />
}}</div>Murray