Search Constraints

Start Over
Filtering by: Alternative title ssim Station circular 69 Remove constraint Alternative title ssim: Station circular 69 Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.) Non-Academic Affiliation Oregon State University. Collaborative Robotics and Intelligent Systems (CoRIS) Institute Remove constraint Non-Academic Affiliation: Oregon State University. Collaborative Robotics and Intelligent Systems (CoRIS) Institute

Search Results

  • Topologically-Guided Robotic Information Gathering

    Creator:
    McCammon, Seth
    Abstract:
    Information gathering tasks, such as terrestrial search and rescue, aerial inspection, and marine monitoring, require robotic unmanned systems to make decisions on how to travel within an environment to maximize or minimize a path-dependent information objective function. The distribution of information throughout the environment is the result of various processes,...
    Resource Type:
    Dissertation
    Full Text:
    entangled by the wharf pilings shown as red circles. The robot is deployed from the base station located at

  • Geometric Motion Planning for Inertial Systems

    Creator:
    Faraji, Hossein
    Abstract:
    In order to enable better visualization and understanding of the effect of the robot's geometry and inertia on the robot's trajectories, this dissertation proposes to use geometric mechanics to bridge the gap between the physical motion of a robot and its mathematical structure. The main focus of this research is...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 4.7.5 High Reynolds Serpenoid Swimmer . . . . . . . . . . . . . . 71 4.8 Discussion

  • Realizable Path Planning and Execution for Robotic Systems

    Creator:
    Jones, Dylan A.
    Abstract:
    Performing autonomous robotic tasks in the field, such as ocean monitoring and aerial surveillance, requires planning and executing paths in dynamic environments. In these uncertain and changing environments, it is not uncommon to see a large difference between the path planned by the robotic vehicle and the path that the...
    Resource Type:
    Dissertation
    Full Text:
    star and ends at the red square. . . . . . . . . . . . . . . . . . . . 69 4.3 Energy cost using

  • Counterfactual thinking applied to multiagent systems

    Creator:
    Zerbel, Nicholas
    Abstract:
    Multiagent approaches are well suited to designing autonomous solutions for systems that feature complex interactions between many individuals such as in autonomous traffic systems and multi-robot exploration systems. However, creating autonomous agents that function effectively in these systems is a challenging task. In these complex environments, agents need informative reward...
    Resource Type:
    Dissertation
    Full Text:
    Counterfactuals 66 5.1 Supervisory Agents in Multiagent Systems . . . . . . . . . . . . . . . . . 69 5.1.1 Shaped

  • Geometry of Locomotion

    Creator:
    Ramasamy, Suresh
    Abstract:
    Many animals and robots move through the world by coupling cyclical changes in shape called gaits to an interaction with the environment. Because mobility is an important aspect of such robots, a key metric when evaluating design and performance of mobile robots is the efficiency of their optimal gaits. The...
    Resource Type:
    Dissertation

  • Robust Long Term Autonomy Through Local Behaviors

    Creator:
    Yates, Connor L.
    Abstract:
    Multi-robot teams offer promising solutions for many long term deployments in remote and dangerous domains, such as extraterrestrial or underseas exploration. However, long term deployments present many problems preventing robot teams from operating effectively. Learning over long time scales is makes it difficult to assign credit to robots' actions, as...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . 67 4.3 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 4.3.1