Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Adaptive algorithms (3)
- Coverage control problems (3)
- Dynamic vehicle routing problems (3)
- Open Orbiter Project (3)
- Partitioning algorithms (3)
-
- Robotics (3)
- Stochastic gradient algorithms (3)
- Student spacecraft (3)
- Artificial Intelligence & Robotic Control (1)
- Command and data handling (1)
- Control of heterogeneous craft (1)
- CubeSat software (1)
- Image processing (1)
- Mars mission (1)
- Multi-Tier Robotic Control (1)
- Multi-tier exploration (1)
- Operating software (1)
- Planetary exploration (1)
- Planetary science (1)
- Sensornet (1)
- Software architecture (1)
- Spacecraft software (1)
- Publication
Articles 1 - 7 of 7
Full-Text Articles in Robotics
Multi-Tier Exploration Concept Demonstration Mission, Jeremy Straub
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
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
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
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
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
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
Payload Software, Christoffer Korvald, Jeremy Straub, Atif Mohammad, Josh Berk
Jeremy Straub
No abstract provided.