Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Adaptive algorithms (3)
- Coverage control problems (3)
- Dynamic vehicle routing problems (3)
- Partitioning algorithms (3)
- Robotics (3)
-
- Stochastic gradient algorithms (3)
- Approximate algorithms (1)
- Artificial Intelligence & Robotic Control (1)
- Cardinalities (1)
- Control of heterogeneous craft (1)
- Exact algorithms (1)
- Heuristic techniques (1)
- Mars mission (1)
- Multi-Tier Robotic Control (1)
- Multi-tier exploration (1)
- Novel strategies (1)
- Number distribution (1)
- Number partitioning (1)
- Planetary exploration (1)
- Planetary science (1)
- Sensornet (1)
- Subset sum (1)
- File Type
Articles 1 - 8 of 8
Full-Text Articles in Theory and Algorithms
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 …
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.
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Jason A Bengtson
Current metadata schemas are largely analog technology grafted onto the digital format. They have three inherent limitations that need to be transcended: they generate a static product which must be changed manually, they revolve around the needs of human, rather than mechanistic agents, and they are limited by the imagination and organizational capabilities of human agency. The author argues that to meet future challenges metadata will have to take a more flexible, adaptive form that centers on the needs of the machine in searching, interpretation and organization until the information it proxies enters into the human sphere. The author further …
The Art Of Redirection: Putting Mobile Devices Where You Want Them, Jason A. Bengtson
The Art Of Redirection: Putting Mobile Devices Where You Want Them, Jason A. Bengtson
Jason A Bengtson
Mobile technology has exploded, with many libraries experiencing a surge in access to their resources through mobile devices. In response, many institutions have created or are creating mobile sites designed to accommodate themselves to the unique strictures of these devices. One hurdle faced by these organizations, however, is getting mobile users to those sites. One solution is mobile redirect scripts, which automatically redirect mobile users from a regular page to a mobile page. These scripts come in various forms and present unique challenges to libraries. How are these scripts created? What triggers can or should be used to activate them? …
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Imagining Emergent Metadata, Realizing The Emergent Web, Jason A. Bengtson
Jason A Bengtson
Current metadata schemas are largely analog technology grafted onto the digital format. They have three inherent limitations that need to be transcended: they generate a static product which must be changed manually, they revolve around the needs of human, rather than mechanistic agents, and they are limited by the imagination and organizational capabilities of human agency. The author argues that to meet future challenges metadata will have to take a more flexible, adaptive form that centers on the needs of the machine in searching, interpretation and organization until the information it proxies enters into the human sphere. The author further …
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 …