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)
- Amplifiers (1)
- Analog VLSI approach (1)
- Analog signal processing system (1)
- Analog-to-digital convertor (1)
- Approximate algorithms (1)
- Artificial Intelligence & Robotic Control (1)
- Cardinalities (1)
- Command and data handling (1)
- Conference Proceedings (1)
- Control of heterogeneous craft (1)
- CubeSat software (1)
- Current mirrors (1)
- Exact algorithms (1)
- Floating-gate bump circuit (1)
- Heuristic techniques (1)
- Image processing (1)
- Large-scale neural network implementations (1)
- Log-domain Alters (1)
- Low-power adaptive analog system (1)
- Mars mission (1)
- Multi-Tier Robotic Control (1)
- Multi-tier exploration (1)
- Publication
- File Type
Articles 1 - 10 of 10
Full-Text Articles in Engineering
Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Kyriakos MOURATIDIS
Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM, may produce widely varying subset sums. In this paper, we introduce the LRM algorithm that lowers the expected spread in subset sums to one third that of BLDM for uniformly distributed numbers and odd subset cardinalities. We also propose Meld, a novel strategy for …
Analog Vlsi Implementation Of Support Vector Machine Learning And Classification, Sheng-Yu Peng, Bradley Minch, Paul Hasler
Analog Vlsi Implementation Of Support Vector Machine Learning And Classification, Sheng-Yu Peng, Bradley Minch, Paul Hasler
Bradley Minch
We propose an analog VLSI approach to implementing the projection neural networks adapted for the supportvector machine with radial-basis kernel functions, which are realized by a proposed floating-gate bump circuit with the adjustable width. Other proposed circuits include simple current mirrors and log-domain Alters. Neither resistors nor amplifiers are employed. Therefore it is suitable for large-scale neural network implementations. We show the measurement results of the bump circuit and verify the resulting analog signal processing system on the transistor level by using a SPICE simulator. The same approach can also be applied to the support vectorregression. With these analog signal …
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.
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Dr Xiaoxun Sun
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-space ADOPT and any-space BnB-ADOPT to find cost-minimal solutions for all DCOPs in the sequence faster than by solving each DCOP individually. This procedure allows those agents that are guaranteed to remain unaffected by a change to reuse their lower and upper …
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.