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 6 of 6 for “"scheduling and coordination"”.

  1. Planning, scheduling and coordination for refuel scheduling on aisle graphs

    … field deployment of mobile robots for persistent and long-term autonomy. Refuel scheduling is a class of vehicle routing problems that arise in autonomous recharging of mobile robots. In this work, we consider the refuel scheduling problem for a team of mobile robots using a fleet of aerial …

    iastate Repository record for Planning, scheduling and coordination for refuel scheduling on aisle graphs (opens in a new tab)

  2. Managing Data Flow Through The Storage Hierarchy Of Extreme Scale Hpc Systems

    … (HPC) machines require high performance I/O and storage system to carry out operations including checkpointing, analysis and visualization of simulation outputs. However, there is significant imbalance in I/O and compute capabilities in HPC systems, and as a result, applications often have to …

    uab Repository record for Managing Data Flow Through The Storage Hierarchy Of Extreme Scale Hpc Systems (opens in a new tab)

  3. PENNSYLVANIA PUBLIC SCHOOL SUPERINTENDENT BELIEFS AND PRACTICES REGARDING SINGLE SUBJECT ACCELERATION IN AN ELEMENTARY SCHOOL SETTING

    … In Pennsylvania, gifted education is mandated by Chapter 16 of the Pennsylvania School Code, yet acceleration policy is left to the local education agency (LEA), the school district. Since use of single-subject acceleration is not consistent across districts, this study sought to …

    temple Repository record for PENNSYLVANIA PUBLIC SCHOOL SUPERINTENDENT BELIEFS AND PRACTICES REGARDING SINGLE SUBJECT ACCELERATION IN AN ELEMENTARY SCHOOL SETTING (opens in a new tab)

  4. Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous

    … planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and optimizing some objective such as path …

    waterloo Repository record for Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous (opens in a new tab)

  5. EXPLOITING FLOWS FOR ORIENTEERING AND PLANNING PROBLEMS

    Task and path planning algorithms for robots in the presence of flows confront a fundamental dichotomy between the continuous and the discrete: task planning algorithms tend to discretize the world and their goals, whereas flows are continuous in nature. This contrast is exemplified in many robotic …

    penn Repository record for EXPLOITING FLOWS FOR ORIENTEERING AND PLANNING PROBLEMS (opens in a new tab)

  6. Heuristic Approaches for Coordination of Heterogeneous Robotic Systems in Harvesting Automation with Size Constraints

    … development of path planning algorithms for the coordination of heterogeneous robotic systems while considering size constraints. The objective is to generate practical and efficient solutions for real-world applications. The use of heterogeneous collaborative robots is beneficial in many …

    mtu Repository record for Heuristic Approaches for Coordination of Heterogeneous Robotic Systems in Harvesting Automation with Size Constraints (opens in a new tab)