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 3 of 3 for “"Receding Horizon Path Planning"”.

  1. Optimal and receding-horizon path planning algorithms for communications relay vehicles in complex environments

    This thesis presents new algorithms for path planning in a communications constrained environment for teams of unmanned vehicles. This problem involves a lead vehicle that must gather information from a set of locations and relay it back to its operator. In general, these locations and the lead …

    mit Repository record for Optimal and receding-horizon path planning algorithms for communications relay vehicles in complex environments (opens in a new tab)

  2. Sensor Fusion and Obstacle Avoidance for an Unmanned Ground Vehicle

    … and implementation of terrain mapping, path planning and control algorithms on an unmanned ground vehicle. Data from GPS, IMU and LIDAR sensors are fused in order to compute and update a dense 3D point cloud that is used by an implicit terrain algorithm to provide detailed mathematical …

    embry-riddle Repository record for Sensor Fusion and Obstacle Avoidance for an Unmanned Ground Vehicle (opens in a new tab)

  3. Robotic Search Planning In Large Environments with Limited Computational Resources and Unreliable Communications

    … To accomplish this task, robots must plan paths through the region of interest that maximize the effectiveness of the sensors they carry. Receding horizon path planning is a popular approach to addressing the computationally expensive task of planning long paths because it allows robotic …

    vt Repository record for Robotic Search Planning In Large Environments with Limited Computational Resources and Unreliable Communications (opens in a new tab)