Thumbnail Image
Publication

Park Rangers' Problem: motion planning for sequential visibility requirements

Phillips, John
Citations
Altmetric:
Advisor
Dantam, Neil T.
Editor
Date
Date Issued
2025
Date Submitted
Keywords
robitics and visibility
 robotics
 visibility based planning
Collections
2025 - Mines Theses & Dissertations
Show all metadata
Files
Phillips_mines_0052N_13084.pdf
Adobe PDF, 2.22 MB
Research Projects
Organizational Units
Journal Issue
URI
https://hdl.handle.net/11124/181175
Embargo Expires
2026-05-11
Abstract
Many robot tasks may involve achieving visibility (such as to observe areas of interest) or maintaining occlusion (such as to avoid disturbing other agents). We generally formulate such sequential visibility tasks for 3D worlds, termed the Park Rangers' Problem, and we develop an approach to solve such tasks offering completeness under certain requirements. Our approach constructs an abstraction based on an exact test for visibility between areas, and multiple tests and relaxations for the nonconvex problem of determining occlusions between areas. We apply a constraint-based planning approach and iteratively refine the abstraction. Finally, we evaluate the approach on simulated visibility scenarios.
Associated Publications
Rights
Copyright of the original work is retained by the author.
Embedded videos