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

Robotics Commons

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

Articles 1 - 8 of 8

Full-Text Articles in Robotics

Real-Time Mobile Stereo Vision, Bryan Hale Bodkin Aug 2012

Real-Time Mobile Stereo Vision, Bryan Hale Bodkin

Masters Theses

Computer stereo vision is used extract depth information from two aligned cameras and there are a number of hardware and software solutions to solve the stereo correspondence problem. However few solutions are available for inexpensive mobile platforms where power and hardware are major limitations. This Thesis will proposes a method that competes with an existing OpenCV stereo correspondence method in speed and quality, and is able to run on generic multi core CPU’s.


Multi-Tier Exploration Concept Demonstration Mission, Jeremy Straub May 2012

Multi-Tier Exploration Concept Demonstration Mission, Jeremy Straub

Jeremy Straub

A multi-tier, multi-craft mission architecture has been proposed but, despite its apparent promise, limited use and testing of the architecture has been conducted. This paper proposes and details a mission concept and its implementation for testing this architecture in the terrestrial environment. It is expected that this testing will allow significant refinement of the proposed architecture as well as providing data on its suitability for use in both terrestrial and extra-terrestrial applications. Logistical and technical challenges with this testing are discussed.


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 …


Operating Software, Donovan Torgerson, Miyuru Arangala, Michael Hlas, David Bullock, Dayln Limesand, Cameron Kerbaugh, Daniel Schuler, Mitchell Fossen, Edwin Carlson, Atif Mohammad, Josh Berk, Jeremy Straub Jan 2012

Operating Software, Donovan Torgerson, Miyuru Arangala, Michael Hlas, David Bullock, Dayln Limesand, Cameron Kerbaugh, Daniel Schuler, Mitchell Fossen, Edwin Carlson, Atif Mohammad, Josh Berk, Jeremy Straub

Jeremy Straub

No abstract provided.


Cubesat Software Architecture, Christoffer Korvald, Atif Mohammad, Jeremy Straub, Josh Berk Jan 2012

Cubesat Software Architecture, Christoffer Korvald, Atif Mohammad, Jeremy Straub, Josh Berk

Jeremy Straub

No abstract provided.


Payload Software, Christoffer Korvald, Jeremy Straub, Atif Mohammad, Josh Berk Jan 2012

Payload Software, Christoffer Korvald, Jeremy Straub, Atif Mohammad, Josh Berk

Jeremy Straub

No abstract provided.