Faster Motion on Cartesian Paths Exploiting Robot Redundancy at the Acceleration Level

The problem of minimizing the transfer time along a given Cartesian path for redundant robots can be approached in two steps, by separating the generation of a joint path associated to the Cartesian path from the exact minimization of motion time under kinematic/dynamic bounds along the obtained parameterized joint path. In this framework, multiple suboptimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. We propose a solution method that works at the acceleration level, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. Several numerical results obtained on different robot systems demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with our method is reasonably close to the global time-optimal solution along same Cartesian path. Experimental results on a KUKA LWR IV are also reported, showing the tracking control performance on the executed motions

Human Arm simulation for interactive constrained environment design

During the conceptual and prototype design stage of an industrial product, it is crucial to take assembly/disassembly and maintenance operations in advance. A well-designed system should enable relatively easy access of operating manipulators in the constrained environment and reduce musculoskeletal disorder risks for those manual handling operations. Trajectory planning comes up as an important issue for those assembly and maintenance operations under a constrained environment, since it determines the accessibility and the other ergonomics issues, such as muscle effort and its related fatigue. In this paper, a customer-oriented interactive approach is proposed to partially solve ergonomic related issues encountered during the design stage under a constrained system for the operator's convenience. Based on a single objective optimization method, trajectory planning for different operators could be generated automatically. Meanwhile, a motion capture based method assists the operator to guide the trajectory planning interactively when either a local minimum is encountered within the single objective optimization or the operator prefers guiding the virtual human manually. Besides that, a physical engine is integrated into this approach to provide physically realistic simulation in real time manner, so that collision free path and related dynamic information could be computed to determine further muscle fatigue and accessibility of a product designComment: International Journal on Interactive Design and Manufacturing (IJIDeM) (2012) 1-12. arXiv admin note: substantial text overlap with arXiv:1012.432

Coordination of several robots based on temporal synchronization

© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/This paper proposes an approach to deal with the problem of coordinating multi-robot systems, in which each robot executes individually planned tasks in a shared workspace. The approach is a decoupled method that can coordinate the participating robots in on-line mode. The coordination is achieved through the adjustment of the time evolution of each robot along its original planned geometric path according to the movements of the other robots to assure a collision-free execution of their respective tasks. To assess the proposed approach different tests were performed in graphical simulations and real experiments.Postprint (published version

Feedrate planning for machining with industrial six-axis robots

The authors want to thank Stäubli for providing the necessary information of the controller, Dynalog for its contribution to the experimental validations and X. Helle for its material contributions.Nowadays, the adaptation of industrial robots to carry out high-speed machining operations is strongly required by the manufacturing industry. This new technology machining process demands the improvement of the overall performances of robots to achieve an accuracy level close to that realized by machine-tools. This paper presents a method of trajectory planning adapted for continuous machining by robot. The methodology used is based on a parametric interpolation of the geometry in the operational space. FIR filters properties are exploited to generate the tool feedrate with limited jerk. This planning method is validated experimentally on an industrial robot

Automated sequence and motion planning for robotic spatial extrusion of 3D trusses

While robotic spatial extrusion has demonstrated a new and efficient means to fabricate 3D truss structures in architectural scale, a major challenge remains in automatically planning extrusion sequence and robotic motion for trusses with unconstrained topologies. This paper presents the first attempt in the field to rigorously formulate the extrusion sequence and motion planning (SAMP) problem, using a CSP encoding. Furthermore, this research proposes a new hierarchical planning framework to solve the extrusion SAMP problems that usually have a long planning horizon and 3D configuration complexity. By decoupling sequence and motion planning, the planning framework is able to efficiently solve the extrusion sequence, end-effector poses, joint configurations, and transition trajectories for spatial trusses with nonstandard topologies. This paper also presents the first detailed computation data to reveal the runtime bottleneck on solving SAMP problems, which provides insight and comparing baseline for future algorithmic development. Together with the algorithmic results, this paper also presents an open-source and modularized software implementation called Choreo that is machine-agnostic. To demonstrate the power of this algorithmic framework, three case studies, including real fabrication and simulation results, are presented.Comment: 24 pages, 16 figure

A Hierarchical Extension of the D ∗ Algorithm

In this paper a contribution to the practice of path planning using a new hierarchical extension of the D ∗ algorithm is introduced. A hierarchical graph is stratified into several abstraction levels and used to model environments for path planning. The hierarchical D∗ algorithm uses a downtop strategy and a set of pre-calculated trajectories in order to improve performance. This allows optimality and specially lower computational time. It is experimentally proved how hierarchical search algorithms and on-line path planning algorithms based on topological abstractions can be combined successfully

A Certified-Complete Bimanual Manipulation Planner

Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, we propose a manipulation planning algorithm to bring an object from an initial stable placement (position and orientation of the object on the support surface) towards a goal stable placement. The key specificity of our algorithm is that it is certified-complete: for a given object and a given environment, we provide a certificate that the algorithm will find a solution to any bimanual manipulation query in that environment whenever one exists. Moreover, the certificate is constructive: at run-time, it can be used to quickly find a solution to a given query. The algorithm is tested in software and hardware on a number of large pieces of furniture.Comment: 12 pages, 7 figures, 1 tabl