Resilience by Reconfiguration: Exploiting Heterogeneity in Robot Teams
暂无分享,去创建一个
[1] Sheldon Howard Jacobson,et al. The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.
[2] Magnus Jansson,et al. A connectedness constraint for learning sparse graphs , 2017, 2017 25th European Signal Processing Conference (EUSIPCO).
[3] Azwirman Gusrialdi,et al. A Distributed Strategy for Near-Optimal Network Topology Design , 2014 .
[4] David Harel,et al. Drawing graphs nicely using simulated annealing , 1996, TOGS.
[5] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[6] Gaurav S. Sukhatme,et al. Crazyswarm: A large nano-quadcopter swarm , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Vijay Kumar,et al. Formations for Resilient Robot Teams , 2017, IEEE Robotics and Automation Letters.
[9] Dan F. M. Goodman,et al. Graph Drawing by Stochastic Gradient Descent , 2017, IEEE Transactions on Visualization and Computer Graphics.
[10] Shreyas Sundaram,et al. Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.
[11] Helmut Alt,et al. Computational Aspects of Packing Problems , 2016, Bull. EATCS.
[12] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[13] Stephen P. Boyd,et al. Linear Matrix Inequalities in Systems and Control Theory , 1994 .
[14] Magnus Egerstedt,et al. Characterizing heterogeneity in cooperative networks from a resource distribution view-point , 2014, Commun. Inf. Syst..
[15] J. Lofberg,et al. YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).
[16] Gaurav S. Sukhatme,et al. Trajectory Planning for Quadrotor Swarms , 2018, IEEE Transactions on Robotics.
[17] Tim Dwyer,et al. Scalable, Versatile and Simple Constrained Graph Layout , 2009, Comput. Graph. Forum.
[18] Shreyas Sundaram,et al. Robustness of information diffusion algorithms to locally bounded adversaries , 2011, 2012 American Control Conference (ACC).
[19] Shreyas Sundaram,et al. A Notion of Robustness in Complex Networks , 2015, IEEE Transactions on Control of Network Systems.
[20] Ulrik Brandes,et al. Graph Drawing by Classical Multidimensional Scaling: New Perspectives , 2012, GD.
[21] Robert J. Lang,et al. Circle Packing for Origami Design Is Hard , 2010, ArXiv.
[22] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .
[23] Mhand Hifi,et al. A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies , 2009, Adv. Oper. Res..
[24] Gaurav S. Sukhatme,et al. Cooperative multi-robot control for target tracking with onboard sensing 1 , 2015, Int. J. Robotics Res..
[25] E. Yaz. Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.
[26] Alexandre M. Bayen,et al. Optimal network topology design in multi-agent systems for efficient average consensus , 2010, 49th IEEE Conference on Decision and Control (CDC).