Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Group Steiner tree problem"”.
-
Generalized Group Steiner Trees
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-05-01
-
Worst-case robot navigation in deterministic environments
… for the following two robot navigation problems: 1. TARGET SEARCH. Given a robot located at a point s in the plane, how will a robot navigate to a goal t in the presence of unknown obstacles ? 2. LOCALIZATION. A robot is "lost" in an environment with a map of its surroundings. How will …