메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1525-1530

Connectivity management in mobile robot teams

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; INDUSTRIAL ENGINEERING; MOBILE ROBOTS; ROBOTICS;

EID: 51649096484     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2008.4543418     Document Type: Conference Paper
Times cited : (157)

References (14)
  • 1
    • 0038548185 scopus 로고    scopus 로고
    • Coordination of groups of mobile autonomous agents using nearest neighbor rules
    • June
    • A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Transactions on Automatic Control, vol. 48, pp. 988-1001, June 2003.
    • (2003) IEEE Transactions on Automatic Control , vol.48 , pp. 988-1001
    • Jadbabaie, A.1    Lin, J.2    Morse, A.S.3
  • 2
    • 34047202699 scopus 로고    scopus 로고
    • Maintaining limited-range connectivity among second-order agents
    • Minneapolis, MN, pp, June
    • G. Notarstefano, K. Savla, F. Bullo, and A. Jadbabaie, "Maintaining limited-range connectivity among second-order agents," in American Control Conference, (Minneapolis, MN), pp. 2124-2129, June 2006.
    • (2006) American Control Conference , pp. 2124-2129
    • Notarstefano, G.1    Savla, K.2    Bullo, F.3    Jadbabaie, A.4
  • 9
    • 23944503840 scopus 로고    scopus 로고
    • On maximizing the second smallest eigenvalue of a state-dependent graph laplacian
    • Y. Kim and M. Mesbahi, "On maximizing the second smallest eigenvalue of a state-dependent graph laplacian," in Proceedings of the 2005 American Control Conference, pp. 99-103, 2005.
    • (2005) Proceedings of the 2005 American Control Conference , pp. 99-103
    • Kim, Y.1    Mesbahi, M.2
  • 12
    • 33746329499 scopus 로고    scopus 로고
    • The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem
    • J. Sun, S. Boyd, L. Xiao, and P. Diaconis, "The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem," SIAM Review, vol. 48, no. 4, pp. 681-699, 2006.
    • (2006) SIAM Review , vol.48 , Issue.4 , pp. 681-699
    • Sun, J.1    Boyd, S.2    Xiao, L.3    Diaconis, P.4


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