Andere Kunden interessierten sich auch für
![Conflict-free Vehicle Routing with an Application to Personal Rapid Transit]( "Conflict-free Vehicle Routing with an Application to Personal Rapid Transit")
Conflict-free Vehicle Routing with an Application to Personal Rapid Transit22,30 €![Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order]( "Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order")
Optimal Scheduling with Nested Time Intervals and Three-Dimensional Strip Packing on Compara-bility Graphs of an Arborescence Order37,80 €![Complex Intelligent Systems and Their Applications]( "Complex Intelligent Systems and Their Applications")
Complex Intelligent Systems and Their Applications63,99 €![Numerical Analysis with Algorithms and Programming]( "Numerical Analysis with Algorithms and Programming")
Numerical Analysis with Algorithms and Programming198,99 €![Mathematical Optimization and Evolutionary Algorithms with Applications]( "Mathematical Optimization and Evolutionary Algorithms with Applications")
Mathematical Optimization and Evolutionary Algorithms with Applications122,99 €![Deflectometry and Image Denoising]( "Deflectometry and Image Denoising")
Deflectometry and Image Denoising48,90 €![Quasi-spectral Finite Difference Methods - Convergence Analysis and Application to Nonlinear Optical Pulse Propagation]( "Quasi-spectral Finite Difference Methods - Convergence Analysis and Application to Nonlinear Optical Pulse Propagation")
Quasi-spectral Finite Difference Methods - Convergence Analysis and Application to Nonlinear Optical Pulse Propagation36,00 €
This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta¬tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate¿and have real-world interpretations that vividly illustrate them¿some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For öine problems the ground plan of the environment is known in advance. In this work we study one öine exploration problem and one exploration and guarding problem in the öine and online version, where the focus is on the latter. For our problems we do not deal with ¿almighty¿ explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid.