Author
N. Mansard
Bio: N. Mansard is an academic researcher from École normale supérieure de Cachan. The author has contributed to research in topics: Visual servoing & Motion control. The author has an hindex of 2, co-authored 2 publications receiving 36 citations.
Papers
More filters
05 Dec 2005
TL;DR: A new general method is proposed that frees up some of the DOF constrained by the main task in addition of the remaining DOF to enhance the performance of the secondary task by enlarging the number of available DOF.
Abstract: The paper presents a new approach to construct a control law that realizes a main task and simultaneously takes supplementary constraints into account. Classically, this is done by using the redundancy formalism. If the main task does not constrain all the motions of the robot, a secondary task can be achieved by using only the remaining degrees of freedom (DOF). We propose a new general method that frees up some of the DOF constrained by the main task in addition of the remaining DOF. The general idea is to enable the motions produced by the secondary control law that help the main task to be completed faster. The main advantage is to enhance the performance of the secondary task by enlarging the number of available DOF. In a formal framework, a projection operator is built which ensures that the secondary control law does not disturb the main task. A control law can be then easily computed from the two tasks considered. Experiments that implement and validate this approach are proposed. The visual servoing framework is used to position a 6-DOF robot while simultaneously avoiding occlusions and joint limits.
27 citations
18 Apr 2005
TL;DR: The key idea is to control the robot with a very under-constrained task when it is far from the desired position, and to incrementally constrain the global task by adding further tasks as the robot moves closer to the goal.
Abstract: Classical visual servoing approaches tend to constrain all degrees of freedom (DOF) of the robot during the execution of a task. In this article a new approach is proposed. The key idea is to control the robot with a very under-constrained task when it is far from the desired position, and to incrementally constrain the global task by adding further tasks as the robot moves closer to the goal. As long as they are sufficient, the remaining DOF are used to avoid undesirable configurations, such as joint limits. Closer from the goal, when not enough DOF remain available for avoidance, an execution controller selects a task to be temporary removed from the applied tasks. The released DOF can then be used for the joint limits avoidance. A complete solution to implement this general idea is proposed. Experiments that prove the validity of the approach are also provided.
12 citations
Cited by
More filters
TL;DR: A complete solution to implement the global full-constraining task into several subtasks, which can be applied or inactivated to take into account potential constraints of the environment is proposed.
Abstract: Classical sensor-based approaches tend to constrain all the degrees of freedom of a robot during the execution of a task. In this paper, a new solution is proposed. The key idea is to divide the global full-constraining task into several subtasks, which can be applied or inactivated to take into account potential constraints of the environment. Far from any constraint, the robot moves according to the full task. When it comes closer to a configuration to avoid, a higher level controller removes one or several subtasks, and activates them again when the constraint is avoided. The last controller ensures the convergence at the global level by introducing some look-ahead capabilities when a local minimum is reached. The robot accomplishes the global task by automatically sequencing sensor-based tasks, obstacle avoidance, and short deliberative phases. In this paper, a complete solution to implement this idea is proposed, along with several experiments that prove the validity of this approach
215 citations
14 May 2012
TL;DR: The proposed SNS (Saturation in the Null Space) iterative algorithm proceeds by successively discarding the use of joints that would exceed their motion bounds when using the minimum norm solution and reintroducing them at a saturated level by means of a projection in a suitable null space.
Abstract: We present a novel efficient method addressing the inverse differential kinematics problem for redundant manipulators in the presence of different hard bounds (joint range, velocity, and acceleration limits) on the joint space motion. The proposed SNS (Saturation in the Null Space) iterative algorithm proceeds by successively discarding the use of joints that would exceed their motion bounds when using the minimum norm solution and reintroducing them at a saturated level by means of a projection in a suitable null space. The method is first defined at the velocity level and then moved to the acceleration level, so as to avoid joint velocity discontinuities due to the switching of saturated joints. Moreover, the algorithm includes an optimal task scaling in case the desired task trajectory is unfeasible under the given joint bounds. We also propose the integration of obstacle avoidance in the Cartesian space by properly modifying on line the joint bounds. Simulation and experimental results reported for the 7-dof lightweight KUKA LWR IV robot illustrate the properties and computational efficiency of the method.
107 citations
19 May 2008
TL;DR: A real-time implementation of collision and self-collision avoidance for robots on the basis of a new proximity distance computation method which ensures having continuous gradient, a new controller in the velocity domain is proposed.
Abstract: This paper proposes a real-time implementation of collision and self-collision avoidance for robots. On the basis of a new proximity distance computation method which ensures having continuous gradient, a new controller in the velocity domain is proposed. The gradient continuity encompasses no jump in the generated command. Included in a stack of tasks architecture, this controller has been implemented on the humanoid platform HRP-2 and experienced in a grasping task while walking and avoiding collisions with the environment and auto-collisions.
86 citations
TL;DR: The planner augments probabilistic road maps with vision-based constraints and finds collision-free paths that simultaneously avoid occlusions of an image target and keep the target within the field of view of the camera.
Abstract: This paper focuses on the challenges of vision-based motion planning for industrial manipulators. Our approach is aimed at planning paths that are within the sensing and actuation limits of industrial hardware and software. Building on recent advances in path planning, our planner augments probabilistic road maps with vision-based constraints. The resulting planner finds collision-free paths that simultaneously avoid occlusions of an image target and keep the target within the field of view of the camera. The planner can be applied to eye-in-hand visual-target-tracking tasks for manipulators that use point-to-point commands with interpolated joint motion.
73 citations
16 Jul 2018
TL;DR: This letter designs an online replanning strategy inspired from model predictive control that successively solves a nonlinear optimization problem using differential flatness and finite parametrization with B-Splines and proposes vision-based approaches based on multiobjective optimization.
Abstract: In this letter, we investigate the online generation of optimal trajectories for target tracking with a quadrotor while satisfying a set of image-based and actuation constraints. We consider a quadrotor equipped with a camera (either down or front-looking) with limited field of view. The aim is to follow in a smooth but reactive way a moving target while avoiding obstacles in the environment and occlusions in the image space. We propose vision-based approaches based on multiobjective optimization, especially with the occlusion constraint formulation. We design an online replanning strategy inspired from model predictive control that successively solves a nonlinear optimization problem. The problem is formulated as a nonlinear program (NLP) using differential flatness and finite parametrization with B-Splines. This allows a resolution by sequential quadratic programming (SQP) at a rate of 30 Hz. The robustness and reactivity of the replanning algorithm are demonstrated through realistic simulation results. Experiments validating the performance with a real quadrotor are also presented.
71 citations