Faculties of University Bonn: Search
Now showing items 1-5 of 5
Path Planning with spatial and temporal Constraints
(2011-01-28)
In this thesis we consider different problems arising in the context of planning the movement of objects. The common aspect of these problems is the interaction of spatial and temporal constraints.
The first problem ......
The first problem ......
On Discrete and Geometric Firefighting
(2021-08-19)
Wildfires ravaging forests around the globe cost lives, homes and billions in damages every year, which motivates the study of effective firefighting. In the area of theoretical computer science, several different models ......
Models and Algorithms for Online Exploration and Search
(2006)
This work considers some algorithmic aspects of exploration and search, two tasks that arise, for example, in the field of motion planning for autonomous mobile robots. We assume that the environment is not known to the ...
Visibility Domains and Complexity
(2014-02-05)
Two problems in discrete and computational geometry are considered that are related to questions about the combinatorial complexity of arrangements of visibility domains and about the hardness of path planning under cost ...
New Results on Abstract Voronoi Diagrams
(2015-07-21)
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have ...