메뉴 건너뛰기




Volumn 24, Issue 10, 2013, Pages 2079-2089

STARS: Static relays for remote sensing in multirobot real-time search and monitoring

Author keywords

coverage; motion planning; Multiple traveling salesman; precedence constraint; relay placement; remote control; teleoperation

Indexed keywords

COVERAGE; EXTENSIVE SIMULATIONS; MOBILE ROBOT SYSTEMS; NEAR-OPTIMAL PERFORMANCE; NETWORKING INFRASTRUCTURE; PRECEDENCE CONSTRAINTS; RELAY PLACEMENTS; TRAVELING SALESMAN;

EID: 84883443556     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.299     Document Type: Article
Times cited : (10)

References (26)
  • 1
    • 84883313595 scopus 로고    scopus 로고
    • Connectivity and bandwidth awarereal-time exploration in mobile robot networks
    • to be published
    • Y. Pei, M. Mutka, and N. Xi, "Connectivity and Bandwidth AwareReal-Time Exploration in Mobile Robot Networks," WirelessComm. and Mobile Computing, to be published.
    • WirelessComm and Mobile Computing
    • Pei, Y.1    Mutka, M.2    Xi, N.3
  • 2
    • 0036680981 scopus 로고    scopus 로고
    • An efficient geneticalgorithm for the traveling salesman problem with precedenceconstraints
    • C. Moon, J. Kim, G. Choi, and Y. Seo, "An Efficient GeneticAlgorithm for the Traveling Salesman Problem with PrecedenceConstraints," European J. Operational Res., vol. 140, no. 3, pp. 606-617, 2002.
    • (2002) European J. Operational Res , vol.140 , Issue.3 , pp. 606-617
    • Moon, C.1    Kim, J.2    Choi, G.3    Seo, Y.4
  • 3
    • 33748086475 scopus 로고    scopus 로고
    • Deploying wireless sensors to achieve both coverage and connectivity
    • X. Bai, S. Kumar, D. Xuan, Z. Yun, and T.H. Lai, "DeployingWireless Sensors to Achieve Both Coverage and Connectivity,"Proc. ACM MobiHoc '06, pp. 131-142.
    • Proc. ACM MobiHoc '06 , pp. 131-142
    • Bai, X.1    Kumar, S.2    Xuan, D.3    Yun, Z.4    Lai, T.H.5
  • 4
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connecteddominating sets
    • S. Guha and S. Khuller, "Approximation Algorithms for ConnectedDominating Sets," Algorithmica, vol. 20, no. 4, pp. 374-387,1998.
    • (1998) Algorithmica , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 7
    • 4544283243 scopus 로고    scopus 로고
    • New tighter polynomiallength formulations for the asymmetric traveling salesmanproblem with and without precedence constraints
    • S.C. Sarin, H.D. Sherali, and A. Bhootra, "New Tighter PolynomialLength Formulations for the Asymmetric Traveling SalesmanProblem with and without Precedence Constraints," OperationsResearch Letters, vol. 33, no. 1, pp. 62-70, 2005.
    • (2005) OperationsResearch Letters , vol.33 , Issue.1 , pp. 62-70
    • Sarin, S.C.1    Sherali, H.D.2    Bhootra, A.3
  • 8
    • 38549147621 scopus 로고    scopus 로고
    • TSP-infrastructure for the travelingsalesperson problem
    • K. Hornik and M. Hahsler, "TSP-Infrastructure for the TravelingSalesperson Problem," J. Statistical Software, vol. 23, no. i02, pp. 1-18, 2007.
    • (2007) J. Statistical Software , vol.23 , Issue.102 , pp. 1-18
    • Hornik, K.1    Hahsler, M.2
  • 9
    • 17544398961 scopus 로고    scopus 로고
    • A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints
    • N. Ascheuer, M. Junger, and G. Reinelt, "A Branch & CutAlgorithm for the Asymmetric Traveling Salesman Problem withPrecedence Constraints," Computational Optimization and Applications,vol. 17, pp. 61-84, 2000.
    • (2000) Computational Optimization and Applications , vol.17 , pp. 61-84
    • Ascheuer, N.1    Junger, M.2    Reinelt, G.3
  • 10
    • 27744588516 scopus 로고    scopus 로고
    • The multiple traveling salesman problem: An overviewof formulations and solution procedures
    • T. Bektas, "The Multiple Traveling Salesman Problem: An Overviewof Formulations and Solution Procedures," Int'l J. ManagementScience, vol. 34, no. 3, pp. 209-219, 2006.
    • (2006) Int'l J. ManagementScience , vol.34 , Issue.3 , pp. 209-219
    • Bektas, T.1
  • 11
    • 0346452839 scopus 로고    scopus 로고
    • Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computationalStudy
    • E. Balas and N. Simonetti, "Linear Time Dynamic- ProgrammingAlgorithms for New Classes of Restricted TSPs: A ComputationalStudy, " Informs J. Computing, vol. 13, no. 1, pp. 56-75, 2000.
    • (2000) Informs J. Computing , vol.13 , Issue.1 , pp. 56-75
    • Balas, E.1    Simonetti, N.2
  • 12
    • 28044443830 scopus 로고    scopus 로고
    • The multiple TSP with time windows: Vehicle bounds based onprecedence graphs
    • "The Multiple TSP with Time Windows: Vehicle Bounds Based onPrecedence Graphs," Operations Research Letters, vol. 34, no. 1,pp. 111-120, 2006.
    • (2006) Operations Research Letters , vol.34 , Issue.1 , pp. 111-120
  • 16
    • 77955827124 scopus 로고    scopus 로고
    • Coordinated multi-robot real-timeexploration with connectivity and bandwidth awareness
    • Y. Pei, M. Mutka, and N. Xi, "Coordinated Multi-Robot Real-TimeExploration with Connectivity and Bandwidth Awareness," Proc.IEEE Int'l Conf. Robotics and Automation (ICRA '10), pp. 1531-1536,2010.
    • (2010) Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '10) , pp. 1531-1536
    • Pei, Y.1    Mutka, M.2    Xi, N.3
  • 20
    • 8844270174 scopus 로고    scopus 로고
    • Distributed multirobot explorationmaintaining a mobile network
    • June
    • J. Vazquez and C. Malcolm, "Distributed Multirobot ExplorationMaintaining a Mobile Network," Proc. IEEE Second Int'l Conf.Intelligent Systems, vol. 3, pp. 113-118, June 2004.
    • (2004) Proc. IEEE Second Int'l Conf.Intelligent Systems , vol.3 , pp. 113-118
    • Vazquez, J.1    Malcolm, C.2
  • 21
    • 34548153614 scopus 로고    scopus 로고
    • The design and analysis of anefficient local algorithm for coverage and exploration based onsensor network deployment
    • Aug
    • M. Batalin and G. Sukhatme, "The Design and Analysis of anEfficient Local Algorithm for Coverage and Exploration Based onSensor Network Deployment," IEEE Trans. Robotics, vol. 23, no. 4,pp. 661-675, Aug. 2007.
    • (2007) IEEE Trans. Robotics , vol.23 , Issue.4 , pp. 661-675
    • Batalin, M.1    Sukhatme, G.2
  • 23
    • 25444457310 scopus 로고    scopus 로고
    • Localization and navigation assisted by networked cooperating sensors and robots
    • P. Corke, R. Peterson, and D. Rus, "Localization and NavigationAssisted by Networked Cooperating Sensors and Robots," Int'l J.Robotics Res., vol. 24, pp. 771-786, 2005.
    • (2005) Int'l J.Robotics Res , vol.24 , pp. 771-786
    • Corke, P.1    Peterson, R.2    Rus, D.3
  • 24
    • 10944257465 scopus 로고    scopus 로고
    • Robot and sensor networks for first responders
    • Oct-Dec
    • V. Kumar, D. Rus, and S. Singh, "Robot and Sensor Networks forFirst Responders," IEEE Pervasive Computing, vol. 3, no. 4, pp. 24-33, Oct.-Dec. 2004.
    • (2004) IEEE Pervasive Computing , vol.3 , Issue.4 , pp. 24-33
    • Kumar, V.1    Rus, D.2    Singh, S.3
  • 26
    • 84863800641 scopus 로고    scopus 로고
    • Servicing wireless sensor networks by mobile robots
    • July
    • X. Li, R. Falcon, A. Nayak, and I. Stojmenovic, "Servicing WirelessSensor Networks by Mobile Robots," IEEE Comm. Magazine,vol. 50, no. 7, pp. 147-154, July 2012.
    • (2012) IEEE Comm. Magazine , vol.50 , Issue.7 , pp. 147-154
    • Li, X.1    Falcon, R.2    Nayak, A.3    Stojmenovic, I.4


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