Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case
暂无分享,去创建一个
[1] Gokarna Sharma,et al. Mutual Visibility with an Optimal Number of Colors , 2015, ALGOSENSORS.
[2] David Peleg,et al. Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges , 2005, IWDC.
[3] Gokarna Sharma,et al. Complete Visibility for Robots with Lights in O(1) Time , 2016, SSS.
[4] Nicola Santoro,et al. Robots with Lights: Overcoming Obstructed Visibility Without Colliding , 2014, SSS.
[5] Giuseppe Prencipe,et al. Autonomous Mobile Robots: A Distributed Computing Perspective , 2013, ALGOSENSORS.
[6] Sruti Gan Chaudhuri,et al. Circle Formation by Asynchronous Fat Robots with Limited Visibility , 2012, ICDCIT.
[7] Gokarna Sharma,et al. Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights , 2020, 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).
[8] Gokarna Sharma,et al. Constant-Time Complete Visibility for Asynchronous Robots with Lights , 2017, SSS.
[9] Maria Gradinariu Potop-Butucaru,et al. Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility , 2010, SSS.
[10] Sruti Gan Chaudhuri,et al. Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement , 2016, WALCOM.
[11] Kaustav Bose,et al. Mutual Visibility by Asynchronous Robots on Infinite Grid , 2018, ALGOSENSORS.