4,071 research outputs found

    Contact-Implicit Trajectory Optimization Based on a Variable Smooth Contact Model and Successive Convexification

    Full text link
    In this paper, we propose a contact-implicit trajectory optimization (CITO) method based on a variable smooth contact model (VSCM) and successive convexification (SCvx). The VSCM facilitates the convergence of gradient-based optimization without compromising physical fidelity. On the other hand, the proposed SCvx-based approach combines the advantages of direct and shooting methods for CITO. For evaluations, we consider non-prehensile manipulation tasks. The proposed method is compared to a version based on iterative linear quadratic regulator (iLQR) on a planar example. The results demonstrate that both methods can find physically-consistent motions that complete the tasks without a meaningful initial guess owing to the VSCM. The proposed SCvx-based method outperforms the iLQR-based method in terms of convergence, computation time, and the quality of motions found. Finally, the proposed SCvx-based method is tested on a standard robot platform and shown to perform efficiently for a real-world application.Comment: Accepted for publication in ICRA 201

    Linear complementarity problems on extended second order cones

    Get PDF
    In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We state necessary and sufficient conditions for a point to be a solution of the converted problem. We also present solution strategies for this problem, such as the Newton method and Levenberg-Marquardt algorithm. Finally, we present some numerical examples

    New Relaxation Modulus Based Iterative Method for Large and Sparse Implicit Complementarity Problem

    Full text link
    This article presents a class of new relaxation modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). Using two positive diagonal matrices, we formulate a fixed-point equation and prove that it is equivalent to ICP. Also, we provide sufficient convergence conditions for the proposed methods when the system matrix is a PP-matrix or an H+H_+-matrix. Keyword: Implicit complementarity problem, H+H_{+}-matrix, PP-matrix, matrix splitting, convergenceComment: arXiv admin note: substantial text overlap with arXiv:2303.1251

    Including Social Nash Equilibria in Abstract Economies

    Get PDF
    We consider quasi-variational problems (variational problems having constraint sets depending on their own solutions) which appear in concrete economic models such as social and economic networks, financial derivative models, transportation network congestion and traffic equilibrium. First, using an extension of the classical Minty lemma, we show that new upper stability results can be obtained for parametric quasi-variational and linearized quasi-variational problems, while lower stability, which plays a fundamental role in the investigation of hierarchical problems, cannot be achieved in general, even on very restrictive conditions. Then, regularized problems are considered allowing to introduce approximate solutions for the above problems and to investigate their lower and upper stability properties. We stress that the class of quasi-variational problems include social Nash equilibrium problems in abstract economies, so results about approximate Nash equilibria can be easily deduced.quasi-variational, social Nash equilibria, approximate solution, closed map, lower semicontinuous map, upper stability, lower stability
    • …
    corecore