Visibility problems for sensor networks and unmanned air vehicles

Visibility Problems for Sensor Networks and Unmanned Air Vehicles

[1]  Stan Sclaroff,et al.  Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements , 2006, Comput. Vis. Image Underst..

[2]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[3]  Robert P. Goldman,et al.  Coordinated deployment of multiple, heterogeneous robots , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[4]  R. Fierro,et al.  Decentralized cooperative control - A multivehicle platform for research in networked embedded systems , 2007, IEEE Control Systems.

[5]  Masafumi Yamashita,et al.  Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..

[6]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.

[7]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[8]  Val Pinciu,et al.  A Coloring Algorithm for Finding Connected Guards in Art Galleries , 2003, DMTCS.

[9]  Steven R. Rasmussen,et al.  Task allocation for wide area search munitions , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[10]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[11]  Jean Ponce,et al.  Computer Vision: A Modern Approach , 2002 .

[12]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[13]  Phillip R. Chandler,et al.  Tour Planning for an Unmanned Air Vehicle Under Wind Conditions (Preprint) , 2007 .

[14]  S. Darbha,et al.  Sampling-Based Roadmap Methods for a Visual Reconnaissance UAV ∗ , 2010 .

[15]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[16]  J. Betts.  Survey of Numerical Methods for Trajectory Optimization , 1998 .

[17]  Phillip R. Chandler,et al.  Dynamic network flow optimization models for air vehicle resource allocation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[18]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[19]  Phillip R. Chandler,et al.  UAV cooperative control , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[20]  Craig A. Woolsey,et al.  Minimum-Time Path Planning for Unmanned Aerial Vehicles in Steady Uniform Winds , 2009 .

[21]  Masafumi Yamashita,et al.  Searching a polygonal region by a group of stationary k-searchers , 2004, Inf. Process. Lett..

[22]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[23]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[24]  Diane L. Souvaine,et al.  An efficient algorithm for guard placement in polygons with holes , 1995, Discret. Comput. Geom..

[25]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[26]  Héctor H. González-Baños,et al.  Real-time combinatorial tracking of a target moving unpredictably among obstacles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[27]  J. Karl Hedrick,et al.  Optimal path planning in a constant wind with a bounded turning rate , 2005 .

[28]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[29]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[30]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[31]  Stephan Eidenbenz,et al.  Inapproximability Results for Guarding Polygons and Terrains , 2001, Algorithmica.

[32]  Masafumi Yamashita,et al.  Online polygon search by a seven-state boundary 1-searcher , 2006, IEEE Transactions on Robotics.

[33]  Tal Shima,et al.  Cooperative UAV Tracking Under Urban Occlusions and Airspace Limitations , 2008 .

[34]  Howie Choset,et al.  Exact cellular decompositions in terms of critical points of Morse functions , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[35]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[36]  George J. Pappas,et al.  A distributed auction algorithm for the assignment problem , 2008, 2008 47th IEEE Conference on Decision and Control.

[37]  Francesco Bullo,et al.  Asynchronous distributed searchlight scheduling , 2007, 2007 46th IEEE Conference on Decision and Control.

[38]  Sariel Har-Peled,et al.  Guarding galleries and terrains , 2002, Inf. Process. Lett..

[39]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[40]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[41]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

[42]  Leonidas J. Guibas,et al.  Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.

[43]  F. Bullo,et al.  Visibility-based multi-agent deployment in orthogonal environments , 2007, 2007 American Control Conference.

[44]  Mark Segal,et al.  Using tolerances to guarantee valid polyhedral modeling results , 1990, SIGGRAPH.

[45]  Tal Shima,et al.  Co-Evolution Genetic Algorithm for UAV Distributed Tracking in Urban Environments , 2008 .

[46]  Francesco Bullo,et al.  A Complete Algorithm for Searchlight Scheduling , 2011, Int. J. Comput. Geom. Appl..

[47]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[48]  Giora Slutzki,et al.  Clearing a Polygon with Two 1-Searchers , 2009, Int. J. Comput. Geom. Appl..

[49]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[50]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[51]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[52]  Kevin M. Passino,et al.  Distributed Task Assignment for Mobile Agents , 2007, IEEE Transactions on Automatic Control.

[53]  Hongyan Wang,et al.  The complexity of the two dimensional curvature-constrained shortest-path problem , 1998 .

[54]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[55]  A. Richards,et al.  Comparison of Branching Strategies for Path-Planning with Avoidance using Nonlinear Branch-and-Bound , 2008 .

[56]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[57]  Sebastian Thrun,et al.  Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..

[58]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[59]  K. Obermeyer.  Path Planning for a UAV Performing Reconnaissance of Static Ground Targets in Terrain , 2009 .

[60]  Masafumi Yamashita,et al.  The Searchlight Scheduling Problem , 1990, SIAM J. Comput..

[61]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[62]  Subhash Suri,et al.  Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry , 2007, Int. J. Robotics Res..

[63]  Swaroop Darbha,et al.  A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem , 2009, 2009 American Control Conference.

[64]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[65]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[66]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[67]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[68]  Emanuele Trucco,et al.  Introductory techniques for 3-D computer vision , 1998 .

[69]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[70]  F. Borrelli,et al.  MILP and NLP Techniques for centralized trajectory planning of multiple unmanned air vehicles , 2006, 2006 American Control Conference.

[71]  Howie Choset.  Nonsmooth Analysis, Convex Analysis, and their Applications to Motion Planning , 1999, Int. J. Comput. Geom. Appl..

[72]  Richard C. T. Lee,et al.  The Minimum Cooperative Guards Problem on K-spiral Polygons , 1993, CCCG.

[73]  Kyung-Yong Chwa,et al.  Simple algorithms for searching a polygon with flashlights , 2002, Inf. Process. Lett..

[74]  F. Bullo,et al.  Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.

[75]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[76]  J.K. Hedrick,et al.  An overview of emerging results in cooperative UAV control , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[77]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[78]  Steven M. LaValle,et al.  Pursuit-evasion in an unknown environment using gap navigation trees , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[79]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[80]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[81]  Gregorio Hernández-Peñalver.  Controlling Guards , 1994, CCCG.

[82]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[83]  Alison Eele,et al.  Path Planning with Avoidance Using Nonlinear Branch-and-Bound , 2007 .

[84]  Alejandro Sarmiento,et al.  Maintaining visibility of a moving target at a fixed distance: the case of observer bounded speed , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[85]  Francesco Bullo,et al.  Motion Coordination for Mobile Robotic Networks With Visibility Sensors , 2007 .

[86]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[87]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[88]  Lynne E. Parker,et al.  Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets , 2002, Auton. Robots.

[89]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[90]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[91]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[92]  Emilio Frazzoli,et al.  The curvature-constrained traveling salesman problem for high point densities , 2007, 2007 46th IEEE Conference on Decision and Control.

[93]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[94]  Antonio Franchi,et al.  Distributed pursuit-evasion with limited-visibility sensors via frontier-based exploration , 2010, 2010 IEEE International Conference on Robotics and Automation.

[95]  Peter Wonka,et al.  Visibility in Computer Graphics , 2003 .

[96]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[97]  Wayne Pullan,et al.  Adapting the genetic algorithm to the travelling salesman problem , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[98]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[99]  Xiaolin Hu,et al.  Dynamic traveling salesman problem based on evolutionary computation , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[100]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[101]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[102]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[103]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[104]  Swaroop Darbha,et al.  A Resource Allocation Algorithm for Multi-Vehicle Systems with Non holnomic Constraints , 2005 .

[105]  Joachim Gudmundsson,et al.  TSP with Neighborhoods of Varying Size , 2002, ESA.

[106]  Ümit Özgüner,et al.  Motion planning for multitarget surveillance with mobile sensor agents , 2005, IEEE Transactions on Robotics.

[107]  Eric Feron,et al.  An Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem ∗ , 2005 .

[108]  Giora Slutzki,et al.  An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[109]  Giora Slutzki,et al.  Pursuit-evasion using beam detection , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).