摘要: One classic problem faced by unmanned autonomous vehicles (UAVs) concerns how the vehicle should traverse its environment in order to leave the current position and arrive at a desired location. The path to this goal location must... 展开 One classic problem faced by unmanned autonomous vehicles (UAVs) concerns how the vehicle should traverse its environment in order to leave the current position and arrive at a desired location. The path to this goal location must maneuver the vehicle around any obstacles and reach the goal with minimal cost. A variant of this problem tasks the UAV with tracking a moving target. In this manner the UAV trajectory is updated through time to reflect changes in the target's location. The specific mission addressed in this thesis, is the track and trail mission. This mission tasks a UAV with acquiring a target vehicle and tracking the vehicle for an indefinite period of time. The goal is not to intercept the vehicle, but to follow the target from a certain standoff distance. One can imagine many applications of this mission. One such application envisioned by the United States Navy deals with an unmanned underwater vehicle (UUV), tracking an enemy submarine. In addition, marine biologists could use such a capability to allow a UUV to follow and record valuable information on certain species. Planning these paths is conceptualized as a series of network shortest path problems. This thesis focuses on planning paths in the plane where the state of the vehicle is defined only by its position in space. In addition, a trajectory smoothing or path-smoothing component is addressed to eliminate any slope discontinuities as a result of the shortest path algorithms. A framework for the moving target shortest path problem is created. The resulting path planner is capable of performing the stated mission. A detailed simulation of the path planner operating on a UUV in an underwater environment is created in order to test the planner's performance. Different variants of the path planner are created in order to deal with different problem parameters. The resulting path planner is shown to be adaptable to these different conditions and effective at tracking a moving target. 收起