메뉴 건너뛰기




Volumn , Issue , 2002, Pages 97-104

Circle Formation for Oblivious Anonymous Mobile Robots with no Common Sense of Orientation

Author keywords

Anonymous computations; Circle formation; Computational geometry; Cooperative mobile robotics; Distributed algorithms; Geometric pattern formation; Oblivious computations; Self stabilization

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; MOBILE ROBOTS; PARALLEL PROCESSING SYSTEMS;

EID: 0141761236     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584490.584509     Document Type: Conference Paper
Times cited : (120)

References (16)
  • 1
    • 0033338881 scopus 로고    scopus 로고
    • Distributed memoryless point convergence algorithm for mobile robots with limited visibility
    • Oct.
    • H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. on Robotics and Automation, 15(5):818-828, Oct. 1999.
    • (1999) IEEE Trans. on Robotics and Automation , vol.15 , Issue.5 , pp. 818-828
    • Ando, H.1    Oasa, Y.2    Suzuki, I.3    Yamashita, M.4
  • 2
    • 84976826673 scopus 로고
    • Voronoi diagrams-A survey of a fundamental geometric data structure
    • Sept.
    • F. Aurenhammer. Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, Sept. 1991.
    • (1991) ACM Comput. Surv. , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1
  • 3
    • 0141863362 scopus 로고    scopus 로고
    • On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks
    • Newport, RI, USA, Aug.
    • I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks. In Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01), pages 1-19, Newport, RI, USA, Aug. 2001.
    • (2001) Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01) , pp. 1-19
    • Chatzigiannakis, I.1    Nikoletseas, S.2    Spirakis, P.3
  • 4
    • 0141751797 scopus 로고
    • Remark about self-stabilizing systems
    • Feb. Technical correspondence
    • X. A. Debest. Remark about self-stabilizing systems. Commun. ACM, 38(2):115-117, Feb. 1995. Technical correspondence.
    • (1995) Commun. ACM , vol.38 , Issue.2 , pp. 115-117
    • Debest, X.A.1
  • 5
    • 0141528699 scopus 로고    scopus 로고
    • Distributed computing on the move: From mobile computing to cooperative robotics and nanorobotics (a position paper)
    • Newport, RI, USA, Aug.
    • X. Défago. Distributed computing on the move: From mobile computing to cooperative robotics and nanorobotics (a position paper). In Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01), pages 49-55, Newport, RI, USA, Aug. 2001.
    • (2001) Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01) , pp. 49-55
    • Défago, X.1
  • 6
    • 0003167391 scopus 로고    scopus 로고
    • A free market architecture for distributed control of a multirobot system
    • Venice, Italy, July
    • M. B. Dias and A. Stentz. A free market architecture for distributed control of a multirobot system. In Proc. 6th Int'l Conf. on Intelligent Autonomous Systems (IAS-6), pages 115-122, Venice, Italy, July 2000.
    • (2000) Proc. 6th Int'l Conf. on Intelligent Autonomous Systems (IAS-6) , pp. 115-122
    • Dias, M.B.1    Stentz, A.2
  • 8
    • 84958058191 scopus 로고    scopus 로고
    • Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots
    • In Proc. 10th Int'l Symp. on Algorithms and Computation (ISAAC'99) Chennai, India, Dec. Springer
    • P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. In Proc. 10th Int'l Symp. on Algorithms and Computation (ISAAC'99), volume 1741 of LNCS, pages 93-102, Chennai, India, Dec. 1999. Springer.
    • (1999) LNCS , vol.1741 , pp. 93-102
    • Flocchini, P.1    Prencipe, G.2    Santoro, N.3    Widmayer, P.4
  • 9
    • 84957081333 scopus 로고    scopus 로고
    • Gathering of asynchronous oblivious robots with limited visibility
    • In Proc. 18th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2001), Dresden, Germany, Feb. Springer
    • P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of asynchronous oblivious robots with limited visibility. In Proc. 18th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2001), volume 2010 of LNCS, pages 247-258, Dresden, Germany, Feb. 2001. Springer.
    • (2001) LNCS , vol.2010 , pp. 247-258
    • Flocchini, P.1    Prencipe, G.2    Santoro, N.3    Widmayer, P.4
  • 10
    • 0141863365 scopus 로고    scopus 로고
    • Flocking by a set of autonomous mobile robots
    • Dipartimento di Informatica, Università di Pisa, Italy, Oct.
    • V. Gervasi and G. Prencipe. Flocking by a set of autonomous mobile robots. Technical Report TR-01-24, Dipartimento di Informatica, Università di Pisa, Italy, Oct. 2001.
    • (2001) Technical Report , vol.TR-01-24
    • Gervasi, V.1    Prencipe, G.2
  • 11
    • 0034738990 scopus 로고    scopus 로고
    • Ant-like task allocation and recruitment in cooperative robots
    • Aug.
    • M. J. B. Krieger, J.-B. Billeter, and L. Keller. Ant-like task allocation and recruitment in cooperative robots. Nature, 406(6799):992-995, Aug. 2000.
    • (2000) Nature , vol.406 , Issue.6799 , pp. 992-995
    • Krieger, M.J.B.1    Billeter, J.-B.2    Keller, L.3
  • 12
    • 0026103114 scopus 로고
    • A simple algorithm for computing the smallest enclosing circle
    • S. Skyum. A simple algorithm for computing the smallest enclosing circle. Information Processing Letters, 37(3):121-125, 1991.
    • (1991) Information Processing Letters , vol.37 , Issue.3 , pp. 121-125
    • Skyum, S.1
  • 13
    • 0030107563 scopus 로고    scopus 로고
    • Distributed algorithms for formation of geometric patterns with many mobile robots
    • Mar.
    • K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal on Robotics Systems, 3(13):127-139, Mar. 1996.
    • (1996) Journal on Robotics Systems , vol.3 , Issue.13 , pp. 127-139
    • Sugihara, K.1    Suzuki, I.2
  • 15
    • 0032681092 scopus 로고    scopus 로고
    • Distributed anonymous mobile robots: Formation of geometric patterns
    • I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing, 28(4):1347-1363, 1999.
    • (1999) SIAM Journal of Computing , vol.28 , Issue.4 , pp. 1347-1363
    • Suzuki, I.1    Yamashita, M.2
  • 16
    • 0030674885 scopus 로고    scopus 로고
    • Cooperative mobile robotics: Antecedents and directions
    • Y. Uny Cao, A. S. Fukunaga, and A. B. Kahng. Cooperative mobile robotics: Antecedents and directions. Autonomous Robots, (4): 1-23, 1997.
    • (1997) Autonomous Robots , Issue.4 , pp. 1-23
    • Uny Cao, Y.1    Fukunaga, A.S.2    Kahng, A.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.