Abstract
In Chap. 3, we considered various optimization problems for one or more point-observers which are stationary with respect to the object \(\mathcal{O}\) under observation in the world space \(\mathcal{W}\). For a single stationary point-observer, total visibility of \(\mathcal{O}\) may not be attainable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
C.S. Balmes, P.K.C. Wang, Numerical algorithms for optimal visibility problems, UCLA Engineering Report ENG 00–214, June 2000
E.W. Dijkstra, A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)
M. Sharir, A. Shorr, On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 193–215 (1986)
J. O’Rourke, S. Suri, H. Boot, Shortest paths on polyhedral surfaces, in Proceedings of Symposium on Theoretical Aspects of Computer Science, (1985) pp. 243–254
E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Wang, P.KC. (2015). Visibility-Based Optimal Path Planning. In: Visibility-based Optimal Path and Motion Planning. Studies in Computational Intelligence, vol 568. Springer, Cham. https://doi.org/10.1007/978-3-319-09779-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-09779-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09778-7
Online ISBN: 978-3-319-09779-4
eBook Packages: EngineeringEngineering (R0)