Author:
Castenow Jannik,Kling Peter,Knollmann Till,Meyer auf der Heide Friedhelm
Publisher
Springer International Publishing
Reference23 articles.
1. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Rob. Autom. 15(5), 818–828 (1999)
2. Barrière, L., Flocchini, P., Barrameda, E.M., Santoro, N.: Uniform scattering of autonomous mobile robots in a grid. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, 23–29 May 2009, pp. 1–8. IEEE (2009)
3. Castenow, J., Kling, P., Knollmann, T., Meyer auf der Heide, F.: A Discrete and Continuous Study of the Max-Chain-Formation Problem. CoRR abs/2010.02043 (2020). https://arxiv.org/abs/2010.02043
4. Castenow, J., Kling, P., Knollmann, T., Meyer auf der Heide, F.: A discrete and continuous study of the max-chain-formation problem: slow down to speed up. In: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2020, USA, 15–17 July 2020, pp. 515–517. ACM (2020)
5. Cohen, R., Peleg, D.: Local algorithms for autonomous robot systems. In: Flocchini, P., Gasieniec, L. (eds.) SIROCCO, vol. 4056, pp. 29–43. Springer, Heidelberg (2006). https://doi.org/10.1007/11780823_4
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Max-Line-Formation Problem;Lecture Notes in Computer Science;2021