Prioritizing linear equality and inequality systems: Application to local motion planning for redundant robots

  • Kanoun O
  • Lamiraux F
  • Wieber P
  • et al.
N/ACitations
Citations of this article
81Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel method for prioritizing both linear equality and inequality systems and provide one algorithm for its resolution. This algorithm can be summarized as a sequence of optimal resolutions for each linear system following their priority order. We propose an optimality criterion that is adapted to linear inequality systems and characterize the resulting optimal sets at every priority level. We have successfully applied our method to plan local motions for the humanoid robot HPR-2. We will demonstrate the validity of the method using an original scenario where linear inequality constraints are solved at lower priority than equality constraints.

Cite

CITATION STYLE

APA

Kanoun, O., Lamiraux, F., Wieber, P.-B., Kanehiro, F., Yoshida, E., & Laumond, J.-P. (2009). Prioritizing linear equality and inequality systems: Application to local motion planning for redundant robots. In 2009 IEEE International Conference on Robotics and Automation (pp. 2939–2944). IEEE. https://doi.org/10.1109/ROBOT.2009.5152293

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free