Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Fordham University (7)
- Selected Works (4)
- University of Massachusetts Amherst (3)
- Louisiana State University (2)
- Loyola University Chicago (2)
-
- University of Nevada, Las Vegas (2)
- Bryn Mawr College (1)
- Dartmouth College (1)
- Florida International University (1)
- Michigan Technological University (1)
- New Jersey Institute of Technology (1)
- Northern Illinois University (1)
- Southwestern Oklahoma State University (1)
- The University of Akron (1)
- Union College (1)
- University at Albany, State University of New York (1)
- University of Denver (1)
- University of Nebraska - Lincoln (1)
- University of Tennessee, Knoxville (1)
- University of Texas at El Paso (1)
- Virginia Commonwealth University (1)
- Publication Year
- Publication
-
- Faculty Publications (7)
- Doctoral Dissertations (4)
- George J. Pappas (3)
- Computer Science: Faculty Publications and Other Works (2)
- LSU Master's Theses (2)
-
- UNLV Theses, Dissertations, Professional Papers, and Capstones (2)
- Computer Science Faculty Research and Scholarship (1)
- Dartmouth College Undergraduate Theses (1)
- Dissertations (1)
- Dissertations, Master's Theses and Master's Reports (1)
- Electronic Theses and Dissertations (1)
- FIU Electronic Theses and Dissertations (1)
- George K. Thiruvathukal (1)
- Graduate Research Theses & Dissertations (1)
- Honors Theses (1)
- Library Philosophy and Practice (e-journal) (1)
- Open Access Theses & Dissertations (1)
- Physics Faculty Scholarship (1)
- Student Research (1)
- Theses and Dissertations (1)
- Williams Honors College, Honors Research Projects (1)
- Publication Type
Articles 31 - 35 of 35
Full-Text Articles in Robotics
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
Faculty Publications
Abstract—Certain robot missions need to perform predictably in a physical environment that may only be poorly characterized in advance. We have previously developed an approach to establishing performance guarantees for behavior-based controllers in a process-algebra framework. We extend that work here to include random variables, and we show how our prior results can be used to generate a Dynamic Bayesian Network for the coupled system of program and environment model. Verification is reduced to a filtering problem for this network. Finally, we present validation results that demonstrate the effectiveness of the verification of a multiple waypoint robot mission using this …
Modeling A Sensor To Improve Its Efficacy, Nabin K. Malakar, Daniil Gladkov, Kevin H. Knuth
Modeling A Sensor To Improve Its Efficacy, Nabin K. Malakar, Daniil Gladkov, Kevin H. Knuth
Physics Faculty Scholarship
Robots rely on sensors to provide them with information about their surroundings. However, high-quality sensors can be extremely expensive and cost-prohibitive. Thus many robotic systems must make due with lower-quality sensors. Here we demonstrate via a case study how modeling a sensor can improve its efficacy when employed within a Bayesian inferential framework. As a test bed we employ a robotic arm that is designed to autonomously take its own measurements using an inexpensive LEGO light sensor to estimate the position and radius of a white circle on a black field. The light sensor integrates the light arriving from a …
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 …