Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Lyapunov-Based Approach to Exploit Asymmetries in Robotic Dual-Arm Task Resolution
135
0
0.0
(
0
)
Added by
Diogo Almeida
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Dual-arm manipulation tasks can be prescribed to a robotic system in terms of desired absolute and relative motion of the robots end-effectors. These can represent, e.g., jointly carrying a rigid object or performing an assembly task. When both types of motion are to be executed concurrently, the symmetric distribution of the relative motion between arms prevents task conflicts. Conversely, an asymmetric solution to the relative motion task will result in conflicts with the absolute task. In this work, we address the problem of designing a control law for the absolute motion task together with updating the distribution of the relative task among arms. Through a set of numerical results, we contrast our approach with the classical symmetric distribution of the relative motion task to illustrate the advantages of our method.
rate research
Read More
This paper investigates the visual servoing problem for robotic systems with uncertain kinematic, dynamic, and camera parameters. We first present the passivity properties associated with the overall kinematics of the system, and then propose two passivity-based adaptive control schemes to resolve the visual tracking problem. One scheme employs the adaptive inverse-Jacobian-like feedback, and the other employs the adaptive transpose Jacobian feedback. With the Lyapunov analysis approach, it is shown that under either of the proposed control schemes, the image-space tracking errors converge to zero without relying on the assumption of the invertibility of the estimated depth. Numerical simulations are performed to show the tracking performance of the proposed adaptive controllers.
In recent times, developments in field of communication and robotics has progressed with leaps and bounds. In addition, the blend of both disciplines has contributed heavily in making human life easier and better. So in this work while making use of both the aforementioned technologies, a procedure for design and implementation of a mobile operated mechanical arm is proposed, that is, the proposed arm will be operated via a cellular device that connects with the receiver mounted on the robotic arm. Moreover, over the duration of a call, if any key is pressed from the cellular device than an indicator indistinct to the key pressed is noticed at the receiver side. This tone represents superimposition of two distinct frequencies and referred to as DTMF (dual tone multi-frequency). Further, the mechanical arm is handled via the DTMF tone. Also, the acquired tone at the receiver is taken into a micro-controller (ATMEGA16) using the DTMF decipher module i.e. MT8870. Further, the decipher module unwinds the DTMF signal into its corresponding two bit representation and then the matched number is transmitted to the micro-controller. The micro-controller is programmed to take an action based on the decoded value. Further, the micro-controller forwards control signals to the motor driver unit to move the arm in forward/backward or multi-directional course. Lastly, the mechanical arm is capable of picking and placing objects while being controlled wirelessly over GSM (Global System for Mobile Communications).
We study an adaptive source seeking problem, in which a mobile robot must identify the strongest emitter(s) of a signal in an environment with background emissions. Background signals may be highly heterogeneous and can mislead algorithms that are based on receding horizon control. We propose AdaSearch, a general algorithm for adaptive source seeking in the face of heterogeneous background noise. AdaSearch combines global trajectory planning with principled confidence intervals in order to concentrate measurements in promising regions while guaranteeing sufficient coverage of the entire area. Theoretical analysis shows that AdaSearch confers gains over a uniform sampling strategy when the distribution of background signals is highly variable. Simulation experiments demonstrate that when applied to the problem of radioactive source seeking, AdaSearch outperforms both uniform sampling and a receding time horizon information-maximization approach based on the current literature. We also demonstrate AdaSearch in hardware, providing further evidence of its potential for real-time implementation.
The development of robotic-assisted extracorporeal ultrasound systems has a long history and a number of projects have been proposed since the 1990s focusing on different technical aspects. These aim to resolve the deficiencies of on-site manual manipulation of hand-held ultrasound probes. This paper presents the recent ongoing developments of a series of bespoke robotic systems, including both single-arm and dual-a
In many real-world reinforcement learning (RL) problems, besides optimizing the main objective function, an agent must concurrently avoid violating a number of constraints. In particular, besides optimizing performance it is crucial to guarantee the safety of an agent during training as well as deployment (e.g. a robot should avoid taking actions - exploratory or not - which irrevocably harm its hardware). To incorporate safety in RL, we derive algorithms under the framework of constrained Markov decision problems (CMDPs), an extension of the standard Markov decision problems (MDPs) augmented with constraints on expected cumulative costs. Our approach hinges on a novel emph{Lyapunov} method. We define and present a method for constructing Lyapunov functions, which provide an effective way to guarantee the global safety of a behavior policy during training via a set of local, linear constraints. Leveraging these theoretical underpinnings, we show how to use the Lyapunov approach to systematically transform dynamic programming (DP) and RL algorithms into their safe counterparts. To illustrate their effectiveness, we evaluate these algorithms in several CMDP planning and decision-making tasks on a safety benchmark domain. Our results show that our proposed method significantly outperforms existing baselines in balancing constraint satisfaction and performance.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
