Bounded Connectivity‐Preserving Leader‐Follower Flocking Algorithms Without Acceleration Measurements

Publisher： John Wiley & Sons Inc

E-ISSN： 1934-6093|17|1|304-314

ISSN： 1561-8625

Source： ASIAN JOURNAL OF CONTROL, Vol.17, Iss.1, 2015-01, pp. : 304-314

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Leader–Follower Dynamic Game of New Product Diffusion

By Breton M.   Chauny F.   Zaccour G.  

Journal of Optimization Theory and Applications, Vol. 92, Iss. 1, 1997-01 ,pp. : 77-98

Springer Publishing Company

Access to resources Recommend Favorite

Solving multi-leader-common-follower games

By Leyffer Sven   Munson Todd  

Optimization Methods and Software, Vol. 25, Iss. 4, 2010-08 ,pp. : 601-623

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for Leader Election by Cellular Automata

By Nichitiu C.   Mazoyer J.   Remila E.  

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 302-329

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for Network Design Problems on Bounded Subsets

By Hochbaum D.S.   Naor J.S.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 403-414

Academic Press

Access to resources Recommend Favorite

Efficient algorithms for learning functions with bounded variation

By Long P.M.  

Information and Computation, Vol. 188, Iss. 1, 2004-01 ,pp. : 99-115

Elsevier

Access to resources Recommend Favorite