Minimum Time Multi-UGV Surveillance
暂无分享,去创建一个
[1] J. Sack,et al. Handbook of computational geometry , 2000 .
[2] J.P. Hespanha,et al. Multiple-agent probabilistic pursuit-evasion games , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).
[3] Hobart R. Everett,et al. Extending Mobile Security Robots to Force Protection Missions , 2002 .
[4] Frank Hoffmann,et al. The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[7] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.
[8] Shuzhi Sam Ge,et al. Complete Multi-Robot Coverage of Unknown Environments with Minimum Repeated Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[9] F. Bullo,et al. Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.
[10] Lynne E. Parker,et al. Towards Collaborative Robots for Infrastructure Security Applications , 2003 .
[11] Leonidas J. Guibas,et al. Sweeping simple polygons with a chain of guards , 2000, SODA '00.
[12] Petter Ögren,et al. Formulation and Solution of the UAV Paparazzi Problem , 2006 .
[13] Howie Choset,et al. Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.
[14] Noam Hazon,et al. Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[15] Wolfram Burgard,et al. Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[16] Sebastian Thrun,et al. Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..
[17] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[18] Kevin White,et al. Mission Planning for Regional Surveillance , 2001, Ann. Oper. Res..
[19] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[20] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[21] Panos M. Pardalos,et al. Optimization and Cooperative Control Strategies , 2009 .
[22] Howie Choset,et al. Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..
[23] Brian Yamauchi,et al. Frontier-based exploration using multiple robots , 1998, AGENTS '98.
[24] Per Skoglar,et al. Concurrent Path and Sensor Planning for a UAV - Towards an Information Based Approach Incorporating Models of Environment and Sensor , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[25] David M. Panton,et al. Mission Planning for Synthetic Aperture Radar Surveillance , 1999, Interfaces.
[26] Wesley H. Huang. Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[27] David A. Anisi,et al. A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions , 2009 .
[28] Sonia Martínez,et al. Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.
[29] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.
[30] Magnus Snorrason,et al. SEARCH PATH OPTIMIZATION FOR UAVS USING STOCHASTIC SAMPLING WITH ABSTRACT PATTERN DESCRIPTORS , 2003 .