Open Access. Powered by Scholars. Published by Universities.®

Controls and Control Theory Commons

Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering

Robotics

Articles 1 - 4 of 4

Full-Text Articles in Controls and Control Theory

Developing And Testing An Anguilliform Robot Swimming With Theoretically High Hydrodynamic Efficiency, John B. Potts Iii Dec 2015

Developing And Testing An Anguilliform Robot Swimming With Theoretically High Hydrodynamic Efficiency, John B. Potts Iii

University of New Orleans Theses and Dissertations

An anguilliform swimming robot replicating an idealized motion is a complex marine vehicle necessitating both a theoretical and experimental analysis to completely understand its propulsion characteristics. The ideal anguilliform motion within is theorized to produce ``wakeless'' swimming (Vorus, 2011), a reactive swimming technique that produces thrust by accelerations of the added mass in the vicinity of the body. The net circulation for the unsteady motion is theorized to be eliminated.

The robot was designed to replicate the desired, theoretical motion by applying control theory methods. Independent joint control was used due to hardware limitations. The fluid velocity vectors in the …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …