1,324 research outputs found
NASA space station automation: AI-based technology review
Research and Development projects in automation for the Space Station are discussed. Artificial Intelligence (AI) based automation technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics. AI technology will also be developed for the servicing of satellites at the Space Station, system monitoring and diagnosis, space manufacturing, and the assembly of large space structures
NASA space station automation: AI-based technology review. Executive summary
Research and Development projects in automation technology for the Space Station are described. Artificial Intelligence (AI) based technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics
Overview of some Command Modes for Human-Robot Interaction Systems
Interaction and command modes as well as their combination are essential features of modern and futuristic robotic systems interacting with human beings in various dynamical environments. This paper presents a synthetic overview concerning the most command modes used in Human-Robot Interaction Systems (HRIS). It includes the first historical command modes which are namely tele-manipulation, off-line robot programming, and traditional elementary teaching by demonstration. It then introduces the most recent command modes which have been fostered later on by the use of artificial intelligence techniques implemented on more powerful computers. In this context, we will consider specifically the following modes: interactive programming based on the graphical-user-interfaces, voice-based, pointing-on-image-based, gesture-based, and finally brain-based commands.info:eu-repo/semantics/publishedVersio
Telescience Testbed Pilot Program
The Telescience Testbed Pilot Program is developing initial recommendations for requirements and design approaches for the information systems of the Space Station era. During this quarter, drafting of the final reports of the various participants was initiated. Several drafts are included in this report as the University technical reports
Advancing automation and robotics technology for the Space Station Freedom and for the US economy
The progress made by levels 1, 2, and 3 of the Office of Space Station in developing and applying advanced automation and robotics technology is described. Emphasis is placed upon the Space Station Freedom Program responses to specific recommendations made in the Advanced Technology Advisory Committee (ATAC) progress report 10, the flight telerobotic servicer, and the Advanced Development Program. Assessments are presented for these and other areas as they apply to the advancement of automation and robotics technology for the Space Station Freedom
Interactive Imitation Learning of Bimanual Movement Primitives
Performing bimanual tasks with dual robotic setups can drastically increase
the impact on industrial and daily life applications. However, performing a
bimanual task brings many challenges, like synchronization and coordination of
the single-arm policies. This article proposes the Safe, Interactive Movement
Primitives Learning (SIMPLe) algorithm, to teach and correct single or dual arm
impedance policies directly from human kinesthetic demonstrations. Moreover, it
proposes a novel graph encoding of the policy based on Gaussian Process
Regression (GPR) where the single-arm motion is guaranteed to converge close to
the trajectory and then towards the demonstrated goal. Regulation of the robot
stiffness according to the epistemic uncertainty of the policy allows for
easily reshaping the motion with human feedback and/or adapting to external
perturbations. We tested the SIMPLe algorithm on a real dual-arm setup where
the teacher gave separate single-arm demonstrations and then successfully
synchronized them only using kinesthetic feedback or where the original
bimanual demonstration was locally reshaped to pick a box at a different
height
Programming by Demonstration on Riemannian Manifolds
This thesis presents a Riemannian approach to Programming by Demonstration (PbD).
It generalizes an existing PbD method from Euclidean manifolds to Riemannian manifolds.
In this abstract, we review the objectives, methods and contributions of the presented
approach.
OBJECTIVES
PbD aims at providing a user-friendly method for skill transfer between human and
robot. It enables a user to teach a robot new tasks using few demonstrations. In order
to surpass simple record-and-replay, methods for PbD need to \u2018understand\u2019 what to
imitate; they need to extract the functional goals of a task from the demonstration data.
This is typically achieved through the application of statisticalmethods.
The variety of data encountered in robotics is large. Typical manipulation tasks involve
position, orientation, stiffness, force and torque data. These data are not solely
Euclidean. Instead, they originate from a variety of manifolds, curved spaces that are
only locally Euclidean. Elementary operations, such as summation, are not defined on
manifolds. Consequently, standard statistical methods are not well suited to analyze
demonstration data that originate fromnon-Euclidean manifolds. In order to effectively
extract what-to-imitate, methods for PbD should take into account the underlying geometry
of the demonstration manifold; they should be geometry-aware.
Successful task execution does not solely depend on the control of individual task
variables. By controlling variables individually, a task might fail when one is perturbed
and the others do not respond. Task execution also relies on couplings among task variables.
These couplings describe functional relations which are often called synergies. In
order to understand what-to-imitate, PbDmethods should be able to extract and encode
synergies; they should be synergetic.
In unstructured environments, it is unlikely that tasks are found in the same scenario
twice. The circumstances under which a task is executed\u2014the task context\u2014are more
likely to differ each time it is executed. Task context does not only vary during task execution,
it also varies while learning and recognizing tasks. To be effective, a robot should
be able to learn, recognize and synthesize skills in a variety of familiar and unfamiliar
contexts; this can be achieved when its skill representation is context-adaptive.
THE RIEMANNIAN APPROACH
In this thesis, we present a skill representation that is geometry-aware, synergetic and
context-adaptive. The presented method is probabilistic; it assumes that demonstrations
are samples from an unknown probability distribution. This distribution is approximated
using a Riemannian GaussianMixtureModel (GMM).
Instead of using the \u2018standard\u2019 Euclidean Gaussian, we rely on the Riemannian Gaussian\u2014
a distribution akin the Gaussian, but defined on a Riemannian manifold. A Riev
mannian manifold is a manifold\u2014a curved space which is locally Euclidean\u2014that provides
a notion of distance. This notion is essential for statistical methods as such methods
rely on a distance measure. Examples of Riemannian manifolds in robotics are: the
Euclidean spacewhich is used for spatial data, forces or torques; the spherical manifolds,
which can be used for orientation data defined as unit quaternions; and Symmetric Positive
Definite (SPD) manifolds, which can be used to represent stiffness and manipulability.
The Riemannian Gaussian is intrinsically geometry-aware. Its definition is based on
the geometry of the manifold, and therefore takes into account the manifold curvature.
In robotics, the manifold structure is often known beforehand. In the case of PbD, it follows
from the structure of the demonstration data. Like the Gaussian distribution, the
Riemannian Gaussian is defined by a mean and covariance. The covariance describes
the variance and correlation among the state variables. These can be interpreted as local
functional couplings among state variables: synergies. This makes the Riemannian
Gaussian synergetic. Furthermore, information encoded in multiple Riemannian Gaussians
can be fused using the Riemannian product of Gaussians. This feature allows us to
construct a probabilistic context-adaptive task representation.
CONTRIBUTIONS
In particular, this thesis presents a generalization of existing methods of PbD, namely
GMM-GMR and TP-GMM. This generalization involves the definition ofMaximum Likelihood
Estimate (MLE), Gaussian conditioning and Gaussian product for the Riemannian
Gaussian, and the definition of ExpectationMaximization (EM) and GaussianMixture
Regression (GMR) for the Riemannian GMM. In this generalization, we contributed
by proposing to use parallel transport for Gaussian conditioning. Furthermore, we presented
a unified approach to solve the aforementioned operations using aGauss-Newton
algorithm. We demonstrated how synergies, encoded in a Riemannian Gaussian, can be
transformed into synergetic control policies using standard methods for LinearQuadratic
Regulator (LQR). This is achieved by formulating the LQR problem in a (Euclidean) tangent
space of the Riemannian manifold. Finally, we demonstrated how the contextadaptive
Task-Parameterized Gaussian Mixture Model (TP-GMM) can be used for context
inference\u2014the ability to extract context from demonstration data of known tasks.
Our approach is the first attempt of context inference in the light of TP-GMM. Although
effective, we showed that it requires further improvements in terms of speed and reliability.
The efficacy of the Riemannian approach is demonstrated in a variety of scenarios.
In shared control, the Riemannian Gaussian is used to represent control intentions of a
human operator and an assistive system. Doing so, the properties of the Gaussian can
be employed to mix their control intentions. This yields shared-control systems that
continuously re-evaluate and assign control authority based on input confidence. The
context-adaptive TP-GMMis demonstrated in a Pick & Place task with changing pick and
place locations, a box-taping task with changing box sizes, and a trajectory tracking task
typically found in industr
Human to robot hand motion mapping methods: review and classification
In this article, the variety of approaches proposed in literature to address the problem of mapping human to robot hand motions are summarized and discussed. We particularly attempt to organize under macro-categories the great quantity of presented methods, that are often difficult to be seen from a general point of view due to different fields of application, specific use of algorithms, terminology and declared goals of the mappings. Firstly, a brief historical overview is reported, in order to provide a look on the emergence of the human to robot hand mapping problem as a both conceptual and analytical challenge that is still open nowadays. Thereafter, the survey mainly focuses on a classification of modern mapping methods under six categories: direct joint, direct Cartesian, taskoriented, dimensionality reduction based, pose recognition based and hybrid mappings. For each of these categories, the general view that associates the related reported studies is provided, and representative references are highlighted. Finally, a concluding discussion along with the authors’ point of view regarding future desirable trends are reported.This work was supported in part by the European Commission’s Horizon 2020 Framework Programme with the project REMODEL under Grant 870133 and in part by the Spanish Government under Grant PID2020-114819GB-I00.Peer ReviewedPostprint (published version
- …