Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Robotics (6)
- Adaptive algorithms (3)
- Coverage control problems (3)
- Dynamic vehicle routing problems (3)
- Partitioning algorithms (3)
-
- Potential field methods (3)
- Stochastic approximation (3)
- Stochastic gradient algorithms (3)
- Stochastic gradient descent algorithms (3)
- Active hand device (1)
- Conference Proceedings (1)
- Ionic Polymer Metallic Composite (1)
- Kalman filter (1)
- Large displacement compliant mechanisms (1)
- Mechatronic devices (1)
- Microassembly (1)
- Microsurgery (1)
- Physiological tremor (1)
- Piecewise linear interpolation compensation (1)
- Precision positioning systems (1)
- Pressure molding fabrication process (1)
- Rapidly prototype 2-axis positioning stage (1)
- Robot (1)
- Subcentimeter robotic (1)
- Tremor modeling (1)
- File Type
Articles 1 - 8 of 8
Full-Text Articles in Robotics
Development Of A Novel Handheld Device For Active Compensation Of Physiological Tremor, Abhijit Saxena
Development Of A Novel Handheld Device For Active Compensation Of Physiological Tremor, Abhijit Saxena
Abhijit Saxena
In microsurgery, the human hand imposes certain limitations in accurately positioning the tip of a device such as scalpel. Any errors in the motion of the hand make microsurgical procedures difficult and involuntary motions such as hand tremors can make some procedures significantly difficult to perform. This is particularly true in the case of vitreoretinal microsurgery. The most familiar source of involuntary motion is physiological tremor. Real-time compensation of tremor is, therefore, necessary to assist surgeons to precisely position and manipulate the tool-tip to accurately perform a microsurgery. In this thesis, a novel handheld device (AID) is described for compensation …
A Rapidly Prototyped 2-Axis Positioning Stage For Microassembly Using Large Displacement Compliant Mechanisms, Aaron Hoover, Srinath Avadhanula, Richard Groff, Ronald Fearing
A Rapidly Prototyped 2-Axis Positioning Stage For Microassembly Using Large Displacement Compliant Mechanisms, Aaron Hoover, Srinath Avadhanula, Richard Groff, Ronald Fearing
Aaron M. Hoover
Compliant mechanisms provide an attractive alternative to conventional rigid mechanisms in the design of ultra low-cost precision positioning systems. The desirable performance characteristics of these mechanisms including freedom from backlash, long life, light weight, and ease of fabrication/assembly make them an ideal solution to the problem of inexpensive precision positioning for microassembly. This paper presents a design for a 2 axis precision positioning system which makes use of large displacement compliant mechanisms, a room temperature and pressure molding fabrication process, commodity hardware, and a piecewise linear interpolation compensation scheme to achieve positioning performance suitable for automated assembly of sub-centimeter robotic …
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 Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
Adaptive Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
George J. Pappas
In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For static deployment problems, a classical way of designing high- level feedback motion planners is to implement a gradient descent scheme on a suitably chosen objective function. This can lead to computationally expensive deployment algorithms that may not be adaptive to uncertain dynamic environments. We address this challenge by showing that algorithms for a variety of deployment scenarios in stochastic environments and with noisy sensor measurements can be designed as stochastic gradient descent algorithms, …
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 Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
Adaptive Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
George J. Pappas
In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For static deployment problems, a classical way of designing high- level feedback motion planners is to implement a gradient descent scheme on a suitably chosen objective function. This can lead to computationally expensive deployment algorithms that may not be adaptive to uncertain dynamic environments. We address this challenge by showing that algorithms for a variety of deployment scenarios in stochastic environments and with noisy sensor measurements can be designed as stochastic gradient descent algorithms, …
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 Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
Adaptive Robot Deployment Algorithms, Jerome Le Ny, George J. Pappas
George J. Pappas
In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For static deployment problems, a classical way of designing high- level feedback motion planners is to implement a gradient descent scheme on a suitably chosen objective function. This can lead to computationally expensive deployment algorithms that may not be adaptive to uncertain dynamic environments. We address this challenge by showing that algorithms for a variety of deployment scenarios in stochastic environments and with noisy sensor measurements can be designed as stochastic gradient descent algorithms, …